%0 Conference Proceedings
%T Scalable and Accurate Causality Tracking for Eventually Consistent Stores
%+ Institute for Systems and Computer Engineering, Technology and Science [Porto] (INESC TEC)
%+ Universidade de Lisboa = University of Lisbon (ULISBOA)
%A Almeida, Paulo, Sérgio
%A Baquero, Carlos
%A Gonçalves, Ricardo
%A Preguiça, Nuno
%A Fonte, Victor
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 4th International Conference on Distributed Applications and Interoperable Systems (DAIS)
%C Berlin, Germany
%Y David Hutchison
%Y Takeo Kanade
%Y Bernhard Steffen
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Gerhard Weikum
%Y Kostas Magoutis
%Y Peter Pietzuch
%Y Josef Kittler
%Y Jon M. Kleinberg
%Y Alfred Kobsa
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%I Springer
%3 Distributed Applications and Interoperable Systems
%V LNCS-8460
%P 67-81
%8 2014-06-03
%D 2014
%R 10.1007/978-3-662-43352-2_6
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X In cloud computing environments, data storage systems often rely on optimistic replication to provide good performance and availability even in the presence of failures or network partitions. In this scenario, it is important to be able to accurately and efficiently identify updates executed concurrently. Current approaches to causality tracking in optimistic replication have problems with concurrent updates: they either (1) do not scale, as they require replicas to maintain information that grows linearly with the number of writes or unique clients; (2) lose information about causality, either by removing entries from client-id based version vectors or using server-id based version vectors, which cause false conflicts. We propose a new logical clock mechanism and a logical clock framework that together support a traditional key-value store API, while capturing causality in an accurate and scalable way, avoiding false conflicts. It maintains concise information per data replica, only linear on the number of replica servers, and allows data replicas to be compared and merged linear with the number of replica servers and versions.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01287733/document
%2 https://inria.hal.science/hal-01287733/file/326177_1_En_6_Chapter.pdf
%L hal-01287733
%U https://inria.hal.science/hal-01287733
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-LNCS-8460
%~ IFIP-TC6
%~ IFIP-WG6-1