Abstract
Processing of spatial queries has been studied extensively in the literature. In most cases, it is accomplished by indexing spatial data by an access method. For queries involving a single dataset, like the Point Location Query, the Window (Distance Range) Query, the (Constrained) K Nearest Neighbor Query, the R*-tree (a data-driven structure) is a very popular choice of such a method. In this paper, we compare the performance of the R*-tree for processing single dataset spatial queries to the performance of a disk based structure that belongs to the Quadtree family, the xBR-tree (a space-driven structure). We demonstrate performance results (I/O efficiency and execution time) of extensive experimentation that was based on real datasets, using these two index structures. The winner depends on several parameters and the results show that the xBR-tree is a promising alternative for these spatial operations.
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
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD Conference, pp. 322-331 (1990)
Chen, Y., Patel, J.M.: Efficient Evaluation of All-Nearest-Neighbor Queries. In: ICDE Conference, pp. 1056-1065 (2007)
Comer, D.: The Ubiquitous B-tree. ACM Computing Surveys 11(2), 121–137 (1979)
Gaede, V., Gunther, O.: Multidimensional Access Methods. ACM Computing Surveys 30(2), 170–231 (1998)
Gorawski, M., Bugdol, M.: New Trends in Data Warehousing and Data Analysis. In: Kozielski, S., Wrembel, R. (eds.) Cost Model for XBR-tree. Springer, Heidelberg (2009)
Guttman: R-trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD Conference, pp. 47-57 (1984)
Hjaltason, G.R., Samet, H.: Ranking in Spatial Databases. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol. 951, pp. 83–95. Springer, Heidelberg (1995)
Hjaltason, G.R., Samet, H.: Distance Browsing in Spatial Databases. ACM Transactions on Database Systems 24(2), 265–318 (1999)
Hoel, E.G., Samet, H.: A Qualitative Comparison Study of Data Structures for Large Line Segment Databases. In: SIGMOD Conference, pp. 205-214 (1992)
Hoel, E.G., Samet, H.: Benchmarking Spatial Join Operations with Spatial Output. In: VLDB Conference, pp. 606-618 (1995)
Kim, Y.J., Patel, J.: Performance Comparison of the R*-tree and the Quadtree for kNN and Distance Join Queries. IEEE Transactions on Knowledge and Data Engineering 22(7), 1014–1027 (2010)
Kothuri, R.K., Ravada, S., Abugov, D.: Quadtree and R-tree Indexes in Oracle Spatial: A Comparison using GIS Data. In: SIGMOD Conference, pp. 546–557 (2002)
Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A., Theodoridis, Y.: R-Trees: Theory and Applications. Springer, Heidelberg (2006)
Roumelis, G., Vassilakopoulos, M., Corral, A.: Algorithms for processing Nearest Neighbor Queries using xBR-trees. In: 15th Panhellenic Conference on Informatics (PCI 2011) (to appear 2011)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD Conference, pp.71-79 (1995)
Samet, H.: Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading (1990)
Vassilakopoulos, M., Manolopoulos, Y.: External Balanced Regular (x-BR) Trees: New Structures for Very Large Spatial Databases. In: Advances in Informatics: Proc. 7th Hellenic Conf. on Informatics (HCI 1999), pp. 324–333. World Scientific Publ. Co., Singapore (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roumelis, G., Vassilakopoulos, M., Corral, A. (2011). Performance Comparison of xBR-trees and R*-trees for Single Dataset Spatial Queries. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds) Advances in Databases and Information Systems. ADBIS 2011. Lecture Notes in Computer Science, vol 6909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23737-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-23737-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23736-2
Online ISBN: 978-3-642-23737-9
eBook Packages: Computer ScienceComputer Science (R0)