Centre de documentation
scientifique

The hB-tree: a multiattribute indexing method with good guaranteed performance / David Bruce Lomet in ACM Transactions on database systems, TODS, vol 15 n° 4 (December 1990)  

Public [article]  inACM Transactions on database systems, TODS > vol 15 n° 4 (December 1990) . - pp 625 - 658 Titre : The hB-tree: a multiattribute indexing method with good guaranteed performance Type de document : Article/Communication Auteurs : David Bruce Lomet, Auteur ; Betty Joan Salzberg, Auteur Année de publication : 1990 Article en page(s) : pp 625 - 658 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] arbre k-d [Termes IGN] arbre-B Résumé : (auteur) A new multiattribute index structure called the hB-tree is introduced. It is derived from the K-D-B-tree of Robinson [15] but has additional desirable properties. 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 no longer represent brick-like regions in k-space, but that can be characterized as holey bricks, bricks in which subregions have been extracted. We present results that guarantee hB-tree users decent storage utilization, reasonable size index terms, and good search and insert performance. These results guarantee that the hB-tree copes well with arbitrary distributions of keys. Numéro de notice : A1990-230 Affiliation des auteurs : non IGN Thématique : INFORMATIQUE Nature : Article DOI : 10.1145/99935.99949 Date de publication en ligne : 01/12/1990 En ligne : https://doi.org/10.1145/99935.99949 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101034 [article]