DBScholar

Back to papers

Efficient Non-Learning Similar Subtrajectory Search

Summary: Introduces the first exact O(mn) algorithm for similar subtrajectory search, improving over the O(mn²) barrier across WED, DTW, ERP, EDR, and Fréchet distances. Extensive experiments on three real datasets demonstrate substantial efficiency and effectiveness gains. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
13337
Venue
VLDB
Year
2023
Pagerank
5.093636e-05
Overall Rank
11,456 | 21.41%
DOI
10.14778/3611479.3611512

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{jin_vldb23,
        title = {{Efficient Non-Learning Similar Subtrajectory Search}},
        author = {Jin, Jiabao and Cheng, Peng and Chen, Lei and Lin, Xuemin and Zhang, Wenjie},
        journal = {PVLDB},
        series = {{VLDB} '23},
        volume = {16},
        number = {11},
        pages = {3111--3123},
        doi = {10.14778/3611479.3611512},
        url = {https://doi.org/10.14778/3611479.3611512},
        year = {2023}
}

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 10 of 10 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