{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T22:59:48Z","timestamp":1768085988798,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3,10]]},"DOI":"10.1145\/3701551.3703491","type":"proceedings-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T12:30:16Z","timestamp":1740573016000},"page":"79-87","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Maintaining\n            <i>k<\/i>\n            -MinHash Signatures over Fully-Dynamic Data Streams with Recovery"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9521-2457","authenticated-orcid":false,"given":"Andrea","family":"Clementi","sequence":"first","affiliation":[{"name":"Department of Enterprise Engineering, University of Rome 'Tor Vergata', Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6976-5579","authenticated-orcid":false,"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[{"name":"Department of Enterprise Engineering, University of Rome 'Tor Vergata', Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4432-6099","authenticated-orcid":false,"given":"Luca","family":"Pep\u00e8 Sciarria","sequence":"additional","affiliation":[{"name":"Department of Enterprise Engineering, University of Rome 'Tor Vergata', Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4543-786X","authenticated-orcid":false,"given":"Alessandro","family":"Straziota","sequence":"additional","affiliation":[{"name":"Department of Enterprise Engineering, University of Rome 'Tor Vergata', Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2025,3,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/553876"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108755528"},{"key":"e_1_3_2_1_4_1","first-page":"21","volume-title":"Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171)","author":"Broder Andrei Z","year":"1997","unstructured":"Andrei Z Broder. On the resemblance and containment of documents. In Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171), pages 21--29. IEEE, 1997."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45123-4_1"},{"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.1109\/TKDE.2019.2916858"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0188702"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_10_1","volume-title":"Luca Pep\u00e8 Sciarria, and Alessandro Straziota. Maintaining k-minhash signatures over fully-dynamic data streams with recovery","author":"Clementi Andrea","year":"2024","unstructured":"Andrea Clementi, Luciano Gual\u00e0, Luca Pep\u00e8 Sciarria, and Alessandro Straziota. Maintaining k-minhash signatures over fully-dynamic data streams with recovery, 2024."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2000.839448"},{"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","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","year":"2001","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, 2nd edition, 2001.","edition":"2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.67"},{"key":"e_1_3_2_1_15_1","first-page":"1037","volume-title":"2022 USENIX Annual Technical Conference (USENIX ATC 22)","author":"Elhemali Mostafa","year":"2022","unstructured":"Mostafa Elhemali, Niall Gallagher, Nick Gordon, Joseph Idziorek, Richard Krog, Colin Lazier, Erben Mo, Akhilesh Mritunjai, Somasundaram Perianayagam, Tim Rath, Swami Sivasubramanian, James Christopher Sorenson III, Sroaj Sosothikul, Doug Terry, and Akshat Vig. Amazon DynamoDB: A scalable, predictably performant, and fully managed NoSQL database service. In 2022 USENIX Annual Technical Conference (USENIX ATC 22), pages 1037--1048, Carlsbad, CA, July 2022. USENIX Association."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133041"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.09.005"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a014"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00172"},{"key":"e_1_3_2_1_22_1","volume-title":"Journal of Research in Science and Engineering","author":"Kathare Nikita","year":"2022","unstructured":"Nikita Kathare, O. Vinati Reddy, and Dr. Vishalakshi Prabhu. A comprehensive study of elastic search. Journal of Research in Science and Engineering, 2022."},{"key":"e_1_3_2_1_23_1","volume-title":"Information retrieval on the web. ACM computing surveys (CSUR), 32(2):144--173","author":"Kobayashi Mei","year":"2000","unstructured":"Mei Kobayashi and Koichi Takeda. Information retrieval on the web. ACM computing surveys (CSUR), 32(2):144--173, 2000."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1146372"},{"key":"e_1_3_2_1_25_1","first-page":"11","article-title":"Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters","volume":"6","author":"Leskovec Jure","year":"2008","unstructured":"Jure Leskovec, Kevin Lang, Anirban Dasgupta, and Michael Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6, 11 2008.","journal-title":"Internet Mathematics"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108684163"},{"key":"e_1_3_2_1_27_1","volume-title":"Advances in Neural Information Processing Systems","author":"Li Ping","year":"2012","unstructured":"Ping Li, Art Owen, and Cun-hui Zhang. One permutation hashing. In F. Pereira, C.J. Burges, L. Bottou, and K.Q. Weinberger, editors, Advances in Neural Information Processing Systems, volume 25. Curran Associates, Inc., 2012."},{"key":"e_1_3_2_1_28_1","first-page":"1","volume-title":"Usenix winter","author":"Udi Manber","year":"1994","unstructured":"Udi Manber et al. Finding similar files in a large file system. In Usenix winter, volume 94, pages 1--10, 1994."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775059"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645374"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1108\/13287260080000756"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-46994-7_15"},{"key":"e_1_3_2_1_33_1","volume-title":"Algorithms for massive data -- lecture notes","author":"Prezza Nicola","year":"2024","unstructured":"Nicola Prezza. Algorithms for massive data -- lecture notes, 2024."},{"key":"e_1_3_2_1_34_1","volume-title":"The power of simple tabulation hashing. J. ACM, 59(3), jun","author":"Pundefinedtrascu Mihai","year":"2012","unstructured":"Mihai Pundefinedtrascu and Mikkel Thorup. The power of simple tabulation hashing. J. ACM, 59(3), jun 2012."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0606031"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488655"},{"key":"e_1_3_2_1_37_1","article-title":"Multiresolution odd sketch for mining extended jaccard similarity of dynamic streaming sets","author":"Xiao Qingjun","year":"2023","unstructured":"Qingjun Xiao, Shiwei Yang, Panpan Li, Kangying Li, and Lin Wen. Multiresolution odd sketch for mining extended jaccard similarity of dynamic streaming sets. IEEE Transactions on Network Science and Engineering, pages 1--15, 2023.","journal-title":"IEEE Transactions on Network Science and Engineering, pages 1--15"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2350190.2350193"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-1990-13203"}],"event":{"name":"WSDM '25: The Eighteenth ACM International Conference on Web Search and Data Mining","location":"Hannover Germany","acronym":"WSDM '25","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"]},"container-title":["Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703491","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701551.3703491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T09:06:47Z","timestamp":1755767207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,10]]},"references-count":39,"alternative-id":["10.1145\/3701551.3703491","10.1145\/3701551"],"URL":"https:\/\/doi.org\/10.1145\/3701551.3703491","relation":{},"subject":[],"published":{"date-parts":[[2025,3,10]]},"assertion":[{"value":"2025-03-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}