Title :
B***-tree: a family of efficient data packaging multiway trees
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 improves the storage utilization of the conventional B*-tree by 20%-50%. The B***-tree uses a special node data structure that eliminates some of the I/O overhead incurred during building the index. Moreover, an adaptation of the B***-tree in distributed memory multiprocessors is discussed. This structure guarantees 100% storage utilization, and incurs a tolerable message passing overhead, solely dependent on the branching factor of the tree
Keywords :
distributed memory systems; indexing; message passing; tree data structures; B***-tree; B*-tree; B-tree; I/O overhead; branching factor; data organization method; data structure; distributed memory multiprocessors; efficient data packaging multiway trees; index building; message passing overhead; node data structure; storage utilization; Buildings; Computer science; Data structures; Database systems; Educational institutions; Indexes; Mathematics; Message passing; Packaging; Standards organizations;
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.315363
