On the power of aggregation in relational query languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1369 LNCS, Issue , 1998, Pages 260-280

  Libkin, Leonid ^a   Wong, Limsoon ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Institute of Systems Science   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; QUERY LANGUAGES; SYNTACTICS;

AGGREGATE FUNCTION; COMMERCIAL SYSTEMS; RATIONAL ARITHMETICS; RELATIONAL ALGEBRA; RELATIONAL CALCULUS; RELATIONAL LANGUAGES; RELATIONAL QUERY LANGUAGES; TRANSITIVE CLOSURE;

AGGREGATES;

EID: 84893485738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64823-2_15     Document Type: Conference Paper

References (22)

1. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison Wesley, 1995.
2. A. V. Aho and J. D. Ullman. Universality of data retrieval languages. In Proceedings of 6th Symposium on Principles of Programming Languages, Texas, pages 110-120, January 1979.
3. 1. JCSS, 41:274-306, 1990.
4. P. Buneman, S. Naqvi, V. Tannen, L. Wong. Principles of programming with complex objects and collection types. Theoretical Computer Science, 149(1):3-48, September 1995.
5. M. Consens and A. Mendelzon. Low complexity aggregation in GraphLog and Datalog, Theoretical Computer Science 116 (1993), 95-116. Extended abstract in ICDT'90.
6. G. Dong, L. LibMn, L. Wong. Local properties of query languages. Proc. Int. Conf. on Database Theory, Springer LNCS 1186, 1997, pages 140-154.
7. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, 1995.
8. K. Etessami. Counting quantifiers, successor relations, and logarithmic space, Journal of Computer and System Sciences 54 (1996), 400-411. Extended abstract in Structure in Complexity'95.
9. R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Finite Model Theory and Descriptive Complexity, 1996.
10. R. Fagin, L. Stockmeyer, M. Vardi, On monadic NP vs monadic co-NP, Information and Computation, 120 (1994), 78-92.
11. H. Gaifman, On local and non-local properties, in "Proceedings of the Herbrand Symposium, Logic Colloquium '81," North Holland, 1982.
12. S. Grumbach, L. Libkin, T. Milo and L. Wong. Query languages for bags: expressive power and complexity. SIGACT News, 27 (1996), 30-37.
13. Y. Gurevich. Toward logic tailored for computational complexity. In Proceedings of Computation and Proof Theory, Springer Lecture Notes in Mathematics, Vol. 1104, 1984, pages 175-216.
14. N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16:760-778, 1987.
15. N. Immerman and E. Lander. Describing graphs: A first order approach to graph canonization. In "Complexity Theory Retrospective", Springer Verlag, Berlin, 1990.
16. L. Libkin. On the forms of locality over finite models. In LICS'97, pages 204-215.
17. L. Libkin and L. Wong. Query languages for bags and aggregate functions. JCSS, 55 (1997), 241-272.
18. L. Libkin and L. Wong. Aggregate functions, conservative extension, and linear orders, in "Proceedings of 4th International Workshop on Database Programming Languages," Manhattan, New York, August 1993.
19. L. Libkin and L. Wong. Conservativity of nested relational calculi with internal generic functions. Information Processing Letters, 49 (1994), 273-280.
20. I. Niven and H.S. Zuckerman. Introduction to the Theory of Numbers. Wiley, 1980.
21. J. Nurmonen. On winning strategies with unary quantifiers. J. Logic and Computation, 6 (1996), 779-798.
22. L. Wong. Normal forms and conservative properties for query languages over collection types. JCSS 52(1):495-505, June 1996.