Optimizing i/o-intensive transactions in highly interactive applications
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Caching and Materialization for Web Databases
Foundations and Trends in Databases
A collaborative monitoring mechanism for making a multitenant platform accountable
HotCloud'10 Proceedings of the 2nd USENIX conference on Hot topics in cloud computing
iCBS: incremental cost-based scheduling under piecewise linear SLAs
Proceedings of the VLDB Endowment
Performance evaluation of scheduling algorithms for database services with soft and hard SLAs
Proceedings of the second international workshop on Data intensive computing in the clouds
Utility driven optimization of real time data broadcast schedules
Applied Soft Computing
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Scheduling with freshness and performance guarantees for web applications in the cloud
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Towards predicting query execution time for concurrent and dynamic database workloads
Proceedings of the VLDB Endowment
Distribution-based query scheduling
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
In highly interactive dynamic web database systems, user satisfaction determines their success. In such systems, user requested web pages are dynamically created by executing a number of database queries or web transactions. In this paper, we model the interrelated transactions generating a web page as workflows and quantify the user satisfaction by associating dynamic web pages with soft-deadlines. Further, we model the importance of transactions in generating a page by associating different weights to transactions. Using this framework, system success is measured in terms of minimizing the deviation from the deadline (i.e., tardiness) and also minimizing the weighted such deviation (i.e., weighted tardiness). In order to efficiently support the materialization of dynamic web pages, we propose ASETS∗, which is a parameter-free adaptive scheduling algorithm that automatically adapts to, not only system load, but also transactions' characteristics (i.e., interdependencies, deadlines and weights). ASETS∗ prioritizes the execution of transactions with the objective of minimizing weighted tardiness. It is also capable of balancing the tradeoff between optimizing average- and worst-case performance when needed. The performance advantages of ASETS∗ are experimentally demonstrated.