{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:29Z","timestamp":1763468129611,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,4]],"date-time":"2013-02-04T00:00:00Z","timestamp":1359936000000},"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":[[2013,2,4]]},"DOI":"10.1145\/2433396.2433422","type":"proceedings-article","created":{"date-parts":[[2013,2,5]],"date-time":"2013-02-05T13:19:52Z","timestamp":1360070392000},"page":"203-212","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Optimizing parallel algorithms for all pairs similarity search"],"prefix":"10.1145","author":[{"given":"Maha Ahmed","family":"Alabduljalil","sequence":"first","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}]},{"given":"Xun","family":"Tang","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}]},{"given":"Tao","family":"Yang","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,2,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164206"},{"key":"e_1_3_2_1_3_1","unstructured":"Language Technologies Institute at Carnegie Mellon University. The clueweb09 dataset http:\/\/boston.lti.cs.cmu.edu\/data\/clueweb09.  Language Technologies Institute at Carnegie Mellon University. The clueweb09 dataset http:\/\/boston.lti.cs.cmu.edu\/data\/clueweb09."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2009.52"},{"key":"e_1_3_2_1_5_1","volume-title":"International Conference on Information Knowledge Engineering","author":"Awekar Amit","year":"2010","unstructured":"Amit Awekar and Nagiza F. Samatova . Parallel all pairs similarity search . In International Conference on Information Knowledge Engineering , 2010 . Amit Awekar and Nagiza F. Samatova. Parallel all pairs similarity search. In International Conference on Information Knowledge Engineering, 2010."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/553876"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.70"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506311"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of OSDI","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat . Mapreduce : simplified data processing on large clusters . In Proc. of OSDI 2004 . Jeffrey Dean and Sanjay Ghemawat. Mapreduce: simplified data processing on large clusters. In Proc. of OSDI 2004."},{"key":"e_1_3_2_1_11_1","volume-title":"No free lunch: Brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity","author":"Ferhan Jimmy Lin","year":"2011","unstructured":"Jimmy Lin Ferhan Ture1, Tamer Elsayed2. No free lunch: Brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity . 2011 . Jimmy Lin Ferhan Ture1, Tamer Elsayed2. No free lunch: Brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity. 2011."},{"key":"e_1_3_2_1_12_1","volume-title":"VLDB","author":"Gionis Aristides","year":"1999","unstructured":"Aristides Gionis , Piotr Indyk , and Rajeev Motwani . Similarity search in high dimensions via hashing . In VLDB , 1999 . Aristides Gionis, Piotr Indyk, and Rajeev Motwani. Similarity search in high dimensions via hashing. In VLDB, 1999."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835520"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341560"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014127"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571970"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242606"},{"key":"e_1_3_2_1_18_1","volume-title":"8th Workshop on LargeScale Distributed Systems for Information Retrieval (2010)","author":"Francisci Morales Gianmarco De","year":"2010","unstructured":"Gianmarco De Francisci Morales , Claudio Lucchese , and Ranieri Baraglia . Scaling out all pairs similarity search with mapreduce . In 8th Workshop on LargeScale Distributed Systems for Information Retrieval (2010) , 2010 . Gianmarco De Francisci Morales, Claudio Lucchese, and Ranieri Baraglia. Scaling out all pairs similarity search with mapreduce. In 8th Workshop on LargeScale Distributed Systems for Information Retrieval (2010), 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135834"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/576628"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/226931.226961"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807222"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187980.2187992"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"event":{"name":"WSDM 2013: Sixth 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":"Rome Italy","acronym":"WSDM 2013"},"container-title":["Proceedings of the sixth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433422","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2433396.2433422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:11Z","timestamp":1750277651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,4]]},"references-count":25,"alternative-id":["10.1145\/2433396.2433422","10.1145\/2433396"],"URL":"https:\/\/doi.org\/10.1145\/2433396.2433422","relation":{},"subject":[],"published":{"date-parts":[[2013,2,4]]},"assertion":[{"value":"2013-02-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}