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: 9596
Venue: VLDB
Year: 2007
Pagerank: 5.2916009e-05
Overall Rank: 5,878 | 59.11%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,294	Approximate Embedding-Based Subsequence Matching of Time Series	2008	SIGMOD	7.2619257e-05
5,936	Efficient and Effective Similar Subtrajectory Search with Deep Reinforcement Learning	2020	VLDB	5.2654071e-05
6,983	A Generic Framework for Efficient and Effective Subsequence Retrieval	2012	VLDB	4.8732757e-05
8,035	A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union	2011	SIGMOD	4.6009403e-05
8,778	The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem	2022	VLDB	4.4543399e-05
11,921	SMiLer: A Semi-Lazy Time Series Prediction System for Sensors	2015	SIGMOD	4.1945683e-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
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
47	Nearest Neighbor Queries	1995	SIGMOD	0.0007015885
65	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD	0.00062029383
79	A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces	1998	VLDB	0.00056242144
243	Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases	2001	SIGMOD	0.00031074984
539	Fast Time Sequence Indexing for Arbitrary L_p Norms	2000	VLDB	0.00020666392
699	Exact Indexing of Dynamic Time Warping	2002	VLDB	0.00018015254
802	Optimal Multi-Step k-Nearest Neighbor Search	1998	SIGMOD	0.00016502317
931	The Pyramid-Technique: Towards Breaking the Curse of Dimensionality	1998	SIGMOD	0.00015238406
1,061	Warping Indexes with Envelope Transforms for Query by Humming	2003	SIGMOD	0.00014368716
3,029	A Decade of Progress in Indexing and Mining Large Time Series Databases	2006	VLDB	7.6803666e-05
3,417	General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows	2002	SIGMOD	7.1195863e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,671	Discovering Longest-lasting Correlation in Sequence Databases	2013	VLDB	4.9669225e-05
8,306	Online Windowed Subsequence Matching over Probabilistic Sequences	2012	SIGMOD	4.5435639e-05
10,691	FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping	2025	VLDB	4.1945683e-05
5,310	Online Event-driven Subsequence Matching over Financial Data Streams	2004	SIGMOD	5.5753015e-05
3,294	Approximate Embedding-Based Subsequence Matching of Time Series	2008	SIGMOD	7.2619257e-05
8,139	Anticipatory DTW for Efficient Similarity Search in Time Series Databases	2009	VLDB	4.5770301e-05
6,983	A Generic Framework for Efficient and Effective Subsequence Retrieval	2012	VLDB	4.8732757e-05
8,778	The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem	2022	VLDB	4.4543399e-05
8,035	A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union	2011	SIGMOD	4.6009403e-05
65	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD	0.00062029383