Database system with improved methods for B-tree maintenance

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