On the Undecidability of Equivalence Problems for Relational Expressions
- 32 Downloads
We consider two versions of the relational algebra: (a) the attribute relational algebra, based on the natural join and relations with columns corresponding to attributes, and (b) the positional relational algebra, based on the cross product and relation with an order on the columns, and with any column identified by its position in that order. For the attribute relational algebra, we show that both the equivalence and the finite equivalence (i.e., equivalence over finite relations only) of expressions involving just one ternary relation and the operators of projection, selection, join and difference, are undecidable. For the positional relational algebra, we show that both the equivalence and finite equivalence of expressions involving just one binary relation and the operators of projection, selection, cross product, restriction and difference, are undecidable.
Unable to display preview. Download preview PDF.
- 3.Codd, E. F.  “Relational Completeness of Data Base Sublanguages”. In: Data Base Systems (R. Rustin, Ed.), Prentice-Hall, Englewood Cliffs, New Jersey, 65–98.Google Scholar
- 4.Gurevich, Y.  “The Word Problem for Certain Classes of Semigroups”, Algebra i Logika 5 (1966) 25–35 (in Russian).Google Scholar
- 5.Imielinski, T., and Lipski, W.  “The Relational Model of Data and Cylindric Algebras,” ACM SIGACT-SIGMOD Symp. on Principles of Database Systems ,Los Angeles, March 1982. (Final version received too late to be included in the formal proceedings: see ICS PAS Report 446, Warsaw, Aug. 1981.)Google Scholar
- 6.Imielinski, T., and Lipski, W.  “A Technique for Translating States between Database Schemata,” ACM SIGMOD Internat. Conf. on Management of Data ,Orlando, Florida, June 1982, 61–68.Google Scholar
- 15.Scott, D.  “A Decision Method for Validity of Sentences in Two Variables”, Journal of Symbolic Logic 27 ,4 (1962) 477.Google Scholar
- 16.Solomon, M.K.  Some Properties of Relational Expressions, ACM South-East Regional Conference (April 1979) 111–116.Google Scholar
- 17.Trakhtenbrot, B.A.  “Impossibility of an Algorithm for the Decision Problem in Finite Classes”, Doklady Akademii Nauk SSSR 70 (1950) 569–572; translated in: Amer. Math. Soc. Transl. Ser. 2 ,23 (1963) 1–5.Google Scholar