Sparse index search method

Details Sparse index search method Sparse index search method

1998-03-13

2000-09-19

Black, Thomas G.

Data processing: database and file management or data structures

Database design

Data structure types

707 1, 707 2, 707 4, 707 5, 707 6, 707 8, 707101, 707104, 707201, 707202, G06F 1730

Patent

active

061226262

ABSTRACT:
The invention relates to a method of searching a plurality of values in an ordered list. Given a data set consisting of data items. With each data item one or more attribute values are associated, which are all stored in an ordered list. Efficiently retrieving the data items associated with a particular set of entered values is accomplished by using the list. The list (partially) resides in slow secondary memory and, and a subset thereof, the sparse index, resides in primary memory. Both indexes preserve some natural ordering of the values. The invention proposes to look up the particular set of entered values in the list in one combined operation, rather than individually. The accumulated retrieval time is substantially reduced as a result.

REFERENCES:
patent: 5724571 (1998-03-01), Woods
patent: 5873080 (1999-02-01), Coden
patent: 5875446 (1999-02-01), Brown

Affiliated with

Also associated with

Rating

Sparse index search method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sparse index search method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse index search method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1083288