<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Annette Bieniusa</style></author><author><style face="normal" font="default" size="100%">Marek Zawirsky</style></author><author><style face="normal" font="default" size="100%">Nuno Preguiça</style></author><author><style face="normal" font="default" size="100%">Marc Shapiro</style></author><author><style face="normal" font="default" size="100%">Carlos Baquero Moreno</style></author><author><style face="normal" font="default" size="100%">Valter Balegas</style></author><author><style face="normal" font="default" size="100%">Sérgio Duarte</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An optimized conflict-free replicated set</style></title><secondary-title><style face="normal" font="default" size="100%">CoRR</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">October</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/cbm/files/1210.3368v1.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">HASLab/INESC TEC &amp; University of Minho</style></publisher><pub-location><style face="normal" font="default" size="100%">Braga, Portugal</style></pub-location><volume><style face="normal" font="default" size="100%">1210.3368</style></volume><pages><style face="normal" font="default" size="100%">9</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Eventual consistency of replicated data supports concurrent updates, reduces latency and improves fault tolerance, but forgoes strong consistency. Accordingly, several cloud computing platforms implement eventually-consistent data types. The set is a widespread and useful abstraction, and many replicated set designs have been proposed. We present a reasoning abstraction, permutation equivalence, that systematizes the characterization of the expected concurrency semantics of concurrent types. Under this framework we present one of the existing conflict-free replicated data types, Observed-Remove Set. Furthermore, in order to decrease the size of meta-data, we propose a new optimization to avoid tombstones. This approach that can be transposed to other data types, such as maps, graphs or sequences.&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">8083</style></issue></record></records></xml>