DBScholar

Back to papers

ON FINITE FD-ACYCLICITY (Extended Abstract)

Summary: Studies database schemes under FDs with finite representative instances and introduces fd-acyclicity: every pairwise-consistent satisfying state is join-consistent. Shows fd-acyclicity ⇔ hypergraph acyclicity when relation schemes are FD-closed, and gives a polynomial-time test when an FD cover is embedded. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
766
Venue
PODS
Year
1986
Pagerank
5.093636e-05
Overall Rank
13,194 | 9.48%
DOI
10.1145/6012.15422

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{sagiv_pods86,
        address = {New York, NY, USA},
        series = {{PODS} '86},
        title = {{ON FINITE FD-ACYCLICITY (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/6012.15422},
        doi = {10.1145/6012.15422},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Sagiv, Yehoshua and Shmueli, Oded},
        year = {1986}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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