Query performance for tightly coupled distributed digital libraries
Proceedings of the third ACM conference on Digital libraries
A vector space model for automatic indexing
Communications of the ACM
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Comparing Hybrid Peer-to-Peer Systems
Proceedings of the 27th International Conference on Very Large Data Bases
Peer-to-Peer Caching Schemes to Address Flash Crowds
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Connectivity Based Node Clustering in Decentralized Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
BiChord: an improved approach for lookup routing in chord
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
As a scalable alternative to traditional server-based architecture, peer-to-peer (P2P) computing has become a popular distributed computing paradigm. However, efficient content search is absent, which hinders the wider deployment of the peer-to-peer systems. Earlier peer-to-peer systems such as Napster and Gnutella suffer from unscalability. Structured peer-to-peer networks achieve good scalability and high reliability, and yet they can only support a single-key based lookup instead of content search by means of DHTs (Distributed Hash Tables). In this paper, we propose a text-based peer-to-peer content search solution, which uses a hierarchical architecture. The heterogeneity of the popularity of terms both in documents and queries and the heterogeneity of hosts are both examined herein. There some techniques are employed to cope with the troubles arising from these heterogeneities. The experimental results show that the solution is feasible and efficient.