【摘要】 提出一种在时间序列上快速匹配子序列的算法,该算法不同于FRM算法,而是采用VA-file这种索引结构,将数据点直接存储在索引上,并在该索引的基础上设计了一种进行范围查询的方法.实验采用了三种时间序列数据集,从不同的角度验证算法的有效性,结果表明该算法大大提高了查询性能.更多还原

【Abstract】 This paper proposes a new algorithm of fast subsequence matching in time-series database. Dramatically differing from FRM algorithm, we develop an index structure using VA-file, which maps data points directly into the index structure. We also propose a new algorithm for Range Query on this index structure. We implement our method and carry out experiments in different ways on three kinds of time-series data. The result shows that our algorithm accelerated the search time significantly.更多还原