Table look-up method with adaptive hashing
US7539661B2 · kind B2 · utility
4Cited by
23References
5Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Jun 2, 2005 |
| Grant date | May 26, 2009 |
| Priority date | — |
| Expiry date | Sep 12, 2026 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99937
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Accessed memory locations of a data table are assigned weights based on usage history, and a hash table chains the highest-weight key values to an abbreviated hash index. The hash table includes keys having at least a predetermined weight so that highly accessed keys are identified by hashing. Additionally, the keys chained to a given hash index are ordered based on their weight in order to optimize the overall data retrieval time. The weights assigned to accessed keys are updated over time so that the content of the hash table is adaptively updated to suit the current table look-up requirements.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.