Generating a boundary hash-based hierarchical data structure associated with a plurality of known arbitrary-length bit strings and using the generated hierarchical data structure for detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit springs
US7868792B2 · kind B2 · utility
12Cited by
3References
23Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Feb 5, 2009 |
| Grant date | Jan 11, 2011 |
| Priority date | — |
| Expiry date | Mar 29, 2029 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2209/60
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A high-speed, space-efficient, scalable and easily updateable data boundary hash-based structure is generated and used. The proposed boundary hash-based 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.