Associative search in peer to peer networks: Harnessing latent semantics

Computer Networks

Volumn 51, Issue 8, 2007, Pages 1861-1881

  Cohen, Edith ^a   Fiat, Amos ^b   Kaplan, Haim ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Information retrieval; Latent semantic; Networks; Peer to peer; Rare items; Search

Indexed keywords

ALGORITHMS; INFORMATION RETRIEVAL; QUERY LANGUAGES; SEMANTICS; SOFTWARE ARCHITECTURE;

ASSOCIATIVE SEARCH; FILE-SHARING NETWORKS; LATENT SEMANTICS; RARE ITEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33947317570     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2006.09.014     Document Type: Article

References (52)

1. E. Cohen, A. Fiat, H. Kaplan, Associative search in peer to peer networks: harnessing latent semantics, in: INFOCOM, 2003.
2. Napster Inc. The napster homepage. In http://www.napster.com/, 2001.
3. Q. Lv, P. Cao, E. Cohen, K. Li, S. Shenker, Search and replication in unstructured peer-to-peer networks, in: Proceedings of the 16th Annual ACM International Conference on Supercomputing, 2002.
4. Risson J., and Moors T. Survey of research towards robust peer-to-peer networks: search methods. Computer Networks 50 17 (2006) 3485-3521
5. Lua K., Crowcroft J., Pias M., Sharma R., and Lim S. A survey and comparison of peer-to-peer overlay network schemes. Communications Surveys & Tutorials (2005), IEEE
6. Gnutella. Available from: .
7. FastTrack Peer-to-Peer technology company. FastTrack. Available from: , 2001.
8. Morpheus file sharing system. Morpheus. Available from: , 2002.
9. KaZaA file sharing network. KaZaA. Available from: , 2002.
10. I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for internet applications, in: SIGCOMM, 2001.
11. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in: SIGCOMM, 2001.
12. A. Rowstron, P. Druschel, Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility, in: Proceedings of SOSP'01, 2001.
13. B.Y. Zhao, J. Kubiatowicz, A. Joseph, Tapestry: an infrastructure for fault-tolerant wide-area location and routing, Technical Report UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department, 2001.
14. Open Source Community, The free network project - rewiring the internet. Available from: , 2001.
15. A. Fiat, J. Saia, Censorship resistant peer-to-peer content addressable networks, in ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 94-103.
16. A. Crespo, H. Garcia-Molina, Routing indices for peer-to-peer systems, in: ICDE, 2002.
17. S. Joseph, Neurogrid: semantically routing queries in peer-to-peer networks, in: Proceedings of the International Workshop on Peer-to-Peer Computing, 2002.
18. Cooper B.F., and Garcia-Molina H. Sil: A model for analyzing scalable peer-to-peer search networks. Computer Networks 50 13 (2006) 2380-2400
19. E. Cohen, S. Shenker, Replication strategies in unstructured peer-to-peer networks, in: SIGCOMM, 2002.
20. Deerwester S., Dumais S.T., Furnas G.W., Landauer T.K., and Harshman R. Indexing by latent semantic indexing. Journal of the American Society for Information Science 41 6 (1990) 391-407
21. Kleinberg J.M. Authoritative sources in a hyperlinked environment. Journal of the ACM 46 5 (1999) 604-632
22. S. Brin, L. Page, The anatomy of a large-scale hypertextual web search engine, in: Proceedings of the WWW7 Conference, 1998.
23. D. Achlioptas, A. Fiat, A. Karlin, F. McSherry, Spectral analysis of data, in: Symposium on Theoretical Computer Science, 2001, pp. 619-626.
24. R. Agrawal, T. Imielinski, A.N. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993, pp. 207-216.
25. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: VLDB'94: Proceedings of 20th International Conference on Very Large Data Bases, 1994, pp. 487-499.
26. ACM SIGGROUP resource page on collaborative filtering. Available from: .
27. Goldberg D., Nichols D., Oki B.M., and Terry D. Using collaborative filtering to weave an information tapestry. Communications of the ACM 35 12 (1992) 51-60
28. S.R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins, Recommendation systems: a probabilistic analysis, in: Symposium on Foundations of Computer Science, 1998, pp. 664-673.
29. Y. Azar, A. Fiat, A.R. Karlin, F. McSherry, J. Saia, Web search through hub synthesis, in: Symposium on Foundations of Computer Science, 2001, pp. 500-509.
30. Cohen E., Datar M., Fujiwara S., Gionis A., Indyk P., Motwani R., Ullman J.D., and Yang C. Finding interesting associations without support pruning. Knowledge and Data Engineering 13 1 (2001) 64-78
31. K. Sripanidkulchai, B.M. Maggs, H. Zhang, Efficient content location using interest-based locality in peer-to-peer systems, in: INFOCOM, 2003.
32. Sripanidkulchai K., Maggs B., and Zhang H. Enabling efficient content location and retrieval in peer-to-peer systems by exploiting locality in interests. ACM SIGCOMM Computer Communication Review 32 1 (2002)
33. R. Ahmed, R. Boutaba, Distributed pattern matching for P2P systems, in: IEEE/IFIP Network Operations & Management Symposium, 2006.
34. R. Zhang, Y.C. Hu, Assisted peer-to-peer search with partial indexing, in: INFOCOM, 2005.
35. Tang C., Xu Z., and Mahalingam M. pSearch: information retrieval in structured overlays. Computer Communication Review 33 1 (2003) 89-94
36. M. Bender, S. Michel, P. Triantafillou, G. Weikum, C. Zimmer, Minerva: collaborative p2p search, in: VLDB'05: Proceedings of the 31st international conference on Very Large Data bases, VLDB Endowment, 2005, pp. 1263-1266.
37. Bawa M., Manku G.S., and Raghavan P. Sets: search enhanced by topic segmentation. SIGIR'03: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2003), ACM Press, New York, NY, USA 306-313
38. Y. Zhu, X. Yang, Y. Hu, Making search efficient on gnutella-like p2p systems, in: IPDPS, 2005.
39. W. Acosta, S. Chandra, Unstructured peer-to-peer networks - next generation of performance and reliability, in: INFOCOM, 2005.
40. Chakrabarti S., Dom B., Gibson D., Kumar R., Raghavan P., Rajagopalan S., and Tomkins A. Topic Distillation and Spectral Filtering. Artificial Intelligence Review 13 5-6 (1999) 409-435
41. Chakrabarti S., Dom B., Raghavan P., Rajagopalan S., Gibson D., and Kleinberg J. Automatic resource compilation by analyzing hyperlink structure and associated text. Computer Networks and ISDN Systems 30 1-7 (1998) 65-74
42. Chakrabarti S., Dom B., Gibson D., Kleinberg J., Kumar S.R., Raghavan P., Rajagopalan S., and Tomkins A. Hypersearching the web. Scientific American (1999) June
43. K. Bharat, M.R. Henzinger, Improved algorithms for topic distillation in a hyperlinked environment, in: Research and Development in Information Retrieval, 1998, pp. 104-111.
44. T. Hofmann, Probabilistic latent semantic indexing, in: Research and Development in Information Retrieval, 1999, pp. 50-57.
45. Dean J., and Henzinger M.R. Finding related pages in the world wide web. WWW8/Computer Networks 31 11-16 (1999) 1467-1479
46. S.R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins. Extracting large-scale knowledge bases from the Web, in: VLDB'99: Proceedings of 25th International Conference on Very Large Data Bases, 1999, pp. 639-650.
47. Bar-Noy A., Bellare M., Halldórss on M.M., Shachnai H., and Tamir T. On chromatic sums and distributed resource allocation. Information and Computation 140 2 (1998) 183-202
48. Bar-Noy A., Halldórsson M.M., and Kortsarz G. A matched approximation bound for the sum of a greedy coloring. Information Processing Letters 71 3-4 (1999) 35-140
49. U. Feige, L. Lovász, P. Tetali, Approximating min-sum set cover, in: International Workshop on Approximation Algorithms for Combinatorial Optimization, 2002, pp. 94-107.
50. E. Cohen, A. Fiat, H. Kaplan. Efficient sequences of trials, in: ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 737-746.
51. E. Cohen, A. Fiat, H. Kaplan, Efficient sequences of trials, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 2003.
52. Web traces and logs. Available from: .