Advertisement

GeoInformatica

, Volume 7, Issue 4, pp 315–336 | Cite as

Polyline Spatial Join Evaluation Using Raster Approximation

  • Leonardo Guerreiro Azevedo
  • Rodrigo Salvador Monteiro
  • Geraldo zimbrão
  • Jano Moreira de Souza
Article

Abstract

The main subject of spatial joins is polygons and polylines. Typical polygons and polylines can occupy several Kbytes. Since approximations use much less space, the processing of spatial joins can be greatly improved by the use of filters that reduce the need for examining the exact geometry of spatial objects in order to find the intersecting ones. Candidate pairs of approximations of spatial objects are evaluated using such filters. As a result, three possible sets of answers are identified: the positive one, composed of intersecting pairs; the negative one, composed of non-intersecting pairs; and the inconclusive one, composed of the remaining pairs of candidates. There are many approximations designed for polygons, but few are suitable for approximating polylines. This paper presents a spatial join processor based on the multi step query processor (MSQP) architecture [24]. We have developed a new polyline approximation, named five color direction raster signature (5CDRS) [18]. It is used as the filter of MSQP’s second step. The performance of the join processor and the approximation was evaluated with real world data sets. The results showed that our approach, when compared to others presented in the literature, reduced the inconclusive answers by 29% in the average. Consequently, the need for retrieving the representation of polylines and carrying out exact geometry tests is reduced by the same factor. As the exact geometry test is the most time consuming step, we have noticed that the overall time is also reduced by 38% in the average. The disk accesses are reduced by 41% in the average.

spatial join raster approximations geometric filters spatial databases 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. Esperança and H. Samet. “Orthogonal polygons as bounding structures in filter-refine query processing strategies,” in Proceedings of the 5th International Symposium on Spatial Databases, Berlin, Germany, 197–220, June 1997.Google Scholar
  2. 2.
    G. Zimbrão and J.M. Souza. “A raster approximation for processing of spatial joins,” in Proceedings of VLDB'98—24th International Conference on Very Large Databases, New York City, NY, USA, 558–569, August 1998.Google Scholar
  3. 3.
    H.M. Veenhof, P.M.G. Apers, and M.A.W. Houtsma. “Optimization of spatial joins using filters,” in Advances in Databases, 13th British National Conference on Databases, BNCOD 13, Manchester, United Kingdom, 136–154, July 1995.Google Scholar
  4. 4.
    H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley Publishing Company: NYC, USA, 1990.Google Scholar
  5. 5.
    J.M. Patel and D. DeWitt. “Partition based spatial-merge join,” in Proceedings of the 1996 ACM-SIGMOD Conference, Montreal, Canada, 259–270, June 1996.Google Scholar
  6. 6.
    L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. Vitter. “Scalable sweeping based spatial join,” in 24th International Conference on Very Large Databases, New York City, NY, USA, 570–581, August 1998.Google Scholar
  7. 7.
    L.G. Azevedo. Filtros Raster para juncções de Polilinhas. COPPE/UFRJ, Brasil, Rio de Janeiro, Rio de Janeiro, 2001.Google Scholar
  8. 8.
    E. McCreight, “Pagination of B*-trees with variable-length records,” Commun. ACM, Vol. 20(9): 670–674, (Sept. 1977).Google Scholar
  9. 9.
    MELP Spatial Archive and Interchange Format (SAIF): Formal Definition Release 3.1 April 1994 Reference Series Volume 1—Surveys and Resource Mapping Branch—Ministry of Environment, Lands and Parks (MELP)—Province of British Columbia—Canada.Google Scholar
  10. 10.
    M.L. Lo and C.V. Ravishankar: “Generating seeded trees from data sets,” in Proceedings of 4th International Symposium on Large Spatial Databases, Portland, ME, USA, 328–347, August 1995.Google Scholar
  11. 11.
    M.L. Lo and C.V. Ravishankar. “Spatial hash-joins,” in Proceedings of the 1996 ACM-SIGMOD Conference, Montreal, Canada, 247–258, June 1996.Google Scholar
  12. 12.
    N. Koudas and K. Sevcik. “Size separation spatial join,” in Proc. of ACM SIGMOD Intl. Conference on Management of Data, Tucson, Arizona, USA, 324–335, May 1997.Google Scholar
  13. 13.
    N. Mamoulis and D. Papadias. “Integration of spatial join algorithms for joining multiple inputs,” in Proceedings of the ACM Conference on the Management of Data, Philadelphia, PA, USA, 1–12, May 1999.Google Scholar
  14. 14.
    O. Günther. “Efficient computation of spatial joins,” in Proceedings of 9th International Conference on Data Engineering, Vienna, Austria, 1993.Google Scholar
  15. 15.
    R.K.V. Kothuri, S. Ravada, and D. Abugov. “Quadtree and R-tree indexes in oracle spatial: A comparison using GIS data,” in Proceedings of the 2002 ACM-SIGMOD Conference, Wisconsin, USA, 546–557, June 2002.Google Scholar
  16. 16.
    R. Schneider and H.P. Kriegel. “The TR*-Tree: A new representation of polygonal objects supported spatial queries and operations,” in Proc. 7th Workshop on Computational Geometry, Bern, Switzerland, 249–264, vol. 553, Lecture Notes in Computer Science, Springer 1991.Google Scholar
  17. 17.
    R.S. Monteiro. Junções de polígonos e polilinhas com o uso de filtros raster. COPPE/UFRJ, Brasil, Rio de Janeiro, Rio de Janeiro, 2001.Google Scholar
  18. 18.
    R.S. Monteiro, L.G. Azevedo, G. Zimbrão, and J.M. Souza. Polyline Join Evaluation Using Raster Approximation, Technical Report ES-550/01, Computer Science Department, Graduate School of Engineering, Federal University of Rio de Janeiro, 2001.Google Scholar
  19. 19.
    S. Berchtold, D.A. Keim, and H.P. Kriegel. “The X-Tree: An index structure for high-dimensional data,” in Proceedings of 22nd International Conference on Very Large DataBases, Bombay, India, 28–39, 1996.Google Scholar
  20. 20.
    T. Brinkhoff, H.P. Kriegel, and B. Seeger. “Efficient processing of spatial joins using R-Trees,” in Proceedings of the 1993 ACM-SIGMOD Conference, Washington, DC, USA, 237–246, May 1993.Google Scholar
  21. 21.
    T. Brinkhoff, H.P. Kriegel, and B. Seeger. “Parallel processing of spatial joins using R-trees,” in Proceedings of 12th International Conference on Data Engineering, New Orleans, LA, USA, 258–265, 1996.Google Scholar
  22. 22.
    T. Brinkhoff, H.P. Kriegel, and R. Schneider. “Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems,” in Proceedings of 9th International Conference on Data Engineering, Vienna, Austria, 40–49, 1993.Google Scholar
  23. 23.
    T. Brinkhoff, H.P. Kriegel, R. Schneider, and A. Braun. “Measuring the complexity of polygonal objects,” in Proceedings of ACM International Workshop on Advances in Geographic Information Systems, Baltimore, MD, USA, 109–118, December 1995.Google Scholar
  24. 24.
    T. Brinkhoff, H.P. Kriegel, R. Schneider, and B. Seeger. “Multi-step processing of spatial joins,” in Proceedings of the 1994 ACM-SIGMOD Conference, Minneapolis, USA, 197–208, May 1994.Google Scholar
  25. 25.
    W.M. Badawy and W.G. Aref. “On local heuristics to speed up polygon-polygon intersection tests,” in Proceedings of the 7th International Symposium on Advances in Geographic Information Systems, Kansas City, USA, 97–102, November 2–6, 1999.Google Scholar
  26. 26.
    X3H2–95–084/DBL:YOW-004, (ISO-ANSI Working Draft) Database Language SQL (SQL3), Jim Melton (ed.), March, 1995.Google Scholar
  27. 27.
    Y. Huang, M. Jones, and E. Rundensteiner. “Improving spatial intersect joins using symbolic intersect detection,” in Proceedings of the 5th International Symposium on Advances in Spatial Databases, Berlin, Germany, 165–177, July 1997.Google Scholar
  28. 28.
    Y.-W. Huang and N. Jing. “Spatial joins using R-Trees: Breadth-first traversal with global optimizations,” Proceedings of the 23rd VLDB Conference, Athens, Greece, 1997.Google Scholar
  29. 29.
    (Brazilian Institute of Geography and Statistics) Fundacção Instituto Brasileiro de Geografia e Estatística—IBGE: “Malha Municipal Digital do Brasil—1994”, Rio de Janeiro, 1996.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Leonardo Guerreiro Azevedo
    • 1
  • Rodrigo Salvador Monteiro
    • 1
  • Geraldo zimbrão
    • 1
  • Jano Moreira de Souza
    • 1
  1. 1.Computer Science Department, Graduate School of EngineeringFederal University of Rio de JaneiroRio de JaneiroBrazil

Personalised recommendations