Tansel, A. U.Garnett, Lucy2016-02-082016-02-0819920362-5915http://hdl.handle.net/11693/26111We discuss the issues encountered in the extended algebra and calculus languages for nested relations defined by Roth, Korth, and Silberschatz. Their equivalence proof between algebra and calculus fails because of the keying problems and the use of extended set operations. Extended set operations also have unintended side effects. Furthermore, their calculus seems to allow the generation of power sets, thus making it more powerful than their algebra.EnglishAlgebraComputer programming languagesSet theoryTheorem provingEquivalence of algebra and calculusNested relationsRelational algebraRelational calculusRelational database systemsArticle10.1145/128903.128908