05644763 is referenced by 85 patents and cites 11 patents.

Database system and methods are described for maintenance of B-Tree indexes, such as are commonly used in a relational database environment. "Load patterns" are monitored, for optimizing B-Tree node splitting, based on a particular load pattern's effect on B-Tree growth. More particularly, an "ascending insert" load pattern--that is, the insertion of data records for a multi-column table where the particular records to be inserted have a fixed value for the first column and a monotonically increasing value for the subsequent column(s)--can be identified and optimized. Methods are described for splitting the B-Tree nodes or pages, not at the half-way point, but instead exactly at the point of insertion, a position where the insert row would have gone into the page (had it not overflowed). Since splitting the index nodes or pages at the insertion point all the time would lead to regression in performance (particularly for random inserts), the methods of the present invention further include steps for testing conditions which should preferably exist before pages are split at insertion points.

Title
Database system with improved methods for B-tree maintenance
Application Number
8/497663
Publication Number
5644763
Application Date
June 28, 1995
Publication Date
July 1, 1997
Inventor
Shaibal Roy
Oakland
CA, US
Agent
David N Slone
John A Smart
Assignee
Sybase
CA, US
IPC
G06F 17/30
View Original Source