A robust multi-attribute search structure

A multiattribute index structure called the hB-tree is introduced. The hB-tree internode search and growth processes are precisely analogous to the corresponding processes in B-trees. The intranode processes are unique. A k-d tree is used as the structure within nodes for very efficient searching. N...

Full description

Saved in:
Bibliographic Details
Published in[1989] Proceedings. Fifth International Conference on Data Engineering pp. 296 - 304
Main Authors Lomet, D.B., Salzberg, B.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1989
Subjects
Computer science
Educational institutions
Robustness
Online AccessGet full text

Cover

More Information
Summary:A multiattribute index structure called the hB-tree is introduced. The hB-tree internode search and growth processes are precisely analogous to the corresponding processes in B-trees. The intranode processes are unique. A k-d tree is used as the structure within nodes for very efficient searching. Node splitting requires that this k-d tree be split. This produces nodes which do not represent brick-like regions in k-space but that can be characterized as holey bricks, i.e. bricks in which subregions have been extracted. Results are presented that guarantee hB-tree users decent storage utilization, reasonable-size index terms, and good search and insert performance regardless of key distribution.< >
ISBN:0818619155
9780818619151
DOI:10.1109/ICDE.1989.47229