Method of compacting and searching a data index
US4677550A · kind A · utility
140Cited by
3References
10Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Sep 30, 1983 |
| Grant date | Jun 30, 1987 |
| Priority date | — |
| Expiry date | Sep 30, 2003 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99933
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An improved method for indexing and accessing data stored in a computer storage system, comprising a multi-way tree structure having interconnected branch nodes and leaf nodes. The leaf nodes contain a large number of distinction bits, rather than a smaller number of search keys as known in the prior art. A distinction bit is determined by comparing two selected search keys and determining the ordinal number of the first bit that is different between the two keys. The density of distinction bit entries in the leaf nodes permits shorter access times to obtain data records in a computer storage system.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.