Skip to main content
SpringerLink
Log in

Revisiting R-Tree Construction Principles

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2435))

Abstract

Spatial indexing is a we researched field that benefited computer science with many outstanding results. Our effort in this paper can be seen as revisiting some outstanding contributions to spatial indexing, questioning some paradigms, and designing an access method with globally improved performance characteristics. In particular, we argue that dynamic R-tree construction is a typical clustering problem which can be addressed by incorporating existing clustering algorithms. As a working example, we adopt the well-known k-means algorithm. Further, we study the effect of relaxing the “two-way” split procedure and propose a “multi-way” split, which inherently is supported by clustering tech- niques. We compare our clustering approach to two prominent examples of spatial access methods, the R- and the R*-tree.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.R. Anderberg. Cluster Analysis for Applications. Academic Press, 1973.

    Google Scholar 

  2. B. Becker, P.G. Franciosa, S. Gschwind, S. Leonardi, T. Ohler, and P. Widmayer. Enclosing aset of objects by two minimum arearectangles. Journal of Algorithms 21:520–541, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  3. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree:an efficient and robust access method for points and rectangles. In Proceedings ACM SIGMOD Conference pages 322–331, 1990.

    Google Scholar 

  4. S. Brakatsoulas, D. Pfoser, and Y. Theodoridis. Revisiting R-tree construction principles. Technical report, Computer Technology Institute, Patras, Greece, 2002. http://dias.cti.gr/~pfoser/clustering.pdf

    Google Scholar 

  5. R. Choubey, L. Chen, and E.A. Rundensteiner. GBI: A generalized R-tree bulk-insertion strategy. In Proceedings SSD Symposium, pages 91–108, 1999.

    Google Scholar 

  6. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121–127, 1979.

    Article  MATH  Google Scholar 

  7. V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys 30(2):381–399, 1998.

    Article  Google Scholar 

  8. Y.J. Garcia, M.A. Lopez, and S.T. Leutenegger. On optimal node splitting for R-trees. In Proceedings 24th VLDB Conference, pages 334–344, 1998.

    Google Scholar 

  9. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings ACM SIGMOD Conference, pages 47–57, 1984.

    Google Scholar 

  10. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2001.

    Google Scholar 

  11. J. Hellerstein, J. Naughton, and A. Pfeffer. Generalized search trees for database systems. In Proceedings 21st VLDB Conference, pages 562–573, 1995.

    Google Scholar 

  12. A.K. Jain, M.N. Murty, and P.J. Flynn. Data clustering: A review. ACM Computting Surveys, 31(3):264–323, 1999.

    Article  Google Scholar 

  13. L. Kaufman and P. Rousseeuw. Finding Groups in Data: an Introduction to Cluster Analysis. Wiley, 1990.

    Google Scholar 

  14. S. Leutenegger, M. Lopez, and J. Edgington. STR: A simple and efficient algorithm for R-tree packing. In Proceedings 12th IEEE ICDE Conference, pages 497–506, 1997.

    Google Scholar 

  15. G. Milligan and M. Cooper. An examination of procedures for determining the number of clusters in a dataset. Psychometrica 50(2):159–179, 1985.

    Article  Google Scholar 

  16. J. O’Rourke. Computational Geometry in C. Cambridge University Press, second edition, 1998.

    Google Scholar 

  17. B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer. Towards an analysis of range query performance. In Proceedings 12th ACM PODS Symposium, 1993.

    Google Scholar 

  18. D. Pfoser, C.S. Jensen, and Y. Theodoridis. Novel approaches to the indexing of moving object trajectories. In Proceedings 26th VLDB Conference, pages 395–406, 2000.

    Google Scholar 

  19. S. Guha, R. Rastogi, and K. Shim. CURE: an efficient clustering algorithm for arge databases. In Proceedings ACM SIGMOD Conference, pages 73–84, 1998.

    Google Scholar 

  20. S. Theodoridis and K. Koutroumbas. Pattern Recognition. Academic Press, 1999.

    Google Scholar 

  21. Y. Theodoridis and T. Sellis. Optimization issues in R-tree construction. In Proceedings International Workshop on Geographic Information Systems, pages 270–273, 1994.

    Google Scholar 

  22. Y. Theodoridis and T. Sellis. A mode for the prediction of r-tree performance. In Proceedings 15th ACM PODS Symposium, pages 161–171, 1996.

    Google Scholar 

  23. Leejay Wu and C. Faloutsos. Fracdim. Web site, 2001. URL: http://www.andrew.cmu.edu/~lw2j/downloads.html current as of Sept.30, 2001.

  24. T. Zhang, R. Ramakrishnan, and M. Linvy. An efficient data clustering method for very large databases. In Proceedings ACM SIGMOD Conference, pages 103–11, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Technology Institute, P.O. Box 1122, GR-26110, Patras, Hellas

    Sotiris Brakatsoulas, Dieter Pfoser & Yannis Theodoridis

Authors
  1. Sotiris Brakatsoulas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dieter Pfoser
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yannis Theodoridis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Aristotle University, 54006, Thessaloniki, Greece

    Yannis Manolopoulos

  2. Department of Computer Science and Engineering, Slovak University of Technology, Ilkovicova 3, 81219, Bratislava, Slovakia

    Pavol Návrat

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brakatsoulas, S., Pfoser, D., Theodoridis, Y. (2002). Revisiting R-Tree Construction Principles. In: Manolopoulos, Y., Návrat, P. (eds) Advances in Databases and Information Systems. ADBIS 2002. Lecture Notes in Computer Science, vol 2435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45710-0_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45710-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44138-0

  • Online ISBN: 978-3-540-45710-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation