Document Server@UHasselt >
Research >
Research publications >

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

Title: Relational transducers for declarative networking
Authors: Ameloot, Tom
Van den Bussche, Jan
Neven, Frank
Issue Date: 2011
Publisher: ACM Press
Citation: Lenzerini, Maurizio; Schwentick, Thomas (Ed.). Proceedings of the 30th Symposium on Principles of Database Systems, ACM Press,p. 283-292
Abstract: Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for "eventually consistent" distributed querying, based on relational transducers. A tight link has been conjectured between coordination-freeness of computations, and monotonicity of the queries expressed by such computations. Indeed, we propose a formal definition of coordination-freeness and confirm that the class of monotone queries is captured by coordination-free transducer networks. Coordination-freeness is a semantic property, but the syntactic class that we define of "oblivious" transducers also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.
URI: http://hdl.handle.net/1942/12947
DOI: 10.1145/1989284.1989321
ISBN: 978-1-4503-0660-7
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
The paper145.86 kBAdobe PDF

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