Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/14571
Title: | Deciding Eventual Consistency for a Simple Class of Relational Transducer Networks | Authors: | AMELOOT, Tom VAN DEN BUSSCHE, Jan |
Issue Date: | 2013 | 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 show that eventual consistency 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. | Keywords: | relational transducer; eventual consistency; decidability; complexity; expressivity | Document URI: | http://hdl.handle.net/1942/14571 | Category: | R2 | Type: | Research Report |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tocs_techreport.pdf | Peer-reviewed author version | 960.6 kB | Adobe PDF | View/Open |
Page view(s)
56
checked on Sep 6, 2022
Download(s)
134
checked on Sep 6, 2022
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.