Efficient Retrieval of Similar Time Sequences Using DFT
<|reference_start|>Efficient Retrieval of Similar Time Sequences Using DFT: We propose an improvement of the known DFT-based indexing technique for fast retrieval of similar time sequences. We use the last few Fourier coefficients in the distance computation without storing them in the index since every coefficient at the end is the complex conjugate of a coefficient at the beginning and as strong as its counterpart. We show analytically that this observation can accelerate the search time of the index by more than a factor of two. This result was confirmed by our experiments, which were carried out on real stock prices and synthetic data.<|reference_end|>
@article{rafiei1998efficient,
    title={Efficient Retrieval of Similar Time Sequences Using DFT},
    author={Davood Rafiei and Alberto Mendelzon},
    journal={Proceedings of 5th Intl. Conf. on Foundations of Data
  Organizations and Algorithms (FODO '98), November 1998, Kobe, Japan},
    year={1998},
    archivePrefix={arXiv},
    eprint={cs/9809033},
    primaryClass={cs.DB}
}