On the complexity of division and set joins in the relational algebra
Journal of Computer and System Sciences, Volume 73, Issue 4, 2007, Pages 538-549.
dichotomy theoremlinear relational algebra expressioncomplexityrelational algebradatabaseMore(8+)
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, and equijoins, must produce intermediate results of quadratic size. To prove this result, we show a dichotomy theorem about intermediate sizes of relational algebra expressions (they are either all linea...More