TY - CPAPER
DO - 10.1109/ICDE.2013.6544879
AB - Computing statistical measures for large databases of time series is a fundamental primitive for querying and mining time-series data [1]–[6]. This primitive is gaining importance with the increasing number and rapid growth of time series databases. In this paper, we introduce a framework for efficient computation of statistical measures by exploiting the concept of affine relationships. Affine relationships can be used to infer statistical measures for time series, from other related time series, instead of computing them directly; thus, reducing the overall computational cost significantly. The resulting methods exhibit at least one order of magnitude improvement over the best known methods. To the best of our knowledge, this is the first work that presents an unified approach for computing and querying several statistical measures at once. Our approach exploits affine relationships using three key components. First, the AFCLST algorithm clusters the time-series data, such that high-quality affine relationships could be easily found. Second, the SYMEX algorithm uses the clustered time series and efficiently computes the desired affine relationships. Third, the SCAPE index structure produces a many-fold im- provement in the performance of processing several statistical queries by seamlessly indexing the affine relationships. Finally, we establish the effectiveness of our approaches by performing comprehensive experimental evaluation on real datasets.
T1 - A FFINITY: Efficiently Querying Statistical Measures on Time-Series Data
DA - 2013
AU - Sathe, Saket
AU - Aberer, Karl
JF - 2013 IEEE 29Tth International Conference On Data Engineering (ICDE)
SP - 841-852
EP - 841-852
PB - IEEE
PP - New York
ID - 182527
SN - 978-1-4673-4909-3
UR - http://infoscience.epfl.ch/record/182527/files/icde13-affinity.pdf
ER -