Performance comparison of xBR-trees and R*-trees for single dataset spatial queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6909 LNCS, Issue , 2011, Pages 228-242

  Roumelis, George ^a   Vassilakopoulos, Michael ^a,b   Corral, Antonio ^c  

^a OPEN UNIVERSITY OF CYPRUS   (Cyprus)

^b University of Central   (Greece)

^c UNIVERSITY OF ALMERÍA   (Spain)

Author keywords

Quadtrees; Query Processing; R trees; Spatial Access Methods

Indexed keywords

ACCESS METHODS; DATA SETS; DATA-DRIVEN; DISK-BASED; EXECUTION TIME; INDEX STRUCTURE; K NEAREST NEIGHBOR QUERIES; PERFORMANCE COMPARISON; POINT LOCATION; QUAD TREES; R-TREES; REAL DATA SETS; SPATIAL ACCESS METHODS; SPATIAL DATA; SPATIAL OPERATIONS; SPATIAL QUERIES;

DECISION TREES; INFORMATION SYSTEMS; PLANT EXTRACTS; QUERY PROCESSING;

TREES (MATHEMATICS);

EID: 80053083535     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23737-9_17     Document Type: Conference Paper

References (17)

1. 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)
2. Chen, Y., Patel, J.M.: Efficient Evaluation of All-Nearest-Neighbor Queries. In: ICDE Conference, pp. 1056-1065 (2007) (Pubitemid 47422109)
3. Comer, D.: The Ubiquitous B-tree. ACM Computing Surveys 11(2), 121-137 (1979)
4. Gaede, V., Gunther, O.: Multidimensional Access Methods. ACM Computing Surveys 30(2), 170-231 (1998) (Pubitemid 128485203)
5. 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)
6. Guttman: R-trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD Conference, pp. 47-57 (1984) (Pubitemid 15469534)
7. 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)
8. Hjaltason, G.R., Samet, H.: Distance Browsing in Spatial Databases. ACM Transactions on Database Systems 24(2), 265-318 (1999)
9. Hoel, E.G., Samet, H.: A Qualitative Comparison Study of Data Structures for Large Line Segment Databases. In: SIGMOD Conference, pp. 205-214 (1992)
10. Hoel, E.G., Samet, H.: Benchmarking Spatial Join Operations with Spatial Output. In: VLDB Conference, pp. 606-618 (1995)
11. 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)
12. 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) (Pubitemid 34985578)
13. Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A., Theodoridis, Y.: R-Trees: Theory and Applications. Springer, Heidelberg (2006)
14. 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)
15. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD Conference, pp.71-79 (1995)
16. Samet, H.: Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading (1990)
17. 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)