EPLA-DSTree: Extending Piecewise Linear Approximation on a Dynamic Segmentation Tree Index in Sensor-Cloud Systems

In sensor-cloud applications, a huge amount of time series are generated. Efficient similarity search approaches are necessary for processing these sensor time series data. Concerning of time series search, whole matching similarity search and subsequence similarity search are two main research focuses. In this paper, we study the whole matching similarity search problem. We propose EPLA-DSTree, which extends piecewise linear approximation on a dynamic segmentation tree index for whole matching on time series. Compared with DSTree, EPLA-DSTree improves data locality of nodes by a better time series representation. EPLA-DSTree has a tighter lower bound for nodes which leads to a better query performance. Experiments show that it has a less index building time and a better query performance. To meet the requirements of sensor-cloud applications, we present an parallel EPLA-DSTree on MapReduce, which is a popular cloud programming model.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.