AN INSERTION STRATEGY FOR A TWO-DIMENSIONAL SPATIAL ACCESS METHOD

Wendy Osborn, Ken Barker

Abstract

This paper presents the 2DR-tree, a novel approach for accessing spatial data. The 2DR-tree uses nodes that are the same dimensionality as the data space. All spatial relationships between objects are preserved. A validity rule ensures that every node preserves the spatial relationships among its objects. The proposed insertion strategy adds a new object by recursively partitioning the space occupied by a set of objects. A performance evaluation shows the advantages of the 2DR-tree and identifies issues for future consideration.

References

  1. 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 the ACM SIGMOD International Conference on Management of Data, pages 322-31.
  2. Berchtold, S., Keim, D., and Kriegel, H.-P. (1996). The Xtree: An index structure for high-dimensional data. In Proceedings of the 22nd International Conference on Very Large Data Bases, pages 28-39.
  3. Comer, D. (1979). The ubiquitous B-tree. ACM Computing Surveys, 11:121-37.
  4. Gaede, V. and G√ľnther, O. (1998). Multidimensional access methods. ACM Computing Surveys, 30:170-231.
  5. Guttman, A. (1984). R-trees: a dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 47-57.
  6. Kamel, I. and Faloutsos, C. (1994). Hilbert R-tree: an improved r-tree using fractals. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 500-9.
  7. Koudas, N. (2000). Indexing support for spatial joins. Data and Knowledge Engineering, 34:99-124.
  8. Orenstein, J. and Merrett, T. (1984). A class of data structures for associative searching. In Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 181-90.
  9. Papadias, D., Egenhofer, M., and Sharma, J. (1996). Hierarchical reasoning about direction relations. In Proceedings of the 4th ACM-GIS.
  10. Samet, H. (1990). The design and analysis of spatial data structures. Addison-Wesley.
  11. Sellis, T., Roussopoulos, N., and Faloutsos, C. (1987). The R+-tree: a dynamic index for multi-dimensional objects. In Proceedings of the 13th International Conference on Very Large Data Bases.
  12. Shekhar, S. and Chawla, S. (2003). Spatial Databases: A Tour. Prentice Hall.
Download


Paper Citation


in Harvard Style

Osborn W. and Barker K. (2007). AN INSERTION STRATEGY FOR A TWO-DIMENSIONAL SPATIAL ACCESS METHOD . In Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-972-8865-88-7, pages 295-300. DOI: 10.5220/0002408002950300


in Bibtex Style

@conference{iceis07,
author={Wendy Osborn and Ken Barker},
title={AN INSERTION STRATEGY FOR A TWO-DIMENSIONAL SPATIAL ACCESS METHOD},
booktitle={Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2007},
pages={295-300},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002408002950300},
isbn={978-972-8865-88-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - AN INSERTION STRATEGY FOR A TWO-DIMENSIONAL SPATIAL ACCESS METHOD
SN - 978-972-8865-88-7
AU - Osborn W.
AU - Barker K.
PY - 2007
SP - 295
EP - 300
DO - 10.5220/0002408002950300