A correlation-aware data placement strategy for key-value stores
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...
Saved in:
Published in | Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems pp. 214 - 227 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
Berlin, Heidelberg
Springer-Verlag
06.06.2011
|
Series | ACM Conferences |
Subjects | |
Online Access | Get full text |
Cover
Loading…
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. |
---|---|
AbstractList | 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. |
Author | Vilaça, Ricardo Oliveira, Rui Pereira, José |
Author_xml | – sequence: 1 givenname: Ricardo surname: Vilaça fullname: Vilaça, Ricardo email: rmvilaca@di.uminho.pt organization: High-Assurance Software Laboratory, University of Minho, Braga, Portugal – sequence: 2 givenname: Rui surname: Oliveira fullname: Oliveira, Rui email: rco@di.uminho.pt organization: High-Assurance Software Laboratory, University of Minho, Braga, Portugal – sequence: 3 givenname: José surname: Pereira fullname: Pereira, José email: jop@di.uminho.pt organization: High-Assurance Software Laboratory, University of Minho, Braga, Portugal |
BookMark | eNqNj01LAzEYhAMqaGvPXnP0sms-NsnuzVK0CgUveg7vJm-kdruRJCr9926xP8C5zDAMA8-MnI9xREJuOKvVpDvBhGAdq4_OmTkjM6mbKcpWy0uyyPmDTVKSaSWvyP2SupgSDlC2cazgBxJSDwXo5wAO9zgWmkuCgu8HGmKiOzxU3zB84VTHhPmaXAQYMi5OPidvjw-vq6dq87J-Xi03FXBlSiVC73wrteaiMxz7zkDT6qBYYD50GlFzLxphJAjDGbYdOK9gYjDQBu-dnJPbv19we9vHuMuWM3sktidieyKepvU_p7ZPWwzyF2cZWM4 |
ContentType | Conference Proceeding |
DOI | 10.5555/2022090.2022107 |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science |
Editor | Felber, Pascal Rouvoy, Romain |
Editor_xml | – sequence: 1 givenname: Pascal surname: Felber fullname: Felber, Pascal organization: Université de Neuchâtel, Institut d'Informatique, Neuchâtel, Switzerland – sequence: 2 givenname: Romain surname: Rouvoy fullname: Rouvoy, Romain organization: University of Lille 1, LIFL, Villeneuve d'Ascq Cedex, France |
EndPage | 227 |
GroupedDBID | 089 0D6 0DA 2HV 38. A4J AABBV AAFYB AAINA AAMFE ABBVZ ABFCV ABMNI ACM ADPZR AECAB AECMQ AEDXK AEGQK AEKFX AETDV AEZAY AFNRJ ALMA_UNASSIGNED_HOLDINGS ANXAN APO AZZ BBABE C9S C9V CZZ GUFHI I4C IEZ IX- JJU LDH MA. MW~ NUC SAO SBO TCUKC TPJZQ TSXQS Z5O Z7R Z7S Z7U Z7V Z7W Z7X Z7Y Z7Z Z81 Z82 Z83 Z84 Z85 Z87 Z88 |
ID | FETCH-LOGICAL-a157t-2fbcd836612971eb97a486f50f0df96ee61d24273a2710e89acd5a2027a8fddc3 |
ISBN | 3642213863 9783642213861 |
IngestDate | Wed Jan 31 06:46:42 EST 2024 Wed Jan 31 06:39:56 EST 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Keywords | DHT cloud computing dependability peer-to-peer |
Language | English |
LinkModel | OpenURL |
MeetingName | DAIS '11: 11th IFIP International Conference on Distributed Applications and Interoperable Systems |
MergedId | FETCHMERGED-LOGICAL-a157t-2fbcd836612971eb97a486f50f0df96ee61d24273a2710e89acd5a2027a8fddc3 |
PageCount | 14 |
ParticipantIDs | acm_books_10_5555_2022090_2022107 acm_books_10_5555_2022090_2022107_brief |
PublicationCentury | 2000 |
PublicationDate | 20110606 |
PublicationDateYYYYMMDD | 2011-06-06 |
PublicationDate_xml | – month: 06 year: 2011 text: 20110606 day: 06 |
PublicationDecade | 2010 |
PublicationPlace | Berlin, Heidelberg |
PublicationPlace_xml | – name: Berlin, Heidelberg |
PublicationSeriesTitle | ACM Conferences |
PublicationTitle | Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems |
PublicationYear | 2011 |
Publisher | Springer-Verlag |
Publisher_xml | – name: Springer-Verlag |
SSID | ssj0000530653 |
Score | 1.8621283 |
Snippet | Key-value stores hold the unprecedented bulk of the data produced by applications such as social networks. Their scalability and availability requirements... |
SourceID | acm |
SourceType | Publisher |
StartPage | 214 |
SubjectTerms | Computer systems organization Computer systems organization -- Architectures Computer systems organization -- Architectures -- Distributed architectures Computer systems organization -- Dependable and fault-tolerant systems and networks General and reference General and reference -- Cross-computing tools and techniques General and reference -- Cross-computing tools and techniques -- Performance Networks Networks -- Network performance evaluation Software and its engineering Software and its engineering -- Software organization and properties Software and its engineering -- Software organization and properties -- Software system structures Software and its engineering -- Software organization and properties -- Software system structures -- Distributed systems organizing principles |
Title | A correlation-aware data placement strategy for key-value stores |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Pb9MwFLZKuYwLowwxYMhIk3ao3NVpYye3VbDRVRvaYb9ukZPYWiVoUJIJiQN_-96LnR90Ewx6SFO3dRR_zvPn5_c-E7KrPamU9mJmRDBlSHhZDEVMB7i3tQaGWzn0T7-I-cV0ce1f93q_utklZTxKfj6YV_I_qEIZ4IpZsv-AbFMpFMA54AtHQBiOa-T3wXHmrCks6qV-zsub4fHR8dnw6vNQjHglB9F6_JImvw8XCT6haC7udwWks7uQ7RSZ4I_Zd51XuVVFR9i8Dm-G2vLcxdIx9QNDyDDedFiFeVUxBoWVvrUxoWAtGEqLo6Rtlrehi5fLr6parpfKZfpDp81a5y-Y42Vuv7pdtpY8r0sXWWFX-62BROHmAnrYaSeZ8TffBrcxWOKPvs1q6juBWZPHJ4GzjbXtnXaGcc9KDqyPED68MAkGE4zD8QjfOYoRPJEh2Mens8PFyWXjowMDhdK9mBLUXNCKNjWfuZWLwmr31ypFvpN867CV802y1d46bTvJC9LTqwF5Xm_kQZ1dH5BnHVXKl-RgRu8hSxFZ2iBLa2QpIEsbZKlFdotcHB2ef5wzt9EGU9yXJfNMnKRwT8B2Q8l1HEo1DYTxx2acmlBoLXgKVE5OlAeEVAehSlJfodtMBSZNk8kr0l9lK_2a0FQAX4QpgY_KijKVygQi1MpXvkkUV3ybfIBGifAhKiKYgGLDRa7hItdw22Tvr7-JYuhN5s0jantLNtqu9Y70y_xW7wCRLOP3Du87mWps4w |
link.rule.ids | 310,311,786,790,795,796,27958 |
linkProvider | Library Specific Holdings |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+11th+IFIP+WG+6.1+international+conference+on+Distributed+applications+and+interoperable+systems&rft.atitle=A+correlation-aware+data+placement+strategy+for+key-value+stores&rft.au=Vila%C3%A7a%2C+Ricardo&rft.au=Oliveira%2C+Rui&rft.au=Pereira%2C+Jos%C3%A9&rft.series=ACM+Conferences&rft.date=2011-06-06&rft.pub=Springer-Verlag&rft.isbn=3642213863&rft.spage=214&rft.epage=227&rft_id=info:doi/10.5555%2F2022090.2022107 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783642213861/lc.gif&client=summon&freeimage=true |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783642213861/mc.gif&client=summon&freeimage=true |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783642213861/sc.gif&client=summon&freeimage=true |