The Complexity of the Evaluation of Complex Algebra Expressions

Journal of Computer and System Sciences

Volumn 55, Issue 2, 1997, Pages 322-343

  Suciu, Dan ^a   Paredaens, Jan ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

COMPLEX ALGEBRA EXPRESSIONS; EXPONENTIAL SPACE; TRANSITIVE CLOSURE;

QUERY LANGUAGES;

EID: 0031245946     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1526     Document Type: Article

References (20)

1. S. Abiteboul and C. Beeri, On the power of languages for the manipulation of complex objects, in "Proceedings of International Workshop on Theory and Applications of Nested Relations and Complex Objects, Darmstadt, 1988." Also available as INRIA Technical Report 846.
2. S. Abiteboul and G. Hillebrand, Space usage in functional query languages, in "Database Theory - ICDT'95, Prague, Czech Republic, January 1995" (G. Gottlob and M. Vardi, Eds.), Springer-Verlag, Berlin, 1995.
3. A. V. Aho and J. D. Ullman, Universality of data retrieval languages, in "Proceedings 6th Symposium on Principles of Programming Languages, Texas, January 1979," pp. 110-120.
4. S. Abiteboul and V. Vianu, Generic computation and its complexity, in "Proceedings, 23rd ACM Symposium on the Theory of Computing, 1991."
5. V. Breazu-Tannen, P. Buneman, and L. Wong, Naturally embedded query languages, in "Proceedings, 4th International Conference on Database Theory, Berlin, Germany, October 1992" (J. Biskup and R. Hull, Eds.), pp. 140-154, Springer-Verlag, Berlin, 1992. Available as UPenn Technical Report MS-CIS-92-47; Lect. Notes in Comput. Sci, Vol. 646.
6. 1, J. Comput. System Sci. 41 (1990), 274-306.
7. D. W. Barnes and J. M. Mack, "An Algebraic Introduction to Mathematical Logic," Springer-Verlag, New York/Berlin, 1975.
8. B. Bollobas, "Graph Theory: An Introductory Course," Springer-Verlag, New York/Berlin, 1979.
9. A. Chandra and D. Harel, Computable queries for relational databases, J. Comput. System Sci. 21, No. 2 (1980), 156-178.
10. J. Van den Bussche, personal communication, 1994.
11. R. Hull and J. Su, On the expressive power of database queries with intermediate types, J. Comput. System Sci. 43 (1991), 219-267.
12. N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987), 760-778.
13. G. Kahn, Natural semantics, in "Proceedings of Symposium on Theoretical Aspects of Computer Science" pp. 22-39, Springer-Verlag, 1987.
14. G. M. Kuper and M. Y. Vardi, On the complexity of queries in the logical data model, Theoretical Computer Science 116, No. 1 (1993), 33-58.
15. J. Paredaens and D. Van Gucht, Possibilities and limitations of using flat operators in nested algebra expressions, in "Proceedings, 7th ACM Symposium on Principles of Database Systems, Austin, Texas," pp. 29-38, 1988.
16. J. Paredaens and D. Van Gucht, Converting nested relational algebra expressions into flat algebra expressions, ACM Transaction on Database Systems 17, No. 1 (1992), 65-93.
17. D. Suciu and V. Breazu-Tannen, A query language for NC, in "Proceedings, 13th ACM Symposium on Principles of Database Systems, Minneapolis, Minnesota, May 1994," pp. 167-178. UPenn Technical Report MC-CIS-94-05.
18. H.-J. Schek and M. H. Scholl, The relational model with relation-valued attributes, Information Systems 11, No. 2 (1986), 137-147.
19. S. J. Thomas and P. C. Fischer, Nested relational structures, in "Advances in Computing Research: The Theory of Database" (P. C. Kanellakis and F. P. Preparata, Eds.), pp. 269-307, JAI Press London, England, 1986.
20. L. Wong, Normal forms and conservative properties for query languages over collection types, in "Proceeding, 12th ACM Symposium on Principles of Database Systems, Washington, DC, May 1993," pp. 26-36. UPenn Technical Report MS-CIS-92-59.