The Community for Technology Leaders
Proceedings. 20th International Conference on Data Engineering (2004)
Boston, Massachusetts
Mar. 30, 2004 to Apr. 2, 2004
ISSN: 1063-6382
ISBN: 0-7695-2065-0
pp: 350
Brian Babcock , Stanford University, CA
Mayur Datar , Stanford University, CA
Rajeev Motwani , Stanford University, CA
ABSTRACT
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.
INDEX TERMS
null
CITATION

M. Datar, R. Motwani and B. Babcock, "Load Shedding for Aggregation Queries over Data Streams," Proceedings. 20th International Conference on Data Engineering(ICDE), Boston, Massachusetts, 2004, pp. 350.
doi:10.1109/ICDE.2004.1320010
92 ms
(Ver 3.3 (11022016))