Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
- 6 March 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 254 (1-2) , 363-377
- https://doi.org/10.1016/s0304-3975(99)00301-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Complexity of the Evaluation of Complex Algebra ExpressionsJournal of Computer and System Sciences, 1997
- Bounded fixpoints for complex objectsTheoretical Computer Science, 1997
- Normal Forms and Conservative Extension Properties for Query Languages over Collection TypesJournal of Computer and System Sciences, 1996
- The Restricted and the Bounded Fixpoint Closures of the Nested Relational Algebra are EquivalentElectronic Workshops in Computing, 1995
- Converting nested algebra expressions into flat algebra expressionsACM Transactions on Database Systems, 1992
- On the expressive power of database queries with intermediate typesJournal of Computer and System Sciences, 1991
- An introduction to the completeness of languages for complex objects and nested relationsPublished by Springer Nature ,1989
- The Structure of the Relational Database ModelPublished by Springer Nature ,1989
- Non First Normal Form relations: An algebra allowing data restructuringJournal of Computer and System Sciences, 1986
- A relational model of data for large shared data banksCommunications of the ACM, 1970