Similarity-Based Queries for Time Series Data

Details Similarity-Based Queries for Time Series Data Similarity-Based Queries for Time Series Data

1998-09-17

arxiv.org/abs/cs/9809023v2

In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, pages 13-24, Tucson, Arizona, May 1997

Computer Science

Databases

Scientific paper

We study a set of linear transformations on the Fourier series representation of a sequence that can be used as the basis for similarity queries on time-series data. We show that our set of transformations is rich enough to formulate operations such as moving average and time warping. We present a query processing algorithm that uses the underlying R-tree index of a multidimensional data set to answer similarity queries efficiently. Our experiments show that the performance of this algorithm is competitive to that of processing ordinary (exact match) queries using the index, and much faster than sequential scanning. We relate our transformations to the general framework for similarity queries of Jagadish et al.

Affiliated with

Also associated with

No associations

Rating

Similarity-Based Queries for Time Series Data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Similarity-Based Queries for Time Series Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Similarity-Based Queries for Time Series Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-536351