Decidability and undecidability of equivalence for linear datalog, with applications to normal-form optimizations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 646 LNCS, Issue , 1992, Pages 297-311

  Feder, Tomás ^a   Saraiya, Yatin ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; LOGIC PROGRAMMING;

COMMUTATIVITY; LINEARIZABILITY; LOGIC PROGRAMS; PROGRAM EQUIVALENCE; RECURSIVE PROGRAMS; RECURSIVE RULES; SERIALIZABILITY; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY;

EID: 84856584824     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56039-4_49     Document Type: Conference Paper

References (22)

1. Abiteboul, S. Boundedness is undecidable for Datalog programs with a single recursive rule. Information Processing Letters 32, 281-287, 1989
2. Chandra, A.K. and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. Proc. Ninth Annual ACM Symposium on the Theory of Computing, 77-90, 1977.
3. Feder, T. and Y. Saraiya. Undecidable normal forms for logic databases, Tech. report TM-ARH-019576, Bellcore, June 1991.
4. Feder, T. and Y. Saruiya. Detecting commutativity, Tech. report TM-ARH- 019716, Bellcore, June 1991.
5. Hopcroft, J.E. and J. D. Ullman. Introduction to automata theory, languages and computation, Addison-Wesley, 1979.
6. Ioannidis, Y. E. Commutativity and its role in the processing of linear recursion. Tech. Report 804, University of Wisconsin-Madison, 1989.
7. Ioannidis, Y. E. and E. Wong. Towards an algebraic theory of recursion. JACM, to appear.
8. Ioannidis, Y.E. and E. Wong. Transforming nonlinear recursion to linear recursion. J. Logic Programming, to appear.
9. Jagadish, H. V., R. Agrawal and L. Ness. A study of transitive closure as a recursion mechanism. ACM SIGMOD International conference on Management of data, 1987.
10. Kannan, R. Solution of the Frobenius problem and its generalization. Combinatorica, to appear.
11. Naughton, J. F. Compiling separable recursions. ACM SIGMOD Intl. Conf. on the Management of Data, 312-319, 1988.
12. Ramakrishnan, R., Y. Sagiv, J.D. Ullman and M.Y. Vardi. Proof-tree transformation theorems and their applications. Proc. Eighth ACM Symposium on Principles of Database Systems, 172-181, 1989.
13. Sagiv, Y. Optimizing Datalog programs. Proc. Sixth ACM Symposium on Principles of Database Systems, 349-362, 1987.
14. Sagiv, Y. and M. Yannakakis. Equivalence among relational expressions with the union and difference operators. J. ACM 27, 633-655, 1981.
15. Saraiya, Y. Linearizing nonlinear recursions in polynomial time. Proc. Eighth ACM Symposium on Principles of Database Systems, 182-189, 1989.
16. Saraiya, Y. Polynomial-time program transformations in deductive databases. Proc. Ninth ACM Symposium on Principles of Database Systems, 1990.
17. Saraiya, Y. Hard problems for simple logic programs. Proc. ACM SIGMOD International Conference on Management of Data, 64-73, 1990.
18. Saraiya, Y. Subtree-elimination algorithms in deductive databases, Ph.D. Thesis, Stanford University, 1991.
19. Shmueli, O. Decidability and expressiveness aspects of logic queries. Proc. Sixth ACM Symposium on Principles of Database Systems, 237-249, 1987.
20. Ullman J. D. Principles of Database and Knowledge-base Systems. 2 volumes. Computer Science Press, Roekville, Md., 1989.
21. Ullman, J. D. and A. van Gelder. The parallel complexity of logical query languages. Proc. IEEE Symposium on Foundations of Computer Science, 1986.
22. Zhang, W., C.T. Yu and D. Troy. Necessary and sufficient conditions to linearize doubly recursive programs in logic databases. ACM Transactions on Database Systems 15:3, 459-482, 1990.