A Generic Framework for Efficient and Effective Subsequence Retrieval

Summary: Generic framework for all-pairs subsequence retrieval in time series and strings; yields subsequence pairs when the distance satisfies consistency. It introduces Reference Net, a linear-space metric index for the framework; enables scalable retrieval. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: hd67c390ca1dc39d7
Venue: VLDB
Year: 2012
Pagerank: 5.6234186e-05
Overall Rank: 7,006 | 52.90%
DOI: 10.14778/2350229.2350256

Incoming Non-self Citations Over Time

Authors

1. Haohan Zhu (Boston University)
2. George Kollios (Boston University)
3. Vassilis Athitsos (University of Texas)

BibTeX Citation

@article{zhu_vldb12,
        title = {{A Generic Framework for Efficient and Effective Subsequence Retrieval}},
        author = {Zhu, Haohan and Kollios, George and Athitsos, Vassilis},
        journal = {PVLDB},
        series = {{VLDB} '12},
        volume = {5},
        number = {11},
        pages = {1579--1590},
        doi = {10.14778/2350229.2350256},
        url = {https://doi.org/10.14778/2350229.2350256},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,903	Discovering Longest-lasting Correlation in Sequence Databases	2013	VLDB	5.651111e-05
11,075	MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean Distance	2026	VLDB	4.9793485e-05
12,574	RCSI: Scalable similarity search in thousand(s) of genomes	2013	VLDB	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
42	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD	0.00045773967
56	M-tree: An Efficient Access Method for Similarity Search in Metric Spaces	1997	VLDB	0.00040370171
306	On The Marriage of Lp-norms and Edit Distance	2004	VLDB	0.00021575844
613	Exact Indexing of Dynamic Time Warping	2002	VLDB	0.00015570505
1,061	VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams	2007	VLDB	0.00012213729
2,144	Cost-Based Variable-Length-Gram Selection for String Collections to Support Approximate Queries Efficiently	2008	SIGMOD	8.9608583e-05
2,313	n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure	2005	VLDB	8.6550779e-05
2,508	WHAM: A High-throughput Sequence Alignment Method	2011	SIGMOD	8.371338e-05
3,182	General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows	2002	SIGMOD	7.561954e-05
3,507	Approximate Embedding-Based Subsequence Matching of Time Series	2008	SIGMOD	7.2494536e-05
5,722	Ranked Subsequence Matching in Time-Series Databases	2007	VLDB	6.0183253e-05
5,818	Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures	2007	VLDB	5.9837891e-05
6,305	Reference-Based Alignment in Large Sequence Databases	2009	VLDB	5.818151e-05
6,619	Reference-Based Indexing of Sequence Databases	2006	VLDB	5.7319339e-05
8,186	A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union	2011	SIGMOD	5.3814143e-05
8,286	Anticipatory DTW for Efficient Similarity Search in Time Series Databases	2009	VLDB	5.3620578e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	9,758	A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application	2011	VLDB
2	10,299	Efficient and Effective KNN Sequence Search with Approximate n-grams	2014	VLDB
3	6,890	On Efficiently Searching Trajectories and Archival Data for Historical Similarities	2008	VLDB
4	6,619	Reference-Based Indexing of Sequence Databases	2006	VLDB
5	3,507	Approximate Embedding-Based Subsequence Matching of Time Series	2008	SIGMOD
6	6,903	Discovering Longest-lasting Correlation in Sequence Databases	2013	VLDB
7	7,842	Efficient Top-k Algorithms for Approximate Substring Matching	2013	SIGMOD
8	8,875	The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem	2022	VLDB
9	42	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD
10	5,722	Ranked Subsequence Matching in Time-Series Databases	2007	VLDB