Access path optimization using degrees of clustering

Details Access path optimization using degrees of clustering Access path optimization using degrees of clustering

1988-07-15

1991-08-27

Williams, Jr., Archie E.

Boots, shoes, and leggings

36493146, 3649621, 3649622, 3649624, 364963, 3649634, 3649744, 3649746, 3642253, 3642823, 3642824, 3642831, 3642834, G06F 1574, G06F 1521, G06F 15403, G06F 1206

Patent

active

050438727

ABSTRACT:
This invention measures the degree of clustering of an index for a relational data base table, estimates the number of physical page accesses required to access the table using a partial index scan using the index, and selects the index providing the fastest access path to the table. The degree of clustering is measured as follows:

REFERENCES:
patent: 4631673 (1923-12-01), Haas et al.
patent: 4769772 (1988-09-01), Dwyer
patent: 4805134 (1989-02-01), Calo et al.
patent: 4817050 (1989-03-01), Komatsu et al.
D. Maio et al., "On Estimating Access Costs in Relational Databases", Information Processing Letters, 19, (1984), pp. 157-161.
Selinger et al., "Access Path Selection in a Relational Database Management System", IBM Research Report, RJ2429, (1/8/79).

Affiliated with

Also associated with

Rating

Access path optimization using degrees of clustering does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Access path optimization using degrees of clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Access path optimization using degrees of clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1419089