Skip to main content
SpringerLink
Log in

Multi-Way Distance Join Queries in Spatial Databases

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “D_distance-value” of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to the edges of the QG. This paper addresses the problem of finding the K n-tuples between n spatial datasets that have the smallest D_distance-values, the so-called K-multi-way distance join query (K-MWDJQ), where each set is indexed by an R-tree-based structure. This query can be viewed as an extension of K-closest-pairs query (K-CPQ) [8] for n inputs. In addition, a recursive non-incremental branch-and-bound algorithm following a depth-first search for processing synchronously all inputs without producing any intermediate result is proposed. Enhanced pruning techniques are also applied to n R-trees nodes in order to reduce the total response time and the number of distance computations of the query. Due to the exponential nature of the problem, we also propose a time-based approximate version of the recursive algorithm that combines approximation techniques to adjust the quality of the result and the global processing time. Finally, we give a detailed experimental study of the proposed algorithms using real spatial datasets, highlighting their performance and the quality of the approximate results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Berchtold, B. Ertl, D. Keim, H.P. Kriegel, and T Seidl. “Fast nearest neighbor search in high-dimensional spaces,” Proceedings of 14th International Conference on Data Engineering (ICDE'98), 209–218, 1998.

  2. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. “The R*-tree: An efficient and robust access method for points and rectangles,” Proceedings of ACM SIGMOD Conference, 322–331, 1990.

  3. T Brinkhoff, H.P. Kriegel, and B. Seeger. “Efficient processing of spatial joins using R-trees,” Proceedings of ACM SIGMOD Conference, 237–246, 1993.

  4. C. Böhm and F. Krebs. “High performance data mining using the nearest neighbor join,” Proceedings of 2nd International Conference on Data Mining (ICDM'02), 43–50, 2002.

  5. P. Brown. Object-Relational Database Development: A Plumber's Guide. Prentice Hall, Upper Saddle River, NJ, 2001.

    Google Scholar 

  6. A. Corral, J. Canadas, and M. Vassilakopoulos. “Approximate algorithms for distance-based queries in high-dimensional data spaces using R-trees,” Proceedings of 6th Conference on Advances in Databases and Information Systems (ADBIS'02), 163–176, 2002.

  7. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos. “Closest pair queries in spatial databases,” Proceedings of ACM SIGMOD Conference, 189–200, 2000.

  8. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos. “Algorithms for processing K-closest-pair queries in spatial databases,” Data & Knowledge Engineering, Vol. 49(1): 67–104, 2004.

    Google Scholar 

  9. 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/dew.

  10. V. Gaede and O. Gunther. “Multidimensional access methods,” ACM Computing Surveys, Vol. 30(2):170–231, 1998.

    Google Scholar 

  11. A. Guttman. “R-trees: A dynamic index structure for spatial searching,” Proceedings of ACM SIGMOD Conference, 47–57, 1984.

  12. Y.W. Huang, N. Jing, and E.A. Rundensteiner. “Spatial joins using R-trees: Breadth-first traversal with global optimizations,” Proceedings of 23rd VLDB Conference, 396–405, 1997.

  13. G.R. Hjaltason and H. Samet. “Incremental distance join algorithms for spatial databases,” Proceedings of ACM SIGMOD Conference, 237–248, 1998.

  14. G.R. Hjaltason and H. Samet. “Distance browsing in spatial databases,” ACM Transactions on Database Systems, Vol. 24(2):265–318, 1999.

    Google Scholar 

  15. N. Koudas and K.C. Sevcik. “Size separation spatial join,” Proceedings of ACM SIGMOD Conference, 324–335,1997.

  16. N. Koudas and K.C. Sevcik. “High dimensional similarity joins: Algorithms and performance evaluation,” Proceedings of 14th International Conference on Data Engineering (ICDE'98), 466–475, 1998.

  17. R. Laurini and C Thomson. Fundamentals of Spatial Information System. Academic Press, London, 1992.

    Google Scholar 

  18. M.L. Lo and C.V. Ravishankar. “Spatial joins using seeded trees,” Proceedings of ACM SIGMOD Conference, 209–220, 1994.

  19. M.L. Lo and C.V. Ravishankar. “Spatial hash-joins,” Proceedings of ACM SIGMOD Conference, 247–258, 1996.

  20. N. Mamoulis and D. Papadias. “Integration of spatial join algorithms for processing multiple inputs,” Proceedings of ACM SIGMOD Conference, 1–12, 1999.

  21. N. Mamoulis and D. Papadias. “Multiway spatial joins,” ACM Transactions on Database Systems, Vol. 26(4):424–475, 2001.

    Google Scholar 

  22. N. Mamoulis and D. Papadias. “Slot index spatial join,” IEEE Transactions on Knowledge and Data Engineering, Vol. 15(1):211–231, 2003.

    Google Scholar 

  23. Y. Manolopoulos, Y. Theodoridis, and V. Tsotras. Advanced Database Indexing. Kluwer Academic Publishers, Boston, 1999.

    Google Scholar 

  24. Oracle Technology Network: “Oracle Spatial”, an Oracle Technical White Paper, 2001. Downloadable from: http://otn.oracle.com/products/oracle9i/pdf/OracleSpatial.pdf.

  25. J. O'Rourke. Computational Geometry in C. Cambridge University Press, Cambridge, 1998.

    Google Scholar 

  26. D. Papadias and D. Arkoumanis. “Approximate processing of multiway spatial joins in very large databases,” Proceedings of 8th EDBT Conference, 179–196, 2002.

  27. J.M. Patel and D.J. DeWitt. “Partition based spatial-merge join,” Proceedings of ACM SIGMOD Conference, 259–270, 1996.

  28. H.H. Park, G.H. Cha, and C.W. Chung. “Multi-way spatial joins using R-trees: Methodology and performance evaluation,” Proceedings of 6th International Symposium on Spatial Databases (SSD'99), 229–250,1999.

  29. D. Papadias, N. Mamoulis, and Y. Theodoridis. “Processing and optimization of multiway spatial joins using R-trees,” Proceedings of 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'99), 44–55, 1999.

  30. F.P. Preparata and M.I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, 1985.

    Google Scholar 

  31. A. Papadopoulos, P. Rigaux, and M. Scholl. “A performance evaluation of spatial join processing strategies,” Proceedings of 6th Symposium on Large Spatial Databases (SSD'99), 286–307, 1999.

  32. N. Roussopoulos, S. Kelley, and F. Vincent. “Nearest neighbor queries,” Proceedings of ACM SIGMOD Conference, 71–79, 1995.

  33. S. Shekhar, S. Chawla, S. Rivada, A. Fetterer, X. Lui, and C. Lu. “Spatial databases, accomplishments and research needs,” IEEE Transactions on Knowledge and Data Engineering, Vol. 11(1):45–55, 1999.

    Google Scholar 

  34. T. Seidl and H.P. Kriegel. “Optimal multi-step K-nearest neighbor search,” Proceedings of ACM SIGMOD Conference, 154–165, 1998.

  35. Y. Shou, N. Mamoulis, H. Cao, D. Papadias, and D.W. Cheung. “Evaluation of iceberg distance joins,” Proceedings of 8th Symposium on Spatial and Temporal Databases (SSTD'03), 270–288, 2003.

  36. H. Shin, B. Moon, and S. Lee. “Adaptive multi-stage distance join processing,” Proceedings of ACM SIGMOD Conference, 343–354, 2000.

  37. C. Yang and K.I. Lin. “An index structure for improving nearest closest pairs and related join queries in spatial databases,” Proceedings of International Database Engineering and Applications Symposium (IDEAS'02), 140–149, 2002.

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Piraeus, GR-18534, Piraeus, Greece

    Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis & Michael Vassilakopoulos

Authors
  1. Antonio Corral
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yannis Manolopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yannis Theodoridis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michael Vassilakopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Corral, A., Manolopoulos, Y., Theodoridis, Y. et al. Multi-Way Distance Join Queries in Spatial Databases. GeoInformatica 8, 373–402 (2004). https://doi.org/10.1023/B:GEIN.0000040832.25622.8d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:GEIN.0000040832.25622.8d

Search

Navigation