New linear node splitting algorithm for R-trees

  • C. H. Ang
  • T. C. Tan
Spatial Access Methods

DOI: 10.1007/3-540-63238-7_38

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1262)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 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