计算机应用与软件2024，Vol.41Issue(7)：25-33,9.DOI:10.3969/j.issn.1000-386x.2024.07.005
时间序列上的变化查询的高效处理算法
FAST QUERY METHODS OF FINDING SUBSEQUENCES OF SATISFIED CHANGES ON TIME SERIES
施文俊 1王鹏 1汪卫1
作者信息
- 1. 复旦大学计算机科学技术学院 上海 200438
- 折叠
摘要
Abstract
Changes in the value of time series data often represent the occurrence of events.The change query on time series data,that is,to find the subsequences within a certain length that meets a certain threshold of increase or decrease,can mine events and has important practical significance.Existing methods cannot efficiently solve this problem.To this end,a method based on segmentation and constructing a segmentation relationship graph is proposed.Experiments show that this method can still return results within 100 milliseconds under a million-length time series,and the storage overhead of the segmentation relationship graph is also small.For data sets with less fluctuation,the storage size can reach less than 30％of the original data set size.Moreover,two optimization methods are further proposed,which can reduce the storage overhead by about 50％on the original basis,and at the same time do not affect the query efficiency too much.关键词
时间序列/变化查询/子序列查询/分段Key words
Time series/Changes query/Subsequence query/Segmentation分类
计算机与自动化引用本文复制引用
施文俊,王鹏,汪卫..时间序列上的变化查询的高效处理算法[J].计算机应用与软件,2024,41(7):25-33,9.
