Publication Type
Journal Article
Version
publishedVersion
Publication Date
3-2005
Abstract
The World Wide Web is a new advertising medium that corporations use to increase their exposure to consumers. Very large websites whose content is derived from a source database need to maintain a freshness that reflects changes that are made to the base data. This issue is particularly significant for websites that present fast-changing information such as stock-exchange information and product information. In this article, we formally define and study the freshness of a website that is refreshed by a scheduled set of queries that fetch fresh data from the databases. We propose several online-scheduling algorithms and compare the performance of the algorithms on the freshness metric. We show that maximizing the freshness of a website is a NP-hard problem and that the scheduling algorithm MiEF performs better than the other proposed algorithms. Our conclusion is verified by empirical results.
Discipline
Databases and Information Systems | Numerical Analysis and Scientific Computing
Publication
World Wide Web
Volume
8
Issue
1
First Page
61
Last Page
90
ISSN
1386-145X
Identifier
10.1023/b:wwwj.0000047378.69751.72
Publisher
Springer Verlag
Citation
LIU, Haifeng; NG, Wee-Keong; and LIM, Ee Peng.
Scheduling queries to improve the freshness of a website. (2005). World Wide Web. 8, (1), 61-90.
Available at: https://ink.library.smu.edu.sg/sis_research/78
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://doi.org/10.1023/b:wwwj.0000047378.69751.72
Included in
Databases and Information Systems Commons, Numerical Analysis and Scientific Computing Commons