On the Equivalence of Recursive and Nonrecursive Datalog Programs

Journal of Computer and System Sciences

Volumn 54, Issue 1, 1997, Pages 61-78

  Chaudhuri, Surajit ^a   Vardi, Moshe Y ^b  

^a MICROSOFT RESEARCH   (United States)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; EQUIVALENCE CLASSES; LOGIC PROGRAMMING; OPTIMIZATION; RECURSIVE FUNCTIONS;

CONJUNCTIVE QUERIES; DATALOG PROGRAM; EQUIVALENCE PROBLEM;

QUERY LANGUAGES;

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

References (51)

1. A. V. Aho and J. D. Ullman, Universality of data retrieval languages, in "Proceedings, ACM Symp. on Principles of Programming Languages, 1979," pp. 110-117.
2. S. Abiteboul and S. Vianu, Fixpoint extensions of first-order logic and Datalog-like languages, in "Proceedings, 4th IEEE Symp. on Logic in Computer Science, 1989," pp. 71-79.
3. C. Beeri, On the membership problem for functional and multivalued dependencies in relational databases, ACM Trans. Database Systems 5 (1980), 241-259.
4. F. Bancilhon and R. Ramakrishnan, An amateur's introduction to recursive query processing strategies, in "Proceedings, ACM Conf. on Management of Data, Washington, 1986," pp. 16-52.
5. A. K. Chandra, Programming primitives for database languages, in "Proceedings, 8th ACM Symp. on Principles of Programming Languages, Williamsburg, 1981," pp. 50-62.
6. A. K. Chandra and D. Harel, Computable queries for relational databases, J. Comput. System Sci. 21 (1980), 156-178.
7. A. K. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982), 99-128.
8. A. K. Chandra and D. Harel, Horn clause queries and generalizations, J. Logic Programming 2 (1985), 1-15.
9. A. K. Chandra, A. Kozen and L. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28 (1981), 114-133.
10. A. K. Chandra, H. R. Lewis, and J. A. Makowsky, Embedded implicational dependencies and their inference problem, in "Proceedings, 13th ACM Symp. on Theory of Computing, 1981," pp. 342-354.
11. S. Chaudhuri and M. Y. Vardi, On the complexity of equivalence between recursive and nonrecursive Datalog programs, in "Proceedings, 13th ACM Symp. on Principles of Database Systems, 1994," pp. 107-116.
12. S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi, Decidable optimization problems for database logic programs, in "Proceedings, 20th ACM Symp. on Theory of Computing, 1988," pp. 477-490.
13. S.S. Cosmadakis and P. Kanellakis, Parallel evaluation of recursive rule queries, in "Proceedings, 5th ACM Symp. on Principles of Database Systems, Cambridge, 1986," pp. 280-293.
14. O. L. Costich, A Medvedev characterization of sets recognized by generalized finite automata, Math. Systems Theory 6 (1972), 263-267.
15. B. Courcelle, The monadic second-order theory of graphs I - Recognizable sets of finite graphs, Inform. and Comput. 85 (1972), 263-267.
16. B. Courcelle, Recursive queries and context-free graph grammars, Theoret. Comput. Sci. 78 (1991), 217-244.
17. J. E. Doner, Three acceptors and some of their applications, J. Comput. System Sci. 4 (1971), 406-451.
18. E. A. Emerson and C. S. Jutla, Complexity of tree automata and modal logics of programs, in "Proceedings, 29th IEEE Symp. on Foundations of Computer Science, 1988," pp. 328-337.
19. H. Gallaire and J. Minker, "Logic and Databases," Plenum, New York, 1978.
20. H. Gaifman, H. Mairson, Y. Sagiv, and M. Y. Vardi, Undecidable optimization problems for database logic programs, J. Assoc. Comput. Mach. 40 (1993), 683-713.
21. G. G. Hillebrand, P. C. Kanellakis, H. G. Mairson, and M. Y. Vardi, Tools for Datalog boundedness, in "Proceedings, 10th ACM Symp. on Principles of Database Systems, May 1991," pp. 1-12.
22. G. G. Hillebrand, P. C. Kanellakis, H. G. Mairson, and M. Y. Vardi, Undecidable boundedness problems for Datalog programs, J. Logic Programming, to appear.
23. N. Immerman, Relational queries computable in polynomial time, Inform. and Control 68 (1986), 86-104.
24. N. D. Jones, Space-bounded reducibility among combinatorial problems, J. Comput. System Sci. 11 (1975), 68-86.
25. P. C. Kanellakis, Elements of relational database theory, in "Handbook of Theoretical Computer Science," Vol. B, Chap. 17 (J. van Leeuwen, A. R. Meyer, N. Nivat, M. S. Paterson, and D. Perrin, Eds.), North-Holland, Amsterdam/ New York, 1990.
26. P. C. Kanellakis and S. Abiteboul, Deciding bounded recursion in database logic programs, SIGACT News 20 No. 4 (1989).
27. D. Maier, J. D. Ullman, and M. Y. Vardi, On the foundations of the universal relation model, ACM Trans. Database Systems 9 (1984), 283-308.
28. R. van der Meyden, recursively indefinite databases, Theoret. Comput. Sci. 116 (1993), 151-194.
29. A. R. Meyer and M. J. Fischer, Economy of description by automata, grammars, and formal systems, in "Proceedings, 21st IEEE Symp. on Switching and Automata Theory, 1971," pp. 188-191.
30. A. R. Meyer and L. J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential time, in "Proceedings, 13th IEEE Symp. on Switching and Automata Theory, 1972," pp. 125-129.
31. I. S. Mumick and H. Pirahesh, Overbound and right-linear queries, in "Proceedings, 10th ACM Symp. on Principles of Database Systems, 1991," pp. 127-141.
32. Y. N. Moschovakis, "Elementary Induction on Abstract Structures," North Holland, Amsterdam/New York, 1974.
33. J. F. Naughton, Data independent recursion in deductive databases, J. Comput. System Sci. 38 (1989), 259-289.
34. J. F. Naughton, Minimizing function-free recursive definitions, J. Assoc. Comput. Mach. 36 (1989), 69-91.
35. J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman, Efficient evaluation of right, left, and multilinear rules, in "Proceedings, ACM-SIGMOD Int'l Conf. on Management of Data, 1989," pp. 235-242.
36. M. O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1-35.
37. M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. Develop. 3 (1959), 114-125.
38. R. Ramakrishnan, Y. Sagiv, J. D. Ullman and M. Y. Vardi, Logical query optimization by proof-tree transformation, J. Comput. System Sci. 47 (1993), 222-248.
39. Y. Sagiv and M. Yannakakis, Equivalence among relational expressions with the union and difference operators, J. 27 No. 4 (1980), 633-655.
40. Y. Sagiv, Optimizing Datalog programs, in "Foundations of deductive Databases and Logic Programming" (J. Minker, Ed.), pp. 659-698, Morgan Kaufmann, San Mateo, CA, 1988.
41. H. Seidl, Deciding equivalence of finite tree automata, SIAM J. Comput. 19 (1990), 424-437.
42. O. Shmueli, Decidability and expressiveness aspects of logic queries, in "Proceedings, 6th ACM Symp. on Principles of Database Systems, 1987," pp. 237-249.
43. J. W. Thatcher and J. B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Systems Theory 2 (1968), 57-81.
44. J. D. Ullman, "Principles of Database and Knowledge Base Systems," Vol. 1, Comput. Sci. Press, New York, 1988.
45. J. D. Ullman, "Principles of Database and Knowledge Base Systems," Vol. 2, Comput. Sci. Press, New York, 1989.
46. J. D. Ullman and A. Van Gelder, Parallel complexity of logical query programs, Algorithmica 3 (1988), 5-42.
47. M. Y. Vardi, The complexity of relational query languages, in "Proceedings, 14th ACM Symp. on Theory of Computing, San Francisco, 1982," pp. 137-146.
48. M. Y. Vardi, Decidability and undecidability results for boundedness of linear recursive queries, in "Proceedings, 7th ACM Symp. on Principles of Database Systems, 1988," pp. 341-351.
49. M. Y. Vardi, Automata theory for database theoreticians, in "Theoretical Studies in Computer Science" (J. D. Ullman, Ed.), pp. 153-180, Academic Press, San Diego, 1992.
50. M. Y. Vardi and P. Wolper, Automata-theoretic techniques for modal logic of programs, J. Comput. System Sci. 32 (1986), 183-221.
51. M. Zloof, "Query-by-Example: Operations on the Transitive Closure," IBM Research Report RC5526, 1976.