作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (21): 95-97. doi: 10.3969/j.issn.1000-3428.2008.21.035

• 网络与通信 • 上一篇    下一篇

有限通信资源下多数据流连接的降载算法

姜万昌,霍 聪,任家东   

  1. (燕山大学信息科学与工程学院,秦皇岛 066004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-11-05 发布日期:2008-11-05

Load Shedding Algorithm for Multi-joins over Data Streams Under Limited Communications Resource

JIANG Wan-chang, HUO Cong, REN Jia-dong   

  1. (College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-11-05 Published:2008-11-05

摘要: 针对数据源节点通信资源十分有限的缺陷,提出一种基于直方图的多数据流滑动窗口连接查询的降载策略。该算法综合中心处理节点和数据源节点的负载情况,给出降载比例计算公式,通过使用聚类技术构建中心直方图和数据源直方图,给出降载策略。结果证明该算法能够产生精确连接结果的极大子集,对多数据流窗口连接降载是高效的。

关键词: 数据流, 降载, 窗口, 连接算法

Abstract:

Considering communications resource of remote nodes is limited, this paper presents a histogram-based load shedding for window multi-joins over data streams. The formula of load shedding rate is given based on the load of central processing and data source nodes. A central histogram and source histograms are designed by using clustering technique, and load shedding is proposed based on these histograms. The results show that the algorithm can produce maximum subset of exact join result and it is efficient for shedding the load of streaming window multi-joins.

Key words: data stream, load shedding, window, join algorithm

中图分类号: