BloomCast: Efficient and effective full-text retrieval in unstructured P2P networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 23, Issue 2, 2012, Pages 232-241

  Chen, Hanhua ^a   Jin, Hai ^a   Luo, Xucheng ^b   Liu, Yunhao ^c,d   Gu, Tao ^e   Chen, Kaiji ^e   Ni, Lionel ^d,f  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

^c TSINGHUA UNIVERSITY   (China)

^d HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^e UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^f SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Bloom Filter; Peer to peer systems; replication

Indexed keywords

BLOOM FILTERS; COMMUNICATION COST; DATA COLLECTION; HYBRID P2P; MATHEMATICAL PROOF; P2P NETWORK; PEER-TO-PEER SYSTEM; QUERY LOGS; QUERY-RECALL; REPLICATION; RESEARCH COMMUNITIES; STORAGE COSTS; UNSTRUCTURED P2P; UNSTRUCTURED P2P NETWORK; UNSTRUCTURED PEER-TO-PEER NETWORK;

BLOOMS (METAL); COMMUNICATION; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION RETRIEVAL; SEARCH ENGINES; WIDE AREA NETWORKS;

PEER TO PEER NETWORKS;

EID: 84855386699     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2011.168     Document Type: Article

References (27)

1. D. Li, J. Cao, X. Lu, and K. Chen, "Efficient Range Query Processing in Peer-to-Peer Systems," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 1, pp. 78-91, Jan. 2008.
2. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM '01, pp. 149-160, 2001. (Pubitemid 32981961)
3. E. Cohen and S. Shenker, "Replication Strategies in Unstructured Peer-to-Peer Networks," Proc. ACM SIGCOMM '02. pp. 177-190, 2002. (Pubitemid 43843783)
4. R.A. Ferreira, M.K. Ramanathan, A. Awan, A. Grama, and S. Jagannathan, "Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks," Proc. IEEE Fifth Int'l Conf. Peer to Peer Computing (P2P '05), pp. 165-172, 2005. (Pubitemid 44883107)
5. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood, "Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing," Proc. ACM SIGCOMM, 2005.
6. C. Tang and S. Dwarkadas, "Hybrid Global-Local Indexing for Effcient Peer-to-Peer Information Retrieval," Proc. First Conf. Symp. Networked Systems Design and Implementation (NSDI '04), p. 16, 2004.
7. S. Robertson, "Understanding Inverse Document Frequency: On Theoretical Arguments for IDF," J. Documentation, vol. 60, pp. 503-520, 2004. (Pubitemid 39538229)
8. P. Reynolds and A. Vahdat, "Efficient Peer-to-Peer Keyword Searching," Proc. ACM/IFIP/USENIX 2003 Int'l Conf. Middleware (Middleware '03), pp. 21-40, 2003.
9. F.M. Cuenca-Acuna, C. Peery, R.P. Martin, and T.D. Nguyen, "Planetp: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities," Proc. 12th IEEE Int'l Symp. High Performance Distributed Computing (HPDC '03), pp. 236-246, 2003.
10. H. Shen, Y. Shu, and B. Yu, "Efficient Semantic-Based Content Search in P2P Network," IEEE Trans. Knowledge and Data Eng., vol. 16, no. 7, pp. 813-826, July 2004.
11. H. Shen and C. Xu, "Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 849-862, June 2007. (Pubitemid 46767745)
12. K. Sripanidkulchai, B. Maggs, and H. Zhang, "Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems," Proc. IEEE INFOCOM '03, 2003.
13. M. Li, W.-C. Lee, A. Sivasubramaniam, and J. Zhao, "SSW: A Small-World-Based Overlay for Peer-to-Peer Search," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 6, pp. 735-749, June 2008. (Pubitemid 351712181)
14. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, "A Scalable Content-Addressable Network," Proc. ACM SIGCOMM '01, pp. 161-172, 2001. (Pubitemid 32981962)
15. G.S. Manku, "Routing Networks for Distributed Hash Tables," Proc. ACM 22nd Ann. Symp. Principles of Distributed Computing (PODC '03), pp. 133-142, 2003.
16. V. King and J. Saia, "Choosing a Random Peer," Proc. ACM 23rd Ann. Symp. Principles of Distributed Computing (PODC '04), pp. 125-130, 2004.
17. B.H. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Comm. the ACM, vol. 13, no. 7, pp. 422-426, 1971.
18. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network Topology Generators: Degree-Based vs. Structural," Proc. ACM SIGCOMM '02, pp. 147-159, 2002. (Pubitemid 43843781)
19. A. Medina, A. Lakhina, I. Matta, and J.W. Byers, "BRITE: An Approach to Universal Topology Generation," Proc. Ninth Int'l Symp. Modeling, Analysis and Simulation of Computer and Telecomm. Systems, (MASCOTS '01), 2001.
20. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella-Like P2P Systems Scalable," Proc. ACM SIGCOMM '03, pp. 407-418, 2003.
21. C. Huang, J. Li, and W. Ross, "Can Internet Video-on-Demand Be Profitable?," Proc. ACM SIGCOMM, 2007.
22. S. Saroiu, P.K. Gummadi, and S.D. Gribble, "A Measurement Study of Peer-to-Peer File Sharing Systems," Proc. Multimedia Computing and Networking (MMCN '02), pp. 156-170, 2002. (Pubitemid 35229649)
23. J.P.C. Jie Lu, "Content-Based Retrieval in Hybrid Peer-to-Peer Networks," Proc. 12th Int'l Conf. Information and Knowledge Management (CIKM), pp. 199-206, 2003.
24. E.M. Voorhees, "Overview of Trec-2009," Proc. 16th Text REtrieval Conf. (TREC-11), 2009.
25. A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," Internet Math., vol. 1, no. 4, pp. 485-509, 2004.
26. X. Tang, J. Xu, and W. Lee, "Analysis of TTL-Based Consistency in Unstructured Peer-to-Peer Networks," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 12, pp. 1683-1694, Dec. 2008.
27. N.F. Huang, R. Liu, C.H. Chen, Y.T. Chen, and L.W. Huang, "A Fast Url Lookup Engine for Content-Aware Multi-Gigabit Switches," Proc. 19th Int'l Conf. Advanced Information Networking and Applications (AINA), 2005.