An Indexing Scheme for Fast Similarity Search in Large Time Series Databases

We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating bins that contain time series subsequences of approximately the same shape. For each bin, we can quickly calculate a lower-bound on the distance between a given query and the most similar element of the bin. This bound allows us to search the bins in best first order, and to prune some bins from the search space without having to examine the contents. Additional speedup is obtained by optimizing the data within the bins such that we can avoid having to compare the query to every item in the bin. We call our approach STB-indexing and experimentally validate it on space telemetry, medical and synthetic data, demonstrating approximately an order of magnitude speed-up.

• Type: Conference
• Year: 1999
• Where: SSDBM
• Authors: Eamonn J. Keogh, Michael J. Pazzani
• Keywords: Database, SSDBM 1999, Time Series, Time Series Databases, Time Series Subsequences