{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:58:17Z","timestamp":1755838697915,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["614331"],"award-info":[{"award-number":["614331"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3196959.3196985","type":"proceedings-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T12:26:14Z","timestamp":1526387174000},"page":"63-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Set Similarity Search for Skewed Data"],"prefix":"10.1145","author":[{"given":"Samuel","family":"McCauley","sequence":"first","affiliation":[{"name":"BARC and IT U. Copenhagen, Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper W.","family":"Mikkelsen","sequence":"additional","affiliation":[{"name":"IT U. Copenhagen, Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rasmus","family":"Pagh","sequence":"additional","affiliation":[{"name":"BARC and IT U. Copenhagen, Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.12"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902285"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.57"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.18"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2969239.2969376"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634150"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039690"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746553"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164206"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2601748"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884437"},{"key":"e_1_3_2_1_13_1","first-page":"21","volume-title":"Proc. Compression and Complexity of Sequences","author":"Broder A. Z.","year":"1997","unstructured":"A. Z. Broder . On the resemblance and containment of documents . In Proc. Compression and Complexity of Sequences , pages 21 -- 29 . IEEE, 1997 . A. Z. Broder. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences, pages 21--29. IEEE, 1997."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"issue":"1","key":"e_1_3_2_1_16_1","first-page":"43","article-title":"A survey of binary similarity and distance measures","volume":"8","author":"Choi S.","year":"2010","unstructured":"S. Choi , S. Cha , and C. C. Tappert . A survey of binary similarity and distance measures . J. Syst. Cybern. Informatics , 8 ( 1 ): 43 -- 48 , 2010 . S. Choi, S. Cha, and C. C. Tappert. A survey of binary similarity and distance measures. J. Syst. Cybern. Informatics, 8(1):43--48, 2010.","journal-title":"J. Syst. Cybern. Informatics"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039689"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055443"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00120"},{"key":"e_1_3_2_1_20_1","first-page":"317","volume-title":"Proc. 26th Conference on Learning Theory (COLT)","author":"Dasgupta S.","year":"2013","unstructured":"S. Dasgupta and K. Sinha . Randomized partition trees for exact nearest neighbor search . In Proc. 26th Conference on Learning Theory (COLT) , pages 317 -- 337 , 2013 . S. Dasgupta and K. Sinha. Randomized partition trees for exact nearest neighbor search. In Proc. 26th Conference on Learning Theory (COLT), pages 317--337, 2013."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9885-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056110"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2457317.2457382"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745761"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884525"},{"key":"e_1_3_2_1_27_1","first-page":"1","volume-title":"Proc. 24th European Symposium on Algorithms (ESA)","author":"Karppa M.","year":"2016","unstructured":"M. Karppa , P. Kaski , J. Kohonen , and P. \u00d3. Cath\u00e1in . Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time . In Proc. 24th European Symposium on Algorithms (ESA) , pages 52: 1 -- 52 :17, 2016 . M. Karppa, P. Kaski, J. Kohonen, and P. \u00d3. Cath\u00e1in. Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time. In Proc. 24th European Symposium on Algorithms (ESA), pages 52:1--52:17, 2016."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2017.7966218"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220359"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/2947618.2947620"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_78"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.82"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/93335.93363"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339677"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2969033.2969086"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741285"},{"key":"e_1_3_2_1_40_1","first-page":"812","volume-title":"Proc. 31st Conference on Uncertainty in Artificial Intelligence (UAI)","author":"Shrivastava A.","year":"2015","unstructured":"A. Shrivastava and P. Li . Improved asymmetric locality sensitive hashing (ALSH) for maximum inner product search (MIPS) . In Proc. 31st Conference on Uncertainty in Artificial Intelligence (UAI) , pages 812 -- 821 , 2015 . A. Shrivastava and P. Li. Improved asymmetric locality sensitive hashing (ALSH) for maximum inner product search (MIPS). In Proc. 31st Conference on Uncertainty in Artificial Intelligence (UAI), pages 812--821, 2015."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747647"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2728167"},{"key":"e_1_3_2_1_43_1","first-page":"629","volume-title":"Proc. 7th National Conference on Artificial Intelligence (AAAI)","author":"Valiant L. G.","year":"1988","unstructured":"L. G. Valiant . Functionality in neural nets . In Proc. 7th National Conference on Artificial Intelligence (AAAI) , pages 629 -- 634 , 1988 . L. G. Valiant. Functionality in neural nets. In Proc. 7th National Conference on Artificial Intelligence (AAAI), pages 629--634, 1988."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213847"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098003"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Houston TX USA","acronym":"SIGMOD\/PODS '18"},"container-title":["Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196959.3196985","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196959.3196985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:35Z","timestamp":1750208915000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196959.3196985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":46,"alternative-id":["10.1145\/3196959.3196985","10.1145\/3196959"],"URL":"https:\/\/doi.org\/10.1145\/3196959.3196985","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}