QoM: An effective querying method for time series database

Publication Type:
Conference Proceeding
2012 IEEE International Conference on Granular Computing (GrC), 2012, pp. 129 - 134
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2012004363OK.pdf1.09 MBAdobe PDF
A very promising idea for fast searching in time series databases is to map the time series into a representative space. In this paper, we propose an effective querying algorithm QoM (Querying on Motif) based on time series motifs. First, we map the time series into representative motifs by motif discovery algorithm. Second, we look for a time series data based on these motifs by QoM. The QoM can effectively locate the position of time series by comparing the distance between the time series and central time series of each motif. Meanwhile, in the process of searching time series, we also can further understand the specific time series by the motif which represents a characteristic pattern in the time series database. Furthermore, experiments show that our querying method on databases from diverse domains is feasible and improves efficiency of time series data querying.
Please use this identifier to cite or link to this item: