Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/20633
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | AMELOOT, Tom | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2016-02-12T13:07:22Z | - |
dc.date.available | 2016-02-12T13:07:22Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | THEORY OF COMPUTING SYSTEMS, 57 (4), p. 1038-1111 | - |
dc.identifier.issn | 1432-4350 | - |
dc.identifier.uri | http://hdl.handle.net/1942/20633 | - |
dc.description.abstract | Networks of relational transducers can serve as a formal model for declarative networking, focusing on distributed database querying applications. In declarative networking, a crucial property is eventual consistency, meaning that the final output does not depend on the message delays and reorderings caused by the network. Here, we formalize eventual consistency as a confluence notion, meaning that finite executions of the system can always be extended to yield the desired output. We show that confluence is decidable when the transducers satisfy some syntactic restrictions, some of which have also been considered in earlier work on automated verification of relational transducers. This simple class of transducer networks computes exactly all distributed queries expressible by unions of conjunctive queries with negation. | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.rights | © Springer Science+Business Media New York 2015 | - |
dc.subject.other | Relational transducer; Eventual consistency; Confluence; Decidability; Conjunctive query | - |
dc.subject.other | relational transducer; eventual consistency; confluence; decidability; conjunctive query | - |
dc.title | Deciding Confluence for a Simple Class of Relational Transducer Networks | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 1111 | - |
dc.identifier.issue | 4 | - |
dc.identifier.spage | 1038 | - |
dc.identifier.volume | 57 | - |
local.format.pages | 74 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | [Ameloot, Tom J.; Van den Bussche, Jan] Hasselt Univ, Hasselt, Belgium. [Ameloot, Tom J.; Van den Bussche, Jan] Transnat Univ Limburg, Hasselt, Belgium. | - |
local.publisher.place | NEW YORK | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.1007/s00224-015-9624-6 | - |
dc.identifier.isi | 000365792200008 | - |
item.accessRights | Open Access | - |
item.contributor | AMELOOT, Tom | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.fulltext | With Fulltext | - |
item.fullcitation | AMELOOT, Tom & VAN DEN BUSSCHE, Jan (2015) Deciding Confluence for a Simple Class of Relational Transducer Networks. In: THEORY OF COMPUTING SYSTEMS, 57 (4), p. 1038-1111. | - |
item.validation | ecoom 2016 | - |
crisitem.journal.issn | 1432-4350 | - |
crisitem.journal.eissn | 1433-0490 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
art%3A10.1007%2Fs00224-015-9624-6.pdf Restricted Access | Published version | 940.37 kB | Adobe PDF | View/Open Request a copy |
icdt12journal.pdf | Peer-reviewed author version | 960.89 kB | Adobe PDF | View/Open |
Page view(s)
58
checked on Sep 7, 2022
Download(s)
206
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.