Algorithms for processing K-closest-pair queries in spatial databases

Data and Knowledge Engineering

Volumn 49, Issue 1, 2004, Pages 67-104

  Corral, Antonio ^a   Manolopoulos, Yannis ^b   Theodoridis, Yannis ^c   Vassilakopoulos, Michael ^d  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^c UNIVERSITY OF PIRAEUS   (Greece)

^d ALEXANDER TECHNOLOGICAL EDUCATIONAL INSTITUTE OF THESSALONIKI   (Greece)

Author keywords

Branch and bound algorithms; Distance join; I O and response time performance; Query processing; R tree; Spatial databases

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; QUERY LANGUAGES;

DATASETS; SPATIAL DATABASES;

DATABASE SYSTEMS;

EID: 1642398164     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2003.08.007     Document Type: Article

References (35)

1. Arya S., Mount D.M., Netanyahu N.S., Silverman R., Wu A.Y. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM. 45(6):1998;891-923.
2. *-tree: an efficient and robust access method for points and rectangles, in: Proceedings ACM SIGMOD Conference, 1990, pp. 322-331.
3. T. Brinkhoff, H.P. Kriegel, B. Seeger, Efficient processing of spatial joins using R-trees, in: Proceedings ACM SIGMOD Conference, 1993, pp. 237-246.
4. Brown P. Object-Relational Database Development, A Plumber's Guide. 2001;Prentice Hall.
5. H.T. Chou, D.J. DeWitt, An evaluation of buffer management strategies for relational database systems, in: Proceedings 11th VLDB Conference, 1985, pp. 127-141.
6. Cheung K.L., Fu A.W. Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Record. 27(3):1998;16-21.
7. Chin F.Y., Wang C.A. Minimum vertex distance between separable convex polygons. Information Processing Letters. 18(1):1984;41-45.
8. A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos, Closest pair queries in spatial databases, in: Proceedings ACM SIGMOD Conference, 2000, pp. 189-200.
9. C.Y. Chan, B.C. Ooi, H. Lu, Extensible buffer management of indexes, in: Proceedings 18th VLDB Conference, 1992, pp. 444-454.
10. Comer D. The ubiquitous B-tree. ACM Computing Surveys. 11(2):1979;121-137.
11. A. Corral, M. Vassilakopoulos, Y. Manolopoulos, The impact of buffering for the closest pairs queries using R-trees, in: Proceedings 5th ADBIS Conference, 2001, pp. 41-54.
12. Digital Chart of the World: real spatial datasets of the world at 1:1,000,000 scale, 1997. Downloadable from 〈 http://www.maproom.psu.edu/dcw〉.
13. Effelsberg W., Harder T. Principles of database buffer management. ACM Transactions on Database Systems. 9(4):1984;560-595.
14. Friedman J.H., Bentley J.L., Finkel R.A. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software. 3(3):1977;209-226.
15. Gaede V., Günther O. Multidimensional access methods. ACM Computing Surveys. 30(2):1998;170-231.
16. Gilbert E.G., Johnson D.W., Keerthi S.S. A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Journal of Robotics and Automation. 4(2):1988;193-203.
17. M.T. Goodrich, J.J. Tsay, D.E. Vengroff, J.S. Vitter, External-memory computational geometry, in: Proceedings 34th FOCS Conference, 1993, pp. 714-723.
18. A. Guttman, R-trees: a dynamic index structure for spatial searching, in: Proceedings ACM SIGMOD Conference, 1984, pp. 47-57.
19. Y.W. Huang, N. Jing, E.A. Rundensteiner, Spatial joins using R-trees: breadth-first traversal with global optimizations, in: Proceedings 23rd VLDB Conference, 1997, pp. 396-405.
20. G.R. Hjaltason, H. Samet, Ranking in spatial databases, in: Proceedings 4th SSD Conference, 1995, pp. 83-95.
21. G.R. Hjaltason, H. Samet, Incremental distance join algorithms for spatial databases, in: Proceedings ACM SIGMOD, 1998, pp. 237-248.
22. Hjaltason G.R., Samet H. Distance browsing in spatial databases. ACM Transactions on Database Systems. 24(2):1999;265-318.
23. Ibaraki T. Annals of Operations Research. 1987;Scientific Publishing Company.
24. N. Koudas, K.C. Sevcik, Size separation spatial join, in: Proceedings ACM SIGMOD Conference, 1997, pp. 324-335.
25. Laurini R., Thomson D. Fundamentals of Spatial Information Systems. 1992;Academic Press, London.
26. M.L. Lo, C.V. Ravishankar, Spatial hash-joins, in: Proceedings ACM SIGMOD Conference, 1996, pp. 247-258.
27. Oracle Technology Network: Oracle Spatial User's Guide and Reference, 2001. Downloadable from 〈 http://technet.oracle.com/doc/Oracle8i_816/inter.816/a77132.pdf〉.
28. J.M. Patel, D.J. DeWitt, Partition based spatial-merge join, in: Proceedings ACM SIGMOD Conference, 1996, pp. 259-270.
29. A.N. Papadopoulos, Y. Manolopoulos, Performance of nearest neighbor queries in R-trees, in: Proceedings 6th ICDT Conference, 1997, pp. 394-408.
30. D. Papadias, N. Mamoulis, Y. Theodoridis, Processing and optimization of multiway spatial joins using R-trees, in: Proceedings 18th ACM PODS Conference, 1999, pp. 44-55.
31. Preparata F.P., Shamos M.I. Computational Geometry: An Introduction. 1985;Springer-Verlag.
32. N. Roussopoulos, S. Kelley, F. Vincent, Nearest neighbor queries, in: Proceedings ACM SIGMOD Conference, 1995, pp. 71-79.
33. H. Shin, B. Moon, S. Lee, Adaptive multi-stage distance join processing, in: Proceedings ACM SIGMOD Conference, 2000, pp. 343-354.
34. +-tree: a dynamic index for multidimensional objects, in: Proceedings 13th VLDB Conference, 1987, pp. 507-518.
35. Y. Theodoridis, E. Stefanakis, T. Sellis, Cost models for join queries in spatial databases, in: Proceedings 14th ICDE Conference, 1998, pp. 476-483.