Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/14570
Title: Relational transducers for declarative networking
Authors: AMELOOT, Tom 
NEVEN, Frank 
VAN DEN BUSSCHE, Jan 
Issue Date: 2013
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 of "oblivious" transducers we define also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.
Keywords: distributed database; relational transducer; monotonicity; expressive power; cloud programming
Document URI: http://hdl.handle.net/1942/14570
Category: R2
Type: Research Report
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
jacm_techreport.pdfMain article719.62 kBAdobe PDFView/Open
Show full item record

Page view(s)

82
checked on May 26, 2022

Download(s)

132
checked on May 26, 2022

Google ScholarTM

Check


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