MTree data structure for storage, indexing and retrieval of info

Details MTree data structure for storage, indexing and retrieval of info MTree data structure for storage, indexing and retrieval of info

1992-07-06

1996-01-30

Black, Thomas G.

Boots, shoes, and leggings

36441907, 36441908, 36441911, 36471502, 364975, 364974, 3642821, 3642606, 364253, 36422282, 364DIG1, 364DIG2, 341 55, G06F 1730

Patent

active

054887178

ABSTRACT:
Data storage space and data access time are significantly decreased by utilizing a tree structure to store data in memory. Only one copy of each data element common to different data units is stored. Each data element is stored in a node that has a next pointer and an alternate pointer. The next pointer points to a list of alternatives for the next sequential element of the data unit. The alternate pointer defines that list of alternatives. Thus, a progression of next pointers and alternate pointers corresponds to a unique data unit. Associated with each data unit is one or more identifiers, which tie the data unit to data units in another trees or to external objects. The last alternate pointer in an alternative list points back to the preceding element of the data unit in order to reconstruct a data unit from the identifier. Nodes in memory that are not currently being used in the tree are linked together to form a list of free nodes.

REFERENCES:
patent: 4464650 (1984-08-01), Eastman et al.
patent: 4677550 (1987-06-01), Ferguson
patent: 5153591 (1992-10-01), Clark
patent: 5202986 (1993-04-01), Nickel
patent: 5274805 (1993-12-01), Ferguson et al.
patent: 5295261 (1994-03-01), Simonetti
patent: 5329405 (1994-07-01), Hou et al.
T. D. M. Purdin, "Compressing Tries for Storing Dictionaries", Proceedings of the 1990 Symposium on Applied Computing, 5-6 Apr., Fayetteville, Arkansas, pp. 336-340.
Toshiyuki Masui, "Keyword Dictionary Compression Using Efficient Trie Implementation", DCC '91. Data Compression Conference, Snowbird Utah, 8-11 Apr. 1991, p. 438.

Affiliated with

Also associated with

Rating

MTree data structure for storage, indexing and retrieval of info does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with MTree data structure for storage, indexing and retrieval of info, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MTree data structure for storage, indexing and retrieval of info will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-162694