Optimizing Similarity Search for Arbitrary Length Time Series Queries (2003)
| Citations: | 3 - 0 self |
BibTeX
@MISC{Kahveci03optimizingsimilarity,
author = {Tamer Kahveci and Ambuj Singh},
title = {Optimizing Similarity Search for Arbitrary Length Time Series Queries},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider the problem of finding similar patterns in a time sequence. Typical applications of this problem involve large databases consisting of long time sequences of different lengths. Current time sequence search techniques work well for queries of a prespecified length, but not for arbitrary length queries. We propose a novel indexing technique that works well for arbitrary length queries. The proposed technique stores index structures at different resolutions for a given dataset. We prove that, this index structure is suA preliminary version of this paper appeared in ICDE 2001 [9].
