One of the most important results in the theory of decomposition of universal relational schemata is the equivalence of acyclicity of the hypergraph of the schema to numerous desirable properties regarding simplicity of constraints, correctness of query evaluation algorithms, and complexity of integrity maintenance. In this paper, we show that the thrust of these results is not specific to the ...