| CPC G06F 12/1009 (2013.01) [G06F 16/9038 (2019.01)] | 16 Claims |

|
1. An apparatus, comprising:
a logical search circuit comprising a first node logic;
a memory connected to the logical search circuit through a databus;
a parsing circuit;
a decision circuit; and
a first comparison circuit group comprising a first plurality of comparison circuits,
wherein the memory comprises a first memory block and a second memory block,
wherein the first node logic is configured to:
when receiving a first table lookup request, read, from a first data table stored in the first memory block through the databus, first node data to be queried based on the first table lookup request; and
when receiving a second table lookup request, read, from a second data table stored in the second memory block through the databus, second node data to be queried based on the second table lookup request,
wherein the parsing circuit is configured to: parse the first table lookup request to obtain a first key, send the first key to the first plurality of comparison circuits, and distribute the first node data to the first plurality of comparison circuits, wherein the first node data comprises a plurality of first data parts, and the plurality of first data parts are in a one-to-one correspondence with the first plurality of comparison circuits;
any comparison circuit in the first comparison circuit group is configured to: match the first key sent by the parsing circuit against a distributed data part to obtain a first matching result, and send the first matching result to the decision circuit; and
the decision circuit is configured to summarize first matching results separately sent by the first plurality of comparison circuits to obtain a query result corresponding to the first table lookup request.
|