Abstract
Under the operation-transfer update model, the propagated updates involve partial content rather than the entire value. Hence, each replica basically reconstructs the current value of a data object from a history of propagated updates. This manner is suited for key-value stores such as PNUTS, Cassandra, and BigTable with a schema-like structured values where the value component is divided into columns as in traditional row structures and the system is responsible for the semantic interpretation of the read and write operations. Under operation-transfer updates, each data object in key-value stores accessed by its key still leads to a clear relationship between the arriving queries and their corresponding pending updates. 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.), based on an operation-transfer model for update propagation, we present scheduling strategies for the efficient processing of both pending queries and updates at key-value data store nodes. In the following, Sect. 5.1 describes hybrid on-demand (HOD) mechanism; Sect. 5.2 presents freshness/tardiness (FIT) mechanism; Sect. 5.3 introduces popularity-aware mechanism; Sect. 5.4 shows the experimental analysis based on a simulation platform; Sect. 5.5 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)
Saito, Y., Shapiro, M.: Optimistic replication. ACM Comput. Surv. 37(1), 42–81 (2005)
Hewitt, E.: Cassandra: The Definitive Guide. O’Reilly Media Inc., Sebastopol (2010)
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). Scheduling for Operation-Transfer Updates. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-47306-1_5
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)