Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/21061
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | AMELOOT, Tom | - |
dc.contributor.author | KETSMAN, Bas | - |
dc.contributor.author | NEVEN, Frank | - |
dc.contributor.author | Zinn, Daniel | - |
dc.date.accessioned | 2016-05-10T07:39:24Z | - |
dc.date.available | 2016-05-10T07:39:24Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | ACM TRANSACTIONS ON DATABASE SYSTEMS, 40 (4) | - |
dc.identifier.issn | 0362-5915 | - |
dc.identifier.uri | http://hdl.handle.net/1942/21061 | - |
dc.description.abstract | The CALM-conjecture, first stated by Hellerstein [2010] and proved in its revised form by Ameloot et al. [2013] within the framework of relational transducer networks, asserts that a query has a coordination-free execution strategy if and only if the query is monotone. Zinn et al. [2012] extended the framework of relational transducer networks to allow for specific data distribution strategies and showed that the nonmonotone win-move query is coordination-free for domain-guided data distributions. In this article, we extend the story by equating increasingly larger classes of coordination-free computations with increasingly weaker forms of monotonicity and present explicit Datalog variants that capture each of these classes. One such fragment is based on stratified Datalog where rules are required to be connected with the exception of the last stratum. In addition, we characterize coordination-freeness as those computations that do not require knowledge about all other nodes in the network, and therefore, can not globally coordinate. The results in this article can be interpreted as a more fine-grained answer to the CALM-conjecture. | - |
dc.language.iso | en | - |
dc.rights | 2015 Copyright is held by the Owner/Author. Publication rights licensed to ACM. | - |
dc.subject.other | distributed database; relational transducer; consistency; coordination; expressive power; cloud programming | - |
dc.title | Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture | - |
dc.type | Journal Contribution | - |
dc.identifier.issue | 4 | - |
dc.identifier.volume | 40 | - |
local.format.pages | 45 | - |
local.bibliographicCitation.jcat | A1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.1145/2809784 | - |
dc.identifier.isi | 000371198500001 | - |
item.accessRights | Open Access | - |
item.validation | ecoom 2017 | - |
item.fulltext | With Fulltext | - |
item.fullcitation | AMELOOT, Tom; KETSMAN, Bas; NEVEN, Frank & Zinn, Daniel (2016) Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture. In: ACM TRANSACTIONS ON DATABASE SYSTEMS, 40 (4). | - |
item.contributor | AMELOOT, Tom | - |
item.contributor | KETSMAN, Bas | - |
item.contributor | NEVEN, Frank | - |
item.contributor | Zinn, Daniel | - |
crisitem.journal.issn | 0362-5915 | - |
crisitem.journal.eissn | 1557-4644 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
a21-ameloot.pdf Restricted Access | Published version | 728.35 kB | Adobe PDF | View/Open Request a copy |
pods2014monotonicity.pdf | Peer-reviewed author version | 587.95 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
9
checked on Sep 5, 2020
WEB OF SCIENCETM
Citations
8
checked on Apr 22, 2024
Page view(s)
32
checked on Sep 7, 2022
Download(s)
30
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.