{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:00:01Z","timestamp":1783008001990,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":67,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union's Horizon 2020 research and innovation program","award":["742754"],"award-info":[{"award-number":["742754"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3375395.3387643","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T15:10:29Z","timestamp":1590765029000},"page":"49-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["The Adversarial Robustness of Sampling"],"prefix":"10.1145","author":[{"given":"Omri","family":"Ben-Eliezer","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eylon","family":"Yogev","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Spencer","author":"Alon Noga","year":"2016","unstructured":"Noga Alon and Joel H . Spencer . 2016 . The Probabilistic Method 4th ed.). Wiley Publishing . Noga Alon and Joel H. Spencer. 2016. The Probabilistic Method 4th ed.). Wiley Publishing."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240239"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387658"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40994-3_25"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.07.023"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.07.007"},{"key":"e_1_3_2_1_7_1","volume-title":"The discrepancy method - randomness and complexity","author":"Chazelle Bernard","unstructured":"Bernard Chazelle . 2001. The discrepancy method - randomness and complexity . Cambridge University Press . Bernard Chazelle. 2001. The discrepancy method - randomness and complexity .Cambridge University Press."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00042"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129115"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2518679"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021819599600023X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/10079817X"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases, VLDB. 13--24","author":"Cormode Graham","unstructured":"Graham Cormode and Minos N. Garofalakis . 2005. Sketching Streams Through the Net: Distributed Approximate Query Tracking . In Proceedings of the 31st International Conference on Very Large Data Bases, VLDB. 13--24 . Graham Cormode and Minos N. Garofalakis. 2005. Sketching Streams Through the Net: Distributed Approximate Query Tracking. In Proceedings of the 31st International Conference on Very Large Data Bases, VLDB. 13--24."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921659.1921667"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160158.2160163"},{"key":"e_1_3_2_1_17_1","first-page":"27","article-title":"The Gigascope Stream Database","volume":"26","author":"Cranor Charles D.","year":"2003","unstructured":"Charles D. Cranor , Theodore Johnson , Oliver Spatscheck , and Vladislav Shkapenyuk . 2003 . The Gigascope Stream Database . IEEE Data Engineering Bulletin , Vol. 26 , 1 (2003), 27 -- 32 . Charles D. Cranor, Theodore Johnson, Oliver Spatscheck, and Vladislav Shkapenyuk. 2003. The Gigascope Stream Database. IEEE Data Engineering Bulletin, Vol. 26, 1 (2003), 27--32.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3326943.3326965"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 32nd International Conference on Machine Learning, ICML. 1405--1411","author":"Daniely Amit","year":"2015","unstructured":"Amit Daniely , Alon Gonen , and Shai Shalev-Shwartz . 2015 . Strongly Adaptive Online Learning . In Proceedings of the 32nd International Conference on Machine Learning, ICML. 1405--1411 . Amit Daniely, Alon Gonen, and Shai Shalev-Shwartz. 2015. Strongly Adaptive Online Learning. In Proceedings of the 32nd International Conference on Machine Learning, ICML. 1405--1411."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.852874"},{"key":"e_1_3_2_1_21_1","volume-title":"Science","volume":"349","author":"Dwork Cynthia","year":"2015","unstructured":"Cynthia Dwork , Vitaly Feldman , Moritz Hardt , Toniann Pitassi , Omer Reingold , and Aaron Roth . 2015 . The reusable holdout: Preserving validity in adaptive data analysis . Science , Vol. 349 , 6248 (2015), 636--638. Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Aaron Roth. 2015. The reusable holdout: Preserving validity in adaptive data analysis. Science, Vol. 349, 6248 (2015), 636--638."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.11.003"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996452"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1186\/s41044-016-0011-3"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2012.6181772"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2012.6319752"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3134599"},{"key":"e_1_3_2_1_28_1","volume-title":"Large Minibatch SGD: Training ImageNet in 1 Hour. arXiv preprint arXiv:1706.02677","author":"Goyal Priya","year":"2017","unstructured":"Priya Goyal , Piotr Doll\u00e1r , Ross Girshick , Pieter Noordhuis , Lukasz Wesolowski , Aapo Kyrola , Andrew Tulloch , Yangqing Jia , and Kaiming He. 2017. Accurate , Large Minibatch SGD: Training ImageNet in 1 Hour. arXiv preprint arXiv:1706.02677 ( 2017 ). Priya Goyal, Piotr Doll\u00e1r, Ross Girshick, Pieter Noordhuis, Lukasz Wesolowski, Aapo Kyrola, Andrew Tulloch, Yangqing Jia, and Kaiming He. 2017. Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour. arXiv preprint arXiv:1706.02677 (2017)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375670"},{"key":"e_1_3_2_1_30_1","volume-title":"Greenwald and Sanjeev Khanna","author":"Michael","year":"2016","unstructured":"Michael B. Greenwald and Sanjeev Khanna . 2016 . Quantiles and Equi-depth Histograms over Streams. In Data Stream Management: Processing High-Speed Data Streams, Minos Garofalakis, Johannes Gehrke, and Rajeev Rastogi (Eds.). Springer Berlin Heidelberg , 45--86. Michael B. Greenwald and Sanjeev Khanna. 2016. Quantiles and Equi-depth Histograms over Streams. In Data Stream Management: Processing High-Speed Data Streams, Minos Garofalakis, Johannes Gehrke, and Rajeev Rastogi (Eds.). Springer Berlin Heidelberg, 45--86."},{"key":"e_1_3_2_1_31_1","volume-title":"Symposium on Theory of Computing Conference. 121--130","author":"Hardt Moritz","unstructured":"Moritz Hardt and David P. Woodruff . 2013. How robust are linear sketches to adaptive inputs? . In Symposium on Theory of Computing Conference. 121--130 . Moritz Hardt and David P. Woodruff. 2013. How robust are linear sketches to adaptive inputs?. In Symposium on Theory of Computing Conference. 121--130."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS). 218--235","author":"Jayaram Rajesh","unstructured":"Rajesh Jayaram , Gokarna Sharma , Srikanta Tirthapura , and David P. Woodruff . 2019. Weighted Reservoir Sampling from Distributed Streams . In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS). 218--235 . Rajesh Jayaram, Gokarna Sharma, Srikanta Tirthapura, and David P. Woodruff. 2019. Weighted Reservoir Sampling from Distributed Streams. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS). 218--235."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007603"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066159"},{"key":"e_1_3_2_1_37_1","volume-title":"Optimal Quantile Approximation in Streams. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). 71--78","author":"Karnin Zohar","year":"2016","unstructured":"Zohar Karnin , Kevin Lang , and Edo Liberty . 2016 . Optimal Quantile Approximation in Streams. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). 71--78 . Zohar Karnin, Kevin Lang, and Edo Liberty. 2016. Optimal Quantile Approximation in Streams. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). 71--78."},{"key":"e_1_3_2_1_38_1","volume-title":"The Art of Computer Programming","author":"Knuth Donald E.","unstructured":"Donald E. Knuth . 1997. The Art of Computer Programming , Volume 2 ( 3 rd Ed.): Seminumerical Algorithms .Addison-Wesley Longman Publishing Co. , Inc., Boston, MA, USA. Donald E. Knuth. 1997. The Art of Computer Programming, Volume 2 (3rd Ed.): Seminumerical Algorithms .Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.","edition":"3"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1741"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190898"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188918"},{"key":"e_1_3_2_1_42_1","unstructured":"Saeed Mahloujifar and Mohammad Mahmoody. 2019. Can Adversarially Robust Learning Leverage Computational Hardness?. In Algorithmic Learning Theory ALT. 581--609.  Saeed Mahloujifar and Mohammad Mahmoody. 2019. Can Adversarially Robust Learning Leverage Computational Hardness?. In Algorithmic Learning Theory ALT. 581--609."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304204"},{"key":"e_1_3_2_1_44_1","volume-title":"Background Class Defense Against Adversarial Examples. In 2018 IEEE Security and Privacy Workshops, SP Workshops. 96--102","author":"McCoyd Michael","unstructured":"Michael McCoyd and David A. Wagner . 2018 . Background Class Defense Against Adversarial Examples. In 2018 IEEE Security and Privacy Workshops, SP Workshops. 96--102 . Michael McCoyd and David A. Wagner. 2018. Background Class Defense Against Adversarial Examples. In 2018 IEEE Security and Privacy Workshops, SP Workshops. 96--102."},{"key":"e_1_3_2_1_45_1","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics, Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin","author":"McDiarmid Colin","unstructured":"Colin McDiarmid . 1998. Concentration . In Probabilistic Methods for Algorithmic Discrete Mathematics, Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin , and Bruce Reed (Eds.). Springer Berlin Heidelberg , 195--248. Colin McDiarmid. 1998. Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics, Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, and Bruce Reed (Eds.). Springer Berlin Heidelberg, 195--248."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733772"},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of the Thirty-Second Conference on Learning Theory, COLT (Proceedings of Machine Learning Research), Alina Beygelzimer and Daniel Hsu (Eds.)","volume":"99","author":"Montasser Omar","year":"2019","unstructured":"Omar Montasser , Steve Hanneke , and Nathan Srebro . 2019 . VC Classes are Adversarially Robustly Learnable, but Only Improperly . In Proceedings of the Thirty-Second Conference on Learning Theory, COLT (Proceedings of Machine Learning Research), Alina Beygelzimer and Daniel Hsu (Eds.) , Vol. 99 . 2512--2530. Omar Montasser, Steve Hanneke, and Nathan Srebro. 2019. VC Classes are Adversarially Robustly Learnable, but Only Improperly. In Proceedings of the Thirty-Second Conference on Learning Theory, COLT (Proceedings of Machine Learning Research), Alina Beygelzimer and Daniel Hsu (Eds.), Vol. 99. 2512--2530."},{"key":"e_1_3_2_1_48_1","volume-title":"Varadarajan","author":"Mustafa Nabil H.","year":"2017","unstructured":"Nabil H. Mustafa and Kasturi R . Varadarajan . 2017 . Epsilon-approximations and epsilon-nets. In Handbook of Discrete and Computational Geometry, 3 rd Edition, Csaba D. Toth, Joseph O'Rourke, and Jacob E. Goodman (Eds.). Chapman and Hall\/CRC , New York, Chapter 47, 27. Nabil H. Mustafa and Kasturi R. Varadarajan. 2017. Epsilon-approximations and epsilon-nets. In Handbook of Discrete and Computational Geometry, 3rd Edition, Csaba D. Toth, Joseph O'Rourke, and Jacob E. Goodman (Eds.). Chapman and Hall\/CRC, New York, Chapter 47, 27.","edition":"3"},{"key":"e_1_3_2_1_49_1","volume-title":"Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference. 565--584.","author":"Naor Moni","unstructured":"Moni Naor and Eylon Yogev . 2015. Bloom Filters in Adversarial Environments . In Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference. 565--584. Moni Naor and Eylon Yogev. 2015. Bloom Filters in Adversarial Environments. In Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference. 565--584."},{"key":"e_1_3_2_1_50_1","volume-title":"Principles of Distributed Database Systems","author":"Tamer \u00d6zsu M.","unstructured":"M. Tamer \u00d6zsu and Patrick Valduriez . 2011. Principles of Distributed Database Systems 3 rd ed.). Springer Publishing Company, Inc orporated. M. Tamer \u00d6zsu and Patrick Valduriez. 2011. Principles of Distributed Database Systems 3rd ed.). Springer Publishing Company, Incorporated.","edition":"3"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3052973.3053009"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90019-2"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"e_1_3_2_1_54_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning, ICML. 3086--3094","author":"Shamir Ohad","year":"2017","unstructured":"Ohad Shamir and Liran Szlak . 2017 . Online Learning with Local Permutations and Delayed Feedback . In Proceedings of the 34th International Conference on Machine Learning, ICML. 3086--3094 . Ohad Shamir and Liran Szlak. 2017. Online Learning with Local Permutations and Delayed Feedback. In Proceedings of the 34th International Conference on Machine Learning, ICML. 3086--3094."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.41.247"},{"key":"e_1_3_2_1_56_1","volume-title":"Arsalan Mosenia, Mung Chiang, and Prateek Mittal.","author":"Sitawarin Chawin","year":"2018","unstructured":"Chawin Sitawarin , Arjun Nitin Bhagoji , Arsalan Mosenia, Mung Chiang, and Prateek Mittal. 2018 . DARTS : Deceiving Autonomous Cars with Toxic Signs. CoRR , Vol. abs\/ 1802 .06430 (2018). Chawin Sitawarin, Arjun Nitin Bhagoji, Arsalan Mosenia, Mung Chiang, and Prateek Mittal. 2018. DARTS: Deceiving Autonomous Cars with Toxic Signs. CoRR, Vol. abs\/1802.06430 (2018)."},{"key":"e_1_3_2_1_57_1","volume-title":"Le","author":"Smith Samuel L.","year":"2017","unstructured":"Samuel L. Smith , Pieter-Jan Kindermans , Chris Ying , and Quoc V . Le . 2017 . Don't Decay the Learning Rate, Increase the Batch Size. http:\/\/arxiv.org\/abs\/1711.00489 Published as a conference paper at ICLR 2018. Samuel L. Smith, Pieter-Jan Kindermans, Chris Ying, and Quoc V. Le. 2017. Don't Decay the Learning Rate, Increase the Batch Size. http:\/\/arxiv.org\/abs\/1711.00489 Published as a conference paper at ICLR 2018."},{"key":"e_1_3_2_1_58_1","volume-title":"Low Noise and Fast Rates. In Advances in Neural Information Processing Systems 23: Annual Conference on Neural Information Processing Systems, NIPS. 2199--2207","author":"Srebro Nathan","year":"2010","unstructured":"Nathan Srebro , Karthik Sridharan , and Ambuj Tewari . 2010 . Smoothness , Low Noise and Fast Rates. In Advances in Neural Information Processing Systems 23: Annual Conference on Neural Information Processing Systems, NIPS. 2199--2207 . Nathan Srebro, Karthik Sridharan, and Ambuj Tewari. 2010. Smoothness, Low Noise and Fast Rates. In Advances in Neural Information Processing Systems 23: Annual Conference on Neural Information Processing Systems, NIPS. 2199--2207."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997844"},{"key":"e_1_3_2_1_60_1","volume-title":"2nd International Conference on Learning Representations, ICLR.","author":"Szegedy Christian","year":"2014","unstructured":"Christian Szegedy , Wojciech Zaremba , Ilya Sutskever , Joan Bruna , Dumitru Erhan , Ian J. Goodfellow , and Rob Fergus . 2014 . Intriguing properties of neural networks . In 2nd International Conference on Learning Representations, ICLR. Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian J. Goodfellow, and Rob Fergus. 2014. Intriguing properties of neural networks. In 2nd International Conference on Learning Representations, ICLR."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176988847"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465312"},{"key":"e_1_3_2_1_66_1","volume-title":"Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems, NeurIPS. 6532--6541","author":"Woodworth Blake E.","year":"2018","unstructured":"Blake E. Woodworth , Vitaly Feldman , Saharon Rosset , and Nati Srebro . 2018 . The Everlasting Database: Statistical Validity at a Fair Price . In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems, NeurIPS. 6532--6541 . Blake E. Woodworth, Vitaly Feldman, Saharon Rosset, and Nati Srebro. 2018. The Everlasting Database: Statistical Validity at a Fair Price. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems, NeurIPS. 6532--6541."},{"key":"e_1_3_2_1_67_1","volume-title":"Adaptive Online Learning in Dynamic Environments. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems, NeurIPS. 1330--1340","author":"Zhang Lijun","year":"2018","unstructured":"Lijun Zhang , Shiyin Lu , and Zhi-Hua Zhou . 2018 . Adaptive Online Learning in Dynamic Environments. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems, NeurIPS. 1330--1340 . Lijun Zhang, Shiyin Lu, and Zhi-Hua Zhou. 2018. Adaptive Online Learning in Dynamic Environments. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems, NeurIPS. 1330--1340."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387643","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375395.3387643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:48Z","timestamp":1750199568000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387643"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":67,"alternative-id":["10.1145\/3375395.3387643","10.1145\/3375395"],"URL":"https:\/\/doi.org\/10.1145\/3375395.3387643","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}