Skip to main content
SpringerLink
Log in

Complex Spatial Query Processing

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

The user of a Geographical Information System is not limited to conventional spatial selections and joins, but may also pose more complicated and descriptive queries. In this paper, we focus on the efficient processing and optimization of complex spatial queries that involve combinations of spatial selections and joins. Our contribution is manifold; we first provide formulae that accurately estimate the selectivity of such queries. These formulae, paired with cost models for selections and joins can be used to combine spatial operators in an optimal way. Second, we propose algorithms that process spatial joins and selections simultaneously and are typically more efficient than combinations of simple operators. Finally we study the problem of optimizing complex spatial queries using these operators, by providing (i) cost models, and (ii) rules that reduce the optimization space significantly. The accuracy of the selectivity models and the efficiency of the proposed algorithms are evaluated through experimentation.

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. A. Aboulnaga and J.F. Naughton. “Accurate estimation of the cost of spatial selections,” International Conference on Data Engineering, 123–134, February-March 2000.

  2. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J.S. Vitter. “Scalable sweeping-based spatial join,” VLDB Conference, 570–581, August 1998.

  3. S. Achaya, V. Poosala, and S. Ramaswamy. “Selectivity estimation in spatial databases,” ACM SIGMOD International Conference on Management of Data, 13–24, June 1999.

  4. A. Belussi and C. Faloutsos. “Estimating the selectivity of spatial queries using the correlation fractal dimension,” VLDB Conference, 299–310, September 1995.

  5. T. Brinkhoff, H.P. Kriegel, and B. Seeger. “Efficient processing of spatial joins using R-trees,” ACM SIGMOD International Conference on Management of Data, 237–246, May 1993.

  6. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. “The R*-tree: An efficient and robust access method for points and rectangles,” ACM SIGMOD International Conference on Management of Data, 322, 331, May 1990.

    Google Scholar 

  7. C. Faloutsos, B. Seeger, A. Traina, and C. Traina. “Spatial join selectivity using power laws,” ACM SIGMOD International Conference on Management of Data, 177–188, May 2000.

  8. V. Gaede and O. Gunther. “Multidimensional access methods,” ACM Computing Surveys, Vol. 30(2):123–169, 1998.

    Google Scholar 

  9. A. Guttman. “R-trees: A dynamic index structure for spatial searching,” ACM SIGMOD International Conference on Management of Data, 47–57, June 1984.

  10. R.H. Gifting. “An introduction to spatial database systems,” VLDB Journal, Vol. 3(4):357–399, 1994.

    Google Scholar 

  11. G. Graefe. “Query evaluation techniques for large databases,” ACM Computing Surveys, Vol. 25(2):73–170, 1993.

    Google Scholar 

  12. R. Haralick and G. Elliott. “Increasing tree search efficiency for constraint satisfaction problems,” Artificial Intelligence, Vol. 14:263–313, 1980.

    Google Scholar 

  13. Y. Ioannidis and S. Christodoulakis. “On the propagation of errors in the size of join results,” ACM SIGMOD International Conference on Management of Data, 268–277, May 1991.

  14. Y. Ioannidis and Y. Kang. “Randomized algorithms for optimizing large join queries,” ACM SIGMOD International Conference on Management of Data, 312–321, May 1990.

  15. I. Kamel and C. Faloutsos. “On packing R-trees,” ACM International Conference on Information and Knowledge Management, 490–499, November 1993.

  16. N. Koudas and K. Sevcik. “Size separation spatial join,” ACM SIGMOD International Conference on Management of Data, 324–335, May 1997.

  17. M.L. Lo and C.V. Ravishankar. “Spatial hash-joins,” ACM SIGMOD International Conference on Management of Data, 247–258, June 1996.

  18. M.L. Lo and C.V. Ravishankar. “The design and implementation of seeded trees: An efficient method for spatial joins,” IEEE Transactions on Knowledge and Data Engineering, Vol. 10(1):136–151, 1998.

    Google Scholar 

  19. A. Mackworth. “Consistency in networks of relations,” Artificial Intelligence, Vol. 8, 1977.

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

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

    Google Scholar 

  22. H. Park, G. Cha, and C. Chung. “Multiway spatial joins using R-trees: Methodology and performance evaluation,” Symposium on Large Spatial Databases (SSD), 229–250, July 1999.

  23. J.M. Patel and D.J. DeWitt. “Partition based spatial-merge join,” ACM SIGMOD International Conference on Management of Data, 259–270, June 1996.

  24. D. Papadias, N. Mamoulis, and V. Delis. “Approximate spatio-temporal retrieval,” ACM Transactions on Information Systems (TOTS), Vol. 19(1):53–96, January 2001.

    Google Scholar 

  25. D. Papadias, N. Mamoulis, and Y. Theodoridis. “Processing and optimization of multiway spatial joins using R-trees,” ACM Symposium on Principles of Database Systems (PODS), 44–55, July 1999.

  26. V. Poosala. Histogram-Based Estimation Techniques in Databases. Ph.D. Thesis, University of Wisconsin-Madison, 1997.

  27. F. Preparata and M. Shamos. Computational Geometry. Springer, 1985.

  28. B. Pagel, H. Six, H. Toben, and P Widmayer. “Towards an analysis of range query performance in spatial data structures,” ACM Symposium on Principles of Database Systems (PODS), 214–221, May 1993.

  29. A. Silberschatz, H.F. Korth, and S. Sudarshan. Database System Concepts. Fourth edition, McGraw-Hill, 2002.

  30. Transaction Processing Performance Council, 30 Benchmark R (Decision Support), Rev. 1.0.1, http:// www.30.org/, 1993–1998.

  31. Y. Theodoridis and T. Sellis. “A model for the prediction of R-tree performance,” ACM Symposium on Principles of Database Systems (PODS), 161–171, June 1996.

  32. Y. Theodoridis, E. Stefanakis, and T. Sellis. “Cost models for join queries in spatial databases,” International Conference on Data Engineering, 476–483, February 1998.

  33. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, London and San Diego, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Systems, University of Hong Kong, Pokfulam Road, Hong Kong

    Nikos Mamoulis & Dimitris Papadias

  2. Department of Electrical and Computer Engineering, National Technical University of Athens, Zographou, 15773, Greece

    Dinos Arkoumanis

Authors
  1. Nikos Mamoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitris Papadias
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dinos Arkoumanis
    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

Mamoulis, N., Papadias, D. & Arkoumanis, D. Complex Spatial Query Processing. GeoInformatica 8, 311–346 (2004). https://doi.org/10.1023/B:GEIN.0000040830.73424.f0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:GEIN.0000040830.73424.f0

Search

Navigation