Skip to main content
SpringerLink
Log in

R-Trees: A Dynamic Index Structure for Spatial Searching

  • Reference work entry
  • First Online:
Book cover Encyclopedia of GIS

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.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

References

  • Ang C-H, Tan TC (1997) New linear node splitting algorithm for r-trees. In: Proceedings of symposium on advances in spatial databases (SSD), Berlin, 15–18 July 1997, pp 339–349

    Google Scholar 

  • Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM management of data (SIGMOD), Atlantic City, 23–25 May 1990, pp 220–231

    Google Scholar 

  • Brakatsoulas S, Pfoser D, Theodoridis Y (2002) Revisiting r-tree construction principles. In: Proceedings of the East European conference on advances in databases and information systems, Bratislava, 8–11 Sept 2002, pp 149–162

    Google Scholar 

  • Driscoll JR, Sarnak N, Sleator DD, Tarjan RE (1989) Making data structures persistent. J Comput Syst Sci 38(1):86–124

    Article  MathSciNet  MATH  Google Scholar 

  • Faloutsos C, Kamel I (1994) Beyond uniformity and independence: analysis of r-trees using the concept of fractal dimension. In: Proceedings of ACM symposium on principles of database systems (PODS), Minneapolis, 24–26 May 1994, pp 4–13

    Google Scholar 

  • Faloutsos C, Sellis T, Roussopoulos N (1987) Analysis of object oriented spatial access methods. SIGMOD Rec 16(3):426–439

    Article  Google Scholar 

  • Garcia YJ, Lopez MA, Leutenegger ST (1998) On optimal node splitting for r-trees. In: Proceedings of very large data bases (VLDB), New York, 24–27 Aug 1998, pp 334–344

    Google Scholar 

  • Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM management of data (SIGMOD), Boston, 18–21 June 1984, pp 47–57

    Google Scholar 

  • Hadjieleftheriou M, Hoel E, Tsotras VJ (2004) Sail: a library for efficient application integration of spatial indices. In: Proceedings of scientific and statistical database management (SSDBM), Santorini Island, 21–23 2004, pp 135–138

    Google Scholar 

  • Hadjieleftheriou M, Kollios G, Tsotras VJ, Gunopulos D (2002) Efficient indexing of spatiotemporal objects. In: Proceedings of extending database technology (EDBT), Prague, 24–28 Mar 2002, pp 251–268

    Google Scholar 

  • Huang PW, Lin PL, Lin HY (2001) Optimizing storage utilization in r-tree dynamic index structure for spatial databases. J Syst Softw 55(3):291–299

    Article  Google Scholar 

  • Kamel I, Faloutsos C (1993) On packing r-trees. In: Proceedings of conference on information and knowledge management (CIKM), Washington, DC, 1–5 Nov 1993, pp 490–499

    Google Scholar 

  • Kamel I, Faloutsos C (1994) Hilbert r-tree: an improved r-tree using fractals. In: Proceedings of very large data bases (VLDB), Santiago de Chile, 12–15 Sept 1994, pp 500–509

    Google Scholar 

  • Kollios G, Tsotras VJ, Gunopulos D, Delis A, Hadjieleftheriou M (2001) Indexing animated objects using spatiotemporal access methods. IEEE Trans Knowl Data Eng (TKDE) 13(5):758–777

    Article  Google Scholar 

  • Kolovson C, Stonebraker M (1991) Segment indexes: dynamic indexing techniques for multi-dimensional interval data. In: Proceedings of ACM management of data (SIGMOD), Denver, 29–31 May 1991, pp 138–147

    Google Scholar 

  • Kumar A, Tsotras VJ, Faloutsos C (1998) Designing access methods for bitemporal databases. IEEE Trans Knowl Data Eng (TKDE) 10(1):1–20

    Article  Google Scholar 

  • Leutenegger ST, Edgington JM, Lopez MA (1997) Str: a simple and efficient algorithm for r-tree packing. In: Proceedings of international conference on data engineering (ICDE), Birmingham, 7–11 Apr 1997, pp 497–506

    Google Scholar 

  • Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y (2005) Rtrees: theory and applications. Springer

    Google Scholar 

  • Nanopoulos A, Vassilakopoulos M, Manolopoulos Y (2003) Performance evaluation of lazy deletion methods in r-trees. GeoInformatica 7(4):337–354

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Saltenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. SIGMOD Rec 29(2):331–342

    Article  Google Scholar 

  • Schreck T, Chen Z (2000) Branch grafting method for r-tree implementation. J Syst Softw 53(1):83–93

    Article  Google Scholar 

  • Sellis T, Roussopoulos N, Faloutsos C (1987) The r+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of very large data bases (VLDB), Brighton, pp 507–518

    Google Scholar 

  • Tao Y, Papadias D (2001) MV3R-Tree: a spatio-temporal access method for timestamp and interval queries. In: Proceedings of very large data bases (VLDB), Roma, pp 431–440

    Google Scholar 

  • Theodoridis Y (2003) The R-tree-portal

    Google Scholar 

  • Theodoridis Y, Sellis T (1996) A model for the prediction of r-tree performance. In: Proceedings of ACM symposium on principles of database systems (PODS), Montreal, pp 161–171

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Labs Inc., Florham Park, NJ, USA

    Marios Hadjieleftheriou

  2. Department of Informatics, Aristotle University, Thessaloniki, Greece

    Yannis Manolopoulos

  3. Department of Informatics, University of Piraeus, Piraeus, Greece

    Yannis Theodoridis

  4. University of California-Riverside, Riverside, CA, USA

    Vassilis J. Tsotras

Authors
  1. Marios Hadjieleftheriou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yannis Manolopoulos
    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

  4. Vassilis J. Tsotras
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vassilis J. Tsotras .

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, MN, USA

    Shashi Shekhar

  2. Management Science and Information Systems Department, Rutgers Business School, Rutgers, The State University of New Jersey, Newark, NJ, USA

    Hui Xiong

  3. Department of Management Sciences, Tippie College of Business, University of Iowa, Iowa City, IA, USA

    Xun Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Hadjieleftheriou, M., Manolopoulos, Y., Theodoridis, Y., Tsotras, V.J. (2017). R-Trees: A Dynamic Index Structure for Spatial Searching. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_1151

Download citation

Publish with us

Policies and ethics

Search

Navigation