A Balanced Multiway Search Tree for Multi-Dimension Searching

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3574-3578

Citation:

Online since:

December 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A. Guttman: Proc ACM SIGMOD Int Conf on Management of Data (1984).

Google Scholar

[2] T. Sellis, N. Roussopoulos, C. Faloutsos: Proc of the 13th VLDB (1987).

Google Scholar

[3] N. Beckmann, H.P. Kriegel: Proc ACM SIGMOD Int Conf on Management of Data (1990).

Google Scholar

[4] A.G. Li, Z.H. Zhang: Proc of Int Conf on Information Engineering and Computer Science(2009).

Google Scholar

[5] H.K. Ahn, N. Mamoulis, H.M. Wong: Technical Report UU-CS-2001-14 (2001).

Google Scholar