External segment trees

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

[2]  Andrew U. Frank,et al.  The Fieldtree: A Data Structure for Geographic Information Systems , 1990, SSD.

[3]  Michiel H. M. Smid,et al.  Maintaining range trees in secondary memory , 1990, Acta Informatica.

[4]  Eugene Wong,et al.  Approximating parametric curves with strip trees using affine arithmetic , 2002, Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing.

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

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

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

[8]  Michael Freeston,et al.  Advances in the Design of the BANG File , 1989, FODO.

[9]  Hanan Samet,et al.  Hierarchical representations of collections of small rectangles , 1988, CSUR.

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

[11]  Hans-Werner Six,et al.  Twin grid files: space optimizing access schemes , 1988, SIGMOD '88.

[12]  Hans-Werner Six,et al.  The Twin Grid File: A Nearly Space Optimal Index Structure , 1988, EDBT.

[13]  Ralf Hartmut Güting,et al.  Geo-Relational Algebra: A Model and Query Language for Geometric Database Systems , 1988, EDBT.

[14]  Michiel H. M. Smid,et al.  Maintaining Range Trees in Secondary Memory (Extended Abstract) , 1988, STACS.

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

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

[17]  Hans-Peter Kriegel,et al.  PLOP-hashing: A grid file without directory , 1988, Proceedings. Fourth International Conference on Data Engineering.

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

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

[20]  Ralf Hartmut Güting,et al.  Dynamic C-Oriented Polygonal Intersections Searching , 1986, Inf. Control..

[21]  Ilsoo Ahn,et al.  Towards an implementation of database management systems with temporal support , 1986, 1986 IEEE Second International Conference on Data Engineering.

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

[23]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[24]  Richard T. Snodgrass,et al.  A taxonomy of time databases , 1985, SIGMOD Conference.

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

[26]  R. Snodgrass.  The temporal query language TQuel , 1984, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

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

[28]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[29]  Makoto Nagao,et al.  A file organization for geographic information systems based on spatial proximity , 1983, Comput. Vis. Graph. Image Process..

[30]  Jürg Nievergelt,et al.  The Grid file , 1983 .

[31]  Walter A. Burkhard,et al.  Interpolation-based index maintenance , 1983, BIT.

[32]  Markku Tamminen,et al.  Efficient spatial access to a data base , 1982, SIGMOD '82.

[33]  Andrew U. Frank,et al.  Application of DBMS to Land Information Systems , 1981, VLDB.

[34]  Hans-Peter Kriegel,et al.  Dynamic k-Dimensional Multiway Search under Time-Varying Access Frequencies , 1981, Theoretical Computer Science.

[35]  Hans-Peter Kriegel,et al.  Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries , 1980, GI Jahrestagung.

[36]  Jon Louis Bentley,et al.  Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.

[37]  Jon Louis Bentley,et al.  Decomposable Searching Problems , 1979, Inf. Process. Lett..

[38]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[39]  Michael Stonebraker,et al.  INGRES: a relational data base system , 1975, AFIPS '75.

[40]  Gabriele Blankenagel.  Intervall-Indexstrukturen in Datenbanksystemen , 1992 .

[41]  Ralf Hartmut Güting,et al.  XP-Trees: External Priority Search Trees , 1990 .

[42]  Michiel H. M. Smid,et al.  Dynamic data structures on multiple storage media , 1989 .

[43]  Jeff A. Bilmes,et al.  The Implementation of the Cell Tree: Design Alternatives and Performance Evaluation , 1989, BTW.

[44]  Beng Chin Ooi,et al.  Spatial kd-Tree: A Data Structure for Geographic Database , 1987, BTW.

[45]  L. Edwin McKenzie,et al.  Bibliography: Temporal Databases , 1986, SIGMOD Rec..

[46]  Hans-Werner Six,et al.  Hintergrundspeicherstrukturen für ausgedehnte Objekte , 1986, GI Jahrestagung.

[47]  Jonathan B. Rosenberg,et al.  Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[49]  H. Kriegel.  Variants of Multidimensional B-Trees as Dynamic Index Structures for Associative Retrieval in Database Systems , 1982, WG.

[50]  Reijo Sulonen,et al.  The EXCELL Method for Efficient Geometric Access to Data , 1982, 19th Design Automation Conference.

[51]  Herbert Edelsbrunner,et al.  On the Intersection of Orthogonal Objects , 1981, Inf. Process. Lett..

[52]  Aris M. Ouksel,et al.  MultidimensionalB-trees: Analysis of dynamic behavior , 1981, BIT.

[53]  J. Bentley,et al.  Quad Trees: A Data Structure for Retrieval on Composite Keys , 1974, Acta Informatica.