Method and apparatus for performing hash lookups using valid bit tables with pointers
US6247014A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jul 1, 1998 |
| Grant date | Jun 12, 2001 |
| Priority date | — |
| Expiry date | Jul 1, 2018 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99943
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method, apparatus, and article of manufacture for hash lookups using valid bit tables with pointers. A key is compressed by hashing the key using a hash function. The hash key is used as a valid bit index into the valid bit table. A first pointer associated with the valid bit index is then used as a pointer into a first block of entries in a result table. A sum of transition bits in the valid bit table below the valid bit index is used as a result index into the first block of entries in the result table. The result index into the first block of entries may be used to reference a result of the radix search tree lookup. Extra space is added in the result table to enable insertion of entries after the first block of entries. A second pointer is used to add redundant entries from the first block of entries into a second block of entries in the result table.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.