Non-Unique Key B-Tree Implementation

摘要

The B-Trees are an indexed method to allow fast retrieval and order preserving updates to a FRAMIS relation based on a designated set of keys in the relation. A B-Tree access method is being implemented to provide indexed and sequential (in index order) access to FRAMIS relations. The implementation modifies the basic B-Tree structure to correctly allow multiple key values and still maintain the balanced page fill property of B-Trees. The data structures of the B-Tree are presented first, including the FRAMIS solution to the duplicate key value problem. Then the access level routines and utilities are presented. These routines include the original B-Tree creation; searching the B-Tree; and inserting, deleting, and replacing tuples on the B-Tree. In conclusion, the uses of the B-Tree access structures at the semantic level to enhance the FRAMIS performance are discussed. 10 figures. (ERA citation 06:011865)