{"id":"https://openalex.org/W4367680569","doi":"https://doi.org/10.1145/3587426","title":"On Practical Nearest Sub-Trajectory Queries under the Fr\u00e9chet Distance","display_name":"On Practical Nearest Sub-Trajectory Queries under the Fr\u00e9chet Distance","publication_year":2023,"publication_date":"2023-05-02","ids":{"openalex":"https://openalex.org/W4367680569","doi":"https://doi.org/10.1145/3587426"},"language":"en","primary_location":{"id":"doi:10.1145/3587426","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3587426","pdf_url":null,"source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087003217","display_name":"Joachim Gudmundsson","orcid":"https://orcid.org/0000-0002-6778-7990"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Joachim Gudmundsson","raw_affiliation_strings":["School of Computer Science, University of Sydney, Darlington, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0002-6778-7990","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Sydney, Darlington, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047610257","display_name":"John Pfeifer","orcid":"https://orcid.org/0000-0001-5286-2604"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"John Pfeifer","raw_affiliation_strings":["School of Computer Science, University of Sydney, Darlington, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0001-5286-2604","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Sydney, Darlington, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040791128","display_name":"Martin P. Seybold","orcid":"https://orcid.org/0000-0001-6901-3035"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Martin P. Seybold","raw_affiliation_strings":["School of Computer Science, University of Sydney, Darlington, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0001-6901-3035","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Sydney, Darlington, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I129604602"],"apc_list":null,"apc_paid":null,"fwci":0.5477,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61044748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"9","issue":"2","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7349520325660706},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6577778458595276},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6080155372619629},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.47474461793899536},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4711802303791046},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4538525342941284},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4417000412940979},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4076944589614868},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33455443382263184},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3326566815376282},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31540292501449585},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3067884147167206},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10210299491882324}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7349520325660706},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6577778458595276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6080155372619629},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.47474461793899536},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4711802303791046},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4538525342941284},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4417000412940979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4076944589614868},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33455443382263184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3326566815376282},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31540292501449585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3067884147167206},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10210299491882324},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3587426","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3587426","pdf_url":null,"source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7099999785423279}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W2031674781","https://openalex.org/W2083364906","https://openalex.org/W2116264435","https://openalex.org/W2124299914","https://openalex.org/W2127248062","https://openalex.org/W2133296809","https://openalex.org/W2157734830","https://openalex.org/W2169036209","https://openalex.org/W2172041433","https://openalex.org/W2412860234","https://openalex.org/W2570995828","https://openalex.org/W2588820692","https://openalex.org/W2597017779","https://openalex.org/W2773593212","https://openalex.org/W2779088922","https://openalex.org/W2779456973","https://openalex.org/W2779876493","https://openalex.org/W2907168943","https://openalex.org/W3105607278","https://openalex.org/W3171419939","https://openalex.org/W3185837231"],"related_works":["https://openalex.org/W2760348722","https://openalex.org/W2783885583","https://openalex.org/W2120095724","https://openalex.org/W2368326437","https://openalex.org/W1631221657","https://openalex.org/W2357479099","https://openalex.org/W2364309619","https://openalex.org/W1525406239","https://openalex.org/W2371864976","https://openalex.org/W4245746077"],"abstract_inverted_index":{"We":[0,91],"study":[1],"the":[2,12,148,159,174],"problem":[3,151],"of":[4,39,56,70,88,99,132,137],"sub-trajectory":[5,36],"nearest-neighbor":[6],"queries":[7],"on":[8,53,74,79,107,163],"polygonal":[9],"curves":[10],"under":[11],"continuous":[13],"Fr\u00e9chet":[14,149],"distance.":[15],"Given":[16],"an":[17,23,122],"n":[18],"vertex":[19,25],"trajectory":[20,27],"P":[21,37,40,57,63,80,133],"and":[22,51,121,155,165,177],"m":[24],"query":[26,125,139],"Q":[28,45,82],",":[29,46,83],"we":[30,72,111],"seek":[31],"to":[32,44,182],"report":[33],"a":[34,66,113,142],"vertex-aligned":[35],"\u2032":[38],"that":[41,127,146,169],"is":[42,141],"closest":[43],"i.e.,":[47],"P\u2032":[48],"must":[49],"start":[50],"end":[52],"contiguous":[54],"vertices":[55],".":[58,134],"Since":[59],"in":[60,158],"real":[61,164],"data":[62,119,167],"typically":[64],"contains":[65],"very":[67],"large":[68],"number":[69],"vertices,":[71],"focus":[73],"answering":[75],"queries,":[76],"without":[77],"restrictions":[78],"or":[81],"using":[84,152],"only":[85],"precomputed":[86],"structures":[87],"\ud835\udcaa(n)":[89],"size.":[90],"use":[92],"three":[93],"baseline":[94,183],"algorithms":[95],"from":[96],"straightforward":[97],"extensions":[98],"known":[100],"work;":[101],"however,":[102],"they":[103],"have":[104],"impractical":[105],"performance":[106],"realistic":[108],"inputs.":[109],"Therefore,":[110],"propose":[112],"new":[114],"Hierarchical":[115],"Simplification":[116],"Tree":[117],"(HST)":[118],"structure":[120],"adaptive":[123],"clustering-based":[124],"algorithm":[126,145],"efficiently":[128],"explores":[129],"relevant":[130],"parts":[131],"The":[135],"core":[136],"our":[138,170],"methods":[140],"novel":[143],"greedy-backtracking":[144],"solves":[147],"decision":[150],"\ud835\udcaa(n+m)":[153],"space":[154,176],"\ud835\udcaaO(nm)":[156],"time":[157],"worst":[160],"case.":[161],"Experiments":[162],"synthetic":[166],"show":[168],"heuristic":[171],"effectively":[172],"prunes":[173],"search":[175],"greatly":[178],"reduces":[179],"computations":[180],"compared":[181],"approaches.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}