Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/16394

Title: Deciding Eventual Consistency for a Simple Class of Relational Transducer Networks
Authors: AMELOOT, Tom
Issue Date: 2012
Publisher: ACM
Citation: Proceedings of the 15th International Conference on Database Theory, p. 86-98
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 re-orderings 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.
URI: http://hdl.handle.net/1942/16394
Category: C2
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
published version491.34 kBAdobe PDF
author version426.85 kBAdobe PDF

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