Abstract
In this paper we present a novel symmetric and dynamic access method, the Arc-tree, for organizing multidimensional data. The Arc-tree uses a new space-filling curve and a partition scheme that is based on bit interleaving. It divides the data space into non-overlapping arc partitions through splits imposed by meeting planes and co-centric spheres that alternate in a fixed order. The proposed structure is k-d-cut, fixed and brickwall. The Arc-tree inco rporates the properties of metric spaces and B-trees, is independent of data distribution and excludes the storage of empty partitions. Moreover, for a given data space the partitions are identical regardless of the order of insertions and deletions. The Arc-tree arranges partitions around a starting p oint and this makes the method especially suitable for applications where distance queries and searches on planes that intersect this point are concerned. We present the Arc-tree, describe its dynamic behavior and provide algorithms that prune the set of candidates to qualify partitions for several types of queries.
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
Bayer, R.: The Universal B-tree for Multidimensional Indexing: General Concepts. In: World-Wide Computing and Its Applications. Lecture Notes in Computer Science, Springer-Verlag, Tsukuba Japan (1997) 10–11
Beckmann, N., Kriegel, H-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In Proc. ACM SIGMOD, (1990) 322–331
Berchtold, S., Keim, D.A., Kriegel, H-P.: The X-tree: An Index Structure for High-Dimensional Data. In Proc. 22nd Int. Conf. on VLDB, (1996) 28–39
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similari ty Search in Metric Spaces. In Proc. 23rd Athens Int. 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. Comp. Inform. Sci., Vol. 14, (1985) 135–159
Faloutsos, C: Gray-codes for partial match and range queries. IEEE Trans, on Software Eng., Vol. 14, (1988) 1381–1393
Faloutsos, C, Roseman, S.: Fractals for secondary key retrieval. In Proc. ACM SIGACT-SIGMOD Symp. Principles of Database Systems, (1989) 247–252
Faloutsos, C: Searching Multimedia Databases by Content. Kluwer Academic Press, (1996).
Freeston, M.: The BANG file: a new kind of grid file. In Proc. ACM SIGMOD, (1987) 260–269
Gunther, O., Bilmes, J.: Tree-Based Access Methods for Spatial Databases: I mplementation, and Performance Evaluation. IEEE Trans, on Knowledge and Data Eng., Vol. 3, no. 3, (1991) 342–356
Gaede, V., Gunther, O.: Multidimensional Access Methods. ACM Computing Surveys, Vol. 30, no. 2, (1998) 170–231
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In Proc. ACM SIGMOD, Boston, (1984) 47–57
Jagadish, H.V.: Spatial Search with Polyhedra. In Proc. 6th IEEE Int. Conf. on Data Engineering, (1990) 311–319
Kapopoulos, D.G., Hatzopoulos, M.: The Gc_Tree: The Use of Active Regions in G-Trees. In: Eder J., Rozman, I., Welzer T. (eds.): Advances in Databases and Information Systems. Lecture Notes in Computer Science, Vol. 1691. Springer-Verlag, (1999) 141–155
Katayama, N., Satoh, S.: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. In Proc. ACM SIGMOD, (1997) 369–380
Kumar, A.: G-Tree: A New Data Structure for Organizing Multidimensional Data. IEEE, Trans, on Knowledge and Data Eng., Vol. 6, no. 2 (1994) 341–347
Lin, K.I., Jagadish, H.V., Faloutsos, C: The TV-Tree: An Index Structure for High-Dimensional Data. In VLDB Journal, Vol. 3, no. 4, (1994) 517–542
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. In Proc. ACM SIGACT-SIGMOD Symp. Principles of Database Systems, (1984) 181–190
Sakurai, Y., Yoshikawa, M., Uemura S., Kojima, H.: The A-tree: An Index Structure for High Dimensional Spaces Using Relative Approximation. In Proc. 26th Cairo Int. Conf. on VLDB, (2000)516–526
Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, MA (1990)
Samet, H.: Spatial Databases. In Proc. 23rd Athens Int. Conf. on VLDB, (1997) 63–129
Sellis, T., Roussopoulos, N., Faloutsos, C: The R+-tree: A Dynamic Index for Multid imensional Objects. In Proc. 13th Brighton Int. Conf. on VLDB, (1987) 507–518
Manolopoulos, Y., Theodoridis, Y., Tsotras, V. J.: Advanced Database Indexing. Kluwer Academic Publishers, Boston (1999)
Traina, C, Traina, A., Seeger, B., Faloutsos, C: Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes. In Proc. EDBT (Extending Database Technology), Konstanz, Germany, (2000)
White, D., Jain, R.: Similarity Indexing with the SS-tree. In Proc. 12th ICDE, (1996) 516–523
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapopoulos, D.G., Hatzopoulos, M. (2001). The Arc-Tree: A Novel Symmetric Access Method for Multidimensional Data. In: Caplinskas, A., Eder, J. (eds) Advances in Databases and Information Systems. ADBIS 2001. Lecture Notes in Computer Science, vol 2151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44803-9_23
Download citation
DOI: https://doi.org/10.1007/3-540-44803-9_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42555-7
Online ISBN: 978-3-540-44803-7
eBook Packages: Springer Book Archive