On the feasibility of website refresh queries

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Several factors complicate the coordination of information refresh to websites from corporate databases; a complex website contains information from different portions of the databases; websites have different refresh frequencies; different refresh queries have different execution times; and limited resources are available to perform the refresh. Given the information refresh requirements of a set of websites, we must find a suitable set of queries that timely refresh the websites. In this paper, we first formulate the problem formally as the Website Refresh Problem (WRP) and define four problem instances along two parameters: website refresh interval and execution time of refresh query. For each case, we give sufficient and necessary conditions for the feasibility of executing a set of refresh queries.

Cite

CITATION STYLE

APA

Liu, H., Ng, W. K., & Lim, E. P. (1999). On the feasibility of website refresh queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1677, pp. 1076–1085). Springer Verlag. https://doi.org/10.1007/3-540-48309-8_101

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free