Efficient Retrieval of Similar Time Sequences Using DFT

Simple item page
dc.creatorRafiei, Davood
dc.creatorMendelzon, Alberto
dc.date1998-09-18
dc.date1998-09-25
dc.date.accessioned2026-07-07T03:23:32Z
dc.date.available2026-07-07T03:23:32Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/9809033
dc.identifierhttp://arxiv.org/abs/cs/9809033
dc.identifierProceedings of 5th Intl. Conf. on Foundations of Data Organizations and Algorithms (FODO '98), November 1998, Kobe, Japan
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32982
dc.subjectDatabases
dc.subjectH.2;H.3
dc.titleEfficient Retrieval of Similar Time Sequences Using DFT
dc.typetext

Files

Collections

arXiv