{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:25Z","timestamp":1750307605273,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,9]],"date-time":"2011-02-09T00:00:00Z","timestamp":1297209600000},"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":[[2011,2,9]]},"DOI":"10.1145\/1935826.1935860","type":"proceedings-article","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T15:50:27Z","timestamp":1296575427000},"page":"157-166","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["KMV-peer"],"prefix":"10.1145","author":[{"given":"Yosi","family":"Mass","sequence":"first","affiliation":[{"name":"IBM Haifa Research Lab and The Hebrew University, Jerusalem, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[{"name":"The Hebrew University, Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Shmueli-Scheuer","sequence":"additional","affiliation":[{"name":"IBM Haifa Research Lab, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,2,9]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646009"},{"key":"e_1_3_2_2_2_1","first-page":"1","volume-title":"RANDOM","author":"Bar-Yossef Z.","year":"2002","unstructured":"Z. Bar-Yossef , T. S. Jayram , R. Kumar , D. Sivakumar , and L. Trevisan . Counting distinct elements in a data stream . In RANDOM , pages 1 -- 10 , 2002 . Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In RANDOM, pages 1--10, 2002."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1196112"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01722-3","volume-title":"The datacenter as a computer -- an introduction to the design of warehouse-scale machines","author":"Barroso L. A.","year":"2009","unstructured":"L. A. Barroso and U. H\u00f6lzle . The datacenter as a computer -- an introduction to the design of warehouse-scale machines . 2009 . L. A. Barroso and U. H\u00f6lzle. The datacenter as a computer -- an introduction to the design of warehouse-scale machines. 2009."},{"key":"e_1_3_2_2_5_1","first-page":"125","volume-title":"BTW","author":"Bender M.","year":"2005","unstructured":"M. Bender , S. Michel , G. Weikum , and C. Zimmer . The minerva project: Database selection in the context of p2p search . In BTW , pages 125 -- 144 , 2005 . M. Bender, S. Michel, G. Weikum, and C. Zimmer. The minerva project: Database selection in the context of p2p search. In BTW, pages 125--144, 2005."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247504"},{"key":"e_1_3_2_2_7_1","first-page":"127","volume-title":"Advances in information retrieval","author":"Callan J.","year":"2000","unstructured":"J. Callan . Distributed information retrieval . In Advances in information retrieval , pages 127 -- 150 , 2000 . J. Callan. Distributed information retrieval. In Advances in information retrieval, pages 127--150, 2000."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011798"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/822087.823421"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273221.1273233"},{"key":"e_1_3_2_2_13_1","first-page":"3","article-title":"Sorting and searching","author":"Knuth D. E.","year":"1973","unstructured":"D. E. Knuth . Sorting and searching . The Art of Computer Programming , 3 , 1973 . D. E. Knuth. Sorting and searching. The Art of Computer Programming, 3, 1973.","journal-title":"The Art of Computer Programming"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148229"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646281"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871682"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183643"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2008.34"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368968"},{"key":"e_1_3_2_2_20_1","volume-title":"TREC","author":"Robertson S. E.","year":"1994","unstructured":"S. E. Robertson , S. Walker , S. Jones , M. Hancock-Beaulieu , and M. Gatford . Okapi at trec-3 . In TREC , 1994 . S. E. Robertson, S. Walker, S. Jones, M. Hancock-Beaulieu, and M. Gatford. Okapi at trec-3. In TREC, 1994."},{"key":"e_1_3_2_2_21_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems","author":"Rowstron A.","year":"2001","unstructured":"A. Rowstron and P. Druschel . Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems . In Lecture Notes in Computer Science , pages 329 -- 350 , 2001 . A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Lecture Notes in Computer Science, pages 329--350, 2001."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763653.1763674"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860490"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2008.03.006"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277857"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1459693.1459723"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390390"}],"event":{"name":"WSDM'11: Fourth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Hong Kong China","acronym":"WSDM'11"},"container-title":["Proceedings of the fourth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935860","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1935826.1935860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:33Z","timestamp":1750250733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935860"}},"subtitle":["a robust and adaptive peer-selection algorithm"],"short-title":[],"issued":{"date-parts":[[2011,2,9]]},"references-count":28,"alternative-id":["10.1145\/1935826.1935860","10.1145\/1935826"],"URL":"https:\/\/doi.org\/10.1145\/1935826.1935860","relation":{},"subject":[],"published":{"date-parts":[[2011,2,9]]},"assertion":[{"value":"2011-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}