Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/99563
Title: New linear node splitting algorithm for R-trees
Authors: Ang, C.H. 
Tan, T.C. 
Issue Date: 1997
Source: Ang, C.H.,Tan, T.C. (1997). New linear node splitting algorithm for R-trees. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1262 LNCS : 339-349. ScholarBank@NUS Repository.
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.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/99563
ISBN: 3540632387
ISSN: 03029743
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

25
checked on Feb 16, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.