The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem
Summary: Establishes an SETH-based near-linear lower bound for subsequence matching, even with polynomial preprocessing. Introduces a new series summarization and index supporting Euclidean/DTW distances with z-normalization, achieving 3–12× speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zemin Chao (Harbin Engineering University; Shenzhen University)
- 2. Hong Gao (Harbin Engineering University)
- 3. Yinan An (Harbin Engineering University)
- 4. Jianzhong Li (Harbin Engineering University; Shenzhen University)
BibTeX Citation
@article{chao_vldb22,
title = {{The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem}},
author = {Chao, Zemin and Gao, Hong and An, Yinan and Li, Jianzhong},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {7},
pages = {1453--1465},
doi = {10.14778/3523210.3523222},
url = {https://doi.org/10.14778/3523210.3523222},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,959 | TSM-Bench: Benchmarking Time Series Database Systems for Monitoring Applications | 2023 | VLDB | 5.3444909e-05 |
| 10,938 | FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping | 2025 | VLDB | 5.093636e-05 |
| 11,233 | CIVET: Exploring Compact Index for Variable-Length Subsequence Matching on Time Series | 2024 | VLDB | 5.093636e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 41 | Fast Subsequence Matching in Time-Series Databases | 1994 | SIGMOD | 0.00046675394 |
| 221 | Robust and Fast Similarity Search for Moving Object Trajectories | 2005 | SIGMOD | 0.00024224879 |
| 303 | On The Marriage of Lp-norms and Edit Distance | 2004 | VLDB | 0.00021956234 |
| 1,046 | Warping Indexes with Envelope Transforms for Query by Humming | 2003 | SIGMOD | 0.00012440091 |
| 1,084 | A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series | 2013 | VLDB | 0.00012256753 |
| 3,037 | The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art | 2019 | VLDB | 7.8275859e-05 |
| 3,125 | General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows | 2002 | SIGMOD | 7.7344198e-05 |
| 5,071 | Fast Subtrajectory Similarity Search in Road Networks under Weighted Edit Distance Constraints | 2020 | VLDB | 6.3761034e-05 |
| 5,592 | Ranked Subsequence Matching in Time-Series Databases | 2007 | VLDB | 6.1552372e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,542 | Online Windowed Subsequence Matching over Probabilistic Sequences | 2012 | SIGMOD |
| 2 | 11,233 | CIVET: Exploring Compact Index for Variable-Length Subsequence Matching on Time Series | 2024 | VLDB |
| 3 | 11,456 | Efficient Non-Learning Similar Subtrajectory Search | 2023 | VLDB |
| 4 | 5,162 | Online Event-driven Subsequence Matching over Financial Data Streams | 2004 | SIGMOD |
| 5 | 8,107 | Anticipatory DTW for Efficient Similarity Search in Time Series Databases | 2009 | VLDB |
| 6 | 41 | Fast Subsequence Matching in Time-Series Databases | 1994 | SIGMOD |
| 7 | 6,858 | A Generic Framework for Efficient and Effective Subsequence Retrieval | 2012 | VLDB |
| 8 | 3,440 | Approximate Embedding-Based Subsequence Matching of Time Series | 2008 | SIGMOD |
| 9 | 5,592 | Ranked Subsequence Matching in Time-Series Databases | 2007 | VLDB |
| 10 | 10,938 | FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping | 2025 | VLDB |