Please use this identifier to cite or link to this item:
|Title:||New linear node splitting algorithm for R-trees|
|Authors:||Ang, C.H. |
|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)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.