跳到主要导航 跳到搜索 跳到主要内容

VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peer-to-Peer systems. In this paper, we propose a new Peer-to-Peer framework based on a balanced tree structure overlay, which can support extensible centralized mapping methods and query processing based on a variety of multidimensional tree structures, including R-Tree, X-Tree, SS-Tree, and M-Tree. Specifically, in a network with N nodes, our framework guarantees that point queries and range queries can be answered within O(logN) hops. We also provide an effective load balancing strategy to allow nodes to balance their work load efficiently. An experimental assessment validates the practicality of our proposal.

源语言英语
主期刊名Proceedings of the 22nd International Conference on Data Engineering, ICDE '06
出版商IEEE Computer Society
25-34
页数10
ISBN(印刷版)0769525709, 9780769525709
DOI
出版状态已出版 - 2006
已对外发布
活动22nd International Conference on Data Engineering, ICDE '06 - Atlanta, GA, 美国
期限: 3 4月 20067 4月 2006

出版系列

姓名Proceedings - International Conference on Data Engineering
2006
ISSN(印刷版)1084-4627

会议

会议22nd International Conference on Data Engineering, ICDE '06
国家/地区美国
Atlanta, GA
时期3/04/067/04/06

指纹

探究 'VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes' 的科研主题。它们共同构成独一无二的指纹。

引用此