By Topic

Data Streams Join Aggregate Algorithms Based on Compound Sliding Window

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
$31 $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)
Yingli Zhong ; Sch. of Comput. Sci. & Technol., Heilongjiang Univ., Harbin, China ; Weiping Wang ; Longjiang Guo

In many applications of data stream, join aggregate queries based on sliding window are a sort of queries that are widely used. All the join aggregate query algorithms in existing research works are designed for immediate continuous queries. In this paper, a join aggregate query method based on compound sliding window for periodically executed continuous queries is presented. This method organizes the basic windows in a compound sliding window into hash tables, according to their join properties, the aggregate values are computed while the join processing, the join results of compound sliding window are not saved, so the memory used by query processing is greatly reduced. An algorithm that computes the N+1th join aggregate value increment by using the Nth one is presented. Theoretical analysis and experiment result both show good time and space complexity of this incremental algorithm.

Published in:

Database Technology and Applications, 2009 First International Workshop on

Date of Conference:

25-26 April 2009