The Community for Technology Leaders
2014 IEEE 33rd International Symposium on Reliable Distributed Systems (SRDS) (2014)
Nara, Japan
Oct. 6, 2014 to Oct. 9, 2014
ISSN: 1060-9857
ISBN: 978-1-4799-5584-8
pp: 95-104
The ability to access and query data stored in multiple versions is an important asset for many applications, such as Web graph analysis, collaborative editing platforms, data forensics, or correlation mining. The storage and retrieval of versioned data requires a specific API and support from the storage layer. The choice of the data structures used to maintain versioned data has a fundamental impact on the performance of insertions and queries. The appropriate data structure also depends on the nature of the versioned data and the nature of the access patterns. In this paper we study the design and implementation space for providing versioning support on top of a distributed key-value store (KVS). We define an API for versioned data access supporting multiple writers and show that a plain KVS does not offer the necessary synchronization power for implementing this API. We leverage the support for listeners at the KVS level and propose a general construction for implementing arbitrary types of data structures for storing and querying versioned data. We explore the design space of versioned data storage ranging from a flat data structure to a distributed sharded index. The resulting system, ALEPH, is implemented on top of an industrial-grade open-source KVS, Infinispan. Our evaluation, based on real-world Wikipedia access logs, studies the performance of each versioning mechanisms in terms of load balancing, latency and storage overhead in the context of different access scenarios.
Data structures, Synchronization, Vectors, Semantics, Data models, Data mining, Indexes

P. Felber et al., "On the Support of Versioning in Distributed Key-Value Stores," 2014 IEEE 33rd International Symposium on Reliable Distributed Systems (SRDS), Nara, Japan, 2014, pp. 95-104.
93 ms
(Ver 3.3 (11022016))