On the Desirability of Acyclic Database Schemes
Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis · Journal of the ACM · 1983
A class of database schemes, called acychc, was recently introduced.It is shown that this class has a number of desirable properties.In particular, several desirable properties that have been studied by other researchers m very different terms are all shown to be eqmvalent to acydicity.In addition, several equivalent charactenzauons of the class m terms of graphs and hypergraphs are given, and a smaple algorithm for determining acychclty is presented.Also given are several eqmvalent characterizations of those sets M of multivalued dependencies such that M is the set of muRlvalued dependencies that are the consequences of a given join dependency.Several characterizations for a conflict-free (in the sense of Lien) set of muluvalued dependencies are provided.