Database Paper Browser

Back to papers

Efficient Non-Learning Similar Subtrajectory Search

Summary: First exact non-learning algorithm for similar subtrajectory search achieving O(mn) time (vs. prior O(m n^2)) for most common trajectory distances (WED, DTW, ERP, EDR, Fréchet). Practicality validated with extensive experiments on three real datasets showing large speedups and accuracy. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13149
Venue
VLDB
Year
2023
Pagerank
4.1945683e-05
Overall Rank
11,257 | 21.69%
DOI
10.14778/3611479.3611512

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers