Abstract
In this paper we present an efficient data structure, called Gr_tree, for organizing multidimensional data. The proposed structure combines the features of distance functions of metric spaces and G-trees. Although the Gr_tree requires distance computations and has the overhead of a small amount of storage space, due to the introduction of active regions inside the partitions of the data space, it reduces the accesses of partial match and range queries. We give algorithms for the dynamic operations of the Gr_tree, examine several types of queries and provide some comparative results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. Proc. 23th Athens Intern. Conf. on VLDB (1997) 426–435
Dandamundi, S., Sorenson, P.: An empirical performance comparison of some variations of the k-d tree and BD-tree. Int.J.Comput. Inform.Sci., vol.14 (1985) 135–159
Dandamundi, S., Sorenson, P.: Algorithms for BD-trees. Software Practice and Experience, vol.16 (1986) 1077–1096
Freeston, M.: The BANG file: a new kind of grid file. Proc. ACM, SIGMOD Conf. (1987) 260–269
Kumar, A.: G-Tree: A New Data Structure for Organizing Multidimentional Data. IEEE, Trans. On Knowledge and Data Eng., vol. 6,no. 2 (1994) 341–347
Nievergelt, J., Hintenberger, H., Sevcik, K.C.: The Grid File: an adaptable, symmetric multikey file structure. ACM Trans. Database Syst., vol. 9,no. 1 (1984) 38–71
Orenstein, J., Merrett, T.: A class of data structures for associative searching. Proc. ACM SIGACT-SIGMOD Symp. Principles of Database Systems (1984) 181–190
Orenstein, J.: Spatial query processing in an object-oriented database system. Proc. ACM SIGMOD Conf., Washington (1986) 326–336
Robinson, J.T.: The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes. Proc. ACM SIGMOD Conf., Ann Arbor, MI (1981) 10–18
Samet, H.: Spatial Databases. Proc. 23th Athens Intern. Conf. on VLDB (1997) 63–129
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapopoulos, D.G., Hatzopoulos, M. (1999). The Gr_Tree: The Use of Active Regions in G-Trees. In: Eder, J., Rozman, I., Welzer, T. (eds) Advances in Databases and Information Systems. ADBIS 1999. Lecture Notes in Computer Science, vol 1691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48252-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-48252-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66485-7
Online ISBN: 978-3-540-48252-9
eBook Packages: Springer Book Archive