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 | Source: | 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. | Document URI: | http://hdl.handle.net/1942/12947 | ISBN: | 978-1-4503-0660-7 | DOI: | 10.1145/1989284.1989321 | Category: | C1 | Type: | Proceedings Paper |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
pods12d-Ameloot.pdf Restricted Access | Peer-reviewed author version | 145.86 kB | Adobe PDF | View/Open Request a copy |
1989284.1989321.pdf Restricted Access | Published version | 423.99 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
22
checked on Sep 2, 2020
Page view(s)
108
checked on Sep 7, 2022
Download(s)
92
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.