Generating a log-log hash-based hierarchical data structure associated with a plurality of known arbitrary-length bit strings used for detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit strings
US8212695B2 · kind B2 · utility
1Cited by
6References
23Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Feb 5, 2009 |
| Grant date | Jul 3, 2012 |
| Priority date | — |
| Expiry date | Apr 29, 2030 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/0836
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Generating and using a high-speed, scalable and easily updateable data structures are described. The proposed data structure provides minimal perfect hashing functionality while intrinsically supporting low-cost set-membership queries. In other words, in some embodiments, it provides at most one match candidate in a set of known arbitrary-length bit strings that is used to match the query.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.