Ranked Subsequence Matching in Time-Series Databases

Summary: Introduces ranked subsequence matching under time warping (DTW) for top-k similarity from data sequences, a first-of-its-kind solution. MDMWP-distance enables pre-access pruning; deferred group retrieval and window-group distance cut I/O and accesses. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9787
Venue: VLDB
Year: 2007
Pagerank: 6.1552372e-05
Overall Rank: 5,592 | 61.64%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Wook-Shin Han (Kyungpook National University)
2. Jinsoo Lee (Kyungpook National University)
3. Yang-Sae Moon (Kangwon National University)
4. Haifeng Jiang (Google)

BibTeX Citation

@article{han_vldb07,
        title = {{Ranked Subsequence Matching in Time-Series Databases}},
        author = {Han, Wook-Shin and Lee, Jinsoo and Moon, Yang-Sae and Jiang, Haifeng},
        journal = {PVLDB},
        series = {{VLDB} '07},
        pages = {423--434},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,440	Approximate Embedding-Based Subsequence Matching of Time Series	2008	SIGMOD	7.4142918e-05
5,997	Efficient and Effective Similar Subtrajectory Search with Deep Reinforcement Learning	2020	VLDB	6.0146869e-05
6,858	A Generic Framework for Efficient and Effective Subsequence Retrieval	2012	VLDB	5.7523396e-05
8,026	A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union	2011	SIGMOD	5.5049255e-05
8,780	The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem	2022	VLDB	5.3742778e-05
12,120	SMiLer: A Semi-Lazy Time Series Prediction System for Sensors	2015	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
4	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.001157935
28	Nearest Neighbor Queries	1995	SIGMOD	0.00052102434
41	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD	0.00046675394
46	A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces	1998	VLDB	0.00044853085
190	Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases	2001	SIGMOD	0.00026105472
468	Fast Time Sequence Indexing for Arbitrary Lp Norms	2000	VLDB	0.00017986163
601	Exact Indexing of Dynamic Time Warping	2002	VLDB	0.00015870156
796	Optimal Multi-Step k-Nearest Neighbor Search	1998	SIGMOD	0.00013932561
864	The Pyramid-Technique: Towards Breaking the Curse of Dimensionality	1998	SIGMOD	0.00013522522
1,046	Warping Indexes with Envelope Transforms for Query by Humming	2003	SIGMOD	0.00012440091
2,928	A Decade of Progress in Indexing and Mining Large Time Series Databases	2006	VLDB	7.9526656e-05
3,125	General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows	2002	SIGMOD	7.7344198e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	6,780	Discovering Longest-lasting Correlation in Sequence Databases	2013	VLDB
2	8,542	Online Windowed Subsequence Matching over Probabilistic Sequences	2012	SIGMOD
3	10,938	FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping	2025	VLDB
4	5,162	Online Event-driven Subsequence Matching over Financial Data Streams	2004	SIGMOD
5	3,440	Approximate Embedding-Based Subsequence Matching of Time Series	2008	SIGMOD
6	8,107	Anticipatory DTW for Efficient Similarity Search in Time Series Databases	2009	VLDB
7	6,858	A Generic Framework for Efficient and Effective Subsequence Retrieval	2012	VLDB
8	8,780	The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem	2022	VLDB
9	8,026	A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union	2011	SIGMOD
10	41	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD