Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Equivalence of datalog queries is undecidable
Journal of Logic Programming
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Decidable Containment of Recursive Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Towards Service Description Logics
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On the undecidability of description and dynamic logics with recursion and counting
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Conjunctive query containment and answering under description logic constraints
ACM Transactions on Computational Logic (TOCL)
Type inference for datalog and its application to query optimisation
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The impact of virtual views on containment
Proceedings of the VLDB Endowment
Datalog for security, privacy and trust
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
| Hi-index | 0.00 |
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unrestricted recursive queries, and decidable for recursive monadic queries and conjunctive queries over regular path expressions. In this paper, we identify a new class of recursive queries with decidable containment. Our framework extends the aforementioned query classes by supporting recursive predicates with more than two arguments and nonlinear recursion.