Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions.
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli:
Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions.
PODS 1993: 109-122@inproceedings{DBLP:conf/pods/LevyMSS93,
author = {Alon Y. Levy and
Inderpal Singh Mumick and
Yehoshua Sagiv and
Oded Shmueli},
title = {Equivalence, Query-Reachability, and Satisfiability in Datalog
Extensions},
booktitle = {Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium
on Principles of Database Systems, May 25-28, 1993, Washington,
DC},
publisher = {ACM Press},
year = {1993},
isbn = {0-89791-593-3},
pages = {109-122},
ee = {http://doi.acm.org/10.1145/153850.153860, db/conf/pods/LevyMSS93.html},
crossref = {DBLP:conf/pods/93},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
We consider the problems of equivalence, satisfiability and query-reachability for datalog programs with negation and dense-order constraints. 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 are also used to push constraints from a given query to the EDB predicates. Finally, we show that satisfiability is undecidable for datalog programs with unary IDB predicates, stratified negation and the interpreted predicate !=.
Copyright © 1993 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98.
and ...
Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings.
and ...
Printed Edition
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 25-28, 1993, Washington, DC.
ACM Press 1993, ISBN 0-89791-593-3
Contents
[Abstract and Index Terms]
[Full Text in PDF Format, 1318 KB]
References
- [AH88]
- Serge Abiteboul, Richard Hull:
Data Functions, Datalog and Negation (Extended Abstract).
SIGMOD Conference 1988: 143-153
- [CV92]
- Surajit Chaudhuri, Moshe Y. Vardi:
On the Equivalence of Recursive and Nonrecursive Datalog Programs.
PODS 1992: 55-66
- [CGKV88]
- Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi:
Decidable Optimization Problems for Database Logic Programs (Preliminary Report).
STOC 1988: 477-490
- [GMSV87]
- Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs.
LICS 1987: 106-115
- [KKR90]
- Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz:
Constraint Query Languages.
PODS 1990: 299-313
- [Levy93]
- ...
- [LS92]
- Alon Y. Levy, Yehoshua Sagiv:
Constraints and Redundancy in Datalog.
PODS 1992: 67-80
- [Shm87]
- Oded Shmueli:
Decidability and Expressiveness of Logic Queries.
PODS 1987: 237-249
- [Ull88]
- Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume I.
Computer Science Press 1988, ISBN 0-7167-8158-1
Contents - [Ull89]
- Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume II.
Computer Science Press 1989, ISBN 0-7167-8162-X
Contents - [UV88]
- Jeffrey D. Ullman, Allen Van Gelder:
Parallel Complexity of Logical Query Programs.
Algorithmica 3: 5-42(1988)
- [vdM92]
- ...
- [Var89]
- Moshe Y. Vardi:
Automata Theory for Database Theoreticans.
PODS 1989: 83-92
Copyright © Fri Mar 12 17:19:57 2010
by Michael Ley (ley@uni-trier.de)