Patent ID: 11924102
Assignee: NXP B.V.
Field: Digital communication (Electrical engineering)
Classification: CPC H  G | IPC G  H

Claim 16:
17. A computer-implemented method for populating a table to perform exact match lookup operations, the method comprising:
examining a state field of each of a plurality of neighboring hash root buckets stored in a hash memory space, wherein one or more of said plurality of neighboring hash root buckets are located in a same row as an originating home hash root bucket in said hash memory space, wherein said state field of each of said plurality of neighboring hash root buckets indicates whether a collision chain of a corresponding neighboring hash root bucket is used to temporarily store an element of said originating home hash root bucket, wherein said originating home hash root bucket corresponds to a hash root bucket that is identified based on a hash value generated from performing a hash of a lookup key;
examining a depth of said collision chain of each neighboring hash root bucket of said plurality of neighboring hash root buckets that does not have a value in said state field matching a value corresponding to a secondary hash value of said hash value, a column offset to a column location of said originating home hash root bucket and a plane offset to a plane location of said originating home hash root bucket;
examining a depth of a collision chain of said originating home hash root bucket; and
storing an element in one of said plurality of neighboring hash root buckets or in said originating home hash root bucket with said collision chain with a shortest length.