Advertisement

A Brief Tutorial Introduction to Data Structures for Geometric Databases

  • T. Ohler
  • P. Widmayer
Part of the International Centre for Mechanical Sciences book series (CISM, volume 347)

Abstract

It is a well established fact that traditional — such as relational — database systems are inappropriate for a large class of nonstandard applications. On the one hand, modeling and querying nonstandard data may be unnatural in a traditional system, and on the other hand, the resulting inefficiency — such as a long response time to a geometric query — may render the system altogether useless. The management of geometric objects, for instance in CAD or cartography, is a prime example of an application where efficiency is the bottleneck; this bottleneck cannot be eliminated without the help of suitable access structures (see also [1]).

Keywords

Range Query Access Structure Spatial Access Grid File Data Base Management System 
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. 1.
    Günther, O. and A. Buchmann: Research issues in spatial databases, IEEE CS Bulletin on Data Engineering, Vol. 13, No. 4, 1990, 35–42.Google Scholar
  2. 2.
    Widmayer, P.: Datenstrukturen für Geodatenbanken, in: Entwicklungstendenzen bei Datenbank-Systemen (Eds. G. Vossen, K.-U. Witt ), Oldenbourg Verlag, 1991, 317–361.Google Scholar
  3. 3.
    Six, H.-W. and P. Widmayer: Spatial access structures for geometric databases, in: Data Structures and Efficient Algorithms (Eds. B. Monien, T. Ottmann), Final Report on the DFG Special Joint Initiative, Lecture Notes in Computer Science, Vol. 594, Springer-Verlag, Berlin 1992, 214–232.Google Scholar
  4. 4.
    Kemper, A. and M. Wallrath: An analysis of geometric modelling in database systems, ACM Computing Surveys, Vol. 19, No. 1, 1987, 47–91.CrossRefGoogle Scholar
  5. 5.
    Crain, I.K.: Extremely large spatial information systems: a quantitative perspective, Proc. 4th International Symposium on Spatial Data Handling, Zürich, 1990, 632–641.Google Scholar
  6. 6.
    Tilove, R.B.: Set membership classification: A unified approach to geometric intersection problems, IEEE Transactions on Computers, Vol. C-29, 1980, 874–883.Google Scholar
  7. 7.
    Bayer, R. and C. McCreight: Organization and maintenance of large ordered indexes, Acta Informatica, Vol. 1, No. 3, 1972, 173–189.CrossRefGoogle Scholar
  8. 8.
    Comer, D.: The ubiquitous B-tree, ACM Computing Surveys, Vol. 11, No. 2, 1979, 121–138.CrossRefMATHGoogle Scholar
  9. 9.
    Enbody, R.J. and H.C. Du: Dynamic hashing schemes, ACM Computing Surveys, Vol. 20, No. 2, 1988, 85–113.CrossRefGoogle Scholar
  10. 10.
    Wang, J.-H., T.-S. Yuen and D.H.-C. Du: On multiple random access and physical data placement in dynamic files, IEEE Transactions on Software Engineering, Vol. 13, No. 8, 1987, 977–987.CrossRefGoogle Scholar
  11. 11.
    Weikum, G., B. Neumann and H.-B. Paul: Konzeption und Realisierung einer mengenorientierten Seitenschnittstelle zum effizienten Zugriff auf komplexe Objekte, GI-Fachtagung Datenbanksysteme für Büro, Technik und Wissenschaft, Informatik-Fachberichte, Vol. 136, Springer-Verlag, Berlin 1987, 212–230.Google Scholar
  12. 12.
    Dröge, G. and H.-J. Schek: Query-adaptive data space partitioning using variable-size storage clusters, 3rd International Symposium on Advances in Spatial Databases, Singapore, Lecture Notes in Computer Science, Vol. 692, Springer-Verlag, Berlin 1993, 337–356.Google Scholar
  13. 13.
    Hutflesz, A., H.-W. Six and P. Widmayer: Globally order preserving multidimensional linear hashing, Proc. 4th International Conference on Data Engineering, Los Angeles, 1988, 572–579.Google Scholar
  14. 14.
    Hutflesz, A., P. Widmayer and C. Zimmermann: Global order makes spatial access faster, Geographic Data Base Management Systems, ESPRIT Basic Research Series Proceedings, Springer-Verlag, Berlin 1992, 161–176.Google Scholar
  15. 15.
    Guttman, A.: R-trees: a dynamic index structure for spatial searching, Proc. ACM SIGMOD International Conference on the Management of Data, Boston, 1984, 47–57.Google Scholar
  16. 16.
    Nievergelt, J., H. Hinterberger and K.C. Sevcik: The grid file: an adaptable, symmetric multikey file structure, ACM Transactions on Database Systems, Vol. 9, No. 1, 1984, 38–71.CrossRefGoogle Scholar
  17. 17.
    Otoo, E.J.: Balanced multidimensional extendible hash tree, Proc. 5th ACM SIGACT-SIGMOD International Symposium on Principles of Database Systems, Cambridge, Massachusetts, 1986, 100–113.Google Scholar
  18. 18.
    Seeger, B.: Entwurf und Implementierung mehrdimensionaler Zugriffsstrukturen, Dissertation, Universität Bremen, Germany, 1989.Google Scholar
  19. 19.
    Schek, H.-J. and W. Waterfeld: A database kernel system for geoscientific applications, Proc. 2nd International Symposium on Spatial Data Handling, Seattle, 1986, 273–288.Google Scholar
  20. 20.
    Waterfeld, W.: Eine erweiterbare Speicher-und Zugriffskomponente für geowissenschaftliche Datenbanksysteme, Dissertation, Fachbereich Informatik, Technische Hochschule Darmstadt, Germany, 1991.Google Scholar
  21. 21.
    Six, H.-W. and P. Widmayer: Hintergrundspeicherstrukturen für ausgedehnte Objekte, 16. Jahrestagung der Gesellschaft für Informatik, Berlin, Informatik-Fachberichte, Vol. 126, Springer-Verlag, Berlin 1986, 538–552.Google Scholar
  22. 22.
    Six, H.-W. and P. Widmayer: Spatial searching in geometric databases, Proc. 4th International Conference on Data Engineering, Los Angeles, 1988, 496–503.Google Scholar
  23. 23.
    d’Amore, F. and P.G. Franciosa: Separating sets of hyperrectangles, International Journal of Computational Geometry and Applications, Vol. 3, No. 2, 1993, 155–165.CrossRefMATHMathSciNetGoogle Scholar
  24. 24.
    d’Amore, F., T. Roos and P. Widmayer: An optimal algorithm for computing a best cut of a set of hyperrectangles, International Computer Graphics Conference, Bombay, 1993.Google Scholar
  25. 25.
    Nguyen, V.H., T. Roos and P. Widmayer: Balanced cuts of a set of hyperrectangles, Proc. 5th Canadian Conference on Computational Geometry, Waterloo, 1993, 121–126.Google Scholar
  26. 26.
    Greene, D.: An implementation and performance analysis of spatial data access methods, Proc. 5th International Conference on Data Engineering, Los Angeles, 1989, 606–615.Google Scholar
  27. 27.
    Henrich, A., H.-W. Six and P. Widmayer: Paging binary trees with external balancing, 15th International Workshop on Graph-Theoretic Concepts in Computer Science, Castle Rolduc, Lecture Notes in Computer Science, Vol. 411, Springer-Verlag, Berlin 1989, 260–276.Google Scholar
  28. 28.
    Henrich, A., H.-W. Six and P. Widmayer: The LSD-tree: Spatial access to multidimensional point-and non-point objects, 15th International Conference on Very Large Data Bases, Amsterdam, 1989, 45–53.Google Scholar
  29. 29.
    Henrich, A.: Der LSD-Baum: eine mehrdimensionale Zugriffsstruktur und ihre Einsatzmöglichkeiten in Datenbanksystemen, Dissertation, FernUniversität Hagen, Germany, 1990.Google Scholar
  30. 30.
    Hinrichs, K.H.: The grid file system: implementation and case studies of applications, Dissertation, ETH Zürich, 1985.Google Scholar
  31. 31.
    Seeger, B. and H.-P. Kriegel: Techniques for design and implementation of efficient spatial access methods, Proc. 14th International Conference on Very Large Data Bases, Los Angeles, 1988, 360–371.Google Scholar
  32. 32.
    Pagel, B.-U., H.-W. Six and H. Toben: The transformation technique for spatial objects revisited, 3rd International Symposium on Advances in Spatial Databases, Singapore, Lecture Notes in Computer Science, Vol. 692, Springer-Verlag, Berlin 1993, 73–88.Google Scholar
  33. 33.
    Harding, E.F. and D.G. Kendall: Stochastic Geometry, Wiley, New York 1974.MATHGoogle Scholar
  34. 34.
    Matheron, G.: Random sets and integral geometry, Wiley, New York 1975.MATHGoogle Scholar
  35. 35.
    Mecke, J., R.G. Schneider, D. Stoyan and W.R.R. Weil: Stochastische Geometrie, DMV-Seminar Band 16, Birkhäuser Verlag, Basel 1990.Google Scholar
  36. 36.
    Santalo, L.A.: Integral geometry and geometric probability, Addison-Wesley, Reading 1976.MATHGoogle Scholar
  37. 37.
    Stoyan, D., W.S. Kendall and J. Mecke: Stochastic geometry and its applications, Wiley, New York 1987.MATHGoogle Scholar
  38. 38.
    Devroye, L.: Lecture notes on bucket algorithms, Birkhäuser Verlag, Boston 1986.Google Scholar
  39. 39.
    Flajolet, P. and C. Puech: Partial match retrieval of multidimensional data, Journal of the ACM, Vol. 33, No. 2, 1986, 371–407.CrossRefMathSciNetGoogle Scholar
  40. 40.
    Regnier, M.: Analysis of grid file algorithms, BIT Vol. 25, 1985, 335–357.CrossRefMATHMathSciNetGoogle Scholar
  41. 41.
    Kriegel, H.-P. and B. Seeger: Multidimensional order preserving linear hashing with partial expansions, Proc. International Conference on Database Theory, Lecture Notes in Computer Science, Vol. 243, Springer-Verlag, Berlin 1986, 203–220.Google Scholar
  42. 42.
    Litwin, W.: A new tool for file and table addressing, Proc. 6th International Conference on Very Large Data Bases, Montreal, 1980, 212–223.Google Scholar
  43. 43.
    Fagin, R., J. Nievergelt, N. Pippenger and H.R. Strong: Extendible hashing–a fast access method for dynamic files, ACM Transactions on Database Systems, Vol. 4, No. 3, 1979, 315–344.CrossRefGoogle Scholar
  44. 44.
    Lomet, D.B. and B. Salzberg: The hB-tree: A multiattribute indexing method with good guaranteed performance, ACM Transactions on Database Systems, Vol. 15, No. 4, 1990, 625–658.CrossRefGoogle Scholar
  45. 45.
    Samet, H.: The design and analysis of spatial data structures, Addison-Wesley, Reading 1990.Google Scholar
  46. 46.
    Samet, H.: Applications of spatial data structures, Addison-Wesley, Reading 1990.Google Scholar
  47. 47.
    Güting, R.H.: Gral: An extensible relational database system for geometric applications, Proc. 15th International Conference on Very Large Data Bases, Amsterdam, 1989, 33–44.Google Scholar
  48. 48.
    Henrich, A., A. Hilbert, H.-W. Six and P. Widmayer: Anbindung einer räumlich clusternden Zugriffsstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle, GI-Fachtagung Datenbanksysteme für Büro, Technik und Wissenschaft, Informatik-Fachberichte, Vol. 270, Springer-Verlag, Berlin 1991, 161–177.Google Scholar
  49. 49.
    Ooi, B.C.: A data structure for geographic database, GI-Fachtagung Datenbanksysteme für Biiro, Technik und Wissenschaft, Informatik-Fachberichte, Vol. 136, Springer-Verlag, Berlin 1987, 247–258.Google Scholar
  50. 50.
    Ooi, B.C., R. Sacks-Davis and K.J. McDonell: Extending a DBMS for geographic applications, Proc. 5th International Conference on Data Engineering, Los Angeles, 1989, 590–597.Google Scholar
  51. 51.
    Freeston, M.W.: A well-behaved file structure for the storage of spatial objects, Symposium on the Design and Implementation of Large Spatial Databases, Santa Barbara, Lecture Notes in Computer Science, Vol. 409, Springer-Verlag, Berlin 1989, 287–300.Google Scholar
  52. 52.
    Beckmann, N., H.-P. Kriegel, R. Schneider and B. Seeger: The R`-tree: An efficient and robust access method for points and rectangles, Proc. ACM SIGMOD International Conference on the Management of Data, Atlantic City, New Jersey, 1990, 322–331.Google Scholar
  53. 53.
    Becker, B., P. Franciosa, S. Gschwind, T. Ohler, G. Thiemt and P. Widmayer: Enclosing many boxes by an optimal pair of boxes, Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science STACS, Cachan, Lecture Notes in Computer Science, Vol. 577, Springer-Verlag, Berlin 1992, 475–486.Google Scholar
  54. 54.
    Pagel, B.-U., H.-W. Six, H. Toben and P. Widmayer: Towards an analysis of range query performance in spatial data structures, 12th SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Washington D.C., 1993, 214–221.Google Scholar
  55. 55.
    Faloutsos, C., T. Sellis and N. Roussopoulos: Analysis of object oriented spatial access methods, Proc. ACM SIGMOD International Conference on the Management of Data, San Francisco, 1987, 426–439.Google Scholar
  56. 56.
    Sellis, T., N. Roussopoulos and C. Faloutsos: The R+-tree: A dynamic index for multi-dimensional objects, Proc. 13th International Conference on Very Large Data Bases, Brighton, 1987, 507–518.Google Scholar
  57. 57.
    Smith, T.R. and P. Gao: Experimental performance evaluations on spatial access methods, Proc. 4th International Symposium on Spatial Data Handling, Zürich, 1990, 991–1002.Google Scholar
  58. 58.
    Abel, D.J. and J.L. Smith: A data structure and algorithm based on a linear key for a rectangle retrieval problem, Computer Vision, Graphics, and Image Processing, Vol. 24, 1983, 1–13.CrossRefGoogle Scholar
  59. 59.
    Roussopoulos, N. and D. Leifker: Direct spatial search on pictorial databases using packed R-trees, Proc. ACM SIGMOD International Conference on the Management of Data, Austin, 1985, 17–31.Google Scholar
  60. 60.
    Ohsawa, Y. and M. Sakauchi: A new tree type data structure with homogeneous nodes suitable for a very large spatial database, Proc. 6th International Conference on Data Engineering, Los Angeles, 1990, 296–303.Google Scholar
  61. 61.
    Ramamohanarao, K. and R. Sacks-Davis: Recursive linear hashing, ACM Transactions on Database Systems, Vol. 9, No. 3, 1984, 369–391.CrossRefMathSciNetGoogle Scholar
  62. 62.
    Hutflesz, A., H.-W. Six and P. Widmayer: The R-file: An efficient access structure for proximity queries, Proc. 6th International Conference on Data Engineering, Los Angeles, 1990, 372–379.Google Scholar
  63. 63.
    Becker, B., H. Six and P. Widmayer: Maßstabsunabhängige Verwaltung von Landschaftsdaten, Tagungsband II der 20. Jahrestagung der Gesellschaft für Informatik, Stuttgart, Informatik-Fachberichte, Vol. 258, Springer-Verlag, Berlin 1990, 487–496.Google Scholar
  64. 64.
    Becker, B., H.-W. Six and P. Widmayer: Spatial priority search: An access technique for scaleless maps, Proc. ACM SIGMOD International Conference on the Management of Data, Denver, 1991, 128–137.Google Scholar
  65. 65.
    Nievergelt, J. and P. Widmayer: Guard files: Stabbing and intersection queries on fat spatial objects, The Computer Journal, Vol. 36, No. 2, 1993, 107–116.CrossRefMATHGoogle Scholar
  66. 66.
    Becker, L.: A new algorithm and a cost model for join processing with grid files, Dissertation, Fachbereich Elektrotechnik und Informatik, Universität-Gesamthochschule Siegen, Germany, 1992.Google Scholar
  67. 67.
    Brinkhoff, T., H.-P. Kriegel and B. Seeger: Efficient processing of spatial joins using R-trees, Proc. ACM SIGMOD International Conference on the Management of Data, Washington D.C., 1993, 237–246.Google Scholar
  68. 68.
    Günther, O.: Efficient computation of spatial joins, Technical Report TR-92–029, International Computer Science Institute, Berkeley, 1992.Google Scholar
  69. 69.
    Kriegel, H.-P., T. Brinkhoff and R. Schneider: An efficient map overlay algorithm based on spatial access methods and computational geometry, Geographic Data Base Management Systems, ESPRIT Basic Research Series Proceedings, Springer-Verlag, Berlin 1992, 194–211.Google Scholar
  70. 70.
    Shaffer, C.A. and H. Samet: Set operations for unaligned linear quadtrees, Computer Vision, Graphics, and Image Processing, Vol. 50, No. 1, 1990, 29–49.CrossRefGoogle Scholar
  71. 71.
    Ohler, T.: The multiclass grid file: An access structure for multiclass range queries, Proc. 4th International Symposium on Spatial Data Handling, Charleston, 1992, 260–271.Google Scholar
  72. 72.
    Kriegel, H.-P., P. Heep, S. Heep, M. Schiwietz and R. Schneider: An access method based query processor for spatial database systems, Geographic Data Base Management Systems, ESPRIT Basic Research Series Proceedings, Springer-Verlag, Berlin 1992, 273–292.Google Scholar
  73. 73.
    Schiwietz, M. and H.-P. Kriegel: Query processing of spatial objects: Complexity versus redundancy, 3rd International Symposium on Advances in Spatial Databases, Singapore, Lecture Notes in Computer Science, Vol. 692, Springer-Verlag, Berlin 1993, 377–396.Google Scholar
  74. 74.
    Becker, B.: Methoden und Strukturen zur effizienten Verwaltung geometrischer Objekte in Geo-Informationssystemen, Dissertation, Mathematische Fakultät, Albert-Ludwigs-Universität, Freiburg, Germany, 1993.Google Scholar
  75. 75.
    Becker, B., S. Gschwind, T. Ohler, B. Seeger and P. Widmayer: On optimal multiversion access structures, 3rd International Symposium on Advances in Spatial Databases, Singapore, Lecture Notes in Computer Science, Vol. 692, Springer-Verlag, Berlin 1993, 123–141.Google Scholar
  76. 76.
    Charlton, M.E., S. Openshaw and C. Wymer: Some experiments with an adaptive data structure in the analysis of space-time data, Proc. 4th International Symposium on Spatial Data Handling, Zürich, 1990, 1030–1039.Google Scholar
  77. 77.
    Xu, X., J. Han and W. Lu: RT-tree: an improved R-tree index structure for spatiotemporal databases, Proc. 4th International Symposium on Spatial Data Handling, Zürich, 1990, 1040–1049.Google Scholar
  78. 78.
    Nelson, R.C. and H. Samet: A population analysis for hierarchical data structures, Proc. ACM SIGMOD International Conference on the Management of Data, San Francisco, 1987, 270–277.Google Scholar
  79. 79.
    Rottke, T., H.-W. Six and P. Widmayer: On the analysis of grid structures for spatial objects of non-zero size, International Workshop on Graph-Theoretic Concepts in Computer Science, Staffelstein, Lecture Notes in Computer Science, Vol. 314, Springer-Verlag, Berlin 1987, 94–105.Google Scholar
  80. 80.
    Kriegel, H.-P., M. Schiwietz, R. Schneider and B. Seeger: Performance comparison of point and spatial access methods, Proc. Symposium on the Design and Implementation of Large Spatial Databases, Santa Barbara, Lecture Notes in Computer Science, Vol. 409, Springer-Verlag, Berlin 1989, 89–114.Google Scholar
  81. 81.
    Shaffer, C.A., H. Samet and R.C. Nelson: QUILT: A geographic information system based on quadtrees, International Journal of Geographical Information Systems, Vol. 4, No. 2, 1990, 103–131.CrossRefGoogle Scholar
  82. 82.
    Henrich, A. and H.-W. Six: How to split buckets in spatial data structures, Geographic Data Base Management Systems, ESPRIT Basic Research Series Proceedings, Springer-Verlag, Berlin 1991, 212–244.Google Scholar

Copyright information

© Springer-Verlag Wien 1994

Authors and Affiliations

  • T. Ohler
    • 1
  • P. Widmayer
    • 1
  1. 1.ETH ZentrumZürichSwitzerland

Personalised recommendations