Database Paper Browser

Back to papers

The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem

Summary: SETH-based lower bound: subsequence matching requires ω(n^(1−δ)) time; no O(n^(1−δ)) algorithm even with polynomial preprocessing. Proposes a fast algorithm with a new summarization and index for time-series; supports Euclidean and DTW with/without z-normalization; yields up to 3-10x and 7-12x speedups over state of the art. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12652
Venue
VLDB
Year
2022
Pagerank
4.4543399e-05
Overall Rank
8,778 | 38.94%
DOI
10.14778/3523210.3523222

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

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