Random sliding window aggregates based on base intervals
基于基区间的随机滑动窗口聚集

An algorithm for random slidden window aggregate based on base intervals was proposed. According to rules, the data set among sliding window were partitioned into a serial of sets called base intervals, then the base intervals were aggregated separately. The aggregate result on whole window was equal to the sum of base intervals. After window had been slidden, previous partial results could be used to compute aggregate on data sets belonging to current window. Compared with aggregate on whole data set within window, the simulative experimental results Show that the approach based on base intervals can reduce efficiently time and improve the real time performance of data stream processing.