Journal of the ACM · 2013 · 40 citations · 24 references
ComputingComputer ScienceDatabasesDistributed SystemsFormal MethodsDistributed AlgorithmsDistributed ComputingQuery ProcessingRelational AlgebraRelational Data ModelDistributed Systems SemanticsFormal ModelingModel Of ComputationMonotone OperatorsNetworkingRelational SemanticsTransducers
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.
24
Epidemic information dissemination in distributed systems
Patrick Eugster, Rachid Guerraoui, Anne-Marie Kermarrec et al. · Computer · 2004 · 496 citations · Full text
Boon Thau Loo, Tyson Condie, Minos Garofalakis et al. · 2006 · 267 citations
Automatic verification of data-centric business processes
Alin Deutsch, Richard Hull, Fabio Patrizi et al. · 2009 · 218 citations · Full text
Business, Information Systems, Management Information Systems +17