{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:58Z","timestamp":1750221358316,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T00:00:00Z","timestamp":1517529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Microsoft","award":["Microsoft Azure for Research Award"],"award-info":[{"award-number":["Microsoft Azure for Research Award"]}]},{"name":"Google","award":["Google Focused Award on Web Algorithmics for Large-scale Data An"],"award-info":[{"award-number":["Google Focused Award on Web Algorithmics for Large-scale Data An"]}]},{"name":"Deutsche Forschungsgemeinschaft","award":["SFB 876 A2"],"award-info":[{"award-number":["SFB 876 A2"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,2,2]]},"DOI":"10.1145\/3159652.3159694","type":"proceedings-article","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T18:12:23Z","timestamp":1517940743000},"page":"72-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Sketch 'Em All"],"prefix":"10.1145","author":[{"given":"Marc","family":"Bury","sequence":"first","affiliation":[{"name":"TU Dortmund, Dortmund, Germany"}]},{"given":"Chris","family":"Schwiegelshohn","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}]},{"given":"Mara","family":"Sorella","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2018,2,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.126"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_41"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2015.06.001"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. SEQUENCES. IEEE Computer Society","author":"Broder A. Z.","year":"1997","unstructured":"A. Z. Broder . 1997 . On the Resemblance and Containment of Documents . In Proc. SEQUENCES. IEEE Computer Society , Washington, DC, USA, 21--. A. Z. Broder. 1997. On the Resemblance and Containment of Documents. In Proc. SEQUENCES. IEEE Computer Society, Washington, DC, USA, 21--."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/647819.736184"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816813"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a030"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908981"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254926"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281133"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646511.695324"},{"volume-title":"Proc. ACM-SIAM SODA. 57--66","author":"Feigenblat G.","key":"e_1_3_2_1_15_1","unstructured":"G. Feigenblat , E. Porat , and A. Shiftan . 2011. Exponential Time Improvement for min-wise Based Algorithms . In Proc. ACM-SIAM SODA. 57--66 . G. Feigenblat, E. Porat, and A. Shiftan. 2011. Exponential Time Improvement for min-wise Based Algorithms. In Proc. ACM-SIAM SODA. 57--66."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1131"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"J. Leskovec A. Rajaraman and J. D. Ullman. 2014. Mining of Massive Datasets 2nd Ed. Cambridge University Press.   J. Leskovec A. Rajaraman and J. D. Ullman. 2014. Mining of Massive Datasets 2nd Ed. Cambridge University Press.","DOI":"10.1017\/CBO9781139924801"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978542.1978566"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000791.2000795"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/110827831"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594554"},{"volume-title":"Proc ACM-SIAM SODA. 209--228","author":"Patrascu M.","key":"e_1_3_2_1_26_1","unstructured":"M. Patrascu and M. Thorup . 2013. Twisted Tabulation Hashing . In Proc ACM-SIAM SODA. 209--228 . M. Patrascu and M. Thorup. 2013. Twisted Tabulation Hashing. In Proc ACM-SIAM SODA. 209--228."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716317"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556270"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488655"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.18"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/100800774"}],"event":{"name":"WSDM 2018: The Eleventh 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":"Marina Del Rey CA USA","acronym":"WSDM 2018"},"container-title":["Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3159652.3159694","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3159652.3159694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:12Z","timestamp":1750213572000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3159652.3159694"}},"subtitle":["Fast Approximate Similarity Search for Dynamic Data Streams"],"short-title":[],"issued":{"date-parts":[[2018,2,2]]},"references-count":30,"alternative-id":["10.1145\/3159652.3159694","10.1145\/3159652"],"URL":"https:\/\/doi.org\/10.1145\/3159652.3159694","relation":{},"subject":[],"published":{"date-parts":[[2018,2,2]]},"assertion":[{"value":"2018-02-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}