Michael Benedikt
Abstract
A query Q is monotonically determined over a set of views V if Q can be expressed as a monotonic function of the view image. In the case of relational algebra views and queries, monotonic determinacy coincides with rewritability as a union of conjunctive queries, and it is decidable in important special cases, such as for conjunctive query views and queries. We investigate the situation for views and queries in the recursive query language Datalog. We give both positive and negative results about the ability to decide monotonic determinacy, and also about the co-incidence of monotonic determinacy with Datalog rewritability.
- . 1995. Foundations of Databases. Addison-Wesley.Google Scholar
Digital Library
- . 2019. Answering Queries Using Views. Morgan & Claypool.Google ScholarDigital Library
- . 2011. Determinacy and query rewriting for conjunctive queries and views. Theoretical Computer Science 412, 11 (2011), 1005–1021.Google ScholarDigital Library
- . 2007. On the power of k-consistency. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP’07).Google ScholarCross Ref
- . 2004. Constraint propagation as a proof system. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP’04).Google ScholarDigital Library
- . 2009. Decidable relationships between consistency notions for constraint satisfaction problems. In Proceedings of the International Workshop on Computer Science Logic (CSL’09).Google ScholarCross Ref
- . 2015. Guarded negation. Journal of the ACM 62, 3 (2015), Article 22, 26 pages.Google ScholarDigital Library
- . 2021. Inference from visible information and background knowledge. ACM Transactions on Computational Logic 22, 2 (2021), Article 13, 69 pages.Google ScholarDigital Library
- . 2019. Monadic datalog, tree validity, and limited access containment. ACM Transactions on Computational Logic 21, 1 (2019), Article 6, 45 pages.Google Scholar
- . 2019. Definability and interpolation within decidable fixpoint logics. Logical Methods in Computer Science 15, 3 (2019), Article 29, 53 pages.Google Scholar
- . 2016. Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation. Morgan & Claypool.Google ScholarCross Ref
- . 2002. Lossless regular views. In Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’02). 247–258.Google ScholarDigital Library
- . 2003. Reasoning on regular path queries. ACM SIGMOD Record 32, 4 (2003), 83–92.Google ScholarDigital Library
- . 2007. View-based query processing: On the relationship between rewriting, answering and losslessness. Theoretical Computer Science 371, 3 (2007), 169–182.Google ScholarDigital Library
- . 1994. On the complexity of equivalence between recursive and nonrecursive datalog programs. In Proceedings of the 13th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’94).Google ScholarDigital Library
- . 1997. On the equivalence of recursive and nonrecursive Datalog programs. Journal of Computer and System Sciences 54, 1 (1997), 61–78.Google ScholarDigital Library
- . 1988. Decidable optimization problems for database logic programs. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC’88). 477–490.Google ScholarDigital Library
- . 1990. The monadic second order theory of graphs. I. Recognisable sets of finite graphs. Information and Computation 85, 1 (1990), 12–75.Google ScholarDigital Library
- . 2000. Recursive query plans for data integration. Journal of Logic and Programming 43, 1 (2000), 49–73.Google ScholarCross Ref
- . 2015. Datalog rewritings of regular path queries using views. Logical Methods in Computer Science 11, 4 (2015), 1–25.Google ScholarCross Ref
- . 1998. Products of modal logics, part 1. Logic Journal of the IGPL 6, 1 (1998), 73–146.Google ScholarCross Ref
- . 2018. Can one escape red chains?: Regular path queries determinacy is undecidable. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’18). 492–501.Google ScholarDigital Library
- . 2015. The hunt for a red spider: Conjunctive query determinacy is undecidable. In Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’15).Google ScholarDigital Library
- . 2016. Red spider meets a rainworm: Conjunctive query finite determinacy is undecidable. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’16). 121–134.Google ScholarDigital Library
- . 2002. Back and forth between guarded and modal logics. ACM Transactions on Computational Logic 3, 3 (2002), 418–463.Google ScholarDigital Library
- . 1995. On the expressive power of Datalog: Tools and a case study. Journal of Computer and System Sciences 51, 1 (1995), 110–134.Google ScholarDigital Library
- . 2003. Many-Dimensional Modal Logics: Theory and Applications.
Studies in Logic and the Foundations of Mathematics , Vol. 148. Elsevier.Google Scholar - . 1995. Answering queries using views. In Proceedings of the 14th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’95).Google ScholarDigital Library
- . 2018. Query expressibility and verification in ontology-based data access. In Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR’18).Google Scholar
- . 2010. Views and queries: Determinacy and rewriting. ACM Transactions on Database Systems 35, 3 (2010), Article 21, 41 pages.Google ScholarDigital Library
- . 2011. Schema Mapping Management in Data Exchange Systems. Ph.D. dissertation. University of Chile.Google Scholar
- . 1993. Equivalence of Datalog queries is undecidable. Journal of Logic Programming 15, 3 (1993), 231–241.Google ScholarDigital Library
Index Terms
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views
Recommendations
On Monotonic Determinacy and Rewritability for Recursive Queries and Views
PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsA query Q is monotonically determined over a set of views if Q can be expressed as a monotonic function of the view image. In the case of relational algebra views and queries, monotonic determinacy coincides with rewritability as a union of conjunctive ...
Determinacy and query rewriting for conjunctive queries and views
Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider ...
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 ...
Comments