RSR-tree: A Dynamic Multi-dimensional Index Structure
|
| Title | RSR-tree: A Dynamic Multi-dimensional Index Structure |
| Authors | |
| Abstract | A new dynamic multi-dimensional index structure called RSR-tree is proposed, in which splitting operations of leaf nodes and non-leaf nodes are performed separatively. RSR-tree retains the sequence ordering of index records in a leaf node of RS-tree and thus reduces the addressing time cost of disk access while reading data files. In addition, it integrates the characteristic of reducing the overlap between brother nodes of R-tree to reduce the query time. The accuracy test and parameter sensitivity test are done on different data sets and the experimental results show that RSR-tree is a dynamic multi-dimensional structure which can efficiently improve query performance and does not bring extra cost of creating index at the same time. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2011-12-01 |
| Source | Journal of Computers Vol 6, No 12 (2011): Special Issue: Selected Best Papers of ICFMD2010 |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |