Database Paper Browser

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
3365
Venue
SIGMOD
Year
2002
Pagerank
7.1195863e-05
Overall Rank
3,417 | 76.23%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers