Generic computation and its complexity

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 209-219

  Abiteboul, Serge ^a   Vianu, Victor ^b  

^a INRIA   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; MAPPING; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; QUERY PROCESSING;

ABSTRACT INTERFACES; COMPLEXITY MEASURES; DATABASE QUERIES; GENERIC MAPPING; LIMITED COMMUNICATION; LOGICAL PROPERTIES; POLYNOMIAL-TIME; TECHNICAL TOOLS;

TURING MACHINES;

EID: 85029975202     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103444     Document Type: Conference Paper

References (26)

1. S. Abiteboul and P. Kanellakis, Object Identity as a Query Language Primitive. In Proc. ACM SIGMOD Int 1. Conf. on Management of Data (1989), full version to appear in JACM.
2. Abiteboul, S., V. Vianu, Datalog Extensions for Database Updates and Queries, I. N. R.I.A. Technical Report No.715 (1988). To appear in JCSS.
3. Abiteboul, S., V. Vianu, Fixpoint Extensions of First-Order Logic and Datalog-like Languages, Proc. Fourth Annual Symposium on Logic in Computer Science, Asilomar, California (1989) pp. 71-79.
4. Abiteboul, S., V. Vianu, Procedural Languages for Database Queries and Updates, JCSS, 41, 2 (1990) pp. 181-229.
5. Bancilhon R., R. Ramakrishnan, an Amateurs Introduction to Recursive Query Processing, Proc. ACM SIGMOD Int1. Conf. on Management of Data (1986) pp. 16-52.
6. Chandra, A. K., Programming Primitives for Database Languages, Proc. ACM Symposium on Principles of Programming Languages, Williamsburg (1981), pp. 50-62.
7. Chandra, A. K., Theory of Database Queries, Proc. 7th ACM Symp. on Principles of Database Systems (1988), pp. 1-9.
8. Chandra, A. K., D. Harel, Computable Queries for Relational Databases, Journal of Computer and System Sciences 21:2 (1980), 156-178.
9. Chandra, A. K., D. Harel, Structure and Complexity of Relational Queries, Journal of Computer and System Sciences 25:1 (1982), 99-128.
10. Chandra, A. K., D. Harel, Horn Clause Queries and Generalizations, J. Logic Programming 2, 1 (1985), pp. 1-15.
11. Denninghof, K., V. Vianu, The Power of Methods With Parallel Semantics, UCSD Technical Report CS91-184 (preliminary version, 1991).
12. Fagin R., Finite-Model Theory-A Personal Per-spective, Proc. Int1. Conf. on Database Theory (1990).
13. Gurevich, Y., Logic andthe Challenge of Cornputer Science, Trends in Theoretical Computer Science, (E. Borger), Computer Science Press (1988). pp.1-57.
14. Gurevich Y., S. Shelah, Fixed-Point Extensions of First-Order Logic, 26th IEEE FOCS (1985), pp. 346-353a
15. Hull R, J. Su, Untyped Sets, Invention and Computable Queries, Proc. ACM Symp. on Principles of Database Systems (1989), pp. 347-359.
16. Immerman N., Relational Queries Computable in Polynomial Time, Information and Control 68 (1986), pp. 86-104.
17. Immerman N., Languages which Capture Complexity Classes, SIAM J. Comp., 16, 4 (1987) pp. 760-778.
18. Immerman N., Expressibility as a Complexity Messure: Results and Directions, Yale Univ. Res. Rep. DCS-TR-538, (1987).
19. Cai J.-W., M. Fiirer, N. Immerman, An Optimal Lower Bound on the Number of Variables for Graph Identification, Proc. IEEE FOCS (1989), pp. 612-617.
20. Kolaitis, P., Personal communication, 1990.
21. Kanellakis, P. C., Elements of Relational Database Theory, to appear as a chapter in Handbook of Theoretical Computer Science, North-Holland.
22. Kolaitis, P., C. Papadimitriou, Why not negation by fixpoint? Proc. ACM SIGACTSIGART-SIGMOD Symp. on Principles of Database Systems, (1988), pp. 231-239.
23. Kolaitis, P., M.Y. Vardi, 0/1 Laws for Infinitary Logic, IEEE Symp. on Logic in Computer Science (1990), pp. 156-167.
24. S. Linden, an Analysis of Fixed-Point Queries on Binary Trees, PhD thesis, UCLA. To appear in Theoretical Computer Science.
25. Unman, J. D., Principles of Database and Knowledge Base Systems, Computer Science Press (1988).
26. Vardi, M.Y., The Complexity of Relational Query Languages, Proc. 14th ACM STOC(1982), pp. 137-146.