Indexing using contiguous, non-overlapping ranges
A method of efficiently constructing and using an index for searches in large datasets is provided. In this method, a dataset can be divided into a plurality of "buckets", i.e. contiguous, non-overlapping ranges of values of a chosen attribute of elements of the dataset. These buckets can...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A method of efficiently constructing and using an index for searches in large datasets is provided. In this method, a dataset can be divided into a plurality of "buckets", i.e. contiguous, non-overlapping ranges of values of a chosen attribute of elements of the dataset. These buckets can be used to construct discrete index segments. Static index segments (associated with "static" buckets including the more frequently occurring values) are always computed, whereas dynamic index segments (associated with "dynamic" buckets including the less frequently occurring values) can be generated on an as-needed basis and based on the availability of system resources. Thus, search time and storage area can be advantageously reduced because less of the complete index needs to be generated and used. |
---|