Title :
B**-tree: a data organization method for high storage utilization
Author :
Toptsis, Anestis A.
Author_Institution :
Dept. of Comput. Sci. & Math., York Univ., Toronto, Ont., Canada
Abstract :
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%
Keywords :
indexing; tree data structures; B**-tree; B*-tree; I/O gains; I/O overhead; data organization method; data structure; high storage utilization; index creation; Computer science; Data processing; Data structures; Database systems; Educational institutions; Indexes; Mathematics; Standards organizations; Testing; Tree data structures;
Conference_Titel :
Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on
Conference_Location :
Sudbury, Ont.
Print_ISBN :
0-8186-4212-2
DOI :
10.1109/ICCI.1993.315364
