Abstract
A generalization of tableaux as a method for representing queries in relational databases, called sets of tableaux, is proposed. Every relational expression with the operators select, project, join and union can be represented by a set of tableaux. A study is made of the equivalence problem for sets of tableaux. It is shown that the theory of tableaux is easily extended to sets of tableaux, but the equivalence problem for set of tableaux (as well as the containment problem for single tableaux) is NP-complete even in very restricted cases. Polynomial time algorithms for testing equivalence of sets of tableaux (and containment of tableaux) in three special cases are presented. Sets of tableaux are further generalized to sets of elementary differences in order to include also the difference operator.
| Original language | English |
|---|---|
| Pages | 535-548 |
| Number of pages | 14 |
| State | Published - 1978 |
| Event | Int Conf on Very Large Data Bases, 4th, Proc - W Berlin, W Ger Duration: 13 Sep 1978 → 15 Sep 1978 |
Conference
| Conference | Int Conf on Very Large Data Bases, 4th, Proc |
|---|---|
| City | W Berlin, W Ger |
| Period | 13/09/78 → 15/09/78 |