FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping
Summary: FSMDTW accelerates index-free DTW subsequence matching by computing candidate lower bounds in average O(log m), replacing the conventional O(m) cost. Novel matching-specific bounds improve pruning, yielding 2.6× gains on shorter queries and up to 10× on long ones. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Zemin Chao (Harbin Engineering University)
- 2. Qiaoyi Zheng (Harbin Engineering University)
- 3. Zhixin Qi (Harbin Engineering University)
- 4. Hongzhi Wang (Harbin Engineering University)
BibTeX Citation
@article{chao_vldb25,
title = {{FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping}},
author = {Chao, Zemin and Zheng, Qiaoyi and Qi, Zhixin and Wang, Hongzhi},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {10},
pages = {3628--3640},
doi = {10.14778/3748191.3748220},
url = {https://doi.org/10.14778/3748191.3748220},
year = {2025}
}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 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,046 | Warping Indexes with Envelope Transforms for Query by Humming | 2003 | SIGMOD | 0.00012440091 |
| 3,486 | Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach | 2018 | VLDB | 7.3696676e-05 |
| 8,780 | The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem | 2022 | VLDB | 5.3742778e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,858 | A Generic Framework for Efficient and Effective Subsequence Retrieval | 2012 | VLDB |
| 2 | 601 | Exact Indexing of Dynamic Time Warping | 2002 | VLDB |
| 3 | 2,467 | An Efficient and Accurate Method for Evaluating Time Series Similarity | 2007 | SIGMOD |
| 4 | 41 | Fast Subsequence Matching in Time-Series Databases | 1994 | SIGMOD |
| 5 | 12,329 | sDTW: Computing DTW Distances using Locally Relevant Constraints based on Salient Feature Alignments | 2012 | VLDB |
| 6 | 5,592 | Ranked Subsequence Matching in Time-Series Databases | 2007 | VLDB |
| 7 | 8,107 | Anticipatory DTW for Efficient Similarity Search in Time Series Databases | 2009 | VLDB |
| 8 | 3,440 | Approximate Embedding-Based Subsequence Matching of Time Series | 2008 | SIGMOD |
| 9 | 3,267 | FTW: Fast Similarity Search under the Time Warping Distance | 2005 | PODS |
| 10 | 8,780 | The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem | 2022 | VLDB |