Abstract
Structured peer-to-peer (P2P) systems are creating a large proportion of network traffic in today’s Internet. Peer-to-peer systems enable access to data spread over an extremely large number of machines. A P2P system typically involves thousands or millions of live peers in the network. Multi-dimensional data indexing has received much attention in a centralized database.
In this paper, we propose and evaluate a multi-dimensional searching scheme in structured P2P networks. We present the design and implementation of a peer-to-peer index service for high dimensional data that is capable of handling complex queries. We design a VibIndex scheme in structured P2P overlay networks. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to search efficiently.
Publisher
Trans Tech Publications, Ltd.
Subject
Mechanical Engineering,Mechanics of Materials,General Materials Science
Reference9 articles.
1. Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang Towards a Scalable Peer-to-Peer Index Service for High Dimensional Data.
2. H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu, Rong Zhang, Aoying Zhou A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes.
3. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, (1994).
4. J. Aspnes and G. Shah. Skip Graphs. In Proceedings of Symposium on Discrete Algorithms, (2003).
5. B. Awerbuch and C. Scheideler. Peer-to-peer systems for Prefix Search. In Proceedings of the Symposium on Principles of Distributed Computing, (2003).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献