A Brief Tutorial Introduction to Data Structures for Geometric Databases

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]).

[1]  Hans-Werner Six,et al.  Anbindung einer rämlich clusternden Zugriffstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle , 1991, BTW.

[2]  Peter Widmayer,et al.  The LSD tree: spatial access to multidimensional and non-point objects , 1989, VLDB 1989.

[3]  Hans-Werner Six,et al.  Globally order preserving multidimensional linear hashing , 1988, Proceedings. Fourth International Conference on Data Engineering.

[4]  Diane Greene,et al.  An implementation and performance analysis of spatial data access methods , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[5]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.

[6]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[7]  Alfons Kemper,et al.  An analysis of geometric modeling in database systems , 1987, CSUR.

[8]  Hans-Peter Kriegel,et al.  An Access Method Based Query Processor for Spatial Database Systems , 1992 .

[9]  Richard J. Enbody,et al.  Dynamic hashing schemes , 1988, CSUR.

[10]  Peter Widmayer,et al.  Balanced Cuts of a Set of Hyperrectangles , 1993, CCCG.

[11]  Hanan Samet,et al.  Applications of spatial data structures , 1989 .

[12]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[13]  Clifford A. Shaffer,et al.  QUILT: a geographic information system based on quadtrees , 1990, Int. J. Geogr. Inf. Sci..

[14]  Philippe Flajolet,et al.  Partial match retrieval of multidimensional data , 1986, JACM.

[15]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[16]  Hans-Peter Kriegel,et al.  Techniques for Design and Implementation of Efficient Spatial Access Methods , 1988, VLDB.

[17]  Peter Widmayer,et al.  Datenstrukturen für Geodatenbanken , 1991, Entwicklungstendenzen bei Datenbanksystemen.

[18]  Kotagiri Ramamohanarao,et al.  Recursive linear hashing , 1984, TODS.

[19]  Jürg Nievergelt,et al.  Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects , 1993, Comput. J..

[20]  Oliver Günther,et al.  Efficient computation of spatial joins , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[21]  Ludger Becker,et al.  A New Algorithm and a Cost Model for Join Processing with Grid Files , 1992, GI Datenbank Rundbrief.

[22]  Mireille Régnier,et al.  Analysis of grid file algorithms , 1985, BIT.

[23]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[24]  Klaus Hinrichs,et al.  The grid file system , 1985 .

[25]  Hans-Werner Six,et al.  Spatial searching in geometric databases , 1988, Proceedings. Fourth International Conference on Data Engineering.

[26]  Oliver Günther,et al.  Research issues in spatial databases , 1990, SGMD.

[27]  Ralf Hartmut Güting,et al.  Gral: An Extensible Relational Database System for Geometric Applications , 1989, VLDB.

[28]  Hans-Peter Kriegel,et al.  Performance Comparison of Point and Spatial Access Methods , 1990, SSD.

[29]  Peter Widmayer,et al.  An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles , 1993, ICCG.

[30]  Hans-Werner Six,et al.  Spatial priority search: an access technique for scaleless maps , 1991, SIGMOD '91.

[31]  Hans-Peter Kriegel,et al.  Query Processing of Spatial Objects: Complexity versus Redundancy , 1993, SSD.

[32]  Hans-Peter Kriegel,et al.  Multidimensional Order Preserving Linear Hashing with Partial Expansions , 1986, ICDT.

[33]  Ekow J. Otoo,et al.  Balanced multidimensional extendible hash tree , 1985, PODS.

[34]  Hans-Werner Six,et al.  On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size , 1987, WG.

[35]  J. L. Smith,et al.  A data structure and algorithm based on a linear key for a rectangle retrieval problem , 1983, Comput. Vis. Graph. Image Process..

[36]  S. Chern.  Review: Luis A. Santaló, Integral geometry and geometric probability , 1977 .

[37]  Christos Faloutsos,et al.  Analysis of object oriented spatial access methods , 1987, SIGMOD '87.

[38]  Clifford A. Shaffer,et al.  Set Operations for Unaligned Linear Quadtrees , 1990, Comput. Vis. Graph. Image Process..

[39]  Bernhard Seeger,et al.  On Optimal Multiversion Access Structures , 1993, SSD.

[40]  Masao Sakauchi,et al.  A new tree type data structure with homogeneous nodes suitable for a very large spatial database , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[41]  Hans-Werner Six,et al.  The R-file: an efficient access structure for proximity queries , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[42]  Hans-Peter Kriegel,et al.  Efficient processing of spatial joins using R-trees , 1993, SIGMOD Conference.

[43]  David Hung-Chang Du,et al.  On Multiple Random Accesses and Physical Data Placement in Dynamic Files , 1987, IEEE Transactions on Software Engineering.

[44]  G. Matheron.  Random Sets and Integral Geometry , 1976 .

[45]  Christian Zimmermann,et al.  Global Order Makes Spatial Access Faster , 1992 .

[46]  Witold Litwin,et al.  Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.

[47]  Peter Widmayer,et al.  Enclosing Many Boxes by an Optimal Pair of Boxes , 1992, STACS.

[48]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[49]  Luc Devroye,et al.  Lecture Notes on Bucket Algorithms , 1986, Progress in Computer Science.

[50]  Hans-Werner Six,et al.  Paging Binary Trees with External Balancing , 1989, WG.

[51]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[52]  Robert B. Tilove,et al.  Set Membership Classification: A Unified Approach to Geometric Intersection Problems , 1980, IEEE Transactions on Computers.

[53]  Hans-Werner Six,et al.  How to Split Buckets in Spatial Data Structures , 1992 .

[54]  Bernd-Uwe Pagel,et al.  Towards an analysis of range query performance in spatial data structures , 1993, PODS '93.

[55]  Bernd-Uwe Pagel,et al.  The Transformation Technique for Spatial Objects Revisited , 1993, SSD.

[56]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[57]  Paolo Giulio Franciosa,et al.  Separating sets of hyperrectangles , 1993, Int. J. Comput. Geom. Appl..

[58]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[59]  Nick Roussopoulos,et al.  Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.

[60]  Michael Freeston,et al.  A Well-Behaved File Structure for the Storage of Spatial Objects , 1989, SSD.

[61]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[62]  Hanan Samet,et al.  A population analysis for hierarchical data structures , 1987, SIGMOD '87.

[63]  Beng Chin Ooi,et al.  Extending a DBMS for geographic applications , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[64]  Hans-Jörg Schek,et al.  Query-Adaptive Data Space Partitioning using Variable-Size Storage Clusters , 1993, SSD.