Abstract
In this paper, we present a new multidimensional access method, called hana tree, which can provide an efficient and robust way for dynamic modifications and interactive queries to spatial database.We designed a new multidimensional binary encoding scheme, hana code, for representing points and page regions in hana tree. When a new spatial data is inserted in uncovered data space, the page region of the existing node is expanded to include it instead of creating a new one. These properties allow the decrease in the total number of nodes and the reduction in the number of nodes accessed during search, thus improving the overall performance in storage space utilization and various operations Also, we shall describe our experimental results where hana tree is compared to other point access methods to show the superiority of hana tree.
This work has been supported by KOSEF and Brain Korea 21 project
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Nievergelt, H. Hinterberger, K.C. Sevcik: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Dtabase System, Vol. 9, No. 1 (1984) 38–71
E. J. Otoo: A mapping Function for the directory of a multidimensional extendible hashing. In Proc. of the tenth Int. Conf. on Very Large Data Bases (1984) 491–506
J. T. Robinson: The k-d-B-tree: a search structure for large multidimensional dynamic indexes. In Proc. of ACM SIGMOD Int. Conf. on Management of Data (1981) 10–18
M. Freeston: The BANG file: a new kind of grid file. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data (1987) 260–269
B. Seeger and H. P. Kriegel: The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems. In Proc. of the 16th Int. Conf. on Very Large Data Bases (1990) 590–601
D. B. Lomet and Betty Salzberg,: The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. In Proc. of the fifth IEEE Int. Conf. on Data Engineering (1989) 296–304
K. Y. Whang and R. Krishmamurthy: The Multilevel Grid File-A Dynamic Hierarchical Multidimensional File Structure. Int. Symposium on Database Systems for Advanced Applications (1991) 449–459
A. Henrich, H. W. Six, and P. Widmayer: The LSD tree: spatial access to multidimensional point and nonpoint objects. In Proc. of the fifteenth Int. Conf. on Very Large Data Bases (1989) 45–53
M. Freeston: A general solution of the n-dimensional B-tree problem. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data (1995) 80–91
J. M. Hellerstein, J. F. Navghton and A. Pfeffer: Generalized search trees for database systems. In Proc. of the 21st Int. Conf. on VeryLarge Data Bases (1995) 562–573
V. Gaede and O. Gunther: Multidimension Access Methods. ACM Computing Surveys, Vol. 30, No. 2 (1998) 170–230
J. Orenstein and T. H. Merrett: A class of data structures for associative searching. In Proc. of the third ACM SIGACT-SIGMOD symposium on Principles of Database Systems (1984) 181–190
C. Faloutsos and S. Roseman: Fractals for secondary key retrieval. In Proc. of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases Systems (1989) 247–252
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwon, Y., Jeong, C. (2000). Hana Tree: A Dynamic and Robust Access Method for Spatial Data Handling. In: Lu, H., Zhou, A. (eds) Web-Age Information Management. WAIM 2000. Lecture Notes in Computer Science, vol 1846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45151-X_26
Download citation
DOI: https://doi.org/10.1007/3-540-45151-X_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67627-0
Online ISBN: 978-3-540-45151-8
eBook Packages: Springer Book Archive