The Restricted and Bounded Fixpoint Closures of the Nested Algebra are Equivalent

The nested model is an extension of the traditional, “flat” re lational model in which relations can also have relationvalued entries. Its “default” query language, the nested al gebra, is rather weak, unfortunately, since it is only a conservative extension of the traditional, “flat” relation al algebra, and thus can only express a small fraction of the polynomial-time queries. Therefore, it was proposed to extend the nested algebra with a least-fixpoint construct, but the resulting language turned out to be too powerful: many inherently exponential queries could also be expressed. Two polynomial-time restrictions of the least-fixpoint closure of the nested algebra were proposed: the restricted least-fixpoint closure(by Gyssens and Van Gucht) and the bounded fixpoint closure (by Suciu). Here, we prove that both restrictions are equivalent in expressive power. We al so exhibit a proof technique, called type substitution, by which we reduce our result to its obvious counterpart in the “ flat” relational model; thus emphasizing the inherent weakness of the nested algebra.