A performance comparison of distance-based query algorithms using R-trees in spatial databases

Information Sciences

Volumn 177, Issue 11, 2007, Pages 2207-2237

  Corral, Antonio ^a   Almendros Jiménez, Jesús M ^a  

^a UNIVERSITY OF ALMERÍA   (Spain)

Author keywords

Distance based queries; Performance study; Query processing; R trees; Search algorithms; Spatial databases

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

BRANCHING FACTORS; DISTANCE RANGE QUERY; QUERY ALGORITHMS; SPATIAL DATABASES;

QUERY PROCESSING;

EID: 33947266975     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2006.12.012     Document Type: Article

References (38)

1. *-tree: an efficient and robust access method for points and rectangles, in: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data (SIGMOD), Atlantic City, NJ, 1990, pp. 322-331.
2. S. Berchtold, C. Böhm, D.A. Keim, H.P. Kriegel, A cost model for nearest neighbor search in high-dimensional data space, in: Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Tucson, AZ, 1997, pp. 78-86.
3. Böhm C., Berchtold S., and Keim D.A. Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Computing Surveys 33 3 (2001) 322-373
4. C. Böhm, F. Krebs, High performance data mining using the nearest neighbor join, in: Proceedings of the IEEE International Conference on Data Mining (ICDM), Maebashi, Japan, 2002, pp. 43-50.
5. Bovet D.P., and Cesati M. Understanding the Linux Kernel (2003), O'Reilly, Sebastopol
6. T. Brinkhoff, H.P. Kriegel, B. Seeger, Efficient processing of spatial joins using R-trees, in: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD), Washington, WA, 1993, pp. 237-246.
7. Brown P. Object-Relational Database Development: A Plumber's Guide (2001), Prentice-Hall, Indianapolis
8. Chan E.P.F. Buffer queries. IEEE Transactions Knowledge Data Engineering (TKDE) 15 4 (2003) 895-910
9. Chen J.K., and Chin Y.H. A concurrency control algorithm for nearest neighbor query. Information Sciences 114 1-4 (1999) 187-204
10. Cheung K.L., and Fu A.W. Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Record 27 3 (1998) 16-21
11. Chrisman N. Exploring Geographic Information Systems (2002), John Wiley and Sons, New York
12. Comer D. The ubiquitous B-tree. ACM Computing Surveys 11 2 (1979) 121-137
13. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms (2003), MIT Press, Cambridge
14. A. Corral, J. Cañadas, M. Vassilakopoulos, Approximate algorithms for distance-based queries in high-dimensional data spaces using R-trees, in: Proceedings of the 6th East European Conference on Advances in Databases and Information Systems (ADBIS), Bratislava, Slovakia, 2002, pp. 163-176.
15. A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos, Closest pair queries in spatial databases, in: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD), Dallas, TX, 2000, pp. 189-200.
16. Corral A., Manolopoulos Y., Theodoridis Y., and Vassilakopoulos M. Algorithms for processing K-closest-pair queries in spatial databases. Data and Knowledge Engineering (DKE) 49 1 (2004) 67-104
17. Gaede V., and Günther O. Multidimensional access methods. ACM Computing Surveys 30 2 (1998) 170-231
18. A. Guttman, R-trees: a dynamic index structure for spatial searching, in: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data (SIGMOD), Boston, MA, 1984, pp. 47-57.
19. G.R. Hjaltason, H. Samet, Incremental distance join algorithms for spatial databases, in: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD), Seattle, WA, 1998, pp. 237-248.
20. Hjaltason G.R., and Samet H. Distance browsing in spatial databases. ACM Transactions on Database Systems (TODS) 24 2 (1999) 265-318
21. Y.W. Huang, N. Jing, E.A. Rundensteiner, Spatial joins using R-trees: breadth-first traversal with global optimizations, in: Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB), Athens, Greece, 1997, pp. 396-405.
22. Korf R.E. Linear-space best-first search. Artificial Intelligence 66 1 (1993) 41-78
23. N. Koudas, K.C. Sevcik, Size separation spatial join, in: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data (SIGMOD), Tucson, AZ, 1997, pp. 324-335.
24. Koudas N., and Sevcik K.C. High dimensional similarity joins: algorithms and performance evaluation. IEEE Transactions Knowledge Data Engineering (TKDE) 12 1 (2000) 3-18
25. Manolopoulos Y., Nanopoulos A., Papadopoulos A.N., and Theodoridis Y. R-Trees: Theory and Applications. Advanced Information and Knowledge Processing Series (2005), Springer, London
26. Nilsson N. Artificial Intelligence: A New Synthesis (1998), Morgan Kaufmann, San Francisco
27. Oracle Technology Network Oracle Spatial User's Guide and Reference, 2001. Downloadable from: .
28. A. Papadopoulos, Y. Manolopoulos, Performance of nearest neighbor queries in R-Trees, in: Proceedings of the 6th International Conference on Database Theory (ICDT), Delphi, Greece, 1997, pp. 394-408.
29. Papadopoulos A.N., Nanopoulos A., and Manolopoulos Y. Processing distance join queries with constraints. The Computer Journal 49 3 (2006) 281-296
30. N. Roussopoulos, S. Kelley, F. Vincent, Nearest neighbor queries, in: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (SIGMOD), San Jose, CA, 1995, pp. 71-79.
31. T. Seidl, H.P. Kriegel, Optimal multi-step k-nearest neighbor search, in: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD), Seattle, WA, 1998, pp. 154-165.
32. Shekhar S., and Chawla S. Spatial Databases: A Tour (2003), Prentice-Hall, New Jersey
33. H. Shin, B. Moon, S. Lee, Adaptive multi-stage distance join processing, in: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD), Dallas, TX, 2000, pp. 343-354.
34. Y. Shou, N. Mamoulis, H. Cao, D. Papadias, D.W. Cheung, Evaluation of iceberg distance joins, in: Proceedings of the 8th International Symposium on Spatial and Temporal Databases (SSTD), Santorini Island, Greece, 2003, pp. 270-288.
35. M. Stonebraker, J. Frew, K. Gardels, J. Meredith, The sequoia 2000 benchmark, in: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD), Washington, WA, 1993, pp. 2-11.
36. The R-tree Portal (TIGER/Line® files, Geography Division, US Census Bureau, ) , 2004.
37. Yang Z., and Yang G. A near-optimal similarity join algorithm and performance evaluation. Information Sciences 167 1-4 (2004) 87-108
38. Zhang W., and Korf R.E. Performance of linear-space search algorithms. Artificial Intelligence 79 2 (1995) 241-292