The LSD tree: spatial access to multidimensional and non-point objects

We propose the Local Split Decision tree (LSD tree, for short), a data structure supporting efficient spatial access to geometrico bjects.I ts main advantageosv er other structures are that it performsw ell for all reasonabled atad istributions, cover quotients( which measureth e overlappingo f the data objects), and bucket capacities, and that it maintains multidimensional points as well as arbitrary geometric objects. Thesep ropertiesd emonstratedb y an extensivep erformance,evaluation make the LSD tree extremely suitable for the implementationo f spatiala ccessp athsi n geometricd atabases. The paging algorithm for the binary tree directory is interesting in its own right because a practical solution for the problem of how to page a (multidimensional)b inary tree without accessp ath degenerationis presented.

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

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

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

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

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

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

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

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

[9]  Michael L. Fredman,et al.  The inherent complexity of dynamic data structures which accommodate range queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

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

[11]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

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

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

[14]  Michael Freeston,et al.  The BANG file: A new kind of grid file , 1987, SIGMOD '87.

[15]  Witold Litwin,et al.  Multilevel Trie Hashing , 1988, EDBT.

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