By Topic

Exploiting memory locality in distributed key-value stores

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Christian Tinnefeld ; Hasso Plattner Institute, University of Potsdam, August-Bebel-Str. 88, 14482, Germany ; Hasso Plattner

Distributed key-value stores which have a main-memory-based persistence can be utilized for serving applications whose performance criteria cannot be met by scaling-out across disk-based nodes. This paper outlines a PhD thesis that addresses the resulting challenge of exploiting memory locality in such systems. We propose to introduce the notion of a block that allows to store a certain number of values consecutively in main-memory. Preliminary micro-benchmarks indicate that this could increase the throughput by a factor 10 on a per-node level. Furthermore, this paper presents a research agenda that covers the resulting implications on a per-node and system-level.

Published in:

Data Engineering Workshops (ICDEW), 2011 IEEE 27th International Conference on

Date of Conference:

11-16 April 2011