Browse > Article
http://dx.doi.org/10.6109/JKIICE.2009.13.4.720

A Study on Scheduling Algorithm for Refreshing Database  

Park, Hee-Sook (부경대학교 전자컴퓨터정보통신공학부)
Abstract
There are coexisting various kinds of data in the large scale database system, the maintenance problem of freshness of data is emerging important issue that provide correctness and usefulness information to users. Most solution of this problem depends on how execute effectively required refreshing query within timely time. In this paper, we propose the refreshing scheduling algorithm to retain the freshness of data and fairness of starvation of requested refresh queries. Our algorithm recompute a rate of goal refreshing a every period to assign execution time of requested refreshing query so that we can keep the freshness and fairness of data by using proposed algorithm. We implement the web sites to showing the results of refreshing process of dynamic and semi-dynamic and static data.
Keywords
Semi-dynamic data; Dynamic data; Static data; Refresh scheduling algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Jon Kleinberg, "Algorithm Design", Addison Wesley, 2006
2 Elmasri, "Fundamentals of Database Systems 5/E", Addison-Wesley, 2007
3 H. M. Deitel and P. J. Deitel and T. R. Nieto and T. Lin, P. Sadhu, "XML How TO PROGRAM", Prentice Hall, 2000
4 Haifeng Liu and Wee Keong Ng and Ee-Peng Lim, "Improving the Fairness of Timely Refresh of Web Views", Proceeding of the 7th International Conference on Database Systems for Advanced Applications (DASFAA 2001), April 2001
5 Rob Peter, "Database Systems(8E)", Thomson, 2008
6 K. Jeffay and D. Stanat and C. Martel, "On non-preemptive Scheduling of Periodic and Sporadic Tasks", In Procedings of th 12th IEEE Real-Time Systems Symposium, 1991
7 Haifeng Liu and Wee Keong Ng and Ee-Peng Lim,“Keeping a Very Large Website Up-to-date: Some Feasibility Results", International Conference on Electronic Commerce and Web Technologies(EC-Web '2000), Greenwich, UK, September 2000