{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T23:04:06Z","timestamp":1769123046147,"version":"3.49.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:p>\n            What-if queries are the building blocks for many explanation and analytics applications\u2014sensitivity analysis, hypothetical reasoning, data cleaning, probabilistic databases\u2014that explore how a query's output changes due to input data changes. Their response time is bounded by intervention evaluation latency, which can be in the minute or hours for complex queries and large datasets. FaDE is a compilation engine that uses provenance to evaluate hypothetical deletion and scaling interventions at low latency and high throughput. FaDE forgoes conventional provenance representations as symbolic expressions and leverages their underlying relational structure. This accelerates intervention evaluation on average by 1000\u00d7 against IVM and 10,000\u00d7 against prior provenance-based approaches. In addition, FaDE develops a suite of optimizations (e.g., compilation, parallelization, incremental evaluation, sparse representations) that collectively raise evaluation throughput to &gt;1 million interventions per sec\u2014a rate that can brute-force existing applications within 1\n            <jats:italic>s.<\/jats:italic>\n          <\/jats:p>","DOI":"10.14778\/3717755.3717757","type":"journal-article","created":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T15:51:49Z","timestamp":1747756309000},"page":"943-955","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["FaDE: More Than a Million What-Ifs Per Second"],"prefix":"10.14778","volume":"18","author":[{"given":"Haneen","family":"Mohammed","sequence":"first","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Yao","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charlie","family":"Summers","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongbin","family":"Zhong","sequence":"additional","affiliation":[{"name":"Georgia Tech"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gromit Yeuk-Yin","family":"Chan","sequence":"additional","affiliation":[{"name":"Adobe Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subrata","family":"Mitra","sequence":"additional","affiliation":[{"name":"Adobe Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lampros","family":"Flokas","sequence":"additional","affiliation":[{"name":"Celonis Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugene","family":"Wu","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,5,20]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2023. http:\/\/www.nsf.gov\/awardsearch\/download.jsp."},{"key":"e_1_2_1_2_1","volume-title":"Accessed","year":"2024","unstructured":"2024. Bureau of Transportation Statistics. https:\/\/www.transtats.bts.gov\/Homepage.asp. Accessed: April 30, 2024."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00633-6"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3297753.3297761"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336670"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989302"},{"key":"e_1_2_1_7_1","first-page":"287","article-title":"Techniques for efficiently querying scientific workflow provenance graphs","volume":"10","author":"Anand Manish Kumar","year":"2010","unstructured":"Manish Kumar Anand, Shawn Bowers, and Bertram Ludascher. 2010. Techniques for efficiently querying scientific workflow provenance graphs.. In EDBT, Vol. 10. 287\u2013298.","journal-title":"EDBT"},{"key":"e_1_2_1_8_1","volume-title":"Algorithms for provisioning queries and analytics. arXiv preprint arXiv:1512.06143","author":"Assadi Sepehr","year":"2015","unstructured":"Sepehr Assadi, Sanjeev Khanna, Yang Li, and Val Tannen. 2015. Algorithms for provisioning queries and analytics. arXiv preprint arXiv:1512.06143 (2015)."},{"key":"e_1_2_1_9_1","volume-title":"Computer graphics forum","author":"Battle Leilani","unstructured":"Leilani Battle and Jeffrey Heer. 2019. Characterizing exploratory visual analysis: A literature review and evaluation of analytic provenance in tableau. In Computer graphics forum, Vol. 38. Wiley Online Library, 145\u2013159."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases","author":"Benjelloun Omar","year":"2006","unstructured":"Omar Benjelloun, Anish Das Sarma, Alon Halevy, and Jennifer Widom. 2006. ULDBs: databases with uncertainty and lineage. In Proceedings of the 32nd International Conference on Very Large Data Bases (Seoul, Korea) (VLDB '06). VLDB Endowment, 953\u2013964."},{"key":"e_1_2_1_11_1","volume-title":"Boon Thau Loo, and Wenchao Zhou","author":"Chen Ang","year":"2017","unstructured":"Ang Chen, Yang Wu, Andreas Haeberlen, Boon Thau Loo, and Wenchao Zhou. 2017. Data Provenance at Internet Scale: Architecture, Experiences, and the Road Ahead.. In CIDR."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50076-0"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498344"},{"key":"e_1_2_1_14_1","volume-title":"Caravan: Provisioning for What-If Analysis. In Sixth Biennial Conference on Innovative Data Systems Research, CIDR","author":"Deutch Daniel","year":"2013","unstructured":"Daniel Deutch, Zachary G. Ives, Tova Milo, and Val Tannen. 2013. Caravan: Provisioning for What-If Analysis. In Sixth Biennial Conference on Innovative Data Systems Research, CIDR 2013, Asilomar, CA, USA, January 6-9, 2013, Online Proceedings. www.cidrdb.org. http:\/\/cidrdb.org\/cidr2013\/Papers\/CIDR13_Paper100.pdf"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5441\/002\/icdt.2014.22"},{"key":"e_1_2_1_16_1","unstructured":"Daniel Deutch Yuval Moskovitch Itay Polak and Noam Rinetzky. 2018. Towards Hypothetical Reasoning Using Distributed Provenance.. In EDBT. 461\u2013464."},{"key":"e_1_2_1_17_1","volume-title":"Approximate Query Processing: Taming the TeraBytes. In VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases","author":"Minos","year":"2001","unstructured":"Minos N. Garofalakis and Phillip B. Gibbons. 2001. Approximate Query Processing: Taming the TeraBytes. In VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases, September 11-14, 2001, Roma, Italy, Peter M. G. Apers, Paolo Atzeni, Stefano Ceri, Stefano Paraboschi, Kotagiri Ramamohanarao, and Richard T. Snodgrass (Eds.). Morgan Kaufmann. http:\/\/www.vldb.org\/conf\/2001\/tut4.pdf"},{"key":"e_1_2_1_18_1","volume-title":"Understanding Business Users' Data-Driven Decision-Making: Practices, Challenges, and Opportunities. arXiv preprint arXiv:2212.13643","author":"Gathani Sneha","year":"2022","unstructured":"Sneha Gathani, Zhicheng Liu, Peter J Haas, and Cagatay Demiralp. 2022. Understanding Business Users' Data-Driven Decision-Making: Practices, Challenges, and Opportunities. arXiv preprint arXiv:2212.13643 (2022)."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824122"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3484224.3484235"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063816"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1886"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462571.1462577"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376686"},{"key":"e_1_2_1_26_1","volume-title":"Efficiently computing provenance graphs for queries with negation. arXiv preprint arXiv:1701.05699","author":"Lee Seokki","year":"2017","unstructured":"Seokki Lee, Sven Kohler, Bertram Ludascher, and Boris Glavic. 2017. Efficiently computing provenance graphs for queries with negation. arXiv preprint arXiv:1701.05699 (2017)."},{"key":"e_1_2_1_27_1","volume-title":"SmokedDuck Demonstration: SQLStepper. In Companion of the 2023 International Conference on Management of Data. 183\u2013186","author":"Mohammed Haneen","year":"2023","unstructured":"Haneen Mohammed, Charlie Summers, Sughosh Kaushik, and Eugene Wu. 2023. SmokedDuck Demonstration: SQLStepper. In Companion of the 2023 International Conference on Management of Data. 183\u2013186."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494130"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3193537"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209900.3209904"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3184470.3184475"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320212"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856329"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236253"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Azadeh Tabiban Heyang Zhao Yosr Jarraya Makan Pourzandi Mengyuan Zhang and Lingyu Wang. 2022. ProvTalk: Towards Interpretable Multi-level Provenance Analysis in Networking Functions Virtualization (NFV).. In NDSS.","DOI":"10.14722\/ndss.2022.23103"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536356"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915240"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3717755.3717757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T16:18:01Z","timestamp":1747757881000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3717755.3717757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.14778\/3717755.3717757"],"URL":"https:\/\/doi.org\/10.14778\/3717755.3717757","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"2025-05-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}