Skip to main content
SpringerLink
Log in

Approximate Processing of Multiway Spatial Joins in Very Large Databases

  • Conference paper
  • First Online:
Advances in Database Technology — EDBT 2002 (EDBT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2287))

Included in the following conference series:

Abstract

Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however, exhaustive processing of multiway spatial joins can be prohibitively expensive due to the exponential nature of the problem. Furthermore, if there do not exist any exact solutions, the result will be empty even though there may exist solutions that match the query very closely. These shortcomings motivate the current work, which aims at the retrieval of the best possible (exact or approximate) solutions within a time threshold, since fast retrieval of approximate matches is the only way to deal with the ever increasing amounts of multimedia information in several real time systems. We propose various techniques that combine local and evolutionary search with underlying indexes to prune the search space. In addition to their usefulness as standalone methods for approximate query processing, the techniques can be combined with systematic search to enhance performance when the goal is retrieval of the best solutions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brinkhoff, T., Kriegel, H., Seeger B. Efficient Processing of Spatial Joins Using R-trees. ACM SIGMOD, 1993.

    Google Scholar 

  2. Beckmann, N., Kriegel, H. Schneider, R., Seeger, B. The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. ACM SIGMOD, 1990.

    Google Scholar 

  3. Blickle, T., Thiele, L. A Comparison of Selection Schemes used in Genetic Algorithms. TIK-Report No. 11, ETH, Zurich, 1996.

    Google Scholar 

  4. Crawford, J., Auton, L. Experimental Results on the Crossover Point in Satisfiability Problems. AAAI, 1993.

    Google Scholar 

  5. Clark, D., Frank, J., Gent, I., MacIntyre, E., Tomov, N., Walsh, T. Local Search and the Number of Solutions. Constraint Programming, 1998.

    Google Scholar 

  6. Chang, S, Shi, Q., Yan C. Iconic Indexing by 2-D String. IEEE PAMI 9(3), 413–428, 1987.

    Google Scholar 

  7. Dechter R., Meiri I. Experimental Evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence, 68: 211–241, 1994.

    Article  MATH  Google Scholar 

  8. Davenport, A., Tsang, E., Wang, C., Zhu, K. GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement. AAAI, 1994.

    Google Scholar 

  9. Guttman, A. R-trees: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD, 1984.

    Google Scholar 

  10. Grefenstette, J. Optimization of Control Parameters for Genetic Algorithms. IEEE Trans. on Systems, Man and Cybernetics, 16 (1), 1986.

    Google Scholar 

  11. Goldberg, D. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, Mass., 1989.

    MATH  Google Scholar 

  12. Glover F., Laguna, M. Tabu Search. Kluwer, London, 1997.

    Google Scholar 

  13. Holland, J. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan, 1975.

    Google Scholar 

  14. Lee, S, Hsu, F. Spatial Reasoning and Similarity Retrieval of Images using 2D C-Strings Knowledge Representation. Pattern Recognition, 25(3), 305–318, 1992.

    Article  MathSciNet  Google Scholar 

  15. Lee, S, Yang, M, Chen, J. Signature File as a Spatial Filter for Iconic Image Database. Journal of Visual Languages and Computing, 3, 373–397, 1992.

    Article  Google Scholar 

  16. Minton, S. Johnston, M., Philips, A., Laird P. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence 58(1–3), 161–205, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  17. Mamoulis, N, Papadias, D., Integration of Spatial Join Algorithms for Processing Multiple Inputs. ACM SIGMOD, 1999.

    Google Scholar 

  18. Papadias, D., Arkoumanis D. Search Algorithms for Multiway Spatial Joins. To appear in the International Journal of Geographic Information Science (IJGIS). Available at: http://www.cs.ust.hk/~dimitris/

  19. Petrakis, E., Faloutsos, C. Similarity Searching in Medical Image Databases. IEEE TKDE, 9 (3) 435–447, 1997.

    Google Scholar 

  20. Park, H-H., Lee, J-Y., Chung, C-W. Spatial Query Optimization Utilizing Early Separated Filter and Refinement Strategy. Information Systems 25(1): 1–22, 2000.

    Article  MATH  Google Scholar 

  21. Papadias, D., Mantzourogiannis, M., Kalnis, P., Mamoulis, N., Ahmad, I. Content-Based Retrieval Using Heuristic Search. ACM SIGIR, 1999.

    Google Scholar 

  22. Papadias, D., Mamoulis, N., Theodoridis, Y. Processing and Optimization of Multiway Spatial Joins Using R-trees. ACM PODS, 1999.

    Google Scholar 

  23. Theodoridis, Y., Stefanakis, E., Sellis, T., Cost Models for Join Queries in Spatial Databases, ICDE, 1998.

    Google Scholar 

  24. Zhu, H, Su, J, Ibarra, O. On Multi-way Spatial Joins with Direction Predicates. SSTD, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

    Dimitris Papadias

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

    Dinos Arkoumanis

Authors
  1. Dimitris Papadias
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dinos Arkoumanis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Aalborg University, Aalborg

    Christian S. Jensen  & Simonas Šaltenis  & 

  2. Business and Information Technology Dept., CLRC Rutherford Appleton Laboratory, UK

    Keith G. Jeffery

  3. Faculty of Mathematics and Physics, Charles University, Czech Republic

    Jaroslav Pokorny

  4. Department of Information Science, University of Milan, Milan

    Elisa Bertino

  5. Institute of Information Systems, ETH Zurich, Zurich

    Klemens Böhn

  6. Informatik V, RWTH Aachen, Aachen

    Matthias Jarke

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadias, D., Arkoumanis, D. (2002). Approximate Processing of Multiway Spatial Joins in Very Large Databases. In: Jensen, C.S., et al. Advances in Database Technology — EDBT 2002. EDBT 2002. Lecture Notes in Computer Science, vol 2287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45876-X_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45876-X_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43324-8

  • Online ISBN: 978-3-540-45876-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation