Database Paper Browser

Back to papers

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
10392
Venue
VLDB
Year
2012
Pagerank
4.8732757e-05
Overall Rank
6,983 | 51.43%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,671 Discovering Longest-lasting Correlation in Sequence Databases 2013 VLDB 4.9669225e-05
10,331 MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean Distance 2026 VLDB 4.1945683e-05
12,086 RCSI: Scalable similarity search in thousand(s) of genomes 2013 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

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
65 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00062029383
91 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.0005181666
358 On The Marriage of Lp-norms and Edit Distance 2004 VLDB 0.0002599481
699 Exact Indexing of Dynamic Time Warping 2002 VLDB 0.00018015254
1,202 VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams 2007 VLDB 0.00013326298
1,944 WHAM: A High-throughput Sequence Alignment Method 2011 SIGMOD 0.00010004608
2,193 Cost-Based Variable-Length-Gram Selection for String Collections to Support Approximate Queries Efficiently 2008 SIGMOD 9.3178557e-05
2,213 n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure 2005 VLDB 9.2765152e-05
3,294 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD 7.2619257e-05
3,417 General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows 2002 SIGMOD 7.1195863e-05
5,397 Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures 2007 VLDB 5.5299002e-05
5,812 Reference-Based Alignment in Large Sequence Databases 2009 VLDB 5.3172025e-05
5,878 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 5.2916009e-05
6,464 Reference-Based Indexing of Sequence Databases 2006 VLDB 5.0532607e-05
8,035 A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union 2011 SIGMOD 4.6009403e-05
8,139 Anticipatory DTW for Efficient Similarity Search in Time Series Databases 2009 VLDB 4.5770301e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
9,428 A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application 2011 VLDB 4.3441378e-05
9,933 Efficient and Effective KNN Sequence Search with Approximate n-grams 2014 VLDB 4.2500258e-05
6,577 On Efficiently Searching Trajectories and Archival Data for Historical Similarities 2008 VLDB 5.0042166e-05
6,464 Reference-Based Indexing of Sequence Databases 2006 VLDB 5.0532607e-05
3,294 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD 7.2619257e-05
6,671 Discovering Longest-lasting Correlation in Sequence Databases 2013 VLDB 4.9669225e-05
7,708 Efficient Top-k Algorithms for Approximate Substring Matching 2013 SIGMOD 4.6721808e-05
8,778 The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem 2022 VLDB 4.4543399e-05
65 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00062029383
5,878 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 5.2916009e-05