Date Added: Jan 2012
In a recent paper by Hellerstein, a tight relationship was conjectured between the number of strata of a Datalog: program and the number of "Coordination stages" required for its distributed computation. Indeed, Ameloot et al. showed that a query can be computed by a coordination-free relational transducer network i it is monotone, thus answering in the affirmative a variant of Hellerstein's CALM conjecture, based on a particular definition of coordination-free computation. In this paper, the authors present three additional models for declarative networking.