On non-preemptive scheduling of recurring tasks using inserted idle times
Information and Computation
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
Strategic directions in real-time and embedded systems
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Query Integration for Refreshing Web Views
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
As websites grow large and become more sophisticated, organizations use structured database systems as a source of base data for information on the website. Thus, it has become critical to keep a very large website up-to-date in response to the frequent changes in base data. This gives rise to an important issue: Can a website be timely refreshed by executing a set of queries against the base data? In this paper, we investigate the feasibility of scheduling a set of queries to refresh a very large website. Based on two types (tight and loose) of feasibility requirements, we present feasibility results when the base data change with uniform, regular and random periods. We found that tight feasibility depends on the interval length between two consecutively raised cell refresh requests while it is NP-Hard to determine loose feasibility when the base data have regular or random update periods. For the case when the base data have the uniform update periods, loose feasibility of a set of refresh queries depends on the sum of execution times of the refresh queries.