Skip to main content
SpringerLink
Log in

New linear node splitting algorithm for R-trees

  • Spatial Access Methods
  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1997)

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

Included in the following conference series:

Abstract

A new linear-time node splitting algorithm for R-trees is proposed. Compared with the node splitting algorithm that requires quadratic time and is used in most implementations of R-tree, it is more superior in terms of the time required to split a node, the distribution of data after splitting, as well as the area of overlapping. Most important of all, it has a better query performance. The claim is substantiated by an analysis of the algorithm and a set of empirical results.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger: The R *-tree: An efficient and robust access method for points and rectangles. Proc. of the SIGMOD Conference, Atlantic City, NJ. (May 1990) 322–331

    Google Scholar 

  2. D. Greene: An implementation and performance analysis of spatial data access methods. Proc. of the 5th International Conference on Data Engineering. (1989) 606–615

    Google Scholar 

  3. Antonin Guttman: R-tree: A Dynamic Index Structure for Spatial Searching. Proc. of the SIGMOD Conference, Boston. (June 1984) 47–57

    Google Scholar 

  4. Ibrahim Kamel and Christos Faloutsos: Hilbert R-tree: An improved R-tree Using Fractals. Proc. of the 20th VLDB Conference, Santiago, Chile. (May 1994) 500–508

    Google Scholar 

  5. Hanan Samet: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1989)

    Google Scholar 

  6. T. Sellis, N. Roussopoulos, and C. Faloutsos: The R+-tree: A dynamic index for multi-dimensional objects. Proc. of 13th VLDB Conference, England, (1987) 507–518. Also available as Computer Science TR 1795, University of Maryland, College Park, MD (1987)

    Google Scholar 

  7. M. Stonebraker, T. Sellis, and E. Hanson: An Analysis of rule indexing implementations in data base systems. Proc. of the First International Conference on Expert Database Systems, Charleston, SC. (April 1986) 353–364

    Google Scholar 

  8. Ching-Der Tung, Wen-Chi Hou, and Jiang-Hsing Chu: Multi-Priority Tree: An Index Structure for Spatial Data. Proc. of 1994 International Computer Symposium. (1994) 1285–1290

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems & Computer Science, National University of Singapore, 119260, Republic of Singapore

    C. H. Ang & T. C. Tan

Authors
  1. C. H. Ang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. C. Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Scholl Agnès Voisard

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ang, C.H., Tan, T.C. (1997). New linear node splitting algorithm for R-trees. In: Scholl, M., Voisard, A. (eds) Advances in Spatial Databases. SSD 1997. Lecture Notes in Computer Science, vol 1262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63238-7_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-63238-7_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63238-2

  • Online ISBN: 978-3-540-69240-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation