A Correlation-Aware Data Placement Strategy for Key-Value Stores

Abstract : Key-value stores hold the unprecedented bulk of the data produced by applications such as social networks. Their scalability and availability requirements often outweigh sacrificing richer data and processing models, and even elementary data consistency. Moreover, existing key-value stores have only random or order based placement strategies.In this paper we exploit arbitrary data relations easily expressed by the application to foster data locality and improve the performance of complex queries common in social network read-intensive workloads.We present a novel data placement strategy, supporting dynamic tags, based on multidimensional locality-preserving mappings. We compare our data placement strategy with the ones used in existing key-value stores under the workload of a typical social network application and show that the proposed correlation-aware data placement strategy offers a major improvement on the system’s overall response time and network requirements.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-01583587
Contributor : Hal Ifip <>
Submitted on : Thursday, September 7, 2017 - 3:37:45 PM
Last modification on : Thursday, September 7, 2017 - 4:12:43 PM

File

978-3-642-21387-8_17_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Ricardo Vilaça, Rui Oliveira, José Pereira. A Correlation-Aware Data Placement Strategy for Key-Value Stores. 11th Distributed Applications and Interoperable Systems (DAIS), Jun 2011, Reykjavik, Iceland. pp.214-227, ⟨10.1007/978-3-642-21387-8_17⟩. ⟨hal-01583587⟩

Share

Metrics

Record views

91

Files downloads

128