Dynamic preconditioning of A B+tree

Details Dynamic preconditioning of A B+tree Dynamic preconditioning of A B+tree

2007-09-17

2010-10-05

Trujillo, James (Department: 2159)

Data processing: database and file management or data structures

Database design

Data structure types

C707S803000

Reexamination Certificate

active

07809759

ABSTRACT:
Various approaches for processing a B+tree data structure of a database are disclosed. In one approach a method determines a pattern of multi-column key values. In response to an insert transaction into the database that requires a new index page and before performing the insert transaction, the method generates a plurality of new multi-column key values based on the pattern and stores one or more of the plurality of multi-column key values in one or more new index pages. Before performing the insert, the method further commits to retentive storage of the one or more new index pages and new data pages as linked to the B+tree. After committing the one or more new index pages and new data pages, the method then proceeds to processes and commits the insert transaction.

REFERENCES:
patent: 5644763 (1997-07-01), Roy
patent: 5717919 (1998-02-01), Kodavalla et al.

Affiliated with

Also associated with

Rating

Dynamic preconditioning of A B+tree 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 preconditioning of A B+tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic preconditioning of A B+tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4199164