p2pDating: Real life inspired semantic overlay networks for Web search

Information Processing and Management

Volumn 43, Issue 3, 2007, Pages 643-664

  Parreira, Josiane Xavier ^a   Michel, Sebastian ^a   Weikum, Gerhard ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Distributed PageRank computation; Distributed Web search; P2P information systems; Semantic overlay networks

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION RETRIEVAL; NETWORK PROTOCOLS; SEMANTICS; WORLD WIDE WEB;

DISTRIBUTED PAGERANK COMPUTATION; DISTRIBUTED WEB SEARCH; P2P INFORMATION SYSTEMS; SEMANTIC OVERLAY NETWORKS;

SEARCH ENGINES;

EID: 33846544497     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipm.2006.09.007     Document Type: Article

References (45)

1. Aberer, K., Cudre-Mauroux, P., Hauswirth, M., & Pelt, T. V. (2004). Gridvine: Building internet-scale semantic overlay networks. Tech. rep., EPFL.
2. Aberer K., Punceva M., Hauswirth M., and Schmidt R. Improving data access in p2p systems. IEEE Internet Computing 6 1 (2002) 58-67
3. Bawa, M., Manku, G. S., & Raghavan, P. (2003). Sets: search enhanced by topic segmentation. In SIGIR, pp. 306-313.
4. Bender, M., Michel, S., Triantafillou, P., Weikum, G., & Zimmer, C. (2005). Improving collection selection with overlap awareness in p2p search engines. In SIGIR, pp. 67-74.
5. Bender, M., Michel, S., Weikum, G., & Zimmer, C. (2004). Bookmark-driven query routing in peer-to-peer Web search. In SIGIR workshop on P2P IR.
6. Bender, M., Michel, S., Weikum, G., & Zimmer, C. (2005). The Minerva project: Database selection in the context of P2P search. In BTW.
7. Bender, M., Michel, S., Weikum, G., & Zimmer, C. (2005). Minerva: Collaborative p2p search. In Proceedings of the VLDB conference (Demonstration).
8. Bloom B.H. Space/time trade-offs in hash coding with allowable errors. Communications of ACM 13 7 (1970) 422-426
9. Brin S., and Page L. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30 1-7 (1998) 107-117
10. Broder, A. Z. (1998). On the resemblance and containment of documents. In SEQS: Sequences '91.
11. Broder, A. Z., Charikar, M., Frieze, A. M., & Mitzenmacher, M. (1998). Min-wise independent permutations (extended abstract). In STOC, pp. 327-336.
12. Broder A.Z., Charikar M., Frieze A.M., and Mitzenmacher M. Min-wise independent permutations. Journal of Computer and System Sciences 60 3 (2000) 630-659
13. Buchmann, E., & Böhm, K. (2004). How to run experiments with large peer-to-peer data structures. In IPDPS, 2004.
14. Byers J.W., Considine J., Mitzenmacher M., and Rost S. Informed content delivery across adaptive overlay networks. IEEE/ACM Transactions on Networking 12 5 (2004) 767-780
15. Callan J. Distributed information retrieval, Advances in information retrieval (2000), Kluwer Academic Publishers pp. 127-150
16. Callan J., Lu Z., and Croft W.B. Searching distributed collections with inference networks. SIGIR (1995), ACM Press 21-28
17. Chernov, S., Serdyukov, P., Bender, M., Michel, S., Weikum, G., et al. (2005). Database selection and result merging in P2P Web search. In DBISP2P.
18. Crespo, A., & Garcia-Molina, H. (2002). Semantic overlay networks for p2p systems. Technical report, Computer Science Department, Stanford University, October.
19. Cuenca-Acuna, F. M., Peery, C., Martin, R. P., & Nguyen, T. D. (2002). PlanetP: Using gossiping to build content addressable peer-to-peer information sharing communities. Tech. Rep. DCS-TR-487, Rutgers University.
20. Fagin R. Combining fuzzy information from multiple systems. Journal of Computer and System Sciences 58 1 (1999) 83-99
21. Fagin, R., Kumar, R., & Sivakumar, D. (2003). Comparing top k lists. In SIAM discrete algorithms.
22. Fan L., Cao P., Almeida J.M., and Broder A.Z. Summary cache: a scalable wide-area Web cache sharing protocol. IEEE/ACM Transactions on Networking 8 3 (2000)
23. Flajolet P., and Martin G.N. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences 31 2 (1985) 182-209
24. Flake G.W., Lawrence S., Giles C.L., and Coetzee F. Self-organization of the Web and identification of communities. IEEE Computer 35 3 (2002) 66-71
25. Fuhr N. A decision-theoretic approach to database selection in networked IR. ACM Transactions on Information Systems 17 3 (1999) 229-249
26. Kullback S. Information theory and statistics (1959), Wiley, New York
27. Li, M., Lee, W.-C., & Sivasubramaniam, A. (2004). Semantic small world: an overlay network for peer-to-peer search. In ICNP, pp. 228-238.
28. Lu J., and Callan J. Content-based retrieval in hybrid peer-to-peer networks. Proceedings of CIKM (2003), ACM Press 199-206
29. Luxenburger, J., & Weikum, G. (2004). Query-log based authority analysis for Web information search. In WISE.
30. Michel, S., Bender, M., Triantafillou, P., & Weikum, G. (2006). IQN routing: integrating quality and novelty in p2p querying and ranking. In EDBT.
31. Mitzenmacher, M. (2002). Compressed bloom filters. In IEEE/ACM Transactions on Networking, 10(5), 604-612.
32. Ng, C., Sia, K., & King, I. (2003). Peer clustering and firework query model in the peer-to-peer network. Technical report, Chinese University of Hongkong, Department of Computer Science and Engineering.
33. Nottelmann H., and Fuhr N. Evaluating different methods of estimating retrieval quality for resource selection. SIGIR (2003), ACM Press 290-297
34. Parreira, J. X., & Weikum, G. (2005). JXP: global authority scores in a p2p network. In WebDB.
35. Ratnasamy S., Francis P., Handley M., Karp R., and Schenker S. A scalable content-addressable network. ACM SIGCOMM (2001), ACM Press 161-172
36. Reynolds, P., & Vahdat, A. (2003). Efficient peer-to-peer keyword searching. In Middleware, pp. 21-40.
37. Rowstron, A., & Druschel, P. (2001). Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware, pp. 329-350.
38. Sizov, S., Biwer, M., Graupmann, J., Siersdorfer, S., Theobald, M., Weikum, G., et al. (2003). The bingo! system for information portal generation and expert Web search, In CIDR.
39. Stoica I., Morris R., Karger D., Kaashoek M.F., and Balakrishnan H. Chord: a scalable peer-to-peer lookup service for internet applications. SIGCOMM (2001), ACM Press 149-160
40. Suel, T., Mathur, C., Wu, J., Zhang, J., Delis, A., Kharrazi, M., et al. (2003). Odissea: A peer-to-peer architecture for scalable Web search and information retrieval. Tech. rep., Polytechnic Univ.
41. Tang C., Xu Z., and Dwarkadas S. Peer-to-peer information retrieval using self-organizing semantic overlay networks. SIGCOMM (2003), ACM Press 175-186
42. Tempich C., Staab S., and Wranik A. REMINDIN': Semantic query routing in peer-to-peer networks based on social metaphors. WWW (2004), ACM, New York, USA
43. Triantafillou, P., Xiruhaki, C., Koubarakis, M., & Ntarmos, N. (2003). Towards high performance peer-to-peer content and resource sharing systems. In CIDR.
44. Wang J., Min R., Zhu Y., and Hu Y. Ucfs-a novel user-space, high performance, customized file system for Web proxy servers. IEEE Transactions on Computing 51 9 (2002) 1056-1073
45. Wang, Y., Galanis, L., & De Witt, D. J. (2003). Galanx: an efficient peer-to-peer search engine system. Available from http://www.cs.wisc.edu/~yuanwang.