Weak Forms of Monotonicity and Coordination-Freeness
Databases
2015-03-20 v1 Distributed, Parallel, and Cluster Computing
Abstract
Our earlier work titled: "Win-move is Coordination-Free (Sometimes)" has shown that the classes of queries that can be distributedly computed in a coordination-free manner form a strict hierarchy depending on the assumptions of the model for distributed computations. In this paper, we further characterize these classes by revealing a tight relationship between them and novel weakened forms of monotonicity.
Cite
@article{arxiv.1202.0242,
title = {Weak Forms of Monotonicity and Coordination-Freeness},
author = {Daniel Zinn},
journal= {arXiv preprint arXiv:1202.0242},
year = {2015}
}
Comments
Early Research Report