Indexing based on key ranges
AssigneeMonmouth University
InventorCui Yu
Life of this patent
Estimating the term…
Loading patent…
AssigneeMonmouth University
InventorCui Yu
Estimating the term…
The present invention is a fast indexing technique that builds an indexing structure based on multi-level key ranges typically for large data storage systems. The invention is explained based on the B+-tree. It is designed to reside in main memory. Point searches and range searches are helped by early termination of searches for non-existent data. Range searches can be processed depth-first or breath-first. One group of multiple searches can be processed with one pass on the indexing structure to minimize total cost. Implementation options and strategies are explained to show the flexibility of this invention for easy adaption and high efficiency. Each branch of any level has exact and clear key boundaries, so that it is very easy to build or cache partial index for various purposes. The inventive indexing structure can be tuned to speed up queries directed at popular ranges of index or index ranges of particular interest to the user.
A search method implemented on a computer for indexing a plurality of objects stored in a data storage system and searching for specific stored objects included within the plurality of stored objects, the method comprising:
A search method implemented on a computer for indexing a plurality of objects stored in a data storage system and for searching for specific stored objects included within the plurality of stored objects, the method comprising:
A search method implemented on a computer for indexing a plurality of objects stored in a data storage system and searching for specific stored objects included within the plurality of stored objects, the method comprising:
Dependencies are inferred from the claim text.