Optimization of spatial joins using filters

  • Hein M. Veenhof
  • Peter M. G. Apers
  • Maurice A. W. Houtsma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 940)


When viewing present-day technical applications that rely on the use of database systems, one notices that new techniques must be integrated in database management systems to be able to support these applications efficiently. This paper discusses one of these techniques in the context of supporting a Geographic Information System. It is known that the use of filters on geometric objects has a significant impact on the processing of 2-way spatial join queries. For this purpose, filters require approximations of objects. Queries can be optimized by filtering data not with just one but with several filters. Existing join methods are based on a combination of filters and a spatial index. The index is used to reduce the cost of the filter step and to minimize the cost of retrieving geometric objects from disk.

In this paper we examine n-way spatial joins. Complex n-way spatial join queries require solving several 2-way joins of intermediate results. In this case, not only the profit gained from using both filters and spatial indices but also the additional cost due to using these techniques are examined. For 2-way joins of base relations these costs are considered part of physical database design. We focus on the criteria for mutually comparing filters and not on those for spatial indices. Important aspects of a multi-step filter-based n-way spatial join method are described together with performance experiments. The winning join method uses several filters with approximations that are constructed by rotating two parallel lines around the object.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bradford, C.B., Dobkin, D.P., Huhdanpaa, H.: The Quickhull Algorithm for Convex Hull. Technical Report GCG53, The Geometry Center, University of Minnesota, Minneapolis, USA, July 30, 1993.Google Scholar
  2. 2.
    Brinkhoff, T., Kriegel, H-.P., Seeger, B.: Efficient Processing of Spatial Joins Using R-trees. Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington, D.C., USA, 1993.Google Scholar
  3. 3.
    Brinkhoff, T., Kriegel, H-.P., Schneider, R.: Comparison of Approximations of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems. Proc. 9th Int. Conf. on Data Engineering, Vienna, Austria, 1993.Google Scholar
  4. 4.
    Brinkhoff, T., Kriegel, H-.P., Schneider, R., Seeger, B.: Multi-Step Processing of Spatial Joins. Proc. ACM SIGMOD Int. Conf. on Management of Data, Minneapolis, Minnesota, USA, 1994.Google Scholar
  5. 5.
    Ceri, S., Pelagatti, G.: Distributed databases. McGrawHill, 1984.Google Scholar
  6. 6.
    Dori, D., Ben-Bassat, M.: Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition. Computer Vision, Graphics and Image Processing, 24(1983):131–159, 1983.Google Scholar
  7. 7.
    Frank, A.U.: Properties of Geographic Data: Requirements for Spatial Access Methods. Proc. Advances in Spatial Databases, SSD'91, Zürich, Switzerland, 1991.Google Scholar
  8. 8.
    Guttman, A.: R-trees: A dynamic index structure for spatial searching. Proc. ACM SIGMOD Int. Conf. on Management of Data, Boston, Massachusetts, USA, 1984.Google Scholar
  9. 9.
    Jagadish, H.V.: Spatial search with Polyhedra. Proc. 6th. Int Conf. on Data Engineering, Los Angeles, California, USA, 1990.Google Scholar
  10. 10.
    Jarke, M., Koch, J.: Query optimization in database systems. Computing Surveys, 16(2):111–152, June 1984.Google Scholar
  11. 11.
    Laurini, R., Thompson, D.: Fundamentals of spatial information systems. Academic Press, 1992.Google Scholar
  12. 12.
    Näher, S.: LEDA User Manual, version 3.0. Max-Planck-Institut für Informatik, Saarbrücken, Germany.Google Scholar
  13. 13.
    Lo, M.L., Ravishankar C.V.: Spatial joins using seeded trees. Proc. ACM SIGMOD Int. Conf. on Management of Data, Mineapolis, Minnesota, USA, 1994.Google Scholar
  14. 14.
    Lu, H., Ooi, B.: Spatial Indexing: Past and Future. Data Engineering Bulletin, 16(3):16–21, Sept 1993.Google Scholar
  15. 15.
    Orenstein, J.A.: Redundancy in spatial databases. Proc. ACM SIGMOD Int. Conf. on Management of Data, Portland, Oregon, USA, 1989.Google Scholar
  16. 16.
    Oosterom, van P., Claassen, E.: Orientation insensitive indexing methods for Geometric Objects, 4th Int. Symp. on Spatial Data Handling, Zürich, Switzerland, July 1990.Google Scholar
  17. 17.
    Preparata, F.P., Shamos, M.I.: Computational Geometry; an introduction. Springer-Verlag, 1985.Google Scholar
  18. 18.
    Samet, H.: Spatial Data Structures. To appear in Database Challenges in the 1990's, W. Kim, ed., Addison Wesley/ACM Press, Reading, MA, USA, 1994.Google Scholar
  19. 19.
    Seeger, B., Kriegel, H.-P.: Techniques for Design and Implementation of Efficient Spatial Access Methods. Proc. 14th Int. Conf. on Very Large Data Bases, Los Angeles, California, USA, 1988.Google Scholar
  20. 20.
    Skyum, S.: A simple algorithm for computing the smallest enclosing circle. Information Processing Letters, 37(1991):121–125, February 1991.Google Scholar
  21. 21.
    Welzl, E.: Smallest Enclosing Disks (Balls and Ellipsoids). Paper B91-09, Freie University of Berlin, 1991.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Hein M. Veenhof
    • 1
  • Peter M. G. Apers
    • 1
  • Maurice A. W. Houtsma
    • 2
  1. 1.University of TwenteAE Enschedethe Netherlands
  2. 2.Telematics Research CentreAE Enschedethe Netherlands

Personalised recommendations