Quality-aware schedulers for weak consistency key-value data stores

Xu, Chen, Sharaf, Mohamed A., Zhou, Xiaofang and Zhou, Aoying (2013) Quality-aware schedulers for weak consistency key-value data stores. Distributed and Parallel Databases, 32 4: 1-47. doi:10.1007/s10619-013-7136-4

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Xu, Chen
Sharaf, Mohamed A.
Zhou, Xiaofang
Zhou, Aoying
Title Quality-aware schedulers for weak consistency key-value data stores
Journal name Distributed and Parallel Databases   Check publisher's open access policy
ISSN 0926-8782
1573-7578
Publication date 2013-11-21
Year available 2013
Sub-type Article (original research)
DOI 10.1007/s10619-013-7136-4
Open Access Status
Volume 32
Issue 4
Start page 1
End page 47
Total pages 47
Place of publication New York, NY, United States
Publisher Springer New York
Collection year 2014
Language eng
Formatted abstract
Highly distributed NoSQL key-value data stores are rapidly becoming the favorite choice for hosting modern web applications. Such platforms rely on data partitioning, replication and relaxed consistency to achieve high levels of performance and scalability. However, these design choices often exhibit a trade-off between latency (i.e., Quality of Service (QoS)) and consistency (i.e., Quality of Data (QoD)). In this work, in addition to latency-based SLAs, we also adopt the application tolerance to data staleness as another requirement determining the end-user satisfaction and our goal is to strike a fine balance between both the QoS and QoD provided to the end-user. Towards achieving that goal, we propose a suite of quality-aware schedulers for efficiently allocating the necessary computational resources between the foreground user-queries and the background system-updates at data store nodes. This suite of schedulers features our proposed Freshness/Tardiness (FIT) mechanism, which introduces a novel selective approach for scheduling the execution of queries and updates. Our experimental results show that FIT provides significant improvements in balancing the trade-off between QoS and QoD under both the state-transfer and operation-transfer update propagation models employed in current key-value data stores.
Keyword NoSQL
Key-value data stores
Distributed database
Scheduling
Consistency
SLA e
FLA
Quality of data
Quality of service
Q-Index Code C1
Q-Index Status Confirmed Code
Institutional Status UQ
Additional Notes Communicated by Beng Chin Ooi.

Document type: Journal Article
Sub-type: Article (original research)
Collections: Official 2014 Collection
School of Information Technology and Electrical Engineering Publications
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Wed, 30 Apr 2014, 22:38:52 EST by Dr Mohamed Sharaf on behalf of School of Information Technol and Elec Engineering