Abstract
A typical real-time data warehouse continually receives read-only queries from users and write-only updates from a variety of external sources. Queries may conflict with updates due to the resource competition and high loads. Moreover, users expect short response time for queries and low staleness for the query results. This makes it challenging to satisfy the two requirements simultaneously. This paper proposes a requirement-based querying and updating scheduling algorithm (RQUS) which allows users to express their real needs for their queries by specifying the acceptable response time delay and the acceptable result staleness when queries are submitted. RQUS dynamically adjusts the work mode of the system according to the changing requirements of users in order to allocate system resource to queries or updates and then prioritizes the query or update queue according to the work mode. And a freshness monitor is adopted to monitor the execution state of updating tasks in order to maintain the global table incrementally. Experimental results show that RQUS algorithm performs better than the three traditional scheduling algorithms with the changing user requirements overall.
Supported by the National Natural Science Foundation of China under Grant No.61033007 and the Basic Scientific Research Foundation of the Ministry of Education under Grant No.N100304005.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Qu, H.M., Labrinidis, A.: Preference-Aware Query and Update Scheduling in Web-databases. In: ICDE, pp. 356–365 (April 2007), doi:10.1109/ICDE.2007.367881
Thiele, M., Fischer, U., Lehner, W.: Partition-based Workload Scheduling in Living Data Warehouse Environments. In: DOLAP, pp. 57–64 (November 2007), doi: 10.1145/1317331.1317342
Mehta, A., Gupta, C., Wang, S., Dayal, U.: rFEED: A Mixed Workload Scheduler for Enterprise Data Warehouses. In: ICDE, pp. 1455–1458 (April 2009), doi:10.1109/ICDE.2009.66
Nama, B., Shinb, M., Andradec, H., Sussman, A.: Multiple query scheduling for distributed semantic caches. Journal of Parallel and Distributed Computing 70(5), 598–611 (2010)
Qu, H.M., Labrinidis, A., Mosse, D.: UNIT: User-centric Transaction Management in Web-Database Systems. In: Proc. ICDE Data Engineering (ICDE 2006), pp. 1–10 (April 2006), doi:10.1109/ICDE.2006.166
Shi, J.G., Bao, Y.B., Leng, F.L., Yu, G.: Priority-based Balance Scheduling in Real-Time Data Warehouse. In: HIS, vol. 3, pp. 301–306 (2009), doi:10.1109/HIS.2009.275
Golab, L., Johnson, T., Shkapenyuk, V.: Scheduling Updates in a Real-Time Stream Warehouse. In: ICDE, pp. 1207–1210 (April 2009), doi:10.1109/ICDE.2009.202
Labrinidis, A., Roussopoulos, N.: Update Propagation Strategies for Improving the Quality of Data on the Web. In: VLDB, pp. 391–400 (June 2001)
Burns, A.: Scheduling hard real-time systems: a review. Software Engineering Journal 6, 116–128 (1991)
Othayoth, R., Poess, M.: The Making of TPC-DS. In: Proc. VLDB, pp. 1049–1058. ACM Press, New York (September 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leng, F., Bao, Y., Yu, G., Shi, J., Cai, X. (2011). Requirement-Based Query and Update Scheduling in Real-Time Data Warehouses. In: Wang, H., Li, S., Oyama, S., Hu, X., Qian, T. (eds) Web-Age Information Management. WAIM 2011. Lecture Notes in Computer Science, vol 6897. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23535-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-23535-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23534-4
Online ISBN: 978-3-642-23535-1
eBook Packages: Computer ScienceComputer Science (R0)