On the equivalence of recursive and nonrecursive datalog programs
S Chaudhuri, MY Vardi - Proceedings of the eleventh ACM SIGACT …, 1992 - dl.acm.org
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles …, 1992•dl.acm.org
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of
database systems: On the equivalence of recursiv Page 1 On the Equivalence of Recursive and
Nonrecursive Datalog Programs Surajit Chaudhuri* Dept. of Computer Science Stanford
University Stanford, CA 94305 E-mail: surajit@cs.stanford. edu Abstract: We study the problem
of determining whether a given recursive Datalog program is equivalent to a given nonrecursive
Datalog program. We prove triply exponential upper and lower time bounds. 1 Introduction …
database systems: On the equivalence of recursiv Page 1 On the Equivalence of Recursive and
Nonrecursive Datalog Programs Surajit Chaudhuri* Dept. of Computer Science Stanford
University Stanford, CA 94305 E-mail: surajit@cs.stanford. edu Abstract: We study the problem
of determining whether a given recursive Datalog program is equivalent to a given nonrecursive
Datalog program. We prove triply exponential upper and lower time bounds. 1 Introduction …
We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. We prove triply exponential upper and lower time bounds.