Evaluating Dotted Version Vectors in Riak

Nuno Manuel Ribeiro Preguiça

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The NoSQL movement is rapidly increasing in importance, acceptance and usage in major (web) applications, that need the partition- tolerance and availability of the CAP theorem for scalability purposes, thus sacrificing the consistency side. With this approach, paradigms such as Eventual Consistency became more widespread. An eventual consis- tent system must handle data divergence and conflicts, that have to be carefully accounted for. Some systems have tried to use classic Version Vectors (VV) to track causality, but these reveal either scalability prob- lems or loss of accuracy (when pruning is used to prevent vector growth). Dotted Version Vectors (DVV) is a novel mechanism for dealing with data versioning in eventual consistent systems, that allows both accu- rate causality tracking and scalability both in the number of clients and servers, while limiting vector size to replication degree. In this paper we describe briefly the challenges faced when incorporat- ing DVV in Riak (a distributed key-value store), evaluate its behavior and performance, and discuss the advantages and disadvantages of this specific implementation.
Original languageUnknown
Title of host publicationINForum 2011: Atas do Terceiro Simpósio de Informática
Publication statusPublished - 1 Jan 2011
EventINForum 2011: 3º Simpósio de Informática -
Duration: 1 Jan 2011 → …


ConferenceINForum 2011: 3º Simpósio de Informática
Period1/01/11 → …

Cite this