Keeping a very large website up-to-date: Some feasibility results

Publication Type

Conference Proceeding Article

Publication Date

9-2000

Abstract

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.

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Publication

Electronic Commerce and Web Technologies: First International Conference, EC-Web 2000 London, UK, September 4–6, 2000 Proceedings

Volume

1875

First Page

399

Last Page

408

ISBN

9783540444633

Identifier

10.1007/3-540-44463-7_35

Publisher

Springer Verlag

City or Country

Greenwich, UK, Springer Verlag Verlag

Additional URL

http://doi.org/10.1007/3-540-44463-7_35

This document is currently not available here.

Share

COinS