Solving equations in the relational algebra

Details Solving equations in the relational algebra Solving equations in the relational algebra

2001-06-14

arxiv.org/abs/cs/0106034v2

Computer Science

Logic in Computer Science

Minor revision, accepted for publication in SIAM Journal on Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Solving equations in the relational algebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving equations in the relational algebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving equations in the relational algebra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275679