The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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 data set. We prove that this index structure is superior to existing index structures that use a single resolution. We propose a range query and nearest neighbor query technique on this index structure and prove the optimality of our index structure for these search techniques. The experimental results show that our method is 4 to 20 times faster than the current techniques, including Sequential Scan, for range queries and 3 times faster than Sequential Scan and other techniques for nearest neighbor queries. Because of the need to store information at multiple resolution levels, the storage requirement of our method could potentially be large. In the second part of the paper, we show how the index information can be compressed with minimal information loss. According to our experimental results, even after compressing the size of the index to one fifth, the total cost of our method is 3 to 15 times less than the current techniques.</p>
Time series, subsequence search, range query, nearest neighbor query, multiple resolutions.
Ambuj K. Singh, Tamer Kahveci, "Optimizing Similarity Search for Arbitrary Length Time Series Queries", IEEE Transactions on Knowledge & Data Engineering, vol. 16, no. , pp. 418-433, April 2004, doi:10.1109/TKDE.2004.1269667
212 ms
(Ver 3.3 (11022016))