DBScholar

Back to papers

Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract)

Summary: Establishes CQ containment (hence equivalence/non-minimality) in NP for inclusion dependencies when either no FDs or FDs are key-based, under infinite-database semantics. Finite databases may add containments, but a compactness theorem rules out finite-only counterexamples in the key-based case. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
622
Venue
PODS
Year
1982
Pagerank
0.00030343737
Overall Rank
134 | 99.09%
DOI
10.1145/588111.588138

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{johnson_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/588111.588138},
        doi = {10.1145/588111.588138},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Johnson, D. S. and Klug, A.},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 52 citing papers.

Rank Citing Paper Year Venue Pagerank
13,184 Independent Database Schemes Under Functional and Inclusion Dependencies 1987 VLDB 5.093636e-05
13,194 ON FINITE FD-ACYCLICITY (Extended Abstract) 1986 PODS 5.093636e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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