Fast Subsequence Matching in Time-Series Databases

Summary: Maps 1D time-series subsequences to a compact feature-space MBR set; sliding windows yield trails partitioned into sub-trails. Indexing with an R*-tree yields fast, length-agnostic subsequence queries, with 3×–100× speedups over scans (real and synthetic data). (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2745
Venue: SIGMOD
Year: 1994
Pagerank: 0.00062029383
Overall Rank: 65 | 99.55%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 106 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
11,340	Scalable Time Series Compound Infrastructure	2022	SIGMOD	4.1945683e-05
11,787	Scaling Locally Linear Embedding	2017	SIGMOD	4.1945683e-05
11,806	Computing Longest Increasing Subsequences over Sequential Data Streams	2017	VLDB	4.1945683e-05
11,921	SMiLer: A Semi-Lazy Time Series Prediction System for Sensors	2015	SIGMOD	4.1945683e-05
12,276	Parsimonious Linear Fingerprinting for Time Series	2010	VLDB	4.1945683e-05
12,584	Fast Algorithms for Time Series with applications to Finance, Physics, Music, Biology, and other Suspects	2004	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0032169493
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
13	Mining Association Rules between Sets of Items in Large Databases	1993	SIGMOD	0.0010864752
24	The R+-Tree: A Dynamic Index For Multi-Dimensional Objects	1987	VLDB	0.00083378538
76	Spatial Query Processing in an Object-Oriented Database System	1986	SIGMOD	0.00057303551
230	An Interval Classifier for Database Mining Applications	1992	VLDB	0.00032217064
231	A Retrieval Technique for Similar Shapes	1991	SIGMOD	0.00032163466

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
539	Fast Time Sequence Indexing for Arbitrary L_p Norms	2000	VLDB	0.00020666392
1,157	A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series	2013	VLDB	0.00013610658
8,778	The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem	2022	VLDB	4.4543399e-05
997	Similarity-Based Queries for Time Series Data	1997	SIGMOD	0.00014739219
3,294	Approximate Embedding-Based Subsequence Matching of Time Series	2008	SIGMOD	7.2619257e-05
5,310	Online Event-driven Subsequence Matching over Financial Data Streams	2004	SIGMOD	5.5753015e-05
3,338	Fast Time-Series Searching with Scaling and Shifting	1999	PODS	7.2040692e-05
6,983	A Generic Framework for Efficient and Effective Subsequence Retrieval	2012	VLDB	4.8732757e-05
362	Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases	1995	VLDB	0.00025770385
5,878	Ranked Subsequence Matching in Time-Series Databases	2007	VLDB	5.2916009e-05