Advertisement

Spatial Access Methods

  • Yannis Manolopoulos
  • Yannis Theodoridis
  • Vassilis J. Tsotras
Part of the Advances in Database Systems book series (ADBS, volume 17)

Abstract

Spatial Databases cover a wide set of applications that handle spatial data, such as points, lines, and regions in multi-dimensional space. GISs are the most popular ones. GIS applications include cartography and network (such as road, telephone, or computer) mapping; apart from such applications, spatial data sets are of interest in the fields of Computer Aided Design (CAD), Robotics, Very Large Scale Integration (VLSI) Design, and Multimedia Systems. In this chapter, we briefly present the basic characteristics of a spatial database and then describe in detail the major efforts on efficiently manipulating spatial data using specialized indexing structures and access methods.

Keywords

Range Query Spatial Database Large Data Base Very Large Scale Integration Query Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adam, N.R. and Gangopadhyay, A. (1997). Database Issues on Geographic Information Systems. Kluwer Academic Publishers.Google Scholar
  2. Beckmann, N., Kriegel, H.-P., Schneider, R., and Seeger, B. (1990). The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 322–331.Google Scholar
  3. Belussi, A. and Faloutsos, C. (1995). Estimating the Selectivity of Spatial Queries Using the ‘Correlation’ Fractal Dimension. In Proceedings of the 21 st International Conference on Very Large Data Bases, pages 299–310.Google Scholar
  4. Brinkhoff, T., Kriegel, H.-P., and Seeger, B. (1993). Efficient Processing of Spatial Joins Using R-trees. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 237–246.Google Scholar
  5. Brinkhoff, T., Kriegel, H.-P., Schneider, R., and Seeger, B. (1994). Multi-Step Processing of Spatial Joins. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 197–208.Google Scholar
  6. Cheung, K. and Fu, A. (1998). Enhanced Nearest Neighbour Search on the R-tree. ACM SIGMOD Record, 27(3):16–21.CrossRefGoogle Scholar
  7. Comer, D. (1979). The Ubiquitous B-tree. ACM Computing Surveys, 11(2):121–137.zbMATHCrossRefGoogle Scholar
  8. Faloutsos, C. and Gaede, V. (1996). Analysis of n-Dimensional Quadtrees using the Haus-dorff Fractal Dimension. In Proceedings of the 22 nd International Conference on Very Large Data Bases, pages 40–50.Google Scholar
  9. Faloutsos, C. and Kamel, I. (1994). Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension. In Proceedings of the 13 th ACM Symposium on Principles of Database Systems, pages 4–13.Google Scholar
  10. Faloutsos, C, Jagadish, H.V., and Manolopoulos, Y. (1997). Analysis of the n-dimensional Quadtree Decomposition for Arbitrary Hyperectangles. IEEE Transactions on Knowledge and Data Engineering, 9(3):373–383.CrossRefGoogle Scholar
  11. Finkel, R.A. and Bentley, J.L. (1974). Quad Trees: a Data Structure for Retrieval on Composite Keys. Acta Informatica, 4(1):1–9.zbMATHCrossRefGoogle Scholar
  12. Freeston, M. (1987). The BANG File: A New Kind of Grid File. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 260–269.Google Scholar
  13. Freeston, M. (1995). A General Solution of the n-dimensional B-tree Problem. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 80–91.Google Scholar
  14. Gaede, V. and Guenther, O. (1998). Multidimensional Access Methods. ACM Computing Surveys, 30(2):170–231.CrossRefGoogle Scholar
  15. Guenther, O. (1989). The Cell tree: an Object-Oriented Index Structure for Geometric Databases. In Proceedings of the 5 th IEEE International Conference on Data Engineering, pages 598–605.Google Scholar
  16. Gueting, R.H. (1994). An Introduction to Spatial Database Systems. The VLDB Journal, 3(4):357–399.CrossRefGoogle Scholar
  17. Guttman, A. (1984). R-trees: a Dynamic Index Structure for Spatial Searching. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 47–57.Google Scholar
  18. Henrich, A., Six, H.-W., and Widmayer, P. (1989). The LSD tree: Spatial Access to Multidimensional Point and non Point Objects. In Proceedings of the 15 th International Conference on Very Large Data Bases, pages 43–53.Google Scholar
  19. Hoel, E.G. and Samet, H. (1992). A Qualitative Comparison Study of Data Structures for Large Segment Databases. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 205–214.Google Scholar
  20. Hunter, G.M. and Steiglitz, K. (1979). Operations on Images Using Quad Trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1(2):145–153.CrossRefGoogle Scholar
  21. Hutflesz, A., Six, H.-W., and Widmayer, P. (1988). Twin Grid Files: Space Optimizing Access Schemes. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 183–190.Google Scholar
  22. Kamel, I. and Faloutso, C. (1994). Hilbert R-tree: an Improved R-tree Using Fractals. In Proceedings of the 20 th International Conference on Very Large Data Bases, pages 500–509.Google Scholar
  23. Knuth, D. (1973). The Art of Computer Programming. Vol. 3: Sorting and Searching. Addison-Wesley.Google Scholar
  24. Kriegel, H.-P., Schiwietz, M., Schneider, R., and Seeger, B. (1989). Performance Comparison of Point and Spatial Access Methods. In Proceedings of the 1 st International Symposium on Spatial Databases, pages 89–114.Google Scholar
  25. Lomet, D.B. and Salzberg, B. (1990). The hB-tree: a Multiattribute Indexing Method with Good Guaranteed Performance. ACM Transactions on Database Systems, 15(4):625–658.CrossRefGoogle Scholar
  26. Nievergelt, J. (1989). 7±2 Criteria for Assessing and Comparing Spatial Data Structures. In Proceedings of the 1 st International Symposium on Spatial Databases, pages 3–27.Google Scholar
  27. Orenstein, J. (1989). Redundancy in Spatial Databases. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 294–305.Google Scholar
  28. Pagel, B.-U., Six, H.-W., Toben, H., and Widmayer, P. (1993). Towards an Analysis of Range Query Performance. In Proceedings of the 12 th ACM Symposium on Principles of Database Systems, pages 214–221.Google Scholar
  29. Pagel, B.-U., Six, H.-W., and Winter, M. (1995). Window Query-Optimal Clustering of Spatial Objects. In Proceedings of the 14 th ACM Symposium on Principles of Database Systems, pages 85–94.Google Scholar
  30. Papadias, D. and Theodoridis, Y. (1997). Spatial Relations, Minimum Bounding Rectangles, and Spatial Data Structures. International Journal of Geographic Information Science, 11(2):111–138.CrossRefGoogle Scholar
  31. Papadias, D., Mamoulis, N., and Theodoridis, Y. (1999). Processing and Optimization of Multi-way Spatial Joins Using R-trees. In Proceedings of the 18 th ACM Symposium on Principles of Database Systems, pages 44–55.Google Scholar
  32. Papadias, D., Theodoridis, Y., Sellis, T., and Egenhofer, M.J. (1995). Topological Relations in the World of Minimum Bounding Rectangles: a Study with R-trees. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 92–103.Google Scholar
  33. Papadopoulos, A. and Manolopoulos, Y. (1997). Performance of Nearest Neighbor Queries in R-trees. In Proceedings of the 6 th International Conference on Database Theory, pages 394–408.Google Scholar
  34. Roussopoulos, N. and Leifker, D. (1985). Direct Spatial Search on Pictorial Databases Using Packed R-trees. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 17–31.Google Scholar
  35. Roussopoulos, N., Kelley, S., and Vincent, F. (1995). Nearest Neighbor Queries. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 71–79.Google Scholar
  36. Samet, H. (1984). The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys, 16(2): 187–260.MathSciNetCrossRefGoogle Scholar
  37. Samet, H. (1989). Hierarchical Spatial Data Structures. In Proceedings of the 1 st International Symposium on Spatial Databases, pages 193–212.Google Scholar
  38. Samet, H. (1990). The Design and Analysis of Spatial Data Structures. Addison-Wesley.Google Scholar
  39. Samet, H. (1990b). Applications of Spatial Data Structures in Computer Graphics, Image Processing and GIS. Addison-Wesley.Google Scholar
  40. Seeger, B. (1991). Performance Comparison of Segment Access Methods Implemented on top of the Buddy-tree. In Proceedings of the 2 nd International Symposium on Spatial Databases, pages 277–296.Google Scholar
  41. Seeger, B. and Kriegel, H.-P. (1988). Techniques for Design and Implementation of Spatial Access Methods. In Proceedings of the 14 th International Conference on Very Large Data Bases, pages 360–371.Google Scholar
  42. Seeger, B. and Kriegel, H.-P. (1990). The Buddy-tree: an Efficient and Robust Access Method for Spatial Data Base Systems. In Proceedings of the 16 th International Conference on Very Large Data Bases, pages 590–601.Google Scholar
  43. Sellis, T., Roussopoulos, N., and Faloutsos, C. (1987). The R+-tree: a Dynamic Index for Multidimensional Objects. In Proceedings of the 13 th International Conference on Very Large Data Bases, pages 507–518.Google Scholar
  44. Shaffer C.A. and Brown P.R. (1993). A Paging Scheme for Pointer-based Quadtrees. In Proceedings of the 3 rd Symposium on Spatial Databases, pages 89–104.Google Scholar
  45. Theodoridis, Y. and Sellis, T. (1996). A Model for the Prediction of R-tree Performance. In Proceedings of the 15 th ACM Symposium on Principles of Database Systems, pages 161–171.Google Scholar
  46. Theodoridis, Y., Sellis, T., Papadopoulos, A., Manolopoulos, Y. (1998a). Specifications for Efficient Indexing in Spatiotemporal Databases. In Proceedings of the 10 th International Conference on Scientific and Statistical Database Management, pages 123–132.Google Scholar
  47. Theodoridis, Y., Stefanakis, E., and Sellis, T. (1998b). Cost Models for Join Queries in Spatial Databases. In Proceedings of the 14 th IEEE International Conference on Data Engineering, pages 476–483.Google Scholar
  48. Vassilakopoulos M and Manolopoulos Y (1994). Analytical Comparison of Two Spatial Data Structures. Information Systems, 19(7):569–582.CrossRefGoogle Scholar
  49. Vassilakopoulos M and Manolopoulos Y (1995). A Random Model for Analyzing Region Quadtrees. Pattern Recognition Letters, 16:1137–1145.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Yannis Manolopoulos
    • 1
  • Yannis Theodoridis
    • 2
  • Vassilis J. Tsotras
    • 3
  1. 1.Aristotle UniversityGreece
  2. 2.Greece
  3. 3.University of CaliforniaRiversideUSA

Personalised recommendations