This book comprehensively illustrates quality-ware scheduling in key-value stores. In addition, it provides scheduling strategies and a prototype framework of quality-aware scheduler as well as a demonstration of online applications. The book offers a rich blend of theory and practice which is suitable for students, researchers and practitioners interested in distributed systems, NoSQL key-value stores and scheduling.
|
|
|
1 | (10) |
|
1.1 Application Scenarios |
|
|
1 | (4) |
|
1.2 The Research Significance and Challenges |
|
|
5 | (2) |
|
1.3 Implementation Framework |
|
|
7 | (1) |
|
|
|
8 | (3) |
|
|
|
9 | (2) |
|
2 Literature and Research Review |
|
|
11 | (14) |
|
2.1 Metrics for Quality-Aware Scheduling |
|
|
11 | (4) |
|
|
|
11 | (3) |
|
|
|
14 | (1) |
|
2.2 Quality-Aware Scheduling in Data Management System |
|
|
15 | (5) |
|
2.2.1 Quality-Aware Scheduling in RTDBMS |
|
|
15 | (2) |
|
2.2.2 Quality-Aware Scheduling in DSMS |
|
|
17 | (1) |
|
2.2.3 Quality-Aware Scheduling in RDBMS |
|
|
17 | (2) |
|
2.2.4 Quality-Aware Scheduling in Key-Value Stores |
|
|
19 | (1) |
|
|
|
20 | (5) |
|
|
|
21 | (4) |
|
|
|
25 | (12) |
|
|
|
25 | (5) |
|
|
|
26 | (1) |
|
3.1.2 Data Replication and Consistency |
|
|
26 | (2) |
|
|
|
28 | (1) |
|
3.1.4 System Updates: State-Transfer Versus Operation-Transfer |
|
|
29 | (1) |
|
|
|
30 | (4) |
|
|
|
31 | (1) |
|
|
|
32 | (1) |
|
|
|
33 | (1) |
|
|
|
34 | (3) |
|
|
|
34 | (3) |
|
4 Scheduling for State-Transfer Updates |
|
|
37 | (28) |
|
4.1 On-Demand (OD) Mechanism |
|
|
37 | (3) |
|
|
|
39 | (1) |
|
4.2 Hybrid On-Demand (HOD) Mechanism |
|
|
40 | (1) |
|
|
|
41 | (1) |
|
4.3 Freshness/Tardiness (FIT) Mechanism |
|
|
41 | (4) |
|
|
|
44 | (1) |
|
4.4 Adaptive Freshness/Tardiness (AFIT) Mechanism |
|
|
45 | (7) |
|
|
|
46 | (2) |
|
|
|
48 | (3) |
|
|
|
51 | (1) |
|
4.5 Popularity-Aware Mechanism |
|
|
52 | (3) |
|
4.5.1 Populairty-Aware WSJF-OD |
|
|
53 | (1) |
|
4.5.2 Populairty-Aware WSJF-HOD |
|
|
53 | (1) |
|
4.5.3 Popularity-Aware WSJF-FIT |
|
|
54 | (1) |
|
4.5.4 Popularity-Aware WSJF-AFIT |
|
|
54 | (1) |
|
|
|
55 | (7) |
|
|
|
55 | (1) |
|
|
|
56 | (2) |
|
4.6.3 Impact of Query Arrival Rate |
|
|
58 | (1) |
|
4.6.4 Impact of Update Cost |
|
|
59 | (1) |
|
4.6.5 Impact of Different QoS and QoD Preferences |
|
|
60 | (1) |
|
4.6.6 Impact of Popularity |
|
|
61 | (1) |
|
|
|
62 | (3) |
|
|
|
62 | (3) |
|
5 Scheduling for Operation-Transfer Updates |
|
|
65 | (18) |
|
5.1 Hybrid On-Demand (HOD) Mechanism |
|
|
65 | (2) |
|
|
|
66 | (1) |
|
5.2 Freshness/Tardiness (FIT) Mechanism |
|
|
67 | (6) |
|
|
|
72 | (1) |
|
5.3 Popularity-Aware Mechanism |
|
|
73 | (4) |
|
5.3.1 Popularity-Aware WSJF-HOD |
|
|
73 | (1) |
|
5.3.2 Popularity-A ware WSJF-FIT |
|
|
74 | (3) |
|
|
|
77 | (3) |
|
|
|
77 | (1) |
|
5.4.2 Impact of Update Arrival Rate |
|
|
78 | (1) |
|
5.4.3 Impact of Popularity and Approximation |
|
|
79 | (1) |
|
|
|
80 | (3) |
|
|
|
81 | (2) |
|
6 AQUAS: A Quality-Aware Scheduler |
|
|
83 | (12) |
|
|
|
83 | (4) |
|
|
|
84 | (1) |
|
|
|
85 | (2) |
|
|
|
87 | (4) |
|
|
|
87 | (1) |
|
|
|
88 | (3) |
|
6.3 A Demonstration on MicroBlogging Application |
|
|
91 | (3) |
|
6.3.1 Timeline Queries in AQUAS |
|
|
91 | (1) |
|
|
|
91 | (3) |
|
|
|
94 | (1) |
|
|
|
94 | (1) |
|
7 Conclusion and Future Work |
|
|
95 | |
|
|
|
95 | (2) |
|
|
|
97 | |
|
|
|
97 | |
Chen Xu received his PhD degree from East China Normal University (ECNU) in 2014 and Bachelor degree from Hefei University of Technology (HFUT) in 2009. In 2011, Chen studied as visiting student at The University of Queensland (UQ) supported by a research fellowship from UQ. He held the honors of outstanding graduates from ECNU and HFUT as well as Anhui provincial government of P.R. China. He was the winner of the National Scholarship from Ministry of Education of P.R. China in 2008. Chen has publications in academic journal such as Distributed and Parallel Databases (DAPD), and conferences including ICDE, DASFAA, etc. He is serving as a reviewer of Frontier of Computer Science (FCS). His research interest includes data management for data-intensive computing, large-scale data analysis, etc. Aoying Zhou is a professor on Computer Science at East China Normal University (ECNU), where he is heading the Institute for Data Science and Engineering. He got his master and bachelor degree in Computer Science from Sichuan University, in 1988 and 1985 respectively, and he won his Ph.D. degree from Fudan University in 1993. Before joining ECNU in 2008, Aoying worked for Fudan University at the Computer Science Department for 15 years. He is the winner of the National Science Fund for Distinguished Young Scholars supported by NSFC and the professorship appointment under Changjiang Scholars Program of Ministry of Education in China. He is now acting as a vice-director of ACM SIGMOD China and Database Technology Committee of China Computer Federation. He is serving as a member of the editorial boards VLDB Journal, WWW Journal, and etc. His research interests include Web data management, data management for data-intensive computing, memory cluster computing, benchmarking for big data and performance.
Lisainfo e-raamatute kohta