DBScholar

Back to papers

On the Decidability of Query Containment under Constraints

Summary: Decidability of containment for nonrecursive Datalog under inclusion constraints using set operations, restricted quantifiers, regular path expressions, and cardinality (models relational/ER/O-O schemas). Provides decision procedures/complexity: decidable when q omits regexes or when no number restrictions (first decidability for CQs with regex); undecidable if q' may use inequalities. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1139
Venue
PODS
Year
1998
Pagerank
0.00010180625
Overall Rank
1,630 | 88.82%
DOI
10.1145/275487.275504

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{calvanese_pods98,
        address = {New York, NY, USA},
        series = {{PODS} '98},
        title = {{On the Decidability of Query Containment under Constraints}},
        url = {https://dl.acm.org/doi/10.1145/275487.275504},
        doi = {10.1145/275487.275504},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Calvanese, Diego and De Giacomo, Giuseppe and Lenzerini, Maurizio},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers