ON FINITE FD-ACYCLICITY

Yehoshua Sagiv, Oded Shmueli

Research output: Contribution to conferencePaperpeer-review

Abstract

Database schemes with functional dependencies are considered. The satisfying states of these schemes are those having representative instances that satisfy all the functional dependencies. All states are assumed to be finite. A database scheme is fd-acyclic if all its pairwise consistent satisfying states are also join consistent. If the relation schemes of a database scheme are closed under the functional dependencies, then the database scheme is fd-acyclic if and only if it is acyclic (i.e., its corresponding hyper-graph is acyclic). If a cover of the functional dependencies is embedded in the database scheme, then fd-acyclicity can be tested in polynomial time.

Original languageEnglish
Pages173-182
Number of pages10
DOIs
StatePublished - 1986
Event5th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1986 - Cambridge, United States
Duration: 24 Mar 198626 Mar 1986

Conference

Conference5th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1986
Country/TerritoryUnited States
CityCambridge
Period24/03/8626/03/86

Bibliographical note

Publisher Copyright:
© 1986.

Fingerprint

Dive into the research topics of 'ON FINITE FD-ACYCLICITY'. Together they form a unique fingerprint.

Cite this