A Correlation-Aware Data Placement Strategy for Key-Value Stores
International audience 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...
Main Authors: | , , |
---|---|
Other Authors: | , , , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2011
|
Subjects: | |
Online Access: | https://inria.hal.science/hal-01583587 https://inria.hal.science/hal-01583587/document https://inria.hal.science/hal-01583587/file/978-3-642-21387-8_17_Chapter.pdf https://doi.org/10.1007/978-3-642-21387-8_17 |
id |
ftifiphal:oai:HAL:hal-01583587v1 |
---|---|
record_format |
openpolar |
spelling |
ftifiphal:oai:HAL:hal-01583587v1 2023-12-31T10:08:18+01:00 A Correlation-Aware Data Placement Strategy for Key-Value Stores Vilaça, Ricardo Oliveira, Rui Pereira, José Universidade do Minho = University of Minho Braga Pascal Felber Romain Rouvoy TC 6 WG 6.1 Reykjavik, Iceland 2011-06-06 https://inria.hal.science/hal-01583587 https://inria.hal.science/hal-01583587/document https://inria.hal.science/hal-01583587/file/978-3-642-21387-8_17_Chapter.pdf https://doi.org/10.1007/978-3-642-21387-8_17 en eng HAL CCSD Springer info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-21387-8_17 hal-01583587 https://inria.hal.science/hal-01583587 https://inria.hal.science/hal-01583587/document https://inria.hal.science/hal-01583587/file/978-3-642-21387-8_17_Chapter.pdf doi:10.1007/978-3-642-21387-8_17 http://creativecommons.org/licenses/by/ info:eu-repo/semantics/OpenAccess Lecture Notes in Computer Science 11th Distributed Applications and Interoperable Systems (DAIS) https://inria.hal.science/hal-01583587 11th Distributed Applications and Interoperable Systems (DAIS), Jun 2011, Reykjavik, Iceland. pp.214-227, ⟨10.1007/978-3-642-21387-8_17⟩ Peer-to-Peer DHT Cloud Computing Dependability [INFO]Computer Science [cs] [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] info:eu-repo/semantics/conferenceObject Conference papers 2011 ftifiphal https://doi.org/10.1007/978-3-642-21387-8_17 2023-12-02T22:28:31Z International audience 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. Conference Object Iceland IFIP Open Digital Library (International Federation for Information Processing) 214 227 |
institution |
Open Polar |
collection |
IFIP Open Digital Library (International Federation for Information Processing) |
op_collection_id |
ftifiphal |
language |
English |
topic |
Peer-to-Peer DHT Cloud Computing Dependability [INFO]Computer Science [cs] [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] |
spellingShingle |
Peer-to-Peer DHT Cloud Computing Dependability [INFO]Computer Science [cs] [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] Vilaça, Ricardo Oliveira, Rui Pereira, José A Correlation-Aware Data Placement Strategy for Key-Value Stores |
topic_facet |
Peer-to-Peer DHT Cloud Computing Dependability [INFO]Computer Science [cs] [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] |
description |
International audience 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. |
author2 |
Universidade do Minho = University of Minho Braga Pascal Felber Romain Rouvoy TC 6 WG 6.1 |
format |
Conference Object |
author |
Vilaça, Ricardo Oliveira, Rui Pereira, José |
author_facet |
Vilaça, Ricardo Oliveira, Rui Pereira, José |
author_sort |
Vilaça, Ricardo |
title |
A Correlation-Aware Data Placement Strategy for Key-Value Stores |
title_short |
A Correlation-Aware Data Placement Strategy for Key-Value Stores |
title_full |
A Correlation-Aware Data Placement Strategy for Key-Value Stores |
title_fullStr |
A Correlation-Aware Data Placement Strategy for Key-Value Stores |
title_full_unstemmed |
A Correlation-Aware Data Placement Strategy for Key-Value Stores |
title_sort |
correlation-aware data placement strategy for key-value stores |
publisher |
HAL CCSD |
publishDate |
2011 |
url |
https://inria.hal.science/hal-01583587 https://inria.hal.science/hal-01583587/document https://inria.hal.science/hal-01583587/file/978-3-642-21387-8_17_Chapter.pdf https://doi.org/10.1007/978-3-642-21387-8_17 |
op_coverage |
Reykjavik, Iceland |
genre |
Iceland |
genre_facet |
Iceland |
op_source |
Lecture Notes in Computer Science 11th Distributed Applications and Interoperable Systems (DAIS) https://inria.hal.science/hal-01583587 11th Distributed Applications and Interoperable Systems (DAIS), Jun 2011, Reykjavik, Iceland. pp.214-227, ⟨10.1007/978-3-642-21387-8_17⟩ |
op_relation |
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-21387-8_17 hal-01583587 https://inria.hal.science/hal-01583587 https://inria.hal.science/hal-01583587/document https://inria.hal.science/hal-01583587/file/978-3-642-21387-8_17_Chapter.pdf doi:10.1007/978-3-642-21387-8_17 |
op_rights |
http://creativecommons.org/licenses/by/ info:eu-repo/semantics/OpenAccess |
op_doi |
https://doi.org/10.1007/978-3-642-21387-8_17 |
container_start_page |
214 |
op_container_end_page |
227 |
_version_ |
1786840986829193216 |