Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/16393
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 | 2014-03-06T08:24:38Z | - |
dc.date.available | 2014-03-06T08:24:38Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Proceedings of the 33rd ACM Symposium on Principles of Database Systems | - |
dc.identifier.isbn | 9781450320665 | - |
dc.identifier.uri | http://hdl.handle.net/1942/16393 | - |
dc.description.abstract | The CALM-conjecture, first stated by Hellerstein [23] and proved in its revised form by Ameloot et al. [13] 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. [32] 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 domainguided data distributions. In this paper, we complete the story by equating increasingly larger classes of coordinationfree computations with increasingly weaker forms of monotonicity and make Datalog variants explicit 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 paper can be interpreted as a more fine-grained answer to the CALM-conjecture. | - |
dc.language.iso | en | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.rights | Copyright 2014 ACM 978-1-4503-2375-8/14/06 ...$15.00 | - |
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 | Proceedings Paper | - |
local.bibliographicCitation.conferencedate | 22-27 June 2014 | - |
local.bibliographicCitation.conferencename | 33rd ACM Symposium on Principles of Database Systems | - |
local.bibliographicCitation.conferenceplace | Salt Lake City, USA | - |
dc.identifier.epage | 75 | - |
dc.identifier.spage | 64 | - |
local.format.pages | 12 | - |
local.bibliographicCitation.jcat | C1 | - |
dc.description.notes | Neven, F (reprint author), Hasselt Univ, Comp Sci, Hasselt, Belgium. frank.neven@uhasselt.be | - |
local.publisher.place | 1515 BROADWAY, NEW YORK, NY 10036-9998 USA | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
dc.source.type | Meeting | - |
dc.identifier.doi | 10.1145/2594538.2594541 | - |
dc.identifier.isi | 000450809200006 | - |
local.provider.type | Web of Science | - |
local.bibliographicCitation.btitle | Proceedings of the 33rd ACM Symposium on Principles of Database Systems | - |
local.uhasselt.uhpub | yes | - |
item.contributor | AMELOOT, Tom | - |
item.contributor | KETSMAN, Bas | - |
item.contributor | NEVEN, Frank | - |
item.contributor | Zinn, Daniel | - |
item.validation | ecoom 2019 | - |
item.fullcitation | AMELOOT, Tom; KETSMAN, Bas; NEVEN, Frank & Zinn, Daniel (2014) Weaker Forms of Monotonicity for Declarative Networking: a more fine-grained answer to the CALM-conjecture. In: Proceedings of the 33rd ACM Symposium on Principles of Database Systems. | - |
item.accessRights | Restricted Access | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
pods2014.pdf Restricted Access | Peer-reviewed author version | 456.91 kB | Adobe PDF | View/Open Request a copy |
published-version.pdf Restricted Access | Published version | 989.6 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.