A comparison between algebraic query languages for flat and nested databases
- 23 September 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 87 (2), 263-286
- https://doi.org/10.1016/0304-3975(91)90327-x
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A recursive algebra and query optimization for nested relationsACM SIGMOD Record, 1989
- An introduction to the completeness of languages for complex objects and nested relationsLecture Notes in Computer Science, 1989
- Extended algebra and calculus for nested relational databasesACM Transactions on Database Systems, 1988
- The powerset algebra as a result of adding programming constructs to the nested relational algebraACM SIGMOD Record, 1988
- Relational queries computable in polynomial timeInformation and Control, 1986
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- On Database LogicJournal of the ACM, 1982
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- On the expressive power of the relational algebraInformation Processing Letters, 1978