Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/24952
Title: | Datalog Queries Distributing over Components | Authors: | AMELOOT, Tom KETSMAN, Bas NEVEN, Frank Zinn, Daniel |
Issue Date: | 2017 | Source: | ACM Transactions on Computational Logic, 18(1), p. 1-35 (Art N° 5) | 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 [Zinn et al. 2012], namely that the classic win-move query is in F2 (a particular class of coordination-free queries). | Keywords: | datalog; stratified semantics; well-founded semantics; coordination-free evaluation; distributed databases | Document URI: | http://hdl.handle.net/1942/24952 | ISSN: | 1529-3785 | e-ISSN: | 1557-945X | DOI: | 10.1145/3022743 | ISI #: | 000399803800005 | Rights: | (c) 2017 ACM 1529-3785/2017/02-ART5 $15.00 | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2018 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
a5-ameloot.pdf Restricted Access | Published version | 1.01 MB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
5
checked on Sep 3, 2020
WEB OF SCIENCETM
Citations
3
checked on Oct 13, 2024
Page view(s)
52
checked on Sep 7, 2022
Download(s)
42
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.