Extended algebra and calculus for nested relational databases
ACM Transactions on Database Systems (TODS)
Principles of Database Systems
Principles of Database Systems
Theory of non-first normal form relational databases (null values, nesting)
Theory of non-first normal form relational databases (null values, nesting)
An extension of relational algebra for summary tables
SSDBM'83 Proceedings of the 2nd international workshop on Proceedings of the Second International Workshop on Statistical Database Management
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
On completeness of historical relational query languages
ACM Transactions on Database Systems (TODS)
Temporal Relational Data Model
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
We discuss the issues encountered in the extended algebra and calculus languages for nested relations defined by Roth, Korth, and Silberschatz.[4]. 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.