Indexed Data Retrieval for the Ibm Rt Pc
Original Publication Date: 1987-Jun-01
Included in the Prior Art Database: 2005-Feb-01
The method involves the use of B+ trees. The following refinements are employed: 1. Last Key Compression: The highest key value in the index is not explicitly maintained. This improves insertion per formance when new, higher-value keys are being added. 2. "Index of Indexes": Multiple indexes are stored in the same physical file. The directory of these indexes is itself a B tree, which allows an unlimited number of named (1-14 character) indexes to be stored. This "anchor" index is maintained using the standard B+ tree algorithms used for the indexes themselves. 3.