Data processing: database and file management or data structures – Database design – Data structure types
Patent
1997-05-29
1999-02-23
Lintz, Paul R.
Data processing: database and file management or data structures
Database design
Data structure types
707 1, 707 3, 707 4, 707 9, 707101, 707102, G06F 1730
Patent
active
058754458
ABSTRACT:
A method and system for estimating a cost of using a tree index to process a query that includes at least one interval restriction is provided. The cost of using an index to process a select query is estimated by (1) classifying intervals covered by the index as either true, false, or mixed intervals, based on the selection criteria, (2) estimating the cost of using the index based on the size of the true and mixed intervals, and (3) improving the cost estimate based on the average ratio of the parent and child node cardinalities taken down one or more sampling paths of the index. Use of a pseudo-ranked B-tree is generally preferred over a fully ranked tree due to the relatively low update costs of a pseudo-ranked B-tree. The index cost estimations are used to pick a select query execution plan that has the smallest cost, in terms of disk I/O operations, from numerous possible execution plans.
REFERENCES:
patent: 5251131 (1993-10-01), Masand et al.
patent: 5412806 (1995-05-01), Du et al.
patent: 5671403 (1997-09-01), Shekita et al.
patent: 5765150 (1998-06-01), Burrows
Havan Thu-Thao
Lintz Paul R.
Oracle Corporation
LandOfFree
Performance-related estimation using pseudo-ranked trees does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Performance-related estimation using pseudo-ranked trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance-related estimation using pseudo-ranked trees will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-315736