Dynamic optimization of a single relation access

Details Dynamic optimization of a single relation access Dynamic optimization of a single relation access

G - Physics

06

F

354/120

G06F 7/10 (2006.01) G06F 17/30 (2006.01)

Patent

CA 2033386

Abstract of the Disclosure 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.

Affiliated with

Also associated with

Rating

Dynamic optimization of a single relation access 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 optimization of a single relation access, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic optimization of a single relation access will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1736330