06816856 is referenced by 29 patents and cites 1 patents.

An adaptive digital tree data structure incorporates various codes within the parent pointers to indicate the state of the underlying subexpanses. The use of these codes reduces the amount of memory used in storage for the subexpanses and improves the overall efficiency of the system. The structure of the system is flexible so that if values stored within a fully populated expanse are removed, the adaptive digital tree data structure will adopt the most memory efficient representation of the structure available.

Title
System for and method of data compression in a valueless digital tree representing a bitset
Application Number
9/874468
Publication Number
6816856 (B2)
Application Date
June 4, 2001
Publication Date
November 9, 2004
Inventor
Alan Silverstein
Fort Collins
CO, US
Douglas L Baskins
Fort Collins
CO, US
Assignee
Hewlett Packard Development Company
TX, US
IPC
G06F 17/30
View Original Source