Exploring the tradeoff between performance and data freshness in database-driven Web servers

被引:28
作者
Labrinidis, A [1 ]
Roussopoulos, N
机构
[1] Univ Pittsburgh, Dept Comp Sci, Pittsburgh, PA 15260 USA
[2] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
关键词
Adaptive Algorithm; Multiple User; Alternative Definition; Online Data; Present Experimental Result;
D O I
10.1007/s00778-004-0131-7
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Personalization, advertising, and the sheer volume of online data generate a staggering amount of dynamic Web content. In addition to Web caching, view materialization has been shown to accelerate the generation of dynamic Web content. View materialization is an attractive solution as it de couples the serving of access requests from the handling of updates. In the context of the Web, selecting which views to materialize must be decided online and needs to consider both performance and data freshness, which we refer to as the online view selection problem. In this paper, we define data freshness metrics, provide an adaptive algorithm for the online view selection problem that is based on user-specified data freshness requirements, and present experimental results. Furthermore, we examine alternative metrics for data freshness and extend our proposed algorithm to handle multiple users and alternative definitions of data freshness.
引用
收藏
页码:240 / 255
页数:16
相关论文
共 31 条
[1]  
Altinel Mehmet., 2003, P VLDB, P718
[2]  
[Anonymous], P ACM SIGMOD MAY
[3]  
[Anonymous], 1991, ART COMPUTER SYSTEM
[4]  
BORNOVD C, 2003, P ACM SIGMOD SAN DIE, P662
[5]  
Breslau L, 1999, IEEE INFOCOM SER, P126, DOI 10.1109/INFCOM.1999.749260
[6]  
Carney D., 2002, Proceedings of the Twenty-eighth International Conference on Very Large Data Bases, P215
[7]  
Challenger J., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P844, DOI 10.1109/INFCOM.2000.832259
[8]   Effective page refresh policies for Web crawlers [J].
Cho, J ;
Garcia-Molina, H .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2003, 28 (04) :390-426
[9]  
Datta A., 2001, Proceedings of the 27th International Conference on Very Large Data Bases, P667
[10]  
Datta A., 2002, P ACM SIGMOD INT C M, P97