Method and system for reinserting a chain in a hash table
US7895211B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Nov 3, 2006 |
| Grant date | Feb 22, 2011 |
| Priority date | — |
| Expiry date | May 9, 2028 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2255
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method and system for reinserting a chain into a hash table of a computer system are described. The chain includes a plurality of keys. The hash table includes a key fields and link fields associated with the key fields. The hash table utilizes an initial collision resolution scheme that precludes coalescing of chains. The method and system include providing a binary tree including nodes corresponding to the keys of the chain. The nodes include a root node corresponding to a root key and at least one child node corresponding to at least one child key. The method and system also include storing a pair of child keys in two empty adjacent key fields and storing a first empty adjacent key value of one of the two empty adjacent key fields in the home link field if the root node is the parent node of more than one child node.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.