Boots – shoes – and leggings
Patent
1994-07-25
1996-02-27
Black, Thomas G.
Boots, shoes, and leggings
36441919, 3649744, 3649746, 3642834, 364DIG2, G06F 1730
Patent
active
054956080
ABSTRACT:
Dynamic optimization of a database access. During execution, based on the actual number of retrieved keys, or on the actual number of fetches (I/O operations) used to retrieve keys, a decision is made between alternative paths for completing the access. The invention features deciding not to retrieve records using the keys retrieved using a particular index if that retrieval could be expected to take longer than retrieving all records. A second index scan is begun during the first index scan, and a decision between alternative paths is made based on the number of keys retrieved during the second scan, or on the number of fetches incurred in the second scan. Scanning of an index is terminated if the number of retrieved keys exceeds a threshold corresponding to the point at which record retrieval using keys is likely to be more costly than full record retrieval. If all index scans are terminated, a full, sequential retrieval of all records is done.
REFERENCES:
patent: 3964029 (1976-06-01), Babb
patent: 4451901 (1984-05-01), Wolfe et al.
patent: 4468728 (1984-08-01), Wang
patent: 5043872 (1991-08-01), Cheng et al.
patent: 5089985 (1992-02-01), Chang et al.
patent: 5091852 (1992-02-01), Tsukhida et al.
"Adaptive Access Plan For Select Queries with Multiple Predicates", IBM Technical Disclosure Bulletin, vol. 32, No. 8B, Jan. 1990. pp. 6-10.
"Dynamic Access Path Determination for Tuple Selection", IBM Technical Disclosure Bulletin, vol. 31, No. 2, Jul. 1988, pp. 249-252.
Lee et al., "Adaptive Selection of Access Path and Join Method", The Thirteenth Annual International Computer Software & Applications Conference, Sep. 22, 1989, pp. 250-256.
B. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors", Association for Computer Machinery Communications, 1970, vol. 13, No. 7, pp. 422-426.
E. Babb, "Implementing a Relational Database by Means of Specialized Hardware", ACM Transactions on Database Systems, 1979, vol. 4, No. 1, pp. 1-29.
G. Graefe, K. Ward, "Dynamic Query Evaluation Plans", Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data, 1989, vol. 18, No. 2, pp. 358-366.
Ramesh et al. "Variable Depth Trie Index Optimization: Theory and Results, ACM Trans on Databases Systems", vol. 14, No. 1, Mar. 1989 pp. 41-74.
Donald E. Knuth, The Art of Computer Programming: vol. 3/ Sorting and Searching, Addison-Wesley Publishing Company, (Reading, Mass., 1973), pp. 550-567.
Ron Ashany, "Application of Sparse Matrix Techniques to Search, Retrieval, Classification and Relationship Analysis in Large Data Base Systems-SPARCOM", Fourth International Conference on Very Large Databases, West Berlin, Germany, Sep. 13-15, 1978, pp. 419-516.
Jeff Winchell, "Rushmore's Bald Spot", DBMS vol. 4, No. 10, Sep., 1991, p. 58.
Jeff Wincell, "dBASE IV 2.0 Query Innovations: Borland's latest dBASE Release: On the Forefront of Bitmap Index Optimization", DBMS, vol. 6, No. 10, Sep., 1993, pp. 68-71.
Hamilton, D. D., Inside Adabas, WH&O International (Wellesley, Mass., 1991), pp. 27-36, 49-51, 56-65.
Black Thomas G.
Lintz Paul R.
Oracle Corporation
LandOfFree
Dynamic index retrieval, bit mapping, and optimization of a sing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Dynamic index retrieval, bit mapping, and optimization of a sing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic index retrieval, bit mapping, and optimization of a sing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1686107