{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T14:11:32Z","timestamp":1792159892493,"version":"4.4.0"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,4]]},"abstract":"<jats:p>\n            This work proposes\n            <jats:italic>V-SMART-Join<\/jats:italic>\n            , a scalable MapReduce-based framework for discovering all pairs of similar entities. The\n            <jats:italic>V-SMART-Join<\/jats:italic>\n            framework is applicable to sets, multisets, and vectors.\n            <jats:italic>V-SMART-Join<\/jats:italic>\n            is motivated by the observed skew in the underlying distributions of Internet traffic, and is a family of 2-stage algorithms, where the first stage computes and joins the partial results, and the second stage computes the similarity exactly for all candidate pairs. The\n            <jats:italic>V-SMART-Join<\/jats:italic>\n            algorithms are very efficient and scalable in the number of entities, as well as their cardinalities. They were up to 30 times faster than the state of the art algorithm,\n            <jats:italic>VCL<\/jats:italic>\n            , when compared on a real dataset of a small size. We also established the scalability of the proposed algorithms by running them on a dataset of a realistic size, on which\n            <jats:italic>VCL<\/jats:italic>\n            never succeeded to finish. Experiments were run using real datasets of IPs and cookies, where each IP is represented as a multiset of cookies, and the goal is to discover similar IPs to identify Internet proxies.\n          <\/jats:p>","DOI":"10.14778\/2212351.2212353","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"704-715","source":"Crossref","is-referenced-by-count":118,"title":["V-SMART-join"],"prefix":"10.14778","volume":"5","author":[{"given":"Ahmed","family":"Metwally","sequence":"first","affiliation":[{"name":"Google, Inc., Mountain View, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"SCS, Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,4]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Apache Hadoop. http:\/\/hadoop.apache.org.  Apache Hadoop. http:\/\/hadoop.apache.org."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164206"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.70"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_2_1_5_1","first-page":"21","volume-title":"Proceedings of the IEEE SEQUENCES Compression and Complexity of Sequences","author":"Broder A.","year":"1997"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/283554.283370"},{"issue":"4","key":"e_1_2_1_7_1","first-page":"300","article-title":"Comprehensive Survey on Distance\/Similarity Measures between Probability Density Functions","volume":"1","author":"Cha S.-H.","year":"2007","journal-title":"International Journal of Mathematical Models and Methods in Applied Sciences"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(01)00118-2"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_2_1_11_1","first-page":"137","volume-title":"Proceedings of the 6th USENIX OSDI Symposium on Operating System Design and Implementation","author":"Dean J.","year":"2004"},{"key":"e_1_2_1_12_1","unstructured":"eHarmony Dating Site. http:\/\/www.eharmony.com.  eHarmony Dating Site. http:\/\/www.eharmony.com."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1557690.1557767"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"issue":"3","key":"e_1_2_1_15_1","first-page":"419","volume":"70","author":"Gibbs A.","year":"2002","journal-title":"On Choosing and Bounding Probability Metrics. The International Statistical Review"},{"key":"e_1_2_1_16_1","first-page":"505","volume-title":"Proceedings of the 16th WWW International Conference on World Wide Web","author":"Grauman K.","year":"2006"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148222"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2007.30"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855013"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242606"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454161"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020452"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/962135"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.72"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/938978.939133"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557101"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"R. Stanley. Enumerative Combinatorics volume 1. Cambridge University Press 2002.   R. Stanley. Enumerative Combinatorics volume 1. Cambridge University Press 2002.","DOI":"10.1007\/978-1-4615-9763-6_1"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807222"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"},{"key":"e_1_2_1_35_1","first-page":"1","volume-title":"Proceedings of the 8th USENIX OSDI Conference on Operating Systems Design and Implementation","author":"Yu Y.","year":"2008"},{"key":"e_1_2_1_36_1","first-page":"663","volume-title":"Proceedings of the 22nd AAAI National Conference on Artificial Intelligence","author":"Zhang H.","year":"2007"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2212351.2212353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:34:44Z","timestamp":1672220084000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2212351.2212353"}},"subtitle":["a scalable mapreduce framework for all-pair similarity joins of multisets and vectors"],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":36,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["10.14778\/2212351.2212353"],"URL":"https:\/\/doi.org\/10.14778\/2212351.2212353","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}