Heirarchical indexing of multi-attribute data by sorting, dividing and storing subsets
US6381605B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | May 29, 1999 |
| Grant date | Apr 30, 2002 |
| Priority date | — |
| Expiry date | May 29, 2019 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99945
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A system and method for indexing and storing multi-dimensional or multi-attribute data. Data items are recursively sorted in a selected dimension (e.g., the dimension having the greatest variance) and divided until each subdivision fits into a leaf node having a specified fanout. Intermediate nodes and a root node are constructed to complete the index. Each node of the index is stored in a database as a separate object or record and may include a node identifier of the unique, an identifier of a parent and/or a sibling node and an entry for each child of the node, which may be data items or other nodes. Each record entry for a child includes an associated bounding area encompassing descendant data items. Another database table or module may store information about the index, such as the dimensionality of the data, the index fanout and an identifier of a root of the index.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.