Randomized algorithms
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Search Performance Analysis in Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Multimedia Systems
Efficient Semantic-Based Content Search in P2P Network
IEEE Transactions on Knowledge and Data Engineering
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Fast hash table lookup using extended bloom filter: an aid to network processing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
User modeling for full-text federated search in peer-to-peer networks
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing
IEEE Transactions on Parallel and Distributed Systems
Hybrid global-local indexing for effcient peer-to-peer information retrieval
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Full-text federated search in peer-to-peer networks
Full-text federated search in peer-to-peer networks
Efficient multi-keyword search over p2p web
Proceedings of the 17th international conference on World Wide Web
Difficulty-Aware Hybrid Search in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Federated search of text-based digital libraries in hierarchical peer-to-peer networks
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
| Hi-index | 0.00 |
Efficient and effective full-text retrieval in unstructured peer-to-peer networks remains a challenge in the research community. First, it is difficult, if not impossible, for unstructured P2P search protocols to effectively locate items with guaranteed recall rate. Second, existing schemes to improve search successful rate often rely on replicating a large number of item replicas across the wide area network, incurring a large amount of communication and storage cost. In this paper we propose BloomCast, an efficient and effective full-text retrieval scheme, in unstructured P2P networks. BloomCast is effective because it guarantees perfect recall rate with high probability. It is efficient because the overall communication cost of full-text search is reduced below a formal bound. Furthermore, by casting Bloom Filters instead of the raw documents across the network, BloomCast significantly reduces the communication cost and storage cost for replication. We demonstrate the power of BloomCast design through both mathematical proof and comprehensive simulations. Results show that BloomCast outperforms existing schemes in terms of both recall rate and communication cost.