A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1901.10615v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Data Consistency in Transactional Storage Systems: a Centralised Approach
[article]
<span title="2019-10-04">2019</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
Other Versions
<span title="2019-01-29">2019</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.10615v1">arXiv:1901.10615v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/udej2wwj4bdotcuest7wxfakrm">fatcat:udej2wwj4bdotcuest7wxfakrm</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.10615v1">arXiv:1901.10615v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/udej2wwj4bdotcuest7wxfakrm">fatcat:udej2wwj4bdotcuest7wxfakrm</a> </span>
We introduce an interleaving operational semantics for describing the client-observable behaviour of atomic transactions on distributed key-value stores. Our semantics builds on abstract states comprising centralised, global key-value stores and partial client views. We provide operational definitions of consistency models for our key-value stores which are shown to be equivalent to the well-known declarative definitions of consistency model for execution graphs. We explore two immediate
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.10615v2">arXiv:1901.10615v2</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vudgmqlgongppbm6a5yeonijy4">fatcat:vudgmqlgongppbm6a5yeonijy4</a>
</span>
more »
... tions of our semantics: specific protocols of geo-replicated databases (e.g. COPS) and partitioned databases (e.g. Clock-SI) can be shown to be correct for a specific consistency model by embedding them in our centralised semantics; programs can be directly shown to have invariant properties such as robustness results against a weak consistency model.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200913103138/https://arxiv.org/pdf/1901.10615v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/5c/3e/5c3e6f1f7664e6eeced2028c20efed5381171c8a.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.10615v2" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>