{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:30Z","timestamp":1750220670840,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,20]],"date-time":"2021-06-20T00:00:00Z","timestamp":1624147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation"},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,20]]},"DOI":"10.1145\/3452021.3458311","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T14:21:58Z","timestamp":1624026118000},"page":"299-311","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Model Counting meets F\n            <sub>0<\/sub>\n            Estimation"],"prefix":"10.1145","author":[{"given":"A.","family":"Pavan","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}]},{"given":"N. V.","family":"Vinodchandran","sequence":"additional","affiliation":[{"name":"University of Nebraska, Lincoln, Lincoln, NE, USA"}]},{"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Ismail Ilkan Ceylan, and Thomas Lukasiewicz","author":"Abboud Ralph","year":"2019","unstructured":"Ralph Abboud , Ismail Ilkan Ceylan, and Thomas Lukasiewicz . 2019 . Learning to Reason : Leveraging Neural Networks for Approximate DNF Counting . arXiv preprint arXiv:1904.02688 (2019). Ralph Abboud, Ismail Ilkan Ceylan, and Thomas Lukasiewicz. 2019. Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting. arXiv preprint arXiv:1904.02688 (2019)."},{"volume-title":"Proc","author":"Achlioptas Dimitris","key":"e_1_3_2_1_2_1","unstructured":"Dimitris Achlioptas and Panos Theodoropoulos . 2017. Probabilistic model counting with short XORs . In Proc . of SAT. Springer , 3--19. Dimitris Achlioptas and Panos Theodoropoulos. 2017. Probabilistic model counting with short XORs. In Proc. of SAT. Springer, 3--19."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Arackaparambil Chrisil","key":"e_1_3_2_1_4_1","unstructured":"Chrisil Arackaparambil , Joshua Brody , and Amit Chakrabarti . 2009. Functional monitoring without monotonicity . In International Colloquium on Automata, Languages, and Programming . Springer , 95--106. Chrisil Arackaparambil, Joshua Brody, and Amit Chakrabarti. 2009. Functional monitoring without monotonicity. In International Colloquium on Automata, Languages, and Programming. Springer, 95--106."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872764"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of RANDOM","volume":"2483","author":"Bar-Yossef Ziv","unstructured":"Ziv Bar-Yossef , T. S. Jayram , Ravi Kumar , D. Sivakumar , and Luca Trevisan . [n. d.]. Counting Distinct Elements in a Data Stream . In Proc. of RANDOM , Vol. 2483 . 1--10. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, and Luca Trevisan. [n. d.]. Counting Distinct Elements in a Data Stream. In Proc. of RANDOM, Vol. 2483. 1--10."},{"volume-title":"Proc. of SODA. ACM\/SIAM , 623--632","author":"Bar-Yossef Ziv","key":"e_1_3_2_1_8_1","unstructured":"Ziv Bar-Yossef , Ravi Kumar , and D. Sivakumar . 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs . In Proc. of SODA. ACM\/SIAM , 623--632 . Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar. 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. of SODA. ACM\/SIAM , 623--632."},{"key":"e_1_3_2_1_9_1","volume-title":"Recursive Sketching For Frequency Moments. CoRR","author":"Braverman Vladimir","year":"2010","unstructured":"Vladimir Braverman and Rafail Ostrovsky . 2010. Recursive Sketching For Frequency Moments. CoRR , Vol. abs\/ 1011 .2571 ( 2010 ). Vladimir Braverman and Rafail Ostrovsky. 2010. Recursive Sketching For Frequency Moments. CoRR , Vol. abs\/1011.2571 (2010)."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the ninth annual ACM symposium on Theory of computing. ACM, 106--112","author":"Lawrence Carter J","year":"1977","unstructured":"J Lawrence Carter and Mark N Wegman . 1977 . Universal classes of hash functions . In Proceedings of the ninth annual ACM symposium on Theory of computing. ACM, 106--112 . J Lawrence Carter and Mark N Wegman. 1977. Universal classes of hash functions. In Proceedings of the ninth annual ACM symposium on Theory of computing. ACM, 106--112."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of AAAI. 689--695","author":"Chakraborty Supratik","year":"2015","unstructured":"Supratik Chakraborty , Dror Fried , Kuldeep S Meel , and Moshe Y Vardi . 2015 . From weighted to unweighted model counting . In Proceedings of AAAI. 689--695 . Supratik Chakraborty, Dror Fried, Kuldeep S Meel, and Moshe Y Vardi. 2015. From weighted to unweighted model counting. In Proceedings of AAAI. 689--695."},{"volume-title":"Proc. of CAV . 608--623","author":"Chakraborty S.","key":"e_1_3_2_1_12_1","unstructured":"S. Chakraborty , K. S. Meel , and M. Y. Vardi . 2013a. A Scalable and Nearly Uniform Generator of SAT Witnesses . In Proc. of CAV . 608--623 . S. Chakraborty, K. S. Meel, and M. Y. Vardi. 2013a. A Scalable and Nearly Uniform Generator of SAT Witnesses. In Proc. of CAV . 608--623."},{"volume-title":"Proc. of CP. 200--216","author":"Chakraborty S.","key":"e_1_3_2_1_13_1","unstructured":"S. Chakraborty , K. S. Meel , and M. Y. Vardi . 2013b. A Scalable Approximate Model Counter . In Proc. of CP. 200--216 . S. Chakraborty, K. S. Meel, and M. Y. Vardi. 2013b. A Scalable Approximate Model Counter. In Proc. of CP. 200--216."},{"volume-title":"Proc. of IJCAI .","author":"Chakraborty S.","key":"e_1_3_2_1_14_1","unstructured":"S. Chakraborty , K. S. Meel , and M. Y. Vardi . 2016. Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls . In Proc. of IJCAI . S. Chakraborty, K. S. Meel, and M. Y. Vardi. 2016. Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls. In Proc. of IJCAI ."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"volume-title":"Proc. of TACAS","author":"Chistikov Dmitry","key":"e_1_3_2_1_16_1","unstructured":"Dmitry Chistikov , Rayna Dimitrova , and Rupak Majumdar . 2015. Approximate counting in SMT and value estimation for probabilistic programs . In Proc. of TACAS . Springer , 320--334. Dmitry Chistikov, Rayna Dimitrova, and Rupak Majumdar. 2015. Approximate counting in SMT and value estimation for probabilistic programs. In Proc. of TACAS . Springer, 320--334."},{"key":"e_1_3_2_1_17_1","volume-title":"Byers","author":"Considine Jeffrey","year":"2004","unstructured":"Jeffrey Considine , Feifei Li , George Kollios , and John W . Byers . 2004 . Approximate Aggregation Techniques for Sensor Databases. In Proc. of ICDE , , Z. Meral \u00d6 zsoyoglu and Stanley B. Zdonik (Eds.). IEEE Computer Society , 449--460. Jeffrey Considine, Feifei Li, George Kollios, and John W. Byers. 2004. Approximate Aggregation Techniques for Sensor Databases. In Proc. of ICDE , , Z. Meral \u00d6 zsoyoglu and Stanley B. Zdonik (Eds.). IEEE Computer Society, 449--460."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066161"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. of ESA (Lecture Notes in Computer Science), , Giuseppe Di Battista and Uri Zwick (Eds.)","volume":"2832","author":"Cormode Graham","unstructured":"Graham Cormode and S. Muthukrishnan . 2003. Estimating Dominance Norms of Multiple Data Streams . In Proc. of ESA (Lecture Notes in Computer Science), , Giuseppe Di Battista and Uri Zwick (Eds.) , Vol. 2832 . Springer, 148--160. Graham Cormode and S. Muthukrishnan. 2003. Estimating Dominance Norms of Multiple Data Streams. In Proc. of ESA (Lecture Notes in Computer Science), , Giuseppe Di Battista and Uri Zwick (Eds.), Vol. 2832. Springer, 148--160."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921659.1921667"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160158.2160163"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"P. Dagum R. Karp M. Luby and S. Ross. 2000. An optimal algorithm for Monte Carlo estimation. SIAM Journal on computing Vol. 29 5 (2000) 1484--1496.  P. Dagum R. Karp M. Luby and S. Ross. 2000. An optimal algorithm for Monte Carlo estimation. SIAM Journal on computing Vol. 29 5 (2000) 1484--1496.","DOI":"10.1137\/S0097539797315306"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of ICML. 334--342","author":"Ermon Stefano","year":"2013","unstructured":"Stefano Ermon , Carla P. Gomes , Ashish Sabharwal , and Bart Selman . 2013 . Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization . In Proc. of ICML. 334--342 . Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, and Bart Selman. 2013. Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization. In Proc. of ICML. 334--342."},{"volume-title":"Proc. of ICML . 271--279","author":"Ermon S.","key":"e_1_3_2_1_24_1","unstructured":"S. Ermon , C. P. Gomes , A. Sabharwal , and B. Selman . 2014. Low-density Parity Constraints for Hashing-Based Discrete Integration . In Proc. of ICML . 271--279 . S. Ermon, C. P. Gomes, A. Sabharwal, and B. Selman. 2014. Low-density Parity Constraints for Hashing-Based Discrete Integration. In Proc. of ICML . 271--279."},{"key":"e_1_3_2_1_25_1","volume-title":"Distributed symmetry breaking in sampling (optimal distributed randomly coloring with fewer colors). arXiv preprint arXiv:1802.06953","author":"Feng Weiming","year":"2018","unstructured":"Weiming Feng , Thomas P Hayes , and Yitong Yin . 2018a. Distributed symmetry breaking in sampling (optimal distributed randomly coloring with fewer colors). arXiv preprint arXiv:1802.06953 ( 2018 ). Weiming Feng, Thomas P Hayes, and Yitong Yin. 2018a. Distributed symmetry breaking in sampling (optimal distributed randomly coloring with fewer colors). arXiv preprint arXiv:1802.06953 (2018)."},{"key":"e_1_3_2_1_26_1","volume-title":"What can be sampled locally? Distributed Computing","author":"Feng Weiming","year":"2018","unstructured":"Weiming Feng , Yuxin Sun , and Yitong Yin . 2018b. What can be sampled locally? Distributed Computing ( 2018 ), 1--27. Weiming Feng, Yuxin Sun, and Yitong Yin. 2018b. What can be sampled locally? Distributed Computing (2018), 1--27."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212757"},{"key":"e_1_3_2_1_28_1","volume-title":"32nd International Symposium on Distributed Computing .","author":"Fischer Manuela","year":"2018","unstructured":"Manuela Fischer and Mohsen Ghaffari . 2018 . A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics . In 32nd International Symposium on Distributed Computing . Manuela Fischer and Mohsen Ghaffari. 2018. A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. In 32nd International Symposium on Distributed Computing ."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_30_1","volume-title":"Gibbons and Srikanta Tirthapura","author":"Phillip","year":"2001","unstructured":"Phillip B. Gibbons and Srikanta Tirthapura . 2001 . Estimating simple functions on the union of data streams. In Proc. of SPAA , , Arnold L. Rosenberg (Ed.). ACM , 281--291. Phillip B. Gibbons and Srikanta Tirthapura. 2001. Estimating simple functions on the union of data streams. In Proc. of SPAA , , Arnold L. Rosenberg (Ed.). ACM, 281--291."},{"volume-title":"Proc. of NIPS . 670--676","author":"Gomes C.P.","key":"e_1_3_2_1_31_1","unstructured":"C.P. Gomes , A. Sabharwal , and B. Selman . 2007 b. Near-Uniform sampling of combinatorial spaces using XOR constraints . In Proc. of NIPS . 670--676 . C.P. Gomes, A. Sabharwal, and B. Selman. 2007 b. Near-Uniform sampling of combinatorial spaces using XOR constraints. In Proc. of NIPS . 670--676."},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. of IJCAI. 2293--2299","author":"Gomes Carla P","year":"2007","unstructured":"Carla P Gomes , Joerg Hoffmann , Ashish Sabharwal , and Bart Selman . 2007 a. From Sampling to Model Counting .. In Proc. of IJCAI. 2293--2299 . Carla P Gomes, Joerg Hoffmann, Ashish Sabharwal, and Bart Selman. 2007 a. From Sampling to Model Counting.. In Proc. of IJCAI. 2293--2299."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213596"},{"key":"e_1_3_2_1_34_1","volume-title":"Woodruff","author":"Indyk Piotr","year":"2005","unstructured":"Piotr Indyk and David P . Woodruff . 2005 . Optimal approximations of the frequency moments of data streams. In Proc. of STOC . ACM , 202--208. Piotr Indyk and David P. Woodruff. 2005. Optimal approximations of the frequency moments of data streams. In Proc. of STOC . ACM, 202--208."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-015--9204-z"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/11534.11537"},{"key":"e_1_3_2_1_37_1","volume-title":"Woodruff","author":"Kane Daniel M.","year":"2010","unstructured":"Daniel M. Kane , Jelani Nelson , and David P . Woodruff . 2010 . An optimal algorithm for the distinct elements problem. In Proc. of PODS . ACM , 41--52. Daniel M. Kane, Jelani Nelson, and David P. Woodruff. 2010. An optimal algorithm for the distinct elements problem. In Proc. of PODS . ACM, 41--52."},{"key":"e_1_3_2_1_38_1","volume-title":"Proc. of FOCS","author":"Karp R.M.","year":"1983","unstructured":"R.M. Karp and M. Luby . 1983. Monte-Carlo algorithms for enumeration and reliability problems . Proc. of FOCS ( 1983 ). R.M. Karp and M. Luby. 1983. Monte-Carlo algorithms for enumeration and reliability problems. Proc. of FOCS (1983)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196--6774(89)90038--2"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142507"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.102"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.68"},{"key":"e_1_3_2_1_43_1","volume-title":"Proc. of LICS .","author":"Akshay Kuldeep S.","year":"2020","unstructured":"Kuldeep S. Meel textcircledr S. Akshay . 2020 . Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice . In Proc. of LICS . Kuldeep S. Meel textcircledr S. Akshay. 2020. Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice. In Proc. of LICS ."},{"key":"e_1_3_2_1_44_1","volume-title":"In Proc. of FSTTCS .","author":"Meel Kuldeep S","year":"2017","unstructured":"Kuldeep S Meel , Aditya A Shrotri , and Moshe Y Vardi . 2017 . On Hashing-Based Approaches to Approximate DNF-Counting . In In Proc. of FSTTCS . Kuldeep S Meel, Aditya A Shrotri, and Moshe Y Vardi. 2017. On Hashing-Based Approaches to Approximate DNF-Counting. In In Proc. of FSTTCS ."},{"key":"e_1_3_2_1_45_1","volume-title":"Vardi","author":"Meel Kuldeep S.","year":"2018","unstructured":"Kuldeep S. Meel , Aditya A. Shrotri , and Moshe Y . Vardi . 2018 . Not All FPRASs are Equal : Demystifying FPRASs for DNF-Counting . (12 2018). Kuldeep S. Meel, Aditya A. Shrotri, and Moshe Y. Vardi. 2018. Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting. (12 2018)."},{"key":"e_1_3_2_1_46_1","volume-title":"Vardi","author":"Meel Kuldeep S.","year":"2019","unstructured":"Kuldeep S. Meel , Aditya A. Shrotri , and Moshe Y . Vardi . 2019 . Not All FPRASs are Equal : Demystifying FPRASs for DNF-Counting (Extended Abstract). In Proc. of IJCAI . Kuldeep S. Meel, Aditya A. Shrotri, and Moshe Y. Vardi. 2019. Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting (Extended Abstract). In Proc. of IJCAI ."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/050643672"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453943"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186549.3186551"},{"volume-title":"Reasoning Web. Explainable Artificial Intelligence","author":"Senellart Pierre","key":"e_1_3_2_1_50_1","unstructured":"Pierre Senellart . 2019. Provenance in Databases: Principles and Applications . In Reasoning Web. Explainable Artificial Intelligence . Springer , 104--109. Pierre Senellart. 2019. Provenance in Databases: Principles and Applications. In Reasoning Web. Explainable Artificial Intelligence. Springer, 104--109."},{"volume-title":"Ubiquitous knowledge discovery","author":"Sharfman Izchak","key":"e_1_3_2_1_51_1","unstructured":"Izchak Sharfman , Assaf Schuster , and Daniel Keren . 2010. A geometric approach to monitoring threshold functions over distributed data streams . In Ubiquitous knowledge discovery . Springer , 163--186. Izchak Sharfman, Assaf Schuster, and Daniel Keren. 2010. A geometric approach to monitoring threshold functions over distributed data streams. In Ubiquitous knowledge discovery . Springer, 163--186."},{"volume-title":"Proceedings of International Conference on Computer-Aided Verification (CAV) .","author":"Soos Mate","key":"e_1_3_2_1_52_1","unstructured":"Mate Soos , Stephan Gocht , and Kuldeep S. Meel . 2020. Tinted, Detached, and Lazy CNF-XOR solving and its Applications to Counting and Sampling . In Proceedings of International Conference on Computer-Aided Verification (CAV) . Mate Soos, Stephan Gocht, and Kuldeep S. Meel. 2020. Tinted, Detached, and Lazy CNF-XOR solving and its Applications to Counting and Sampling. In Proceedings of International Conference on Computer-Aided Verification (CAV) ."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011592"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808740"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.031"},{"key":"e_1_3_2_1_57_1","volume-title":"Proc. of PODS 2021 .","author":"Sourav Chakraborty Kuldeep S.","year":"2021","unstructured":"Kuldeep S. Meel $textcircledr$ N. V. Vinodchandran $textcircledr$ Sourav Chakraborty . 2021 . Estimating Size of Union of Sets in Streaming Model . In Proc. of PODS 2021 . Kuldeep S. Meel $textcircledr$ N. V. Vinodchandran $textcircledr$ Sourav Chakraborty. 2021. Estimating Size of Union of Sets in Streaming Model. In Proc. of PODS 2021 ."},{"key":"e_1_3_2_1_58_1","volume-title":"Woodruff","author":"Tirthapura Srikanta","year":"2012","unstructured":"Srikanta Tirthapura and David P . Woodruff . 2012 . Rectangle-efficient aggregation in spatial data streams. In Proc. of PODS . ACM , 283--294. Srikanta Tirthapura and David P. Woodruff. 2012. Rectangle-efficient aggregation in spatial data streams. In Proc. of PODS . ACM, 283--294."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_3_2_1_60_1","unstructured":"David Woodruff. [n. d.]. personal communication.  David Woodruff. [n. d.]. personal communication."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214063"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0218-3"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9584-4"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Virtual Event China","acronym":"SIGMOD\/PODS '21"},"container-title":["Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452021.3458311","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3452021.3458311","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452021.3458311","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452021.3458311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:00Z","timestamp":1750197780000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452021.3458311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,20]]},"references-count":63,"alternative-id":["10.1145\/3452021.3458311","10.1145\/3452021"],"URL":"https:\/\/doi.org\/10.1145\/3452021.3458311","relation":{},"subject":[],"published":{"date-parts":[[2021,6,20]]},"assertion":[{"value":"2021-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}