The Complexity of the Evaluation of Complex Algebra Expressions
- 31 October 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 55 (2) , 322-343
- https://doi.org/10.1006/jcss.1997.1526
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Natural semanticsPublished by Springer Nature ,2005
- Space usage in functional query languagesPublished by Springer Nature ,1995
- On the complexity of queries in the logical data modelTheoretical Computer Science, 1993
- 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
- Generic Computation and its complexityPublished by Association for Computing Machinery (ACM) ,1991
- Possibilities and limitations of using flat operators in nested algebra expressionsPublished by Association for Computing Machinery (ACM) ,1988
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979