A Balanced Multiway Search Tree for Multi-Dimension Searching

Abstract:

Article Preview

A new multi-dimensional index structure called RSR-tree is proposed, which based on RS-tree. In RSR-tree, index records of a leaf node are split to ensure the sequence ordering of index records in a leaf node, which reduces the addressing cost of I/O operations effectively when reading data files. The entries of a non-leaf node are split to decreases the overlap between the brother nodes, which reduces effectively the time of reading data from data files. Experimental results on different data sets show that compared to RS-tree, RSR-tree has better comprehensive performance, in regard to tree building and querying. The querying performance is increased and extra cost is not produced.

Info:

Periodical:

Edited by:

Ran Chen

Pages:

3574-3578

DOI:

10.4028/www.scientific.net/AMM.44-47.3574

Citation:

A. G. Li et al., "A Balanced Multiway Search Tree for Multi-Dimension Searching", Applied Mechanics and Materials, Vols. 44-47, pp. 3574-3578, 2011

Online since:

December 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.