Modified skip list database structure and method for access

Details Modified skip list database structure and method for access Modified skip list database structure and method for access

1995-06-27

1997-09-02

Loomis, John C.

395613, G06F 1730

Patent

active

056641796

ABSTRACT:
A database management system and method for operation allow both key compression and quick indexed retrieval of nodes. The system includes a processor, memory and a modified skip list data structure with compressed search keys. The prior art skip list structure is modified so that each node has only one other node pointing to it. This allows search keys to be compressed based on the key of the previous node. Key compression allows the data structure to use less memory than is otherwise possible.

REFERENCES:
patent: 4507752 (1985-03-01), McKenna et al.
patent: 5274805 (1993-12-01), Ferguson et al.
patent: 5276868 (1994-01-01), Poole
T. Papadakis, "Skip Lists and Probabilistic Analysis of Algorithms", A thesis for University Of Waterloo, Ontario, Canada, 1993, pp. 1-146.
W. Pugh, "A Skip List Cookbook", Institute For Advanced Computer Studies, University Of Maryland, Jun. 1990, pp. 1-14.
Pugh, W., "Skip Lists: A Probabilistic Alternative to Balanced Trees", Communications of ACM, Jun. 1990, pp. 668-676.

Affiliated with

Also associated with

Rating

Modified skip list database structure and method for access does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Modified skip list database structure and method for access, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modified skip list database structure and method for access will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-316544