Paper Info
Title
New Linear Node Splitting Algorithm for R-trees
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.
Year
DOI
Venue
1997
10.1007/3-540-63238-7_38
SSD
Keywords
Field
DocType
new linear node splitting,linear time
Spatial analysis,Computer science,Linear algorithm,Algorithm,Spatial representation,Time complexity,Query formulation
Conference
Volume
ISSN
ISBN
1262
0302-9743
3-540-63238-7
Citations 
PageRank 
References 
26
2.98
7
Authors
2
Name
Order
Citations
PageRank
Chuan-heng Ang18012.00
T. C. Tan2263.32