On Roth, Korth, and Silberschatz's extended algebra and calculus for nested relational databases

Simple item page
dc.citation.epage383en_US
dc.citation.issueNumber2en_US
dc.citation.spage374en_US
dc.citation.volumeNumber17en_US
dc.contributor.authorTansel, A. U.en_US
dc.contributor.authorGarnett, Lucyen_US
dc.date.accessioned2016-02-08T10:55:08Z
dc.date.available2016-02-08T10:55:08Z
dc.date.issued1992en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractWe 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.en_US
dc.identifier.doi10.1145/128903.128908en_US
dc.identifier.issn0362-5915en_US
dc.identifier.urihttp://hdl.handle.net/11693/26111en_US
dc.language.isoEnglishen_US
dc.relation.isversionofhttps://doi.org/10.1145/128903.128908en_US
dc.source.titleACM Transactions on Database Systemsen_US
dc.subjectAlgebraen_US
dc.subjectComputer programming languagesen_US
dc.subjectSet theoryen_US
dc.subjectTheorem provingen_US
dc.subjectEquivalence of algebra and calculusen_US
dc.subjectNested relationsen_US
dc.subjectRelational algebraen_US
dc.subjectRelational calculusen_US
dc.subjectRelational database systemsen_US
dc.titleOn Roth, Korth, and Silberschatz's extended algebra and calculus for nested relational databasesen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
On-Roth-Korth-and-Silberschatz's-extended-algebra-and-calculus-for-nested-relational-databases.pdf
Size:
512.82 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering