{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T21:07:15Z","timestamp":1762981635573,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100009002","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["R-252-000-B59-114,MOE-T2EP20121-0011"],"award-info":[{"award-number":["R-252-000-B59-114,MOE-T2EP20121-0011"]}],"id":[{"id":"10.13039\/100009002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-NRFFAI1-2019-0004"],"award-info":[{"award-number":["NRF-NRFFAI1-2019-0004"]}],"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":[[2023,6,18]]},"DOI":"10.1145\/3584372.3588677","type":"proceedings-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T22:21:22Z","timestamp":1685744482000},"page":"339-347","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic Query Evaluation: The Combined FPRAS Landscape"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0538-3044","authenticated-orcid":false,"given":"Timothy","family":"van Bremen","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9423-5270","authenticated-orcid":false,"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2023,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.04.013"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.46298\/lmcs-18(1:2)2022"},{"key":"e_1_3_2_1_3_1","volume-title":"ICDT (LIPIcs","volume":"17","author":"Amarilli Antoine","year":"2021","unstructured":"Antoine Amarilli and Benny Kimelfeld. 2021. Uniform Reliability of Self-Join-Free Conjunctive Queries. In ICDT (LIPIcs, Vol. 186). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 17:1--17:17."},{"key":"e_1_3_2_1_4_1","volume-title":"Mika\u00eb l Monet, and Pierre Senellart","author":"Amarilli Antoine","year":"2017","unstructured":"Antoine Amarilli, Mika\u00eb l Monet, and Pierre Senellart. 2017. Conjunctive Queries on Probabilistic Graphs: Combined Complexity. In PODS. ACM, 217--232."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477045"},{"key":"e_1_3_2_1_6_1","volume-title":"Rajesh Jayaram, and Cristian Riveros.","author":"Arenas Marcelo","year":"2021","unstructured":"Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, and Cristian Riveros. 2021b. When is approximate counting for conjunctive queries tractable?. In STOC. ACM, 1015--1027."},{"key":"e_1_3_2_1_7_1","volume-title":"Merlin","author":"Chandra Ashok K.","year":"1977","unstructured":"Ashok K. Chandra and Philip M. Merlin. 1977. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In STOC. ACM, 77--90."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Nilesh N. Dalvi Karl Schnaitter and Dan Suciu. 2010. Computing query probability with incidence algebras. In PODS. ACM 203--214.","DOI":"10.1145\/1807085.1807113"},{"key":"e_1_3_2_1_9_1","volume-title":"Dalvi and Dan Suciu","author":"Nilesh","year":"2004","unstructured":"Nilesh N. Dalvi and Dan Suciu. 2004. Efficient Query Evaluation on Probabilistic Databases. In VLDB. Morgan Kaufmann, 864--875."},{"key":"e_1_3_2_1_10_1","volume-title":"Dalvi and Dan Suciu","author":"Nilesh","year":"2007","unstructured":"Nilesh N. Dalvi and Dan Suciu. 2007. The dichotomy of conjunctive queries on probabilistic structures. In PODS. ACM, 293--302."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395119"},{"key":"e_1_3_2_1_12_1","first-page":"3","article-title":"Query Processing on Probabilistic Data: A Survey","volume":"7","author":"den Broeck Guy Van","year":"2017","unstructured":"Guy Van den Broeck and Dan Suciu. 2017. Query Processing on Probabilistic Data: A Survey. Found. Trends Databases , Vol. 7, 3--4 (2017), 197--341.","journal-title":"Found. Trends Databases"},{"key":"e_1_3_2_1_13_1","volume-title":"The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper). In IPEC (LIPIcs","volume":"23","author":"Dzulfikar M. Ayaz","year":"2019","unstructured":"M. Ayaz Dzulfikar, Johannes Klaus Fichte, and Markus Hecher. 2019. The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper). In IPEC (LIPIcs, Vol. 148). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 25:1--25:23."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0310-5"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Robert Fink and Dan Olteanu. 2011. On the optimal approximation of queries using tractable propositional languages. In ICDT. ACM 174--185.","DOI":"10.1145\/1938551.1938575"},{"key":"e_1_3_2_1_16_1","volume-title":"MUD (CTIT Workshop Proceedings Series","volume":"04","author":"Gatterbauer Wolfgang","year":"2010","unstructured":"Wolfgang Gatterbauer, Abhay Kumar Jha, and Dan Suciu. 2010. Dissociation and Propagation for Efficient Query Evaluation over Probabilistic Databases. In MUD (CTIT Workshop Proceedings Series, Vol. WP10-04 ). Centre for Telematics and Information Technology (CTIT), University of Twente, The Netherlands, 83--97."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"volume-title":"The Complexity of Query Reliability","author":"Erich","key":"e_1_3_2_1_19_1","unstructured":"Erich Gr\"a del, Yuri Gurevich, and Colin Hirsch. 1998. The Complexity of Query Reliability. In PODS. ACM Press, 227--234."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739082"},{"key":"e_1_3_2_1_21_1","volume-title":"Vardi","author":"Kolaitis Phokion G.","year":"1998","unstructured":"Phokion G. Kolaitis and Moshe Y. Vardi. 1998. Conjunctive-Query Containment and Constraint Satisfaction. In PODS. ACM Press, 205--213."},{"volume-title":"Approximate confidence computation in probabilistic databases","author":"Olteanu Dan","key":"e_1_3_2_1_22_1","unstructured":"Dan Olteanu, Jiewen Huang, and Christoph Koch. 2010. Approximate confidence computation in probabilistic databases. In ICDE. IEEE Computer Society, 145--156."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Dan Suciu Dan Olteanu Christopher R\u00e9 and Christoph Koch. 2011. Probabilistic Databases. Morgan & Claypool Publishers.","DOI":"10.1007\/978-3-031-01879-4"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Moshe Y. Vardi. 1982. The Complexity of Relational Query Languages (Extended Abstract). In STOC. ACM 137--146. io","DOI":"10.1145\/800070.802186"}],"event":{"name":"SIGMOD\/PODS '23: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Seattle WA USA","acronym":"SIGMOD\/PODS '23"},"container-title":["Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588677","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584372.3588677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:28Z","timestamp":1750178788000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,18]]},"references-count":24,"alternative-id":["10.1145\/3584372.3588677","10.1145\/3584372"],"URL":"https:\/\/doi.org\/10.1145\/3584372.3588677","relation":{},"subject":[],"published":{"date-parts":[[2023,6,18]]},"assertion":[{"value":"2023-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}