New linear node splitting algorithm for R-trees

  • C. H. Ang
  • T. C. Tan
Spatial Access Methods
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1262)


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.


Point Query Linear Algorithm Node Access Window Query Containment Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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–331Google Scholar
  2. 2.
    D. Greene: An implementation and performance analysis of spatial data access methods. Proc. of the 5th International Conference on Data Engineering. (1989) 606–615Google Scholar
  3. 3.
    Antonin Guttman: R-tree: A Dynamic Index Structure for Spatial Searching. Proc. of the SIGMOD Conference, Boston. (June 1984) 47–57Google Scholar
  4. 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–508Google Scholar
  5. 5.
    Hanan Samet: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1989)Google Scholar
  6. 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. 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–364Google Scholar
  8. 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–1290Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • C. H. Ang
    • 1
  • T. C. Tan
    • 1
  1. 1.Department of Information Systems & Computer ScienceNational University of SingaporeRepublic of Singapore

Personalised recommendations