Database searching using trapeze fetch

Details Database searching using trapeze fetch Database searching using trapeze fetch

2005-11-29

2005-11-29

Le, Uyen (Department: 2163)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

06970865

ABSTRACT:
A method and apparatus for improving search performance in databases organized in B Tree or B+ Tree format has an automatic determination and switching between two methods. It also searches to the end of a current leaf page even if a current value for all key parameters has been fulfilled in the search prior to reaching the end of the current leaf page. Swinging across and thus skipping leaf pages to fetch a next leaf page (trapeze fetching or swinging) is activated only either initially or where a B Tree search has resulted in a skipping of leaf pages previously in a search. User interference with the automatic selection of search type between next sequential leaf or trapeze type is not provided for and not allowed.

REFERENCES:
patent: 5664172 (1997-09-01), Antoshenkov
patent: 5717919 (1998-02-01), Kodavalla et al.
patent: 5852821 (1998-12-01), Chen et al.
patent: 6374232 (2002-04-01), Dageville et al.

Affiliated with

Also associated with

Rating

Database searching using trapeze fetch does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Database searching using trapeze fetch, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Database searching using trapeze fetch will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3471271