Advertisement

Distributed and Parallel Databases

, Volume 10, Issue 2, pp 111–126 | Cite as

Window Query Processing in Linear Quadtrees

  • Ashraf Aboulnaga
  • Walid G. Aref
Article

Abstract

The linear quadtree is a spatial access method that is built by decomposing the spatial objects in a database into quadtree blocks and storing these quadtree blocks in a B-tree. The linear quadtree is very useful for geographic information systems because it provides good query performance while using existing B-tree implementations. An algorithm and a cost model are presented for processing window queries in linear quadtrees. The algorithm can handle query windows of any shape in the general case of spatial databases with overlapping objects. The algorithm recursively decomposes the space into quadtree blocks, and uses the quadtree blocks overlapping the query window to search the B-tree. The cost model estimates the I/O cost of processing window queries using the algorithm. The cost model is also based on a recursive decomposition of the space, and it uses very simple parameters that can easily be maintained in the database catalog. Experiments with real and synthetic data sets verify the accuracy of the cost model.

spatial databases spatial access methods quadtrees window queries GIS 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D.J. Abel and D.M. Mark, “A comparative analysis of some two-dimensional orderings,” Int. Journal of Geographical Information Systems, vol. 4, no. 1, pp. 21–31, 1990.Google Scholar
  2. 2.
    A. Aboulnaga, “An algorithm and a cost model for window queries in spatial databases,” Master's thesis, Faculty of Engineering, Alexandria University, Alexandria, Egypt, 1996.Google Scholar
  3. 3.
    A. Aboulnaga and J.F. Naughton, “Accurate estimation of the cost of spatial selections,” in Proc. IEEE Int. Conf. on Data Engineering, San Diego, California, March 2000, pp. 123–134.Google Scholar
  4. 4.
    S. Acharya, V. Poosala, and S. Ramaswamy, “Selectivity estimation in spatial databases,” in Proc. ACM SIGMOD Int. Conf. on Management of Data, June 1999, pp. 13–24.Google Scholar
  5. 5.
    P. Aoki, “How to avoid building DataBlades that know the value of everything and the cost of nothing,” in Proc. Int. Conf. on Scientific and Statistical Database Management, Cleveland, Ohio, July 1999.Google Scholar
  6. 6.
    W.G. Aref and H. Samet, “Efficient window block retrieval in quadtree-based spatial databases,” GeoInformatica, vol. 1, no. 1, pp. 59–91, 1997.Google Scholar
  7. 7.
    H.-T. Chou and D.J. DeWitt, “An evaluation of buffer management strategies for relational database systems,” in Proc. Int. Conf. on Very Large Data Bases, Stockholm, Sweden, August 1985, pp. 127–141.Google Scholar
  8. 8.
    D. Comer, “The ubiquitous B-tree,” ACM Computing Surveys, vol. 11, no. 2, pp. 121–137, 1979.Google Scholar
  9. 9.
    C. Faloutsos, “Gray codes for partial match and range queries,” IEEE Transactions on Software Engineering, vol. 14, no. 10, pp. 1381–1393, 1988.Google Scholar
  10. 10.
    C. Faloutsos and I. Kamel, “Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension,” in Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Minneapolis, Minnesota, May 1994, pp. 4–13.Google Scholar
  11. 11.
    C. Faloutsos and S. Roseman, “Fractals for secondary key retrieval,” in Proc. ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems (PODS), Philadelphia, Pennsylvania, March 1989, pp. 247–252.Google Scholar
  12. 12.
    V. Gaede and O. Günther, “Multidimensional access methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 170–231, 1998.Google Scholar
  13. 13.
    I. Gargantini, “An effective way to represent quadtrees,” Communications of the ACM, vol. 25, no. 12, pp. 905–910, 1982.Google Scholar
  14. 14.
    A. Guttman, “R-trees: A dynamic index structure for spatial searching,” in Proc. ACM SIGMOD Int. Conf. on Management of Data, June 1984, pp. 47–54.Google Scholar
  15. 15.
    H.V. Jagadish, “Linear clustering of objects with multiple attributes,” in Proc. ACM SIGMOD Int. Conf. on Management of Data, 1990, pp. 332–342.Google Scholar
  16. 16.
    I. Kamel and C. Faloutsos, “On packing R-trees,” in Proc. 2nd Int. Conference on Information and Knowledge Management, Washington, DC, November 1993, pp. 490–499.Google Scholar
  17. 17.
    G.M. Morton, “A computer oriented geodetic data base and a new technique in file sequencing,” IBM, Ottawa, Canada, Technical report, 1966.Google Scholar
  18. 18.
    Oracle Corporation. Oracle Spatial User's Guide and Reference, 1999. Available from http://technet.oracle.com/products/spatial/.Google Scholar
  19. 19.
    J.A. Orenstein, “Spatial query processing in an object-oriented database system,” in Proc. ACM SIGMOD Int. Conf. on Management of Data, May 1986, pp. 326–336.Google Scholar
  20. 20.
    J.A. Orenstein, “Redundancy in spatial databases,” in Proc. ACM SIGMOD Int. Conf. on Management of Data, June 1989, pp. 294–305.Google Scholar
  21. 21.
    J.A. Orenstein and F.A. Manola, “PROBE spatial data modeling and query processing in an image database application,” IEEE Transactions on Software Engineering, vol. 14, no. 5, pp. 611–629, 1988.Google Scholar
  22. 22.
    B.-U. Pagel, H.W. Six, H. Toben, and P. Widmayer, “Towards an analysis of range query performance in spatial data structures,” in Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Washington, DC, May 1993, pp. 214–221.Google Scholar
  23. 23.
    H. Samet, “The quadtree and related hierarchical data structures,” ACM Computing Surveys, vol. 16, no. 2, pp. 187–260, June 1984.Google Scholar
  24. 24.
    H. Samet, Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS, Addison-Wesley: Reading, MA, 1990.Google Scholar
  25. 25.
    H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley: Reading, MA, 1990.Google Scholar
  26. 26.
    H. Samet and M. Tamminen, “Computing geometric properties of images represented by linear quadtrees,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, no. 2, pp. 229–240, 1985.Google Scholar
  27. 27.
    A.S. Szalay, P.Z. Kunszt, A. Thakar, J. Gray, D. Slutz, and R.J. Brunner, “Designing and mining multi-terabyte astronomy archives: The Sloan Digital Sky Survey,” in Proc. ACM SIGMOD Int. Conf. on Management of Data, Dallas, Texas, May 2000, pp. 451–462.Google Scholar
  28. 28.
    Y. Theodoridis and T. Sellis, “A model for the prediction of R-tree performance,” in Proc. ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Montreal, Canada, June 1996, pp. 161–171.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Ashraf Aboulnaga
    • 1
  • Walid G. Aref
    • 2
  1. 1.Computer Sciences DepartmentUniversity of Wisconsin - MadisonMadisonUSA
  2. 2.Department of Computer SciencesPurdue UniversityWest LafayetteUSA

Personalised recommendations