Can Datalog Be Approximated?

Journal of Computer and System Sciences

Volumn 55, Issue 2, 1997, Pages 355-369

  Chaudhuri, Surajit ^a   Kolaitis, Phokion G ^b  

^a MICROSOFT RESEARCH   (United States)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ERROR ANALYSIS; POLYNOMIALS; QUERY LANGUAGES; RECURSIVE FUNCTIONS;

RELATIONAL ALGEBRA QUERY;

RELATIONAL DATABASE SYSTEMS;

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

References (21)

1. F. Afrati and C. H. Papadimitriou, The parallel complexity of simple chain queries, in "Proceedings, 6th ACM Symp. on Principles of Database Systems, 1987," pp. 210-213.
2. M. Ajtai and Y. Gurevich, DATALOG vs First-Order Logic, J. Comput. System Sci. 49 (1994), 562-588.
3. A. V. Aho and J. D. Ullman, Universality of data retrieval languages, in "Proceedings, 6th ACM Symp. on Principles of Programming Languages, 1979," pp. 110-117.
4. S. A. Cook, An observation of time-storage trade-off, J. Comput. System Sci. 9 (1974), 308-316.
5. S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi, Decidable optimization problems for database logic programs, in "Proc. 20th ACM Symp. on Theory of Computing," pp. 447-490.
6. A. K. Chandra and P. M. Merlin, Optimal implementation of conjunctive queries in relational databases, in "Proc. 9th ACM Symp. on Theory of Computing, New York, 1977," pp. 77-90.
7. S. Chaudhuri, Finding nonrecursive envelopes for recursive predicates, in "Proceedings, 12th ACM Symp. on Principles of Database Systems, Washington, DC, 1993."
8. R. Fagin, Monadic generalized spectra, Z. Math. Logik 21 (1975), 89-96.
9. R. Fagin, L. Stockmeyer, and M. Y. Vardi, On Monadic NP vs. Monadic co-NP, in "Proc. 8th IEEE Conf. on Structure in Complexity Theory, 1993," pp. 19-30.
10. H. Gaifman, H. Mairson, Y. Sagiv, and M. Y. Vardi, Undecidable optimization problems for database logic programs, in "Proc. 2nd IEEE Symp. on Logic in Computer Science, Ithaca, 1987," pp. 106-115.
11. M. R. Garey and D. S. Johnson, "Computers and Intractability - A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
12. Y. E. Ioannides, Bounded recursion in deductive databases, Algorithmic 1 (1986), 391-385.
13. P. Kanellakis and S. Abiteboul, Deciding bounded recursion in database logic programs, SIG ACT News 20 (4), 1989.
14. P. G. Kolaitis and M. Y. Vardi, On the expressive power of Datalog: Tools and a case study, in "Proc. 9th ACM Symp. on Principles of Database Systems, 1990," pp. 61-71.
15. D. Maier, J. D. Ullman, and M. Y. Vardi, On the foundations of the universal relation model, ACM Trans. on Database Systems 9 (1984), 283-308.
16. J. F. Naughton, Data independent recursion in deductive databases, J. Comput. Syst. Sci. 38 (1989), 259-289.
17. C. H. Papadimitriou and K. Steiglitz, "Combinatorial Optimization-Algorithms and Complexity," Prentice-Hall, Englewood Cliffs, NJ, 1982.
18. C. H. Papadimitriou, "Computational Complexity," Addison-Wesley, Reading, MA, 1994.
19. Y. Sagiv and M. Yannakakis, Equivalences among relational expressions with the union and difference operators, J. Assoc. Comput. Mach. 27, No. 4 (1981), 633-655.
20. J. D. Ullman, "Principles of Database and Knowledge Base Systems," Vol. 2, Computer Science Press, New York, 1989.
21. M. Y. Vardi, The complexity of relational query languages, in "Proc. 14th ACM Symp. on Theory of Computing, San Francisco, 1982," pp. 137-146.