Abbadi, “G-Store: A Scalable Data Store for Transactional Multi key

Abbadi, “G-Store: A Scalable Data Store for Transactional Multi key

Cached

Download Links

[www.cs.ucsb.edu]

by Sudipto Das , Divyakant Agrawal , Amr El Abbadi

Venue:	Access in the Cloud,” in SOCC, 2010
Citations:	15 - 7 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Abbadi, “G-Store: A Scalable Data Store for Transactional Multi key	INFERENCE
AUTHOR NAME	Sudipto Das	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of California, Santa Barbara	SVM HeaderParse 0.2
AUTHOR ADDR	Santa Barbara, CA 93106-5110, USA	SVM HeaderParse 0.2
AUTHOR NAME	Divyakant Agrawal	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of California, Santa Barbara	SVM HeaderParse 0.2
AUTHOR ADDR	Santa Barbara, CA 93106-5110, USA	SVM HeaderParse 0.2
AUTHOR NAME	Amr El Abbadi	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of California, Santa Barbara	SVM HeaderParse 0.2
AUTHOR ADDR	Santa Barbara, CA 93106-5110, USA	SVM HeaderParse 0.2
ABSTRACT	Cloud computing has emerged as a preferred platform for deploying scalable web-applications. With the growing scale of these applications and the data associated with them, scalable data management systems form a crucial part of the cloud infrastructure. Key-Value stores – such as Bigtable, PNUTS, Dynamo, and their open source analogues – have been the preferred data stores for applications in the cloud. In these systems, data is represented as Key-Value pairs, and atomic access is provided only at the granularity of single keys. While these properties work well for current applications, they are insufficient for the next generation web applications – such as online gaming, social networks, collaborative editing, and many more – which emphasize collaboration. Since collaboration by definition requires consistent access to groups of keys, scalable and consistent multi key access is critical for such applications. We propose the Key Group abstraction that defines a relationship between a group of keys and is the granule for on-demand transactional access. This abstraction allows the Key Grouping protocol to collocate control for the keys in the group to allow efficient access to the group of keys. Using the Key Grouping protocol, we design and implement G-Store which uses a key-value store as an underlying substrate to provide efficient, scalable, and transactional multi key access. Our implementation using a standard key-value store and experiments using a cluster of commodity machines show that G-Store preserves the desired properties of key-value stores, while providing multi key access functionality at a very low overhead.	SVM HeaderParse 0.2
VENUE	Access in the Cloud,” in SOCC, 2010	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	163--174	INFERENCE
CITATIONS	32 found	ParsCit 1.0