Method of storing compressed data for accelerated interrogation
US5592667A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Nov 10, 1994 |
| Grant date | Jan 7, 1997 |
| Priority date | — |
| Expiry date | Nov 10, 2014 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99943
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A method of data compression includes means to accelerate a direct query thereof. Input data are transformed into a multilevel n-ary tree structure wherein each leaf node corresponds to the creation of a memory storing unique occurrences of a particular data body, and each non-leaf node corresponds to a memory storing unique occurrences associated with its child nodes, whether leaf or non-leaf types. To accelerate a determination as to the solution of a query of the data, one or more pointers are further stored at each memory level, the pointers at least including those used to identify the parent of each child node and the children of each parent. In the preferred embodiment additional pointers are further stored in conjunction with each non-leaf node, these being used to identify other locations corresponding to unique occurrences derived through the same child nodes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.