Database Paper Browser

Back to papers

On the Decidability of Containment of Recursive Datalog Queries - Preliminary report

Summary: Identifies a new class of recursive Datalog queries with decidable query containment. Extends prior decidable fragments by allowing recursive predicates of arity >2 and nonlinear recursion, generalizing monadic and regular-path-based cases. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1332
Venue
PODS
Year
2004
Pagerank
4.843579e-05
Overall Rank
7,070 | 50.82%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,312 Type Inference for Datalog and its Application to Query Optimisation 2008 PODS 5.1158809e-05
7,275 The Impact of Virtual Views on Containment 2010 VLDB 4.7806552e-05
9,676 Schema-Based Query Optimisation for Graph Databases 2025 SIGMOD 4.3047774e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,490 On the Decidability of Query Containment under Constraints 1998 PODS 0.00011699154
Previous Page 1 / 1 Next

Semantically Similar Papers