计算机应用 ›› 2017, Vol. 37 ›› Issue (1): 37-41.DOI: 10.11772/j.issn.1001-9081.2017.01.0037

• 2016年全国开放式分布与并行计算学术年会(DPCS2016)论文 • 上一篇    下一篇

MapReduce并行加速数据流多模式相似性搜索

付晨1, 钟诚1, 叶波2   

  1. 1. 广西大学 计算机与电子信息学院, 南宁 530004;
    2. 广西科技信息网络中心, 南宁 530012
  • 收稿日期:2016-08-25 修回日期:2016-09-03 出版日期:2017-01-10 发布日期:2017-01-09
  • 通讯作者: 钟诚
  • 作者简介:付晨(1988-),女,江西瑞昌人,硕士,主要研究方向:网络软件工程、大数据高性能计算;钟诚(1964-),男,广西桂平人,教授,博士,CCF高级会员,主要研究方向:并行计算、大数据高性能计算、网络软件工程;叶波(1974-),男,广西南宁人,教授级高级工程师,博士,主要研究方向:网络软件工程、管理信息系统。
  • 基金资助:
    广西自然科学基金资助项目(2014GXNSFAA118396)。

Accelerating parallel searching similar multiple patterns from data streams by using MapReduce

FU Chen1, ZHONG Cheng1, YE Bo2   

  1. 1. School of Computer, Electronics and Information, Guangxi University, Nanning Guangxi 530004, China;
    2. Guangxi Scientific and Technological Information Center, Nanning Guangxi 530012, China
  • Received:2016-08-25 Revised:2016-09-03 Online:2017-01-10 Published:2017-01-09
  • Supported by:
    This work is supported by the Natural Science Foundation of Guangxi (2014GXNSFAA118396).

摘要: 设计时间序列数据在Hadoop分布式文件系统(HDFS)中的有效存储方式,利用分布式缓存工具Distributed Cache将各子序列分发到Hadoop集群的计算节点上,将动态时间弯曲距离矩阵划分成多个子矩阵,采取并行迭代计算每条反对角线上子矩阵的方法,基于MapReduce编程模型,实现高效并行计算时间序列动态弯曲距离,通过改进剪裁冗余计算方法,设计实现一种数据流多模式相似性搜索并行算法。中国雪深长时间序列数据集的实验结果表明,当每条时间序列的长度达到5000以上时,并行计算动态弯曲距离所需时间少于串行计算所需时间,当每条时间序列的长度达到9000以上时,参与计算的集群节点越多,并行计算所需时间越少;当模式长度达到4000、参与计算的集群节点数达5个以上时,从数据流中并行搜索出与模式匹配的相似子序列所需时间约为串行搜索所需时间的20%。

关键词: 时间序列, 数据流, 动态时间弯曲距离, 模式搜索, Hadoop

Abstract: The effective storage mode for time series was designed on Hadoop Distributed File System (HDFS), the sub-series were distributed to the compute nodes on Hadoop cluster by applying Distributed Cache tool, and the matrix of dynamic time warping distances was partitioned into several sub-matrixes. Based on MapReduce programming mode, by parallel computing sub-matrixes in each back-diagonal iteratively, the parallel computation of dynamic time warping distances was implemented, and an efficient parallel algorithm for searching similar patterns from data streams was developed by improving pruning redundant computation. The experimental results on the data set of snow depth long time series in China show that when the length of each time series is equal to or longer than 5000, the required time of parallel computing dynamic time warping distances is less than that of the corresponding sequential computation, and when the length of each time series is equal to or longer than 9000, the more the compute nodes used, the less the required parallel computation time; furthermore, when the length of each pattern is equal to or longer than 4000 and the number of compute nodes is equal to or larger than 5, the required time of parallel searching similar sub-series from data streams is 20% of the corresponding sequential searching time.

Key words: time series, data stream, dynamic time warping distance, pattern searching, Hadoop

中图分类号: