Skip to main content
SpringerLink
Log in

R-Tree (and Family)

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Database Systems

  • 58 Accesses

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 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Beckmann N, Kriegel HP, Seeger B. The R.*-tree: an efficient and robust method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1990. p. 322–31.

    Google Scholar 

  2. Berchtold S, Keim DA, Kriegel HP. The X-tree: an index structure for high-dimensional data. In: Proceedings of 22nd International Conference on Very Large Data Bases; 1996. p. 28–39.

    Google Scholar 

  3. Chen L, Choubey R, Rundensteiner EA. Bulk-insertions into R-trees using the small-tree-large-tree approach. In: Proceedings of 6th International Symposium on Advances in Geographic Information Systems; 1998. p. 161–2.

    Google Scholar 

  4. Choubey R, Chen L, Rundensteiner EA. GBI – a generalized R-tree bulk-insertion strategy. In: Proceedings of 6th International Symposium on Advances in Spatial Databases; 1999. p. 91–108.

    Chapter  Google Scholar 

  5. Faloutsos C. Searching multimedia databases by content. Dordecht: Kluwer; 1996.

    Book  MATH  Google Scholar 

  6. Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1984. p. 47–57.

    Google Scholar 

  7. Kamel I, Faloutsos C. On packing R-trees. In: Proceedings of the 2nd International Conference on Information and Knowledge Management; 1993. p. 490–9.

    Google Scholar 

  8. Kamel I, Faloutsos C. Hilbert R-tree – an improved R-tree using fractals. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 500–9.

    Google Scholar 

  9. Leutenegger S, Edgington JM, Lopez MA. STR – a simple and efficient algorithm for R-tree packing. In: Proceedings of the 13th International Conference on Data Engineering; 1997. p. 497–506.

    Google Scholar 

  10. Lin K, Jagadish HV, Faloutsos C. The TV-tree: an index structure for high-dimensional data. VLDB J. 1994;3(4):517–42.

    Article  Google Scholar 

  11. Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y. R-trees: theory and applications. Berlin: Springer; 2006.

    Book  MATH  Google Scholar 

  12. du Mouza C, Litwin W, Rigaux P. SD-Rtree: a scalable distributed R-tree. In: Proceedings of the 23rd International Conference on Data Engineering; 2007. p. 296–305.

    Google Scholar 

  13. Roussopoulos N, Leifker D. Direct spatial search on pictorial databases using packed R-trees. ACM SIGMOD Rec. 1985;14(4):17–31.

    Article  Google Scholar 

  14. Sakurai Y, Yoshikawa M, Uemura S, Kojima H. Spatial indexing of high-dimensional data based on relative approximation. VLDB J. 2002;11(2):93–108.

    Article  Google Scholar 

  15. Sellis T, Roussopoulos N, Faloutsos C. The R+-tree: a dynamic index for multidimensional objects. In: Proceedings of the 13th International Conference on Very Large Data Bases; 1987. p. 507–18.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aristotle University of Thessaloniki, Thessaloniki, Greece

    Apostolos N. Papadopoulos

  2. University of Almeria, Almeria, Spain

    Antonio Corral

  3. Aristotle University, Thessaloniki, Greece

    Alexandros Nanopoulos

  4. University of Piraeus, Piraeus, Greece

    Yannis Theodoridis

Authors
  1. Apostolos N. Papadopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonio Corral
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexandros Nanopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yannis Theodoridis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Apostolos N. Papadopoulos or Antonio Corral .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. Dept. of Computer Science and Eng., Hong Kong Univ. of Science and Technology, Kowloon, Hong Kong, Hong Kong SAR

    Dimitris Papadias

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Papadopoulos, A.N., Corral, A., Nanopoulos, A., Theodoridis, Y. (2018). R-Tree (and Family). In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_300

Download citation

Publish with us

Policies and ethics

Search

Navigation