A Framework for Supporting Tree-Like Indexes on the Chord Overlay |
| |
| Authors: | Ming-Dong Zhu De-Rong Shen Kou Yue Tie-Zheng Nie Ge Yu |
| |
| Affiliation: | 1. College of Information Science and Engineering, Northeastern University, Shenyang, 110004, China
|
| |
| Abstract: | With the explosive growth of data, to support efficient data management including queries and updates, the database system is expected to provide tree-like indexes, such as R-tree, M-tree, B+-tree, according to different types of data. In the distributed environment, the indexes have to be scattered across the compute nodes to improve reliability and scalability. Indexes can speed up queries, but they incur maintenance cost when updates occur. In the distributed environment, each compute node maintains a subset of an index tree, so keeping the communication cost small is more crucial, or else it occupies lots of network bandwidth and the scalability and availability of the database system are affected. Further, to achieve the reliability and scalability for queries, several replicas of the index are needed, but keeping the replicas consistent is not straightforward. In this paper, we propose a framework supporting tree-like indexes, based on Chord overlay, which is a popular P2P structure. The framework dynamically tunes the number of replicas of index to balance the query cost and the update cost. Several techniques are designed to improve the efficiency of updates without the cost of performance of the queries. We implement M-tree and R-tree in our framework, and extensive experiments on real- life and synthetic datasets verify the efficiency and scalability of our framework. |
| |
| Keywords: | tree-like index Chord distributed algorithm |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
