Solving Equations in the Relational Algebra

Authors:
Joachim Biskup;Jan Paredaens;Thomas Schwentick;Jan Van den Bussche
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Computing
Year:
2004

Citing 0
Cited 2

Constraint processing in relational database systems: from theory to implementation

Proceedings of the 2010 ACM Symposium on Applied Computing
A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operator

Proceedings of the 32nd symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases, equivalent to the well-known powerset algebra. We study sparse equations, which are equations with at most polynomially many solutions. We look at their complexity and compare their expressive power with that of similar notions in the powerset algebra.