Skip to main content

Estimating the Overlapping Area of Polygon Join

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3633))

Abstract

Traditional query processing provides exact answers to queries trying to maximize throughput while minimizing response time. However, in many applications the response time of exact answers is often longer than what is acceptable. Approximate query processing has emerged as an alternative approach to give to the user an answer in a shorter time than the traditional approach. The goal is to provide an estimated result very close to the exact answer, along with a confidence interval, in a short time. There is a large set of techniques for approximate query processing available in different research areas. However most of them are only suitable for traditional data. This work is concerned with approximate query processing in spatial databases. We propose a new algorithm to estimate the overlapping area of polygon join using raster signatures. We executed experimental tests over real world data sets, and the results demonstrated our approach effectiveness.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Das, A., Gehrke, J., Riedwald, M.: Approximation Techniques for Spatial Data. In: Proc. of ACM-SIGMOD Conference, Paris, France, pp. 695–706 (2004)

    Google Scholar 

  2. Dobra, A., Garofalakis, M., Gehrke, J.E., Rastogi, R.: Processing complex aggregate queries over data streams. In: Proc. of SIGMOD, pp. 61–72 (2002)

    Google Scholar 

  3. Faloutsos, C., Jagadish, H.V., Sidiropoulos, N.D.: Recovering information from summary data. In: Proc. of 23rd Int. Conf. on Very Large Data Bases, Athens, Greece, pp. 36–45 (1997)

    Google Scholar 

  4. Barbara, D., DuMouchel, W., Faloutsos, C., Hass, P., Hellerstein, J.M., Ioannidis, Y., Jagadish, H., Johnson, T., Ng, R., Poosala, V., Ross, K., Sevcik, K.: The New Jersey data reduction report. Bulletin of the Technical Committee on Data Engineering. IEEE Data Engineering Bulletin 20(4), 3–45 (1997)

    Google Scholar 

  5. Heuvelink, G.: Error Propagation in Environmental Modeling with GIS. Taylor & Francis, London (1998)

    Google Scholar 

  6. Zimbrao, G., Souza, J.M.: A Raster Approximation for Processing of Spatial Joins. In: Proc. of the 24th VLDB Conference, pp. 558–569. New York City, New York (1998)

    Google Scholar 

  7. Larson, H.J.: Introduction to probability theory and statistical inference. John Wiley & Sons, Chichester (1982)

    MATH  Google Scholar 

  8. Jagadish, H.V., Mumick, I.S., Silberschatz, A.: View maintenance issues in the chronicle data model. In: Proc. ACM PODS, San Jose, CA, pp. 113–124 (1995)

    Google Scholar 

  9. Zhu, H., Su, J., Ibarra, O.H.: Toward Spatial Joins for Polygons. In: Proc. Int. Conf. of SSDBM, Berlin, Germany, pp. 231–244 (2000)

    Google Scholar 

  10. IBGE (Brazilian Institute of Geography and Statistics): Malha Municipal Digital do Brasil, Rio de Janeiro, Brasil (1994)

    Google Scholar 

  11. Orenstein, J.A.: Spatial query processing in an object-oriented database system. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, Washington, DC, pp. 326–336 (1986)

    Google Scholar 

  12. Han, J., Kamber, M.: Data Mining: concepts and techniques. Academic Press, London (2001)

    Google Scholar 

  13. Hellerstein, J.M., Haas, P.J., Wang, H.J.: Online aggregation. In: Proc. of ACM SIGMOD Int. Conf on Management of Data, Tucson, Arizona, pp. 171–182 (1997)

    Google Scholar 

  14. Costa, J.P., Furtado, P.: Time-Stratified Sampling for Approximate Answers to Aggregate Queries. In: Proc. of Int. Conf. on Database Systems for Advanced Applications, Kyoto, Japan, pp. 215–222 (2003)

    Google Scholar 

  15. Roddick, J., Egenhofer, M., Hoel, E., Papadias, D., Salzberg, B.: Spatial, Temporal and Spatiotemporal Databases Hot Issues and Directions for PhD Research. SIGMOD Record 33(2), 126–131 (2004)

    Article  Google Scholar 

  16. Zhang, J., Goodchild, M.: Uncertainty in Geographical Information System. Taylor & Francis, Erewhon (2002)

    Book  Google Scholar 

  17. Azevedo, L.G., Monteiro, R.S., Zimbrao, G., Souza, J.M.: Approximate Spatial Query Processing Using Raster Signatures. In: Proc. of VI Brazilian Symposium on GeoInformatics, Campos do Jordao, Brazil (2004)

    Google Scholar 

  18. Lo, M.L., Ravishankar, C.V.: Spatial Hash-Joins. In: Proc. of the ACM-SIGMOD Conference, Montreal, Canada, pp. 247–258 (1996)

    Google Scholar 

  19. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, pp. 322–331. Atlantic City, NJ (1990)

    Google Scholar 

  20. Gibbons, P.B., Matias, Y., Poosala, V.: Aqua project white paper. Technical report, Bell Laboratories, Murray Hill, NJ (1997)

    Google Scholar 

  21. Furtado, P., Costa, J.P.: Time-Interval Sampling for Improved Estimations in Data Warehouses. In: Proc. of 4th Int. Conf. on Data Warehousing and Knowledge Discovery, Aix-en-Provence, France, pp. 327–338 (2002)

    Google Scholar 

  22. Steel, R.G.D., Torrie, J.H.: Introduction to statistics. McGraw-Hill Book Company, New York (1976)

    MATH  Google Scholar 

  23. Güting, R.H., de Ridder, T., Schneider, M.: Implementation of the ROSE Algebra: Efficient Algorithms for Realm-Based Spatial Data Types. In: Proc. of the 4th Int. Symposium on Large Spatial Databases, Portland, Maine, pp. 216–239 (1995)

    Google Scholar 

  24. Kothuri, R.K., Ravada, S.: Efficient Processing of Large Spatial Queries Using Interior Approximations. In: Proc. of the Int. Symposium on Spatial and Temporal Databases, Los Angeles, CA, pp. 404–424 (2001)

    Google Scholar 

  25. Madria, S.K., Mohania, M.K., Roddick, J.F.: A Query Processing Model for Mobile Computing using Concept Hierarchies and Summary Databases. In: Proc. of Int. Conference of Foundations of Data Organization, Kobe, Japan, pp. 147–157 (1998)

    Google Scholar 

  26. Brinkhoff, T., Kriegel, H.P., Schneider, R., Seeger, B.: Multi-step Processing of Spatial Joins. In: Proc. of ACM-SIGMOD Int. Conference on Management of Data, Minneapolis, MN, pp. 197–208 (1994)

    Google Scholar 

  27. Brinkhoff, T., Kriegel, H.P., Schneider, R.: Comparison of Approximations of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems. In: Procs. of Int. Conf. on Data Engineering, Vienna, Austria, pp. 40–49 (1993)

    Google Scholar 

  28. Brinkhoff, T., Kriegel, H.P., Schneider, R., Braun, A.: Measuring the Complexity of Polygonal Objects. In: Proc. of ACM Int. Workshop on Advances in Geographic Information Systems, Baltimore, MD, pp. 109–118 (1995)

    Google Scholar 

  29. Ioannidis, Y.E., Poosala, V.: Balancing histogram optimality and practicality for query result size estimation. In: ACM SIGMOD, pp. 233–244 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Azevedo, L.G., Zimbrão, G., de Souza, J.M., Güting, R.H. (2005). Estimating the Overlapping Area of Polygon Join. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds) Advances in Spatial and Temporal Databases. SSTD 2005. Lecture Notes in Computer Science, vol 3633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535331_6

Download citation

  • DOI: https://doi.org/10.1007/11535331_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28127-6

  • Online ISBN: 978-3-540-31904-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics