DBScholar

Back to papers

Notions of Dependency Satisfaction

Summary: Introduces two notions of dependency satisfaction—consistency (generalizes weak satisfaction; suits EGDs but conflicts with TGDs) and completeness (matches intuitive TGD semantics; awkward for EGDs)—framing them as alternative enforcement policies. Characterizes both via tableaux and first-order semantics, links their decision problems to dependency implication, and examines avoiding a universal relation scheme. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
625
Venue
PODS
Year
1982
Pagerank
6.482729e-05
Overall Rank
4,843 | 66.78%
DOI
10.1145/588111.588142

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{graham_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{Notions of Dependency Satisfaction}},
        url = {https://dl.acm.org/doi/10.1145/588111.588142},
        doi = {10.1145/588111.588142},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Graham, Marc H. and Mendelzon, Alberto O.},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 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