Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/19796
Title: | Datalog Queries Distributing over Components | Authors: | AMELOOT, Tom KETSMAN, Bas NEVEN, Frank Zinn, Daniel |
Issue Date: | 2015 | Publisher: | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik | Source: | Arenas, Marcelo; Ugarte, Martín (Ed.). 18th International Conference on Database Theory, p. 308-323 | Series/Report: | LIPIcs | Series/Report no.: | 31 | Abstract: | 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, namely, that the classic win-move query is in F2 (a particular class of coordination-free queries). | Notes: | Ameloot, TJ (reprint author), Hasselt Univ, Hasselt, Belgium tom.ameloot@uhasselt.be; bas.ketsman@uhasselt.be; frank.neven@uhasselt.be; danielqzinn@gmail.com | Keywords: | datalog; stratified semantics; well-founded semantics; coordination-free evaluation; distributed databases | Document URI: | http://hdl.handle.net/1942/19796 | ISBN: | 9783939897798 | DOI: | 10.4230/LIPIcs.ICDT.2015.308 | Rights: | © Tom J. Ameloot, Bas Ketsman, Frank Neven, and Daniel Zinn; licensed under Creative Commons License CC-BY | Category: | C1 | Type: | Proceedings Paper |
Appears in Collections: | Research publications |
Show full item record
SCOPUSTM
Citations
6
checked on Sep 2, 2020
Page view(s)
66
checked on Nov 7, 2023
Download(s)
142
checked on Nov 7, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.