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
h9949dacb4ec74528
Venue
SIGMOD
Year
2002
Pagerank
7.561954e-05
Overall Rank
3,182 | 78.61%
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,070 Warping Indexes with Envelope Transforms for Query by Humming 2003 SIGMOD 0.00012174775
3,333 FTW: Fast Similarity Search under the Time Warping Distance 2005 PODS 7.4153527e-05
3,507 Approximate Embedding-Based Subsequence Matching of Time Series 2008 SIGMOD 7.2494536e-05
5,270 Online Event-driven Subsequence Matching over Financial Data Streams 2004 SIGMOD 6.2013771e-05
5,722 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 6.0183253e-05
6,320 Subsequence Matching on Structured Time Series Data 2005 SIGMOD 5.8149919e-05
7,006 A Generic Framework for Efficient and Effective Subsequence Retrieval 2012 VLDB 5.6234186e-05
7,754 Uncertain Time-Series Similarity: Return to the Basics 2012 VLDB 5.4592892e-05
8,186 A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union 2011 SIGMOD 5.3814143e-05
8,875 The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem 2022 VLDB 5.2577831e-05
9,544 Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree 2007 CIDR 5.1611019e-05
11,075 MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean Distance 2026 VLDB 4.9793485e-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.0011405675
42 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00045773967
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.0004503446
385 Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases 1995 VLDB 0.0001946565
829 Similarity-Based Queries for Time Series Data 1997 SIGMOD 0.00013611445
886 The Pyramid-Technique: Towards Breaking the Curse of Dimensionality 1998 SIGMOD 0.0001325914
1,142 Beyond Uniformity and Independence : Analysis of R-trees Using the Concept of Fractal Dimension 1994 PODS 0.00011848523
3,302 Fast Time-Series Searching with Scaling and Shifting 1999 PODS 7.4433382e-05
4,166 Similarity-Based Queries 1995 PODS 6.7666324e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

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