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

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

1995-10-18

1996-09-24

Black, Thomas G.

Boots, shoes, and leggings

395650, 3642821, 364974, 364DIG1, 364DIG2, G06F 1730

Patent

active

055600077

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.

REFERENCES:
patent: 4606002 (1986-08-01), Waisman et al.
patent: 4811199 (1989-03-01), Kuechler et al.
patent: 4817036 (1989-03-01), Millett et al.
patent: 5168565 (1992-12-01), Morita
patent: 5430869 (1995-07-01), Ishak et al.
patent: 5475837 (1995-12-01), Ishak et al.
D. D. Hamilton, Inside ADABAS, WH&O International (Wellesley, Mass. 1991), pp. 27-37, 49-51, 56-65.
Donald E. Knuth, The Art of Computer Programming, vol. 3/Sorting and Searching, Addison-Wesley Publishing Company, (Reading, Mass., 1973), pp. 550-567.
Ashany, Ron, "Application of Sparse Matrix Techniques to Search, Retrieval, Classification, and Relationship Analysis in Large Data Base Systems-SPARCOM", Fourth International Conference On Very Large Data Bases, West Berlin, Germany, Sep. 13-15, 1978, pp. 499-516.
Douglas Comer, "The Ubiquitous B-Tree", Computing Surveys, vol. 11, No. 2, Jun. 1979, pp. 121-137.
"Rushmore's Bald Spot", DBMS, vol. 4, No. 10, Sep., 1991, p. 58.
Turbo Database Toolbox Owner's Handbook, Appendix B, B+ Tree Structure, pp. 131, Third Edition, Sep. 1985.
Freeland, R., Exploring MDXs, Data Based Advisor, Feb. 1991, pp. 85-87.
Baker, M., B-tree indexing: A look at indexing tradeoffs in dBASE, Clipper and FoxPro, Programmer's Journal, vol. 8.6, Nov./Dec. 1990, pp. 42-46.
Hamilton, Inside Adabas, WH&O International, copyright 1991, Chapter 3: "The ADABAS Associator," pp. 27-36, and Chapter 6: "ADABAS Commands," pp. 49-65.

Affiliated with

Also associated with

Rating

B-tree key-range bit map index optimization of database queries does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with B-tree key-range bit map index optimization of database queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and B-tree key-range bit map index optimization of database queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1947925