Please use this identifier to cite or link to this item:
Title: Deciding Eventual Consistency for a Simple Class of Relational Transducer Networks
Authors: AMELOOT, Tom 
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:
Category: R2
Type: Research Report
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
tocs_techreport.pdfMain article960.6 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 27, 2022


checked on May 27, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.