{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:18:25Z","timestamp":1752549505502,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council Discovery Projects","award":["DP180102870"],"award-info":[{"award-number":["DP180102870"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,2]]},"DOI":"10.1145\/3474717.3484264","type":"proceedings-article","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T22:59:49Z","timestamp":1636066789000},"page":"596-605","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["On Practical Nearest Sub-Trajectory Queries under the Fr\u00e9chet Distance"],"prefix":"10.1145","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin P.","family":"Seybold","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Pfeifer","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"75","article-title":"Computing the near neighbors queries for Fr\u00e9chet distance between two polygonal curves","volume":"5","author":"Alt Helmut","year":"1995","unstructured":"Helmut Alt and Michael Godau . 1995 . Computing the near neighbors queries for Fr\u00e9chet distance between two polygonal curves . IJCGA 5 (1995), 75 -- 91 . https:\/\/doi.org\/10.1142\/S0218195995000064 10.1142\/S0218195995000064 Helmut Alt and Michael Godau. 1995. Computing the near neighbors queries for Fr\u00e9chet distance between two polygonal curves. IJCGA 5 (1995), 75--91. https:\/\/doi.org\/10.1142\/S0218195995000064","journal-title":"IJCGA"},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"A fast implementation of near neighbors queries for Fr\u00e9chet distance (GIS Cup)","volume":"99","author":"Baldus Julian","year":"2017","unstructured":"Julian Baldus and Karl Bringmann . 2017 . A fast implementation of near neighbors queries for Fr\u00e9chet distance (GIS Cup) . In Proc. ACM-SIGSPATIAL. 99 : 1 -- 4 . https:\/\/doi.org\/10.1145\/3139958.3140062 10.1145\/3139958.3140062 Julian Baldus and Karl Bringmann. 2017. A fast implementation of near neighbors queries for Fr\u00e9chet distance (GIS Cup). In Proc. ACM-SIGSPATIAL. 99:1--4. https:\/\/doi.org\/10.1145\/3139958.3140062","journal-title":"Proc. ACM-SIGSPATIAL."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. 35th SoCG. 17:1--17:21","author":"Bringmann Karl","year":"2019","unstructured":"Karl Bringmann , Marvin K\u00fcnnemann , and Andr\u00e9 Nusser . 2019 . Walking the Dog Fast in Practice: Algorithm Engineering of the Fr\u00e9chet Distance . In Proc. 35th SoCG. 17:1--17:21 . https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.17 10.4230\/LIPIcs.SoCG.2019.17 Karl Bringmann, Marvin K\u00fcnnemann, and Andr\u00e9 Nusser. 2019. Walking the Dog Fast in Practice: Algorithm Engineering of the Fr\u00e9chet Distance. In Proc. 35th SoCG. 17:1--17:21. https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.17"},{"key":"e_1_3_2_1_5_1","volume-title":"Detecting commuting patterns by clustering subtrajectories. IJCGA","author":"Buchin Kevin","year":"2011","unstructured":"Kevin Buchin , Maike Buchin , Joachim Gudmundsson , Maarten L\u00f6ffler , and Jun Luo . 2011. Detecting commuting patterns by clustering subtrajectories. IJCGA ( 2011 ), 253--282. https:\/\/doi.org\/10.1142\/S0218195911003652 10.1142\/S0218195911003652 Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten L\u00f6ffler, and Jun Luo. 2011. Detecting commuting patterns by clustering subtrajectories. IJCGA (2011), 253--282. https:\/\/doi.org\/10.1142\/S0218195911003652"},{"key":"e_1_3_2_1_6_1","first-page":"1","article-title":"Efficient trajectory queries under the Fr\u00e9chet distance (GIS Cup)","volume":"101","author":"Buchin Kevin","year":"2017","unstructured":"Kevin Buchin , Yago Diez , Tom van Diggelen , and Wouter Meulemans . 2017 . Efficient trajectory queries under the Fr\u00e9chet distance (GIS Cup) . In Proc. ACM-SIGSPATIAL. 101 : 1 -- 4 . https:\/\/doi.org\/10.1145\/3139958.3140064 10.1145\/3139958.3140064 Kevin Buchin, Yago Diez, Tom van Diggelen, and Wouter Meulemans. 2017. Efficient trajectory queries under the Fr\u00e9chet distance (GIS Cup). In Proc. ACM-SIGSPATIAL. 101:1--4. https:\/\/doi.org\/10.1145\/3139958.3140064","journal-title":"Proc. ACM-SIGSPATIAL."},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. VLDB. 426--435","author":"Ciaccia Paolo","year":"1997","unstructured":"Paolo Ciaccia , Marco Patella , and Pavel Zezula . 1997 . M-tree: An efficient access method for similarity search in metric spaces . In Proc. VLDB. 426--435 . http:\/\/www.vldb.org\/conf\/1997\/P426.PDF Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An efficient access method for similarity search in metric spaces. In Proc. VLDB. 426--435. http:\/\/www.vldb.org\/conf\/1997\/P426.PDF"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2012.11.006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139958.3140023"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/120865112"},{"key":"e_1_3_2_1_11_1","first-page":"94","article-title":"Approximating the Fr\u00e9chet distance for realistic curves in near linear time","volume":"48","author":"Driemel Anne","year":"2012","unstructured":"Anne Driemel , Sariel Har-Peled , and Carola Wenk . 2012 . Approximating the Fr\u00e9chet distance for realistic curves in near linear time . DCG 48 , 1 (2012), 94 -- 127 . https:\/\/doi.org\/10.1007\/s00454-012-9402-z 10.1007\/s00454-012-9402-z Anne Driemel, Sariel Har-Peled, and Carola Wenk. 2012. Approximating the Fr\u00e9chet distance for realistic curves in near linear time. DCG 48, 1 (2012), 94--127. https:\/\/doi.org\/10.1007\/s00454-012-9402-z","journal-title":"DCG"},{"key":"e_1_3_2_1_12_1","first-page":"1","article-title":"Locality-Sensitive Hashing of Curves","volume":"77","author":"Driemel Anne","year":"2017","unstructured":"Anne Driemel and Francesco Silvestri . 2017 . Locality-Sensitive Hashing of Curves . In Proc. SoCG , Vol. 77. 37: 1 -- 16 . https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.37 10.4230\/LIPIcs.SoCG.2017.37 Anne Driemel and Francesco Silvestri. 2017. Locality-Sensitive Hashing of Curves. In Proc. SoCG, Vol. 77. 37:1--16. https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.37","journal-title":"Proc. SoCG"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"A Filter-and-Refinement-Algorithm for Range Queries Based on the Fr\u00e9chet Distance (GIS Cup)","volume":"100","author":"D\u00fctsch Fabian","year":"2017","unstructured":"Fabian D\u00fctsch and Jan Vahrenhold . 2017 . A Filter-and-Refinement-Algorithm for Range Queries Based on the Fr\u00e9chet Distance (GIS Cup) . In Proc. ACM-SIGSPATIAL. 100 : 1 -- 4 . https:\/\/doi.org\/10.1145\/3139958.3140063 10.1145\/3139958.3140063 Fabian D\u00fctsch and Jan Vahrenhold. 2017. A Filter-and-Refinement-Algorithm for Range Queries Based on the Fr\u00e9chet Distance (GIS Cup). In Proc. ACM-SIGSPATIAL. 100:1--4. https:\/\/doi.org\/10.1145\/3139958.3140063","journal-title":"Proc. ACM-SIGSPATIAL."},{"key":"e_1_3_2_1_14_1","volume-title":"Pigeon navigation: exposure to environmental odours prior release is sufficient for homeward orientation, but not for homing. Journal of Experimental Biology","author":"Gagliardo Anna","year":"2016","unstructured":"Anna Gagliardo , Enrica Pollonara , and Martin Wikelski . 2016. Pigeon navigation: exposure to environmental odours prior release is sufficient for homeward orientation, but not for homing. Journal of Experimental Biology ( 2016 ), 2475--2480. https:\/\/doi.org\/10.1242\/jeb.140889 10.1242\/jeb.140889 Anna Gagliardo, Enrica Pollonara, and Martin Wikelski. 2016. Pigeon navigation: exposure to environmental odours prior release is sufficient for homeward orientation, but not for homing. Journal of Experimental Biology (2016), 2475--2480. https:\/\/doi.org\/10.1242\/jeb.140889"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460121"},{"key":"e_1_3_2_1_16_1","unstructured":"Joachim Gudmundsson and Natalie Tridgell. [n.d.]. Approximate Subtrajectory Range Counting Queries. Unpublished ([n. d.]).  Joachim Gudmundsson and Natalie Tridgell. [n.d.]. Approximate Subtrajectory Range Counting Queries. Unpublished ([n. d.])."},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. FOCS. 534--543","author":"Gupta Anupam","year":"2003","unstructured":"Anupam Gupta , Robert Krauthgamer , and James R. Lee . 2003. Bounded Geometries, Fractals, and Low-Distortion Embeddings . In Proc. FOCS. 534--543 . https:\/\/doi.org\/10.1109\/SFCS. 2003 .1238226 10.1109\/SFCS.2003.1238226 Anupam Gupta, Robert Krauthgamer, and James R. Lee. 2003. Bounded Geometries, Fractals, and Low-Distortion Embeddings. In Proc. FOCS. 534--543. https:\/\/doi.org\/10.1109\/SFCS.2003.1238226"},{"key":"e_1_3_2_1_18_1","volume-title":"Karger and Matthias Ruhl","author":"David","year":"2002","unstructured":"David R. Karger and Matthias Ruhl . 2002 . Finding nearest neighbors in growth-restricted metrics. In Proc. ACM-STOC. 741--750. https:\/\/doi.org\/10.1145\/509907.510013 10.1145\/509907.510013 David R. Karger and Matthias Ruhl. 2002. Finding nearest neighbors in growth-restricted metrics. In Proc. ACM-STOC. 741--750. https:\/\/doi.org\/10.1145\/509907.510013"},{"key":"e_1_3_2_1_19_1","unstructured":"STATS. 2015. STATS LLC - Data Science. http:\/\/www.stats.com\/data-science\/.  STATS. 2015. STATS LLC - Data Science. http:\/\/www.stats.com\/data-science\/."}],"event":{"name":"SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Beijing China","acronym":"SIGSPATIAL '21"},"container-title":["Proceedings of the 29th International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474717.3484264","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3474717.3484264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:46Z","timestamp":1750191106000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474717.3484264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":19,"alternative-id":["10.1145\/3474717.3484264","10.1145\/3474717"],"URL":"https:\/\/doi.org\/10.1145\/3474717.3484264","relation":{},"subject":[],"published":{"date-parts":[[2021,11,2]]},"assertion":[{"value":"2021-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}