γ-Acyclic database schemes and nested relations

Nested relations have been put forward as a way of extending the applicability of the classical relational model. In this model acyclic database schemes have attracted a lot of interest because of the desirable properties they enjoy. Herein we characterize those γ-acyclic database schemes that are equivalent to nested relation schemes, and present an algorithm to restructure a γ-acyclic database scheme into a nested database scheme. This is desirable, since nested relations minimize redundancy and improve efficiency