P266: Enumeration of all full disjunction in an acyclic set

P266: Enumeration of all full disjunction in an acyclic set

Input:

An acyclic set of relation $R$ with $N$ tuples.

Output:

All full disjunctions of $R$.

Complexity:

$O(N)$ delay.

Comment:

Reference:

[Cohen2006] (Bibtex)