Skip to main content
SpringerLink
Log in

Efficient Window Block Retrieval in Quadtree-Based Spatial Databases

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving all of the quadtree blocks in the underlying spatial database that cover the quadtree blocks that comprise the window. It works by decomposing the window operation into sub-operations over smaller window partitions. These partitions are the quadtree blocks corresponding to the window. Although a block b in the underlying spatial database may cover several of the smaller window partitions, b is only retrieved once rather than multiple times. This is achieved by using an auxiliary main memory data structure called the active border which requires O(n) additional storage for a window query of size n×n. As a result, the algorithm generates an optimal number of disk I/O requests to answer a window query (i.e., one request per covering quadtree block). A proof of correctness and an analysis of the algorithm's execution time and space requirements are given, as are some experimental results.

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.

Similar content being viewed by others

References

  1. A. Aboulnaga. An algorithm and a cost model for window queries in spatial databases. Master's thesis, Department of Computer Science and Automatic Control, Alexandria University, Alexandria, Egypt, 1996.

    Google Scholar 

  2. W.G. Aref and H. Samet. Uniquely reporting spatial objects: yet another operation for comparing spatial data structures. In Proceedings of the Fifth International Symposium on Spatial Data Handling, pages 178–189, Charleston, South Carolina, August 1992.

  3. W.G. Aref and H. Samet. Decomposing a window into maximal quadtree blocks. Acta Informatica, 30:425–439, 1993 (also University of Maryland Computer Science TR-2771).

    Google Scholar 

  4. W.G. Aref and H. Samet. Hashing by proximity to process duplicates in spatial databases. In Proceedings of the Third International Conference on Information and Knowledge Management, pages 347–354, Gaithersburg, Maryland, December 1994. ACM Press.

  5. W.G. Aref and H. Samet. Multidimensional window retrieval in large spatial databases Technical Report CS-TR-3716, UMIACS-TR-96-86, The University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, MD, November 1996.

    Google Scholar 

  6. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proceedings of the SIGMOD Conference, pages 322–331, Atlantic City, NJ, June 1990.

  7. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121–137, June 1979.

    Google Scholar 

  8. C.R. Dyer. The space efficiency of quadtrees. Computer Graphics and Image Processing, 19(4):335–348, August 1982.

    Google Scholar 

  9. M.J. Egenhofer and J.R. Herring, editors. Advances in Spatial Databases—Fourth International Symposium, SSD'95. Springer-Verlag, Berlin, 1995. (also Lecture Notes in Computer Science 951).

    Google Scholar 

  10. R. Elmasri and S.B. Navathe. Fundamentals of Database Systems. Benjamin Cummings, Redwood City, CA, 1989.

    Google Scholar 

  11. C. Faloutsos. Analytical results on the quadtree decomposition of arbitrary rectangles. Department of Computer Science UMIACS-TR-89-115/CS-TR-2354, University of Maryland, College Park, MD, November 1989.

    Google Scholar 

  12. W.R. Franklin. Adaptive grids for geometric operations. Cartographica, 21(2&3):160–167, Summer & Autumn 1984.

    Google Scholar 

  13. M. Freeston. The BANG file: a new kind of gird file. In Proceedings of the SIGMOD Conference, pages 260–269, San Francisco, May 1987.

  14. I. Gargantini. An effective way to represent quadtrees. Communications of the ACM, 25(12):905–910, December 1982.

    Google Scholar 

  15. O. Günther. Efficient structures for geometric data management. PhD thesis, University of California at Berkeley, Berkeley, CA, 1987. (Lecture Notes in Computer Science 337, Springer-Verlag, Berlin, 1988).

    Google Scholar 

  16. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proceedings of the SIGMOD Conference, pages 47–57, Boston, MA, June 1984.

  17. A. Henrich, H.W. Six, and P. Widmayer. The LSD tree: spatial access to multidimensional point and nonpoint data. In P.M.G. Apers and G. Wiederhold, editors, Proceedings of the Fifteenth International Conference on Very Large Data Bases (VLDB), pages 45–53, Amsterdam, August 1989.

  18. R.C. Nelson and H. Samet. A consistent hierarchical representation for vector data. Computer Graphics, 20(4):197–206, August 1986. (also Proceedings of the SIGGRAPH'86 Conference, Dallas, August 1986).

    Google Scholar 

  19. J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The grid file: an adaptable, symmetric multikey file structure. ACM Transactions on Database Systems, 9(1):38–71, March 1984.

    Google Scholar 

  20. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  21. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  22. H. Samet and W.G. Aref. Spatial data models and query processing. In W. Kim, editor, Modern Database Systems, The Object Model, Interoperability and Beyond, pages 338–360. ACM Press and Addison-Wesley, New York, 1995.

    Google Scholar 

  23. H. Samet and M. Tamminen. Computing geometric properties of images represented by linear quadtrees. IEEE Transactions on Pattern Analysis and Machine intelligence, 7(2):229–240, March 1985. (also University of Maryland Computer Science TR-1359).

    Google Scholar 

  24. H. Samet and R.E. Webber. Storing a collection of polygons using quadtrees. ACM Transactions on Graphics, 4(3):182–222, July 1985. (Also Proceedings of Computer Vision and Pattern Recognition 83, Washington, DC, June 1983, 127–132; and University of Maryland Computer Science TR-1372).

    Google Scholar 

  25. B. Seeger and H.P. Kriegel. The buddy-tree: an efficient and robust access method for spatial data base systems. In D. McLeod, R. Sacks-Davis, and H. Schek, editors, Proceedings of the Sixteenth International Conference on Very Large Data Bases (VLDB), pages 590–601, Brisbane, Australia, August 1990.

  26. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: a dynamic index for multi-dimensional objects. In P.M. Stocker and W. Kent, editors, Proceedings of the 13th International Conference on Very Large Databases (VLDB), pages 71–79, Brighton, England, September 1987.

  27. C.A. Shaffer. A formula for computing the number of quadtree node fragments created by a shift. Pattern Recognition Letters, 7(1):45–49, January 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department and Center for Automation Research and Institute for Advanced Computer Studies, The University of Maryland, College Park, Maryland, 20742

    WALID G AREF & HANAN SAMET

Authors
  1. WALID G AREF
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. HANAN SAMET
    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

AREF, W.G., SAMET, H. Efficient Window Block Retrieval in Quadtree-Based Spatial Databases. GeoInformatica 1, 59–91 (1997). https://doi.org/10.1023/A:1009760201355

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009760201355

Search

Navigation