Solving equations in the relational algebra
| dc.creator | Biskup, Joachim | |
| dc.creator | Paredaens, Jan | |
| dc.creator | Schwentick, Thomas | |
| dc.creator | Bussche, Jan Van den | |
| dc.date | 2001-06-14 | |
| dc.date | 2003-12-10 | |
| dc.date.accessioned | 2026-07-07T03:17:15Z | |
| dc.date.available | 2026-07-07T03:17:15Z | |
| dc.description | 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 \emph{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. | |
| dc.description | Minor revision, accepted for publication in SIAM Journal on Computing | |
| dc.identifier | https://arxiv.org/abs/cs/0106034 | |
| dc.identifier | http://arxiv.org/abs/cs/0106034 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30653 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Databases | |
| dc.subject | F.4.2; H.2.3 | |
| dc.title | Solving equations in the relational algebra | |
| dc.type | text |