Abstract
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 \(\mathbb {R}\) (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+\epsilon )\) approximation factor, uses space in \(n\cdot \mathcal {O}\left( {\epsilon ^{-1}}\right) ^{k} + \mathcal {O}(nm)\) and has query time in \(\mathcal {O}\left( k\right) \). Our second data structure achieves a \((2+\epsilon )\) approximation factor, uses space in \(n\cdot \mathcal {O}\left( \frac{m}{k\epsilon }\right) ^{k} + \mathcal {O}(nm)\) and has query time in \(\mathcal {O}\left( k\cdot 2^k\right) \). Our third positive result is a probabilistic data structure based on locality-sensitive hashing, which achieves space in \(\mathcal {O}(n\log n+nm)\) and query time in \(\mathcal {O}(k\log n)\), and which answers queries with an approximation factor in \(\mathcal {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 arc length 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^{\varOmega (k)}\).
A full version of this paper can be found on arXiv [9]. We thank Karl Bringmann and André Nusser for useful discussions on the topic of this paper. Special thanks go to the anonymous reviewer who pointed out an error in an earlier version of the manuscript, and to Andrea Cremer for careful reading.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
In fact, an earlier version of this manuscript claimed such a result, but it contained a flaw.
References
Afshani, P., Driemel, A.: On the complexity of range searching among curves. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pp. 898–917 (2018). https://doi.org/10.1137/1.9781611975031.58
Aronov, B., Filtser, O., Horton, M., Katz, M.J., Sheikhan, K.: Efficient nearest-neighbor query and clustering of planar curves. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 28–42. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-24766-9_3
de Berg, M., Gudmundsson, J., Mehrabi, A.D.: A dynamic data structure for approximate proximity queries in trajectory data. In: Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2017 (2017). https://doi.org/10.1145/3139958.3140023
Beygelzimer, A., Kakade, S.M., Langford, J.: Cover trees for nearest neighbor. In: Proceedings of the 23rd International Conference (ICML) on Machine Learning, pp. 97–104 (2006). https://doi.org/10.1145/1143844.1143857
Bringmann, K., Mulzer, W.: Approximability of the discrete Fréchet distance. JoCG 7(2), 46–76 (2016). https://doi.org/10.20382/jocg.v7i2a4
De Berg, M., Cook, A.F., Gudmundsson, J.: Fast Fréchet queries. Comput. Geom. 46(6), 747–755 (2013)
Driemel, A., Krivosija, A., Sohler, C.: Clustering time series under the Fréchet distance. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 766–785 (2016). https://doi.org/10.1137/1.9781611974331.ch55
Driemel, A., Phillips, J.M., Psarros, I.: The VC dimension of metric balls under Fréchet and Hausdorff distances. In: Proceedings of the 35th International Symposium on Computational Geometry, pp. 28:2–28:16 (2019)
Driemel, A., Psarros, I.: (2+\(\epsilon \))-ANN for time series under the Fréchet distance. CoRR abs/2008.09406 (2020). https://arxiv.org/abs/2008.09406
Driemel, A., Silvestri, F.: Locally-sensitive hashing of curves. In: Proceedings of 33rd International Symposium on Computational Geometry, pp. 37:1–37:16 (2017)
Emiris, I.Z., Psarros, I.: Products of Euclidean metrics and applications to proximity questions among curves. In: Proceedings of 34th International Symposium on Computational Geometry (SoCG), LIPIcs, vol. 99, pp. 37:1–37:13 (2018)
Farach-Colton, M., Indyk, P.: Approximate nearest neighbor algorithms for Hausdorff metrics via embeddings. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, New York, NY, USA, 17–18 October 1999, pp. 171–180 (1999). https://doi.org/10.1109/SFFCS.1999.814589
Filtser, A., Filtser, O., Katz, M.J.: Approximate nearest neighbor for curves - simple, efficient, and deterministic. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, pp. 48:1–48:19 (2020). https://doi.org/10.4230/LIPIcs.ICALP.2020.48
Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with \(O(1)\) worst case access time. J. ACM 31(3), 538–544 (1984)
Gudmundsson, J., Horton, M., Pfeifer, J., Seybold, M.P.: A practical index structure supporting Fréchet proximity queries among trajectories (2020)
Gudmundsson, J., Smid, M.: Fast algorithms for approximate Fréchet matching queries in geometric trees. Comput. Geom. 48(6), 479–494 (2015). https://doi.org/10.1016/j.comgeo.2015.02.003
Har-Peled, S., Indyk, P., Motwani, R.: Approximate nearest neighbor: towards removing the curse of dimensionality. Theory Comput. 8(1), 321–350 (2012). https://doi.org/10.4086/toc.2012.v008a014
Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35(5), 1148–1184 (2006). https://doi.org/10.1137/S0097539704446281
Indyk, P.: On approximate nearest neighbors in non-Euclidean spaces. In: 39th Annual Symposium on Foundations of Computer Science, FOCS 1998, pp. 148–155 (1998). https://doi.org/10.1109/SFCS.1998.743438
Indyk, P.: Approximate nearest neighbor algorithms for Fréchet distance via product metrics. In: Symposium on Computational Geometry, pp. 102–106 (2002)
Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 798–807 (2004). http://dl.acm.org/citation.cfm?id=982792.982913
Meintrup, S., Munteanu, A., Rohde, D.: Random projections and sampling algorithms for clustering of high-dimensional polygonal curves. NeurIPS 2019, 12807–12817 (2019)
Miltersen, P.B.: Lower bounds for union-split-find related problems on random access machines. In: Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 625–634. ACM (1994). https://doi.org/10.1145/195058.195415
Mirzanezhad, M.: On the approximate nearest neighbor queries among curves under the Fréchet distance. CoRR abs/2004.08444 (2020). https://arxiv.org/abs/2004.08444
Werner, M., Oliver, D.: ACM SIGSPATIAL GIS Cup 2017: range queries under Fréchet distance. SIGSPATIAL Spec. 10(1), 24–27 (2018). https://doi.org/10.1145/3231541.3231549
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Driemel, A., Psarros, I. (2021). ANN for Time Series Under the Fréchet Distance. In: Lubiw, A., Salavatipour, M., He, M. (eds) Algorithms and Data Structures. WADS 2021. Lecture Notes in Computer Science(), vol 12808. Springer, Cham. https://doi.org/10.1007/978-3-030-83508-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-83508-8_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-83507-1
Online ISBN: 978-3-030-83508-8
eBook Packages: Computer ScienceComputer Science (R0)