Presents the B**-tree, a data organization method which achieves a storage utilization which is higher than that of the B*-tree. The proposed structure performs especially well in just those cases where the B*-tree performs the worst. The B**-tree attains high storage utilization but incurs some I/O overhead during index creation. The observed I/O overhead ranges from -20% (i.e. I/O gains) to +35%. In all tested cases, the storage utilization achieved by the proposed structure is at least 90%.
展开▼
