By Topic

A semantic load shedding algorithm based on priority table in Data Stream System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li Ma ; College of Computer and Communication Engineering, China University of Petroleum, Qingdao Shandong, 266555, China ; Qiongsheng Zhang ; Nianyun Shi

When a Data Stream Management System (DSMS) becomes overloaded and fails to satisfy all kinds of requirements, such as tuple latency and result precision because the arrival rates are bursty. Especially, real-time queries have to be completed within certain deadlines for results to be full of value. Semantic load shedding is an effective approach to alleviate workload. A semantic load shedding algorithm based on priority table is presented which considers about execution costs and values of tuples at the same time when deciding which tuples are dropped in this paper. Experiment results show that this algorithm has better performance and flexibility to handle workload fluctuations gracefully.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2010 Seventh International Conference on  (Volume:3 )

Date of Conference:

10-12 Aug. 2010