By Topic

Efficient Load Shedding for Streaming Sliding Window Joins

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)
Jia-Dong Ren ; YanShan Univ., Qinhuangdao ; Wan-Chang Jiang ; Cong Huo

We present a novel load shedding technique, called range loading shedding (denoted as RANGE), for sliding window joins when CPU capacity is insufficient in the system and the details of the distribution of streams are unknown. To obtain the statistics of data, we dynamically maintain clustering range histogram (CR-histogram) and average density counter table (ADC-table) for each sliding window. The CR-Histogram is constructed and maintained by clustering technique with a fixed amount of memory. When CPU capacity is insufficient, the RANGE technique is used to select tuples to be processed by utilizing the CR-Histogram and ADC-table, and then produces maximum subset join outputs. Experimental results on synthetic and real life data show that Range load shedding approach obtains max-subset results effectively, and outperforms the existing load shedding strategies.

Published in:

Machine Learning and Cybernetics, 2007 International Conference on  (Volume:3 )

Date of Conference:

19-22 Aug. 2007