基于基区间的随机滑动窗口聚集  

Random sliding window aggregates based on base intervals

作　　者：程国达[1] 赵文彦[1] 宣恒农[1] 

机构地区：[1]南京财经大学信息工程学院,江苏南京210046

出　　处：《计算机应用》2006年第2期360-363,共4页journal of Computer Applications

基　　金：江苏省高校自然科学研究指导性项目(05KJD520080);江苏省自然科学基金资助项目(BK2004119)

摘　　要：提出了一个基于基区间的实时随机滑动窗口聚集算法。首先,按照规则将窗口中的数据项划分成一系列基区间,然后分别对这些基区间进行聚集计算,窗口中数据项的聚集等于这些基区间聚集和。窗口滑动后,窗口中数据项的聚集可以部分地利用上一次窗口聚集的结果。模拟实验表明,与对窗口中的数据整体进行聚集相比,基于基区间的聚集算法可以有效地降低窗口聚集的时间,提高数据流处理的实时性。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.

关 键 词：数据流 随机滑动窗口 实时 基区间 聚集 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]