Weak Forms of Monotonicity and Coordination-Freeness

TL;DR

This paper explores the relationship between coordination-freeness in distributed query computation and weakened forms of monotonicity, providing a detailed hierarchy and new characterizations.

Contribution

It introduces a novel connection between coordination-freeness classes and weakened monotonicity, extending previous work on distributed query computation.

Findings

Hierarchy of coordination-free query classes established

New weakened monotonicity forms characterized

Deeper understanding of distributed computation models achieved

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.