Advertisement

R + + -Tree: An Efficient Spatial Access Method for Highly Redundant Point Data

  • Martin Šumák
  • Peter Gurský
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 241)

Abstract

We present a new spatial index belonging to R-tree family. Since our new index comes out from the R + -tree and holds the concept of non-overlapping nodes we call it R + + -tree. The original R + -tree was designed for both point and spatial data. Using R + -tree for indexing spatial data is very inefficient. In our research we face the problem of indexing product catalogues data that can be represented as point data. Therefore we suggested the R + + -tree for point data only. We present a dynamic index R + + -tree as an improvement of R + -tree. In the tests we show that R + + -tree offers even better search efficiency than R*-tree when highly redundant point data is considered. Moreover the construction time of R + + -tree is shorter than the construction time of R*-tree.

Keywords

R + -tree point data spatial indexing spatial searching 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Guttman, A.: A dynamic index structure for spatial searching. In: SIGMOD Conference (1984)Google Scholar
  2. 2.
    Theodoridis, Y., Sellis, T.: Optimization Issues in R-tree Construction. In: Proceedings of the International Workshop on Geographic Information Systems (1993)Google Scholar
  3. 3.
    Brakatsoulas, S., Pfoser, D., Theodoridis, Y.: Revisiting R-tree Construction Principles. In: Proceedings of ADBIS the 6th East European Conference on Advances in Databases and Information, pp. 149–162 (2002)Google Scholar
  4. 4.
    Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-Tree: An efficient and Robust Access Method for Points and Rectangles. In: SIGMOD Conference, pp. 322–331 (1990)Google Scholar
  5. 5.
    Sellis, T., Roussopoulos, N., Faloutsos, C.: The R + -Tree: A dynamic index for multi-dimensional objects. In: VLDB (1987)Google Scholar
  6. 6.
    Greene, D.: An Implementation and Performance Analysis of Spatial Data Access Methods. In: Proc. Fifth Intl. Conf. Data Eng., pp. 606–615 (1989)Google Scholar
  7. 7.
    Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems, 265–318 (1999)Google Scholar
  8. 8.
    Šumák, M., Gurský, P.: Top-k search in product catalogues. In: Proceedings of DATESO, pp. 1–12 (2011)Google Scholar
  9. 9.
    Šumák, M., Gurský, P.: Top-k search over grid file. In: Proceedings of DATESO, pp. 115–126 (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.P. J. Šafárik University in KošiceKošiceSlovakia

Personalised recommendations