Supporting Content-Based Searches on Time Series via Approximation C. Wang and X. Wang   View Paper (PDF)   Return to TIME SERIES Abstract Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series whose contents are similar to what users specify. The content types studied include shapes, trends, cyclic components, autocorrelation functions and partial autocorrelation functions. Due to the complex nature of the similarity searches involving such contents, traditional database techniques usually cannot provide a fast response when the involved data volume is high. This paper hence proposes to answer such content-based queries using appropriate approximation techniques. The paper then introduces two specific approximation methods; one is wavelet based and the other line fitting based. Finally, the paper reports some experiments conducted on a stock price data set as well as a synthesized random walk data set, and shows that both approximation methods significantly reduce the query processing time without introducing intolerable errors. Proceedings of the 12th International Conference on Scientific and Statistical Database Management (SSDBM'00) DiSC'01 Copyright ©2002 ACM Inc.