DBScholar

Back to papers

General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows

Summary: General Match generalizes subsequence matching window construction in time-series DBs via J-sliding and J-disjoint windows, unifying FRM, Dual Match, and prior methods as special cases. It combines large windows with point-filtering, proves correctness (no false dismissals), estimates an optimal J to minimize I/O, and yields substantial practical speedups on real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3427
Venue
SIGMOD
Year
2002
Pagerank
7.7344198e-05
Overall Rank
3,125 | 78.57%
DOI
10.1145/564691.564735

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{moon_sigmod02,
        title = {{General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows}},
        author = {Moon, Yang-Sae and Whang, Kyu-Young and Han, Wook-Shin},
        series = {{SIGMOD} '02},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/564691.564735},
        url = {https://dl.acm.org/doi/10.1145/564691.564735},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank Citing Paper Year Venue Pagerank
1,046 Warping Indexes with Envelope Transforms for Query by Humming 2003 SIGMOD 0.00012440091
3,267 FTW: Fast Similarity Search under the Time Warping Distance 2005 PODS 7.5816553e-05
3,440 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD 7.4142918e-05
5,162 Online Event-driven Subsequence Matching over Financial Data Streams 2004 SIGMOD 6.339805e-05
5,592 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 6.1552372e-05
6,189 Subsequence Matching on Structured Time Series Data 2005 SIGMOD 5.9483531e-05
6,858 A Generic Framework for Efficient and Effective Subsequence Retrieval 2012 VLDB 5.7523396e-05
7,608 Uncertain Time-Series Similarity: Return to the Basics 2012 VLDB 5.5845913e-05
8,026 A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union 2011 SIGMOD 5.5049255e-05
8,780 The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem 2022 VLDB 5.3742778e-05
9,365 Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree 2007 CIDR 5.279561e-05
10,629 MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean Distance 2026 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

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

Rank Cited Paper Year Venue Pagerank
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
41 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00046675394
46 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00044853085
371 Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases 1995 VLDB 0.00019869565
810 Similarity-Based Queries for Time Series Data 1997 SIGMOD 0.00013874464
864 The Pyramid-Technique: Towards Breaking the Curse of Dimensionality 1998 SIGMOD 0.00013522522
1,129 Beyond Uniformity and Independence : Analysis of R-trees Using the Concept of Fractal Dimension 1994 PODS 0.00012061727
3,252 Fast Time-Series Searching with Scaling and Shifting 1999 PODS 7.5951443e-05
4,077 Similarity-Based Queries 1995 PODS 6.921027e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 3,440 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD
2 9,232 Window-Accumulated Subsequence matching Problem is linear 1999 PODS
3 371 Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases 1995 VLDB
4 5,162 Online Event-driven Subsequence Matching over Financial Data Streams 2004 SIGMOD
5 8,026 A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union 2011 SIGMOD
6 8,780 The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem 2022 VLDB
7 6,858 A Generic Framework for Efficient and Effective Subsequence Retrieval 2012 VLDB
8 8,542 Online Windowed Subsequence Matching over Probabilistic Sequences 2012 SIGMOD
9 5,592 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB
10 41 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD