The Complexity of Why-Provenance for Datalog Queries
Article No.: 83, Pages 1 - 16
Abstract
Datalog is a powerful rule-based language that allows us to express complex recursive queries and has found numerous applications over the years. Explaining why a result to a Datalog query is obtained is an essential task towards explainable and transparent data-intensive applications that rely on Datalog. A standard way of explaining a query result is the so-called why-provenance, which provides information about the witnesses to a query result in the form of subsets of the input database that as a whole can be used to derive that result. To our surprise, despite the fact that the notion of why-provenance for Datalog queries has been around for decades and intensively studied, its computational complexity remains unexplored. Our goal is to fill this gap in the why-provenance literature. Towards this end, we pinpoint the data complexity of why-provenance for Datalog queries and key subclasses thereof. The takeaway of our work is that why-provenance for recursive queries, even if the recursion is limited to be linear, is an intractable problem, whereas for non-recursive queries is highly tractable.
References
[1]
Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley.
[2]
Camille Bourgaux, Pierre Bourhis, Liat Peterfreund, and Michaë l Thomazo. 2022. Revisiting Semiring Provenance for Datalog. In KR.
[3]
Peter Buneman, Sanjeev Khanna, and Wang Chiew Tan. 2001. Why and Where: A Characterization of Data Provenance. In ICDT. 316--330.
[4]
Marco Calautti, Ester Livshits, Andreas Pieris, and Markus Schneider. 2024. Computing the Why-Provenance for Datalog Queries via SAT Solvers. In AAAI.
[5]
Stephen A. Cook. 1974. An Observation on Time-Storage Trade Off. J. Comput. Syst. Sci., Vol. 9, 3 (1974), 308--316.
[6]
Carlos Viegas Damá sio, Anastasia Analyti, and Grigoris Antoniou. 2013. Justifications for Logic Programming. In LPNMR. 530--542.
[7]
Evgeny Dantsin, Thomas Eiter, Georg Gottlob, and Andrei Voronkov. 2001. Complexity and expressive power of logic programming. ACM Comput. Surv., Vol. 33, 3 (2001), 374--425.
[8]
Daniel Deutch, Tova Milo, Sudeepa Roy, and Val Tannen. 2014. Circuits for Datalog Provenance. In ICDT. 201--212.
[9]
Ali Elhalawati, Markus Krö tzsch, and Stephan Mennicke. 2022. An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog. In RuleMLRR.
[10]
Javier Esparza, Michael Luttenberger, and Maximilian Schlund. 2014. FPsolve: A Generic Solver for Fixpoint Equations over Semirings. In CIAA. 1--15.
[11]
Todd J. Green. 2011. Containment of Conjunctive Queries on Annotated Relations. Theory Comput. Syst., Vol. 49, 2 (2011), 429--459.
[12]
Todd J. Green, Gregory Karvounarakis, and Val Tannen. 2007. Provenance semirings. In PODS. 31--40.
[13]
Todd J. Green and Val Tannen. 2017. The Semiring Framework for Database Provenance. In PODS. ACM, 93--99.
[14]
Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, and Yisu Remy Wang. 2022. Convergence of Datalog over (Pre-) Semirings. In PODS. ACM, 105--117.
[15]
Seokki Lee, Bertram Lud"a scher, and Boris Glavic. 2019. PUG: a framework and practical implementation for why and why-not provenance. VLDB J., Vol. 28, 1 (2019), 47--71.
[16]
Moshe Y. Vardi. 1995. On the Complexity of Bounded-Variable Queries. In PODS. 266--276.
[17]
David Zhao, Pavle Subotic, and Bernhard Scholz. 2020. Debugging Large-scale Datalog: A Scalable Provenance Evaluation Strategy. ACM Trans. Program. Lang. Syst., Vol. 42, 2 (2020), 7:1--7:35. io
Index Terms
- The Complexity of Why-Provenance for Datalog Queries
Recommendations
Decidable containment of recursive queries
Database theoryOne of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another one. Query containment is crucial in several contexts, such as query optimization, query ...
Precise complexity analysis for efficient datalog queries
PPDP '10: Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programmingGiven a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answering the query, top-down evaluation is extended with tabling that stores ...
Efficient provenance tracking for datalog using top-k queries
Highly expressive declarative languages, such as datalog, are now commonly used to model the operational logic of data-intensive applications. The typical complexity of such datalog programs, and the large volume of data that they process, call for ...
Comments
Information & Contributors
Information
Published In
May 2024
852 pages
Copyright © 2024 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 May 2024
Published in PACMMOD Volume 2, Issue 2
Author Tags
Qualifiers
- Research-article
Funding Sources
- European Union
- EPSRC
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 43Total Downloads
- Downloads (Last 12 months)43
- Downloads (Last 6 weeks)13
Reflects downloads up to 09 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in