Discovering and exploiting keyword and attribute-value co-occurrences to improve P2P routing indices

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2006, Pages 172-181

  Michel, Sebastian ^a   Bender, Matthias ^a   Ntarmos, Nikos ^b   Triantafillou, Peter ^b   Weikum, Gerhard ^a   Zimmer, Christian ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

Distributed IR; Key co occurrences; Peer to peer information systems; Query routing

Indexed keywords

INFORMATION SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES; SCALABILITY; STATISTICS; WORLD WIDE WEB;

DISTRIBUTED IR; KEY CO-OCCURRENCES; KEYWORDS; PEER-TO-PEER INFORMATION SYSTEMS; QUERY ROUTING;

NETWORK ROUTING;

EID: 34547637575     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183614.1183643     Document Type: Conference Paper

References (43)

1. K. Aberer. P-Grid: A self-organizing access structure for P2P information systems. In CoopIS, 2001.
2. K. Aberer and P. Cudré-Mauroux. Semantic overlay networks. In VLDB, 2005.
3. K. Aberer, F. Klemm, T. Luu, I. Podnar, and M. Rajman. Building a peer-to-peer full-text Web search engine with highly discriminative keys. Technical report, EPFL (LSIR), 2005.
4. D. Agrawal, A. E. Abbadi, and S. Suri. Attribute-based access to distributed data over p2p networks. In DNIS, 2005.
5. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In SIGMOD, 1993.
6. M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. Improving collection selection with overlap awareness in p2p search engines. In SIGIR, 2005.
7. M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. Minerva: collaborative p2p search. In VLDB, 2005.
8. M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. P2p content search: Give the web back to the people. In IPTPS, 2006.
9. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7), 1970.
10. A. Broder. On the resemblance and containment of documents. In SEQS, 1997.
11. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. Journal of Computer and System Sciences, 60(3), 2000.
12. J. Callan. Distributed information retrieval. Advances in information retrieval, Kluwer Academic Publishers., 2000.
13. J. P. Callan, Z. Lu, and W. B. Croft. Searching distributed collections with inference networks. In SIGIR, 1995.
14. E. Cohen, A. Fiat, and H. Kaplan. Associative search in peer to peer networks: Harnessing latent semantics. In INFOCOM, 2003.
15. G. Cormode and M. N. Garofalakis. Sketching streams through the net: Distributed approximate query tracking. In VLDB, 2005.
16. A. Crespo and H. Garcia-Molina. Semantic overlay networks for p2p systems. In AP2PC, 2004.
17. P. Druschel and A. Rowstron. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Middleware, 2001.
18. M. Durand and P. Flajolet. Loglog counting of large cardinalities. In ESA, 2003.
19. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing iceberg queries efficiently. In VLDB, 1998.
20. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2), 1985.
21. N. Fuhr. A decision-theoretic approach to database selection in networked IR. ACM Transactions on Information Systems, 17(3), 1999.
22. J. Han and M. Kamber. Data Mining Concepts and Techniques. Morgan Kaufman, 2001.
23. T. Hernandez and S. Kambhampati. Improving text collection selection with coverage and overlap statistics, poster at WWW 2005.
24. R. Huebsch, B. N. Chun, J. M. Hellerstein, B. T. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, and A. R. Yumerefendi. The architecture of pier: an internet-scale query processor. In CIDR, 2005.
25. M. Jelasity, W. Kowalczyk, and M. van Steen. An approach to massively distributed aggregate computing on peer-to-peer networks. In PDP, 2004.
26. M. Jelasity, A. Montresor, and O. Babaoglu. Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst., 23(3):219-252, 2005.
27. P. Kalnis, W. S. Ng, B. C. Ooi, and K.-L. Tan. Answering similarity queries in peer-to-peer networks. Inf. Syst., 31(1), 2006.
28. R. M. Karp, C. Schindelhauer, S. Shenker, and B. Voecking. Randomized rumor spreading. In FOCS, 2000.
29. W. Litwin and M.-A. Neimat. k-rp*s: A scalable distributed data structure for high-performance multi-attribute access. In PDIS, 1996.
30. J. Lu and J. P. Callan. Content-based retrieval in hybrid peer-to-peer networks. In CIKM, 2003.
31. V. Markl, N. Megiddo, M. Kutsch, T. M. Tran, P. J. Haas, and U. Srivastava. Consistently estimating the selectivity of conjuncts of predicates. In VLDB, 2005.
32. W. Meng, C. T. Yu, and K.-L. Liu. Building efficient and effective metasearch engines. A CM Computing Surveys, 34(1):48-89, 2002.
33. S. Michel, M. Bender, P. Triantafillou, and G. Weikum. IQN Routing: Integrating quality and novelty for web search. In EDBT, 2006.
34. S. Ratnasamy, et al. A scalable content-addressable network. In SIGCOMM, 2001.
35. L. Si, R. Jin, J. P. Callan, and P. Ogilvie. A language modeling framework for resource selection and results merging. In CIKM, 2002.
36. K. Sripanidkulchai, B. M. Maggs, and H. Zhang. Efficient content location using interest-based locality in peer-to-peer systems. In INFOCOM, 2003.
37. I. Stoica, et al. Chord: A scalable Peer-To-Peer lookup service for internet applications. In SIGCOMM, 2001.
38. Text REtrieval Conference (TREC). http://trec.nist.gov/.
39. P. Triantafillou, C. Xiruhaki, M. Koubarakis, and N. Ntarmos. Towards high performance peer-to-peer content and resource sharing systems. In CIDR, 2003.
40. S. Voulgaris, A.-M. Kermarrec, L. Massoulié, and M. van Steen. Exploiting semantic proximity in peer-to-peer content searching. In FTDCS, 2004.
41. L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer, Feb. 2004.
42. B. Yang, P. Vinograd, and H. Garcia-Molina. Evaluating guess and non-forwarding peer-to-peer search. In ICDCS, 2004.
43. J. Zhang and T. Suel. Efficient query evaluation on large textual collections in a peer-to-peer environment. In Peer-to-Peer Computing, 2005.