Relational transducers for declarative networking

Details Relational transducers for declarative networking Relational transducers for declarative networking

2010-12-13

arxiv.org/abs/1012.2858v1

30th ACM Symposium on Principles of Database Systems, 2011

Computer Science

Databases

Scientific paper

10.1145/1989284.1989321

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.

Affiliated with

Also associated with

No associations

Rating

Relational transducers for declarative networking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Relational transducers for declarative networking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relational transducers for declarative networking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-177773