Eventually Consistent Transactions
As computing gets ubiquitous and distributed, when clients query or update shared data, there is the need of methods to provide better availability of the data. One solution is to use an eventually consistent data infrastructure model instead of choosing a strong consistent one, at the expense of consistency over availability. In order for the programmers to better understand such a model, Burckhardt et al. devised and formalized a new consistency model which is based on eventually consistent transactions. The novelty in their approach is that the actions are ordered by two order relations(visibility and arbitration). In this paper, we present the required notions and previous work in this field, their approach on solving this problem, the advantages and disadvantages and the related subsequent advancements.