DBScholar

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
1331
Venue
PODS
Year
2004
Pagerank
5.7382018e-05
Overall Rank
6,926 | 52.49%
DOI
10.1145/1055558.1055600

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bonatti_pods04,
        address = {New York, NY, USA},
        series = {{PODS} '04},
        title = {{On the Decidability of Containment of Recursive Datalog Queries - Preliminary report}},
        url = {https://dl.acm.org/doi/10.1145/1055558.1055600},
        doi = {10.1145/1055558.1055600},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bonatti, Piero A.},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,098 The Impact of Virtual Views on Containment 2010 VLDB 5.9778168e-05
6,310 Type Inference for Datalog and its Application to Query Optimisation 2008 PODS 5.9176726e-05
9,811 Schema-Based Query Optimisation for Graph Databases 2025 SIGMOD 5.214913e-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,630 On the Decidability of Query Containment under Constraints 1998 PODS 0.00010180625
Previous Page 1 / 1 Next

Semantically Similar Papers