Relational queries computable in polynomial time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1982, Pages 147-152

  Jmmerman, Neil ^a,b  

^a TUFTS UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; QUERY PROCESSING; SYNTACTICS;

EXPRESSIVE POWER; FIRST ORDER PREDICATE CALCULUS; LEXICOGRAPHIC ORDER; NATURAL MATHEMATICAL LANGUAGES; RELATIONAL CALCULUS; RELATIONAL DATABASE; RELATIONAL QUERIES; TRANSITIVE CLOSURE;

QUERY LANGUAGES;

EID: 85051541380     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800070.802187     Document Type: Conference Paper

References (14)

1. Aho, A., Hoperoft, J., Ullman, J., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. th Symp. on Principles of Programming Languages, 1979, pp. 110-117.
3. th Symp. on Principles of Programming Languages, 1981, pp. 50-62.
4. Chandra, A., Harel, D., "Computable Queries for Relational Databases," JCSS, Vol. 21, No. 2, October, 1980, 156-178.
5. st Symp. on Foundations of Computer Science, 1980, pp: 337-347.
6. Chandra, A., Harel, D., "Horn Clause and the 1-ixpoint Query Hierarchy," to appear.
7. Codd, E.F., "Relational Completeness of Database Sublanguages," in Database Systems, R. Rustin, ed., Prentice-Hall, 1972, pp. 65-98.
8. Enderton, H., A Mathematical Introduction to Logic, Academic Press, 1972.
9. Harel, David, personal communication.
10. st Symp. on Foundations of Computer Science, 1980, pp. 74-82.
11. Immerman, N., "Number of Quantifiers is Better than Number of Tape Cells," JCSS, Vol. 22, No. 3, June, 1981, pp. 384-406.
12. Immerman, N., "Upper and Lower Bounds for First Order Expressibility," to appear in JCSS, 1982.
13. Ullman, J.D., Introduction to Database Systems, Computer Science Press, 1980.
14. Vardi, M. "Complexity of Relational Query Languages," this Volume.