A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union

Summary: Models ranked subsequence matching as ranked union; introduces MSEQ and MSEQ-distance for lower-bounds and pruning. Cost-aware density-based PQ scheduling eliminates HLMJ overhead; yields up to 2–3 orders of magnitude speedups over HLMJ and PSM on real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4405
Venue: SIGMOD
Year: 2011
Pagerank: 4.5965282e-05
Overall Rank: 8,037 | 44.15%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,982	A Generic Framework for Efficient and Effective Subsequence Retrieval	2012	VLDB	4.8685999e-05
11,929	SMiLer: A Semi-Lazy Time Series Prediction System for Sensors	2015	SIGMOD	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
8	Optimal Aggregation Algorithms for Middleware [Extended Abstract]	2001	PODS	0.0015436578
17	Optimizing Multi-Feature Queries for Image Databases	2000	VLDB	0.00095799341
65	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD	0.00061977022
537	Fast Time Sequence Indexing for Arbitrary L_p Norms	2000	VLDB	0.00020650291
696	Exact Indexing of Dynamic Time Warping	2002	VLDB	0.00017991162
1,060	Warping Indexes with Envelope Transforms for Query by Humming	2003	SIGMOD	0.00014359912
1,207	RankSQL: Query Algebra and Optimization for Relational Top-k Queries	2005	SIGMOD	0.0001327437
3,033	A Decade of Progress in Indexing and Mining Large Time Series Databases	2006	VLDB	7.6737668e-05
3,297	Approximate Embedding-Based Subsequence Matching of Time Series	2008	SIGMOD	7.2549403e-05
3,418	General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows	2002	SIGMOD	7.1129681e-05
3,911	Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions	2007	SIGMOD	6.6343292e-05
5,883	Ranked Subsequence Matching in Time-Series Databases	2007	VLDB	5.2865165e-05
8,140	Anticipatory DTW for Efficient Similarity Search in Time Series Databases	2009	VLDB	4.5726407e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,911	Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions	2007	SIGMOD	6.6343292e-05
6,673	Discovering Longest-lasting Correlation in Sequence Databases	2013	VLDB	4.962156e-05
7,707	Efficient Top-k Algorithms for Approximate Substring Matching	2013	SIGMOD	4.6676985e-05
8,300	Online Windowed Subsequence Matching over Probabilistic Sequences	2012	SIGMOD	4.5392079e-05
7,273	Efficient and Generic Evaluation of Ranked Queries	2011	SIGMOD	4.775366e-05
9,934	Efficient and Effective KNN Sequence Search with Approximate n-grams	2014	VLDB	4.245954e-05
6,982	A Generic Framework for Efficient and Effective Subsequence Retrieval	2012	VLDB	4.8685999e-05
8,775	The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem	2022	VLDB	4.4500701e-05
65	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD	0.00061977022
5,883	Ranked Subsequence Matching in Time-Series Databases	2007	VLDB	5.2865165e-05