Equivalence, query-reachability, and satisfiability in datalog extensions

Alon Y. Levy; Inderpal Singh Mumick; Yehoshua Sagiv; Oded Shmueli

doi:10.1145/153850.153860

Equivalence, query-reachability, and satisfiability in datalog extensions

Alon Y. Levy^*, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

29 Scopus citations

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.

Original language	English
Title of host publication	Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
Publisher	Publ by ACM
Pages	109-122
Number of pages	14
ISBN (Print)	0897915933, 9780897915939
DOIs	https://doi.org/10.1145/153850.153860
State	Published - 1993
Externally published	Yes
Event	Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - Washington, DC, USA Duration: 25 May 1993 → 28 May 1993

Publication series

Name	Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Conference

Conference	Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
City	Washington, DC, USA
Period	25/05/93 → 28/05/93

Access to Document

10.1145/153850.153860

Cite this

Levy, A. Y., Mumick, I. S., Sagiv, Y., & Shmueli, O. (1993). Equivalence, query-reachability, and satisfiability in datalog extensions. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (pp. 109-122). (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems). Publ by ACM. https://doi.org/10.1145/153850.153860

@inproceedings{3fce697bb2524702ab96839fa5e2d9da,

title = "Equivalence, query-reachability, and satisfiability in datalog extensions",

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.",

author = "Levy, {Alon Y.} and Mumick, {Inderpal Singh} and Yehoshua Sagiv and Oded Shmueli",

year = "1993",

doi = "10.1145/153850.153860",

language = "אנגלית",

isbn = "0897915933",

series = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",

publisher = "Publ by ACM",

pages = "109--122",

booktitle = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",

note = "Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems ; Conference date: 25-05-1993 Through 28-05-1993",

}

Levy, AY, Mumick, IS, Sagiv, Y & Shmueli, O 1993, Equivalence, query-reachability, and satisfiability in datalog extensions. in Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Publ by ACM, pp. 109-122, Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Washington, DC, USA, 25/05/93. https://doi.org/10.1145/153850.153860

Equivalence, query-reachability, and satisfiability in datalog extensions. / Levy, Alon Y.; Mumick, Inderpal Singh; Sagiv, Yehoshua et al.
Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Publ by ACM, 1993. p. 109-122 (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Equivalence, query-reachability, and satisfiability in datalog extensions

AU - Levy, Alon Y.

AU - Mumick, Inderpal Singh

AU - Sagiv, Yehoshua

AU - Shmueli, Oded

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027841958&partnerID=8YFLogxK

U2 - 10.1145/153850.153860

DO - 10.1145/153850.153860

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0027841958

SN - 0897915933

SN - 9780897915939

T3 - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

SP - 109

EP - 122

BT - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

PB - Publ by ACM

T2 - Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Y2 - 25 May 1993 through 28 May 1993

ER -

Equivalence, query-reachability, and satisfiability in datalog extensions

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this