DBScholar

Back to papers

Functional and Inclusion Dependencies: A Graph Theoretic Approach

Summary: Graph-theoretic framework for FD+IND implication; proves decidability for the unrestricted implication when INDs are typed and FDs are acyclic. Establishes NP- and PSPACE-hardness (bounded domains) and shows no k-ary complete axiomatization even under pairwise consistency. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
680
Venue
PODS
Year
1984
Pagerank
9.2564254e-05
Overall Rank
2,047 | 85.96%
DOI
10.1145/588011.588016

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{cosmadakis_pods84,
        address = {New York, NY, USA},
        series = {{PODS} '84},
        title = {{Functional and Inclusion Dependencies: A Graph Theoretic Approach}},
        url = {https://dl.acm.org/doi/10.1145/588011.588016},
        doi = {10.1145/588011.588016},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Cosmadakis, Stavros S. and Kanellakis, Paris C.},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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