B-tree key-range bit map index optimization of database queries

  

Webster's Online Dictionary
with Multilingual Thesaurus Translation
  Home    Browse    Credits    About Us  

    

  EnglishNon-English  

Copyright © Philip M. Parker, INSEAD. Terms of Use.

B-tree key-range bit map index optimization of database queries

Invention: B-tree key-range bit map index optimization of database queries

Year    Description
1995Invention patented by Lam H. Thai on October 17th, 1995. Abstract: System and methods are provided for optimizing the access of information, particularly in response to ad hoc queries or filters. The system of the present invention includes a computer having a memory and a processor, a database for storing information in the memory as field values in a record, an indexing component for referencing a plurality of records by key values of the field(s), an input device for selecting desired records by entering a filter (query) condition corresponding to values stored in the field(s), and an optimization module for providing rapid access to the desired records. The optimization module employs one or more existing indices for optimizing data access, including using ones which do not directly support the filter expression. In instances where no indices are available, the optimization module may employ a "learned" optimization method of the invention for on-the-fly learning of records which meet the filter condition.
Source: selected by the editor from original sources.

Top     



  

Webster's Online Dictionary
with Multilingual Thesaurus Translation
  Home    Browse    Credits    About Us  

    

  EnglishNon-English  

Copyright © Philip M. Parker, INSEAD. Terms of Use.