2020/08/21 by Anne Driemel, Driemel, Anne, Ioannis Psarros +1
Computer Science · #Advanced Image and Video Retrieval Techniques #Algorithms and Data Compression #Computational Geometry (cs.CG) #Data Management and Algorithms #FOS: Computer and information sciences #Time Series Analysis and Forecasting
paper · pdf · doi:10.48550/arxiv.2008.09406
openalex publication_date 2020/08/21 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28
We study approximate-near-neighbor data structures for time series under the continuous Fréchet distance. For an attainable approximation factor c>1 and a query radius r, an approximate-near-neighbor data structure can be used to preprocess n curves in ℝ (aka time series), each of complexity m, to answer queries with a curve of complexity k by either returning a curve that lies within Fréchet distance cr, or answering that there exists no curve in the input within distance r. In both cases, the answer is correct. Our first data structure achieves a (5+ε) approximation factor, uses space in n⋅ O(ε-1)k + O(nm) and has query time in O(k). Our second data structure achieves a (2+ε) approximation factor, uses space in n⋅ O((m)/(kε))k + O(nm) and has query time in O(k⋅ 2k). Our third positive result is a probabilistic data structure based on locality-sensitive hashing, which achieves space in O(nlog n+nm) and query time in O(klog n), and which answers queries with an approximation factor in O(k). All of our data structures make use of the concept of signatures, which were originally introduced for the problem of clustering time series under the Fréchet distance. In addition, we show lower bounds for this problem. Consider any data structure which achieves an approximation factor less than 2 and which supports curves of arclength up to L and answers the query using only a constant number of probes. We show that under reasonable assumptions on the word size any such data structure needs space in LΩ(k).