Method and apparatus for querying a cube forest data structure
US6424967B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 17, 1998 |
| Grant date | Jul 23, 2002 |
| Priority date | — |
| Expiry date | Nov 17, 2018 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99943
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A device and method is disclosed for using a data structure known as a cube forest for use in a batch-load-then-read-intensively system. The device and method significantly improve the time to execute a bit vector query. Hierarchically split cube forests provide a method for efficiently duplicating information, and can be optimized to reduce update and storage costs. Cube forests including hierarchically split cube forests are most appropriate for read-intensive, update-rarely-and-in-large-batches multidimensional applications in an off-the-shelf (low cost) hardware environment. A method and an apparatus for querying a cube forest for aggregates are disclosed herein.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.