Device for storage and retrieval of compact contiguous tree index records
US5829004A · kind A · utility
Inventor
Key dates
| Filing date | May 20, 1996 |
| Grant date | Oct 27, 1998 |
| Priority date | — |
| Expiry date | May 20, 2016 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99942
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A system and methods for allocating and traversing tree structured data in contiguous portions of memory by encapsulating lower level subtrees within the memory allocated for their higher level parent trees. These encapsulated memory allocations are encoded with length descriptors at both lowest and highest ends in memory, so that allocated subtrees can be retrieved or skipped when scanning allocated subtrees in either lowest-to-highest or highest-to-lowest directions in memory. The length descriptors themselves are allocated variable amounts of memory by allocating additional multiplier bits to describe larger lengths. Smaller lengths can be described with a smaller number of bits. There is no limit to the size of length which can be described. Extra reserve memory may be allocated within some subtrees to localize the allocation of memory within those subtrees.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.