B-tree structured data base using sparse array bit maps to store inverted lists
US4606002A · kind A · utility
158Cited by
12References
14Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 17, 1983 |
| Grant date | Aug 12, 1986 |
| Priority date | — |
| Expiry date | Aug 17, 2003 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99933
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Variable length data (e.g., for hospital patients) is embedded in a B-tree type index structure of a relational data base. A logically related inverted B-tree index is used to access the original index. Access time, and storage space for the inverted lists, are decreased by data compression techniques and by encoding certain inverted list parameters in sparse array bit maps.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.