Alon Y. Halevy
Inderpal Singh Mumick
Abstract
We consider the problems of containment, equivalence, satisfiability and query-reachability for datalog programs with negation. These problems are important for optimizing datalog programs. We show that both query-reachability and satisfiability are decidable for programs with stratified negation provided that negation is applied only to EDB predicates or that all EDB predicates are unary. In the latter case, we show that equivalence is also decidable. The algorithms we present can also be used to push constraints from a given query to the EDB predicates. In showing our decidability results we describe a powerful tool, the query-tree, which is used for several optimization problems for datalog programs. Finally, we show that satisfiability is undecidable for datalog programs with unary IDB predicates, stratified negation and the interpreted predicate ≠.
- ABITEBOUL, S., AND HULL, R. 1988. Data functions, datalog, and negation. In Proceedings of ACM SIGMOD 1988 International Conference on Management of Data (Chicago, Ill. June). ACM, New York. Google Scholar
- CHAUDHURI, S., AND VARDI, M. 1992. On the equivalence of recursive and non-recursive datalog programs. In Proceedings of the 11th Annual Symposium on Principles of Database Systems (PODS) (San Diego, Calif., June 2-4). ACM, New York, pp. 55-66. Google Scholar
- COSMADAKIS, S. S., GAIFMAN, H., KANELLAKIS,P.C.,AND VARDI, M. Y. 1998. Decidable optimization problems for database logic programs. In Proceedings of the 20th Annual Symposium on Theory of Computing. ACM, New York, pp. 477-490. Google Scholar
- DUSCHKA, O., GENESERETH, M., AND LEVY A. 1999. Recursive query plans for data integration. In J. Logic Prog. special issue on Logic Based Heterogeneous Information Systems 43, 1, 49-73.Google Scholar
- HOPCROFT,J.E.,AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass. Google Scholar
- GAIFMAN, H., MAIRSON, H., SAGIV,Y.,AND VARDI, M. Y. 1987 Undecidable optimization problems for database logic programs. In Proceedings of the 2nd Annual IEEE Symposium on Logic in Computer Science (LICS) (Ithaca, N.Y.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 106-115.Google Scholar
- KANELLAKIS, P. C., KUPER,G.M.,AND REVESZ, P. Z. 1990. Constraint query languages. In Proceedings of the 9th Annual Symposium on Principles of Database Systems (PODS) (Nashville, Tenn., Apr.). ACM, New York, pp. 299-313. Google Scholar
- LEVY, A. Y. 1993. Relevance reasoning in knowledge based systems. Ph.D dissertation, Stanford Univ., Stanford, Calif. Google Scholar
- LEVY, A. Y. 1996. Obtaining complete answers from incomplete databases. In Proceedings of the 22th Conference on Very Large Databases (VLDB) (Bombay, India, Sept.). Google Scholar
- LEVY,A.Y.,FIKES,R.E.,AND SAGIV, S. 1997. Speeding up inferences using relevance reasoning: A formalism and algorithms. Artif. Int. 97(1-2). Google Scholar
- LEVY,A.Y.,MENDELZON, A. O., SAGIV,Y.,AND SRIVASTAVA, D. 1995. Answering queries using views. In Proceedings of the 14th Annual Symposium on Principles of Database Systems (PODS) (San Jose, Calif., May 22-24). ACM, New York. Google Scholar
- LEVY,A.Y.,MUMICK,I.S.,AND SAGIV, Y. 1994. Query optimization by predicate move-around. In Proceedings of the 20th VLDB Conference (Santiago, Chile, Sept.). Google Scholar
- LEVY, A., AND SAGIV, Y. 1992. Constraints and redundancy in datalog. In Proceedings of the 11th Annual Symposium on Principles of Database Systems (PODS) (San Diego, Calif., June 2-4). ACM, New York, pp. 67-80. Google Scholar
- LEVY, A., AND SAGIV, Y. 1993. Queries independent of updates. In Proceedings of the 19th Conference on Very Large Databases (VLDB) (Dublin, Ireland, Aug.). Google Scholar
- LEVY, A., AND SAGIV, Y. 1995. Semantic query optimization of datalog programs. In Proceedings of the 14th Annual Symposium on Principles of Database Systems (PODS) (San Jose, Calif., May 22-24). ACM, New York. Google Scholar
- MUMICK, I., FINKELSTEIN, S., PIRAHESH, H., AND RAMAKRISHNAN, R. 1996. Magic conditions. ACM Trans. Datab. Syst. 21, 1, 107-155. Google Scholar
- MUMICK, I. S., PIRAHESH, H., AND RAMAKRISHNAN, R. 1994. Adornments in database programs. Comput. Artif. Intel. 13(2-3), 201-230.Google Scholar
- SAGIV, Y. 1988. Optimizing datalog programs. In Foundations of Deductive Databases and Logic Programming, Jack Minker, Ed. Morgan-Kaufmann, Los Altos, Calif., pp. 659-698. Google Scholar
- SHMUELI, O. 1987. Decidability and expressiveness aspects of logic queries. In Proceedings of the 6th Annual Symposium on Principles of Database Systems (PODS) (San Diego, Calif., Mar.). ACM, New York, pp. 237-249. Google Scholar
- SHMUELI, O. 1993. Equivalence of datalog queries is undecidable. J. Log. Prog. 15, 231-241. Google Scholar
- ULLMAN, J. D. 1988. Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press. Google Scholar
- ULLMAN, J. D. 1989. Principles of Database and Knowledge-Base Systems, vol. 2. Computer Science Press. Google Scholar
- ULLMAN, J. D. 1997. Information integration using logical views. In Proceedings of the International Conference on Database Theory, pp. 19-40. Google Scholar
- ULLMAN,J.D.,AND VAN GELDER, A. 1988. Parallel complexity of logical query programs. Algorithmica 3, 5-42.Google Scholar
- VAN DER MEYDEN, R. 1992. The Complexity of Querying Indefinite Information: Defined Relations, Recursion and Linear Order. Ph.D. dissertation, Rutgers, The State University of New Jersey, New Brunswick, N.J.Google Scholar
- VARDI, M. Y. 1989. Automata theory for database theoreticians. In Proceedings of the 8th Annual Symposium on Principles of Database Systems (PODS) (Philadelphia, Pa. Mar.). ACM, New York, pp. 83-92. Google Scholar
Index Terms
- Static analysis in datalog extensions
Recommendations
Abstract Hilbertian deductive systems, infon logic, and Datalog
In the first part of the paper, we discuss abstract Hilbertian deductive systems; these are systems defined by abstract notions of formula, axiom, and inference rule. We use these systems to develop a general method for converting derivability problems, ...
On temporal logic versus datalog
Logic and complexity in computer scienceWe provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal µ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the ...
Flag & check: data access with monadically defined queries
PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systemsWe introduce monadically defined queries (MODEQs) and nested monadically defined queries (NEMODEQs), two querying formalisms that extend conjunctive queries, conjunctive two-way regular path queries, and monadic Datalog queries. Both can be expressed as ...
Comments