Load shedding for aggregation queries over data streams

被引:87
作者
Babcock, B [1 ]
Datar, M [1 ]
Motwani, R [1 ]
机构
[1] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
来源
20TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS | 2004年
关键词
D O I
10.1109/ICDE.2004.1320010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Systems for processing continuous monitoring queries over data streams must be adaptive because data streams are often bursty and data characteristics may vary over time. In this paper we focus on one particular type of adaptivity: the ability to gracefully degrade performance via "load shedding" (dropping unprocessed tuples to reduce system load) when the demands placed on the system cannot be met in full given available resources. Focusing on aggregation queries, we present algorithms that determine at what points in a query plan should load shedding be performed and what amount of load should be shed at each point in order to minimize the degree of inaccuracy introduced into query answers. We report the results of experiments that validate our analytical conclusions.
引用
收藏
页码:350 / 361
页数:12
相关论文
共 21 条
[1]  
Acharya S, 1999, SIGMOD RECORD, VOL 28, NO 2 - JUNE 1999, P275, DOI 10.1145/304181.304207
[2]  
[Anonymous], COMMUNICATION
[3]  
[Anonymous], P 1997 ACM SIGMOD IN
[4]  
BABCOCK B, UNPUB LOAD SHEDDING
[5]  
BABCOCK B, 2002, P 2002 ACM S PRINC D
[6]  
BABCOCK B, 2003, P 2003 ACM SIGMOD C
[7]  
CARNEY D, 2002, P 28 INT C VER LARG
[8]  
Chaudhuri S, 1999, SIGMOD RECORD, VOL 28, NO 2 - JUNE 1999, P263, DOI 10.1145/304181.304206
[9]  
CHAUDHURI S, 2001, P ACM SIGMOD INT C M, P295
[10]  
Chen J., 2000, SIGMOD 00, P379, DOI DOI 10.1145/342009.335432