The expressiveness of a family of finite set languages

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 1991, Pages 37-52

  Immerman, Neil ^a   Patnaik, Sushant ^a   Stemple, David ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING;

DATABASE LANGUAGE; DATABASE QUERY LANGUAGE; FINITE SET; LOGSPACE; ORDER INDEPENDENTS; UNIFIED FRAMEWORK;

QUERY LANGUAGES;

EID: 85054956501     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/113413.113417     Document Type: Conference Paper

References (37)

1. A. Aho, J. Ullman: Universality of data retrieval languages. Proceedings of Sixth ACM Symposium on POPL, Jan. 1979, 110-117.
2. S. Abiteboul, P. Kanellakis: Database theory column: Query languages for complex object databases. SIGACT News 21 No. 3, Summer 1990, 9-18.
3. S. Abiteboul, P. Kanellakis: Object identity as a query language primitive. Rapports de Recherche No. 1022, INRIA, Apr 1989.
4. S. Abiteboul, C. Beeri: On the power of languages for the manipulation of complex objects. Rapports de Recherche no. 846, INRIA, May 1988.
5. F. Arafati, S. Cosmadakis: Expressiveness of restricted recursive queries, Proceedings of 21st ACM STOC, 1989, 113-126.
6. S. Abiteboul, V. Vianu: Procedural and declarative database update languages. Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on PODS, 1988, 240-250.
7. S. Abiteboul, V. Vianu: Fixpoint extensions of first-order logic and datalog-like languages. Proceedings of LICS, 1989, 2-11.
8. S. Abiteboul, V. Vianu: Generic computation and its complexity. To appear in 32nd IEEE Symposium on FÖCS, 1991.
9. 1. Journal of Computer Systems and Science 41, No. 3, 1990, 274-306.
10. R.S.Boyer, J.S.Moore: 4 Computational Logic, Academic Press, New York, 1979.
11. 1989, 612-617. of 30th IEEE
12. A. Chandra, D. Harel: Computable queries for relational databases. Journal of Computer Systems and Science 21, 1980, 156-178.
13. A. Chandra, D. Harel: Structure and complexity of relational queries. Journal of Computer Systems and Science 25, 1982, 99-128.
14. A. Chandra, D. Hard: Horn clauses and fixpoint query hierarchy. Proceedings of lAth ACM STOC, May 1982, 158-163.
15. A. Chandra: Programming primitives for database languages. Proceedings of ACM Symposium on POPL, 1981, 50-62.
16. A. Chandra, L. Stockmeyer, U. Vishkin: Constant-depth reducibility, SIAM Journal of Computing 13, May 1984, 423-439.
17. A. Cobham: The intrinsic computational difficulty of functions. Proceedings of the 1964 Congress for Logic, Philosophy and Methodology of Science, North Holland, 24-30.
18. S. Cook: A taxonomy of problems with fast parallel algorithms. Information and Control 64, (1985), 2-22.
19. S. Cook, P. McKenzie: Problems complete for deterministic logspace. Journal of Algorithms 8, 1987, 385-394.
20. S. Cosmadakis, P. Kanellakis: Parallel evaluation of recursive rule queries. Proceedings of 5th ACM Symposium on PODS, 1986, 280-290.
21. M. Davis, S. Weyukar: Computability, Complexity and Languages. Academic Press, 1983.
22. R. Hull, J. Su: Untyped sets, invention and computable queries. Proceedings of 8th ACM Symposium on PODS, 1989, 347-360.
23. R. Hull, J. Su: On bulk data type constructors and manipulation primitives - a framework for analyzing expressive power and complexity. Proceedings of 2nd International Workshop on Database Programming Languages, June 1989, 396-410.
24. R. Hull, J. Su: On the expressive power of database queries with intermediate types. Proceedings of 7th ACM Symposium on PODS, Mar. 1988, 39-51.
25. N. Immerman: Languages that capture complexity classes. SIAM Journal on Computing 16 No. 4, Aug. 1987, 760-778.
26. N. Immerman: Relational queries computable in polynomial time. Proceedings of the 14th ACM STOC, May 1982, 147 - 152 .
27. N. Immerman: Upper and lower bounds for first order expressibility. Journal of Computer and System Sciences 25, 1982, 76-98.
28. N. Immermann: Nondeterministic space is closed under complementation. SIAM J. Comput. 17, No. 5, (1988), 935-938.
29. N. Immerman, S. Landau: The complexity of iterated multiplication. Proceedings of 4th Structure in Complexity Theory Conference, 1989, 104-111.
30. N. Immerman, E. Lander: Describing graphs: A first-order approach to graph canonization. Complexity Theory Retrospective, A. Selman, ed., Springer Verlag (1990).
31. N. Immerman, S. Patnaik, D. W. Stemple: The expressiveness of a family of finite set languages. Technical Report, Computer and Information Science Dept., University of Massachusetts, Amherst, 1991.
32. P. Kanellakis: Elements of relational database theory. Tech. Report CS-88-09, Dept. Of Computer Science, Brown University, Apr. 1988.
33. A. Ohori, P. Buneman, V. Breazu-Tannen: Database programming in Machiavelli - a polymorphic language with static type interference. Proceedings of the ACM SIGMOD, June 1989, 46-57.
34. X.Qian: The expressive power of the bounded iteration construct. Proceedings of the 2nd International Workshop on Database Programming Languages, 1990.
35. T. Sheard, D. Stemple: Automatic verification of database transaction safety. ACM transactions on Database Systems 14, No. 3, Sep. 1989, 322-368.
36. M. Y. Vardi: The complexity of relational query languages. Proceedings of 14th ACM STOC, May 1982, 137-146.
37. J. Vitter, E. Shriver: Optimal disk I/O with parallel block transfer. Proceedings of the 22nd ACM STOC, May 1990, 159-169.