{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:28Z","timestamp":1763467708653,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,8,15]],"date-time":"2005-08-15T00:00:00Z","timestamp":1124064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,8,15]]},"DOI":"10.1145\/1076034.1076049","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"67-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Improving collection selection with overlap awareness in P2P search engines"],"prefix":"10.1145","author":[{"given":"Matthias","family":"Bender","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Sebastian","family":"Michel","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Peter","family":"Triantafillou","sequence":"additional","affiliation":[{"name":"University of Patras, Rio, Greece"}]},{"given":"Gerhard","family":"Weikum","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Christian","family":"Zimmer","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2005,8,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/4236.978370"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2004.1302938"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633031"},{"key":"e_1_3_2_1_5_1","first-page":"127","volume-title":"Distributed information retrieval. Advances in information retrieval","author":"Callan J.","year":"2000","unstructured":"J. Callan . Distributed information retrieval. Advances in information retrieval , Kluwer Academic Publishers ., pages 127 -- 150 , 2000 . J. Callan. Distributed information retrieval. Advances in information retrieval, Kluwer Academic Publishers., pages 127--150, 2000."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/215206.215328"},{"key":"e_1_3_2_1_7_1","volume-title":"Morgan Kaufmann","author":"Chakrabarti S.","year":"2002","unstructured":"S. Chakrabarti . Mining the Web: Discovering Knowledge from Hypertext Data . Morgan Kaufmann , San Francisco , 2002 . S. Chakrabarti. Mining the Web: Discovering Knowledge from Hypertext Data. Morgan Kaufmann, San Francisco, 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1600"},{"key":"e_1_3_2_1_10_1","first-page":"216","volume-title":"The VLDB Journal","author":"Florescu D.","year":"1997","unstructured":"D. Florescu , D. Koller , and A. Y. Levy . Using probabilistic information in data integration . In The VLDB Journal , pages 216 -- 225 , 1997 . D. Florescu, D. Koller, and A. Y. Levy. Using probabilistic information in data integration. In The VLDB Journal, pages 216--225, 1997."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/314516.314517"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872790"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/502585.502655"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320252"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062902"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/502115.502116"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"e_1_3_2_1_18_1","first-page":"1097","volume-title":"VLDB","author":"Nie Z.","year":"2003","unstructured":"Z. Nie , S. Kambhampati , and T. Hernandez . Bibfinder\/statminer: Effectively mining and using coverage and overlap statistics in data integration . In VLDB , pages 1097 -- 1100 , 2003 . Z. Nie, S. Kambhampati, and T. Hernandez. Bibfinder\/statminer: Effectively mining and using coverage and overlap statistics in data integration. In VLDB, pages 1097--1100, 2003."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860489"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584856"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_24_1","volume-title":"Polytechnic Univ.","author":"Suel T.","year":"2003","unstructured":"T. Suel , C. Mathur , J. Wu , J. Zhang , A. Delis , M. Kharrazi , X. Long , and K. Shanmugasunderam . Odissea: A peer-to-peer architecture for scalable web search and information retrieval. Technical report , Polytechnic Univ. , 2003 . T. Suel, C. Mathur, J. Wu, J. Zhang, A. Delis, M. Kharrazi, X. Long, and K. Shanmugasunderam. Odissea: A peer-to-peer architecture for scalable web search and information retrieval. Technical report, Polytechnic Univ., 2003."},{"volume-title":"REtrieval Conference (TREC). http:\/\/trec.nist.gov\/.","key":"e_1_3_2_1_25_1","unstructured":"Text REtrieval Conference (TREC). http:\/\/trec.nist.gov\/. Text REtrieval Conference (TREC). http:\/\/trec.nist.gov\/."},{"key":"e_1_3_2_1_26_1","unstructured":"Y. Wang L. Galanis and D. J. de Witt. Galanx: An efficient peer-to-peer search engine system. Available at http:\/\/www.cs.wisc.edu\/~yuanwang.  Y. Wang L. Galanis and D. J. de Witt. Galanx: An efficient peer-to-peer search engine system. Available at http:\/\/www.cs.wisc.edu\/~yuanwang."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312687"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564393"}],"event":{"name":"SIGIR05: The 28th ACM\/SIGIR International Symposium on Information Retrieval 2005","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Salvador Brazil","acronym":"SIGIR05"},"container-title":["Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1076034.1076049","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1076034.1076049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:16Z","timestamp":1750262896000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1076034.1076049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8,15]]},"references-count":27,"alternative-id":["10.1145\/1076034.1076049","10.1145\/1076034"],"URL":"https:\/\/doi.org\/10.1145\/1076034.1076049","relation":{},"subject":[],"published":{"date-parts":[[2005,8,15]]},"assertion":[{"value":"2005-08-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}