Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Dawar, S. Kreutzer (2008)
On Datalog vs. LFP
I. Guessarian (1990)
Deciding Boundedness for Uniformly Connected Datalog Programs
J. Hellerstein (2010)
The declarative imperative: experiences and conjectures in distributed logicSIGMOD Rec., 39
S. Abiteboul, R. Hull, V. Vianu (1994)
Foundations of Databases
REFERENCES
Gerald Berger, Andreas Pieris (2016)
Ontology-Mediated Queries Distributing over Components
T. J. Ameloot, B. Ketsman, F. Neven, D. Zinn (2016)
Weaker forms of monotonicity for declarative networking: a More fine-grained answer to the CALM-conjectureACM Trans. Database Syst., 40
T. J. Ameloot, B. Ketsman, F. Neven, D. Zinn (2015)
Datalog queries distributing over componentsProceedings of the 18th International Conference on Database Theory. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Daniel Zinn, Todd Green, Bertram Ludäscher (2012)
Win-move is coordination-free (sometimes)ArXiv, abs/1312.2919
R. Hull, Masatoshi Yoshikawa (1990)
ILOG: Declarative Creation and Manipulation of Object Identifiers
Guozhu Dong (1989)
On distributed processibility of datalog queries by decomposing databases
K. Compton (1983)
Some useful preservation theoremsJournal of Symbolic Logic, 48
(2017)
ACM Transactions on Computational Logic
Tom Ameloot, F. Neven, J. Bussche (2010)
Relational transducers for declarative networking
(2015)
Received September
T. Jim, Dan Suciu (2001)
Dynamically distributed query evaluation
A. Gelder (1989)
The Alternating Fixpoint of Logic Programs with NegationJ. Comput. Syst. Sci., 47
We thank Phokion Kolaitis for suggesting Corollary 4.7 about positive programs
T. J. Ameloot, F. Neven, J. Van den Bussche (2013)
Relational transducers for declarative networkingJ. ACM, 60
Neil Conway, William Marczak, P. Alvaro, J. Hellerstein, D. Maier (2012)
Logic and lattices for distributed programming
B. Loo, Tyson Condie, M. Garofalakis, David Gay, J. Hellerstein, Petros Maniatis, R. Ramakrishnan, Timothy Roscoe, I. Stoica (2006)
Declarative networking: language, execution and optimizationProceedings of the 2006 ACM SIGMOD international conference on Management of data
T. Feder, Moshe Vardi (2003)
Homomorphism closed vs. existential positive18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
Tom Ameloot, Bas Ketsman, F. Neven, Daniel Zinn (2014)
Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjectureProceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
L. Cabibbo (1998)
The Expressive Power of Stratified Logic Programs with Value InventionInf. Comput., 147
D. Kemp, D. Srivastava, Peter Stuckey (1995)
Bottom-Up Evaluation and Query Optimization of Well-Founded ModelsTheor. Comput. Sci., 146
S. Abiteboul, Z. Abrams, S. Haar, T. Milo (2005)
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
P. Alvaro, Neil Conway, J. Hellerstein, D. Maier (2013)
Blazes: Coordination analysis for distributed programs2014 IEEE 30th International Conference on Data Engineering
O. Shmueli (1993)
Equivalence of DATALOG Queries is UndecidableJ. Log. Program., 15
We investigate the class D of queries that distribute over components. These are the queries that can be evaluated by taking the union of the query results over the connected components of the database instance. We show that it is undecidable whether a (positive) Datalog program distributes over components. Additionally, we show that connected Datalog (the fragment of Datalog where all rules are connected) provides an effective syntax for Datalog programs that distribute over components under the stratified as well as under the well-founded semantics. As a corollary, we obtain a simple proof for one of the main results in previous work [Zinn et al. 2012], namely that the classic win-move query is in F2 (a particular class of coordination-free queries).
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Feb 22, 2017
Keywords: Datalog
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.