Abstract
How to define the quality-aware scheduling problem in key-value stores is the foundation of studying the scheduling strategies. In this chapter (Part of this chapter are reprinted from Xu et al., Distrib Parallel Databases 32(4):535–581, 2014 [1], with kind permission from Springer Science+Business Media.), with a comprehensive analysis on data organization, data replication, and consistency, user queries as well as system updates, we first model the asynchronous update in distributed key-value stores and highlight the difference between state-transfer and operation-transfer updates. Then, we employ a series of parameters to specify users’ expectation on QoS and QoD, and propose tardiness on query and staleness of data to measure the satisfaction of users’ requirement on QoS and QoD. Hence, motivated by the idea that penalties are incurred if the system cannot meet user prespecified expectation, we formally define our quality-aware scheduling problem in key-value stores since optimizing QoS and QoD is equivalent to minimizing penalties incurred. In the following, Sect. 3.1 introduces preliminaries about key-value stores and models the data access processing; Sect. 3.2 defines the metrics to qualify QoS and QoD, so as to formally illustrate quality-aware scheduling in key-value stores; Sect. 3.3 summarizes this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Xu, C., Sharaf, M.A., Zhou, X., Zhou, A.: Quality-aware schedulers for weak consistency key-value data stores. Distrib. Parallel Databases 32(4), 535–581 (2014)
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon’s highly available key-value store. In: SOSP, pp. 205–220 (2007)
Cooper, B.F., Ramakrishnan, R., Srivastava, U., Silberstein, A., Bohannon, P., Jacobsen, H., Puz, N., Weaver, D., Yerneni, R.: Pnuts: Yahoo!’s hosted data serving platform. PVLDB 1(2), 1277–1288 (2008)
Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. Operat. Syst. Rev. 44(2), 35–40 (2010)
Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: a distributed storage system for structured data. ACM Trans. Comput. Syst. 26(2), 4:1–4:26 (2008)
Cattell, Rick: ScalableSQL and NoSQL data stores. SIGMOD Rec. 39(4), 12–27 (2010)
Agrawal, D., El Abbadi, A., Antony, S., Das, S.: Data management challenges in cloud computing infrastructures. In: DNIS, pp. 1–10 (2010)
Saito, Y., Shapiro, M.: Optimistic replication. ACM Comput. Surv. 37(1), 42–81 (2005)
Zhu, Y., Yu, P.S., Wang, J.: Records: replica consistency-on-demand store. In: ICDE, pp. 1360–1363 (2013)
Guo, H., Larson, P., Ramakrishnan, R., Goldstein, J.: Relaxed currency and consistency: how to say “good enough” in SQL. In: SIGMOD Conference, pp. 815–826 (2004)
Bright, L., Raschid, L.: Using latency-recency profiles for data delivery on the web. In: VLDB, pp. 550–561 (2002)
Chi, Y., Jin Moon, H., Hacigümüs, H.: ICBS: Incremental cost-based scheduling under piecewise linear SLAs. PVLDB 4(9), 563–574 (2011)
Guirguis, S., Sharaf, M.A., Chrysanthis, P.K.: Alexandros Labrinidis, and Kirk Pruhs. Adaptive scheduling of web transactions. In: ICDE, pp. 357–368 (2009)
Zhang, L., Ardagna, D.: SLA based profit optimization in autonomic computing systems. In: ICSOC, pp. 173–182 (2004)
Irwin, D.E., Grit, L.E., Chase, J.S.: Balancing risk and reward in a market-based task service. In: HPDC, pp. 160–169 (2004)
Bouzeghoub, M., Peralta, V.: A framework for analysis of data freshness. In: IQIS, pp. 59–67 (2004)
Labrinidis, A., Roussopoulos, N.: Exploring the tradeoff between performance and data freshness in database-driven web servers. VLDB J. 13(3), 240–255 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Xu, C., Zhou, A. (2015). Problem Overview. In: Quality-aware Scheduling for Key-value Data Stores. SpringerBriefs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47306-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-47306-1_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47305-4
Online ISBN: 978-3-662-47306-1
eBook Packages: Computer ScienceComputer Science (R0)