A study on data point search for HG-trees

Authors:
Joseph Kuan;Paul Lewis
Affiliations:
Dept. of Electronic and Comp. Science, University of Southampton, Highfield, Southampton, United Kingdom;Dept. of Electronic and Comp. Science, University of Southampton, Highfield, Southampton, United Kingdom
Venue:
ACM SIGMOD Record
Year:
1999

Citing 0
Cited 3

Simple QSF-trees: an efficient and scalable spatial access method

Proceedings of the eighth international conference on Information and knowledge management
Dynamic and hierarchical spatial access method using integer searching

Proceedings of the tenth international conference on Information and knowledge management
Index structures for data warehouses

Index structures for data warehouses

Quantified Score

Hi-index	0.00

Visualization

Abstract

A point data retrieval algorithm for the HG-tree is introduced which improves the number of nodes accessed. The HG-tree is a multidimensional indexing tree designed for point data and it is a simple modification from the Hilbert R-tree for indexing spatial data. The HG-tree data search method mainly makes use of the Hilbert index values to search for exact data, instead of using conventional point search methods as used in most of the R-tree papers. The use of Hilbert curve values and MBR can reduce the spatial cover of an MBR.Several R-tree variants have been developed; R*-tree, S-tree, Hilbert R-tree, and R*-tree combined with the linear split method by Ang et al. Our search method on the HG-tree gives a superior speed performance compared to all other R-tree variants.