Towards Designing Acyclic Database Schemes

We present a modification of the synthesizing method (Bernstein [1976]), Biskup et al [1979]) to produce a third normal form, dependency preserving, lossless join decomposition of a universal relation scheme which is additionally acyclic. Our method essentially uses the options of the original method of how to group functional dependencies with the identical left hand side. Furthermore we present a decomposition theorem for acyclic database schemes.