Loading...
Please wait, while we are loading the content...
Solving equations in the relational algebra.
| Content Provider | CiteSeerX |
|---|---|
| Author | Biskup, Joachim Paredaens, Jan Schwentick, Thomas Bussche, Jan Van Den |
| 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. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Relational Algebra Sparse Equation Powerset Algebra Relational Algebra Expression Many Solution Similar Notion Query Language Well-known Powerset Algebra Powerful Operation Expressive Power Nested Relational Database Finite Domain Nested Relational Algebra Introduction Suppose Relational Algebra Equation Query Language Primitive |
| Content Type | Text |