Database Paper Browser

Back to papers

Online Windowed Subsequence Matching over Probabilistic Sequences

Summary: Online windowed subsequence matching over probabilistic sequences to handle noisy streams and CEP. Exact algorithm, randomized approximation with provable accuracy, adaptive filtering, and negation-enabled patterns; validated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4530
Venue
SIGMOD
Year
2012
Pagerank
4.5435639e-05
Overall Rank
8,306 | 42.22%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
12,042 E-Matching: Event Processing over Noisy Sequences in Real Time 2013 SIGMOD 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 12 of 12 cited papers.

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

Rank Cited Paper Year Venue Pagerank
125 Approximate String Joins in a Database (Almost) for Free 2001 VLDB 0.00044847972
142 TelegraphCQ: Continuous Dataflow Processing for an Uncertain World 2003 CIDR 0.00041725802
205 Monitoring Streams – A New Class of Data Management Applications 2002 VLDB 0.00034731577
259 High-Performance Complex Event Processing over Streams 2006 SIGMOD 0.00030174924
484 Composite Event Specification in Active Databases: Model & Implementation 1992 VLDB 0.00022086995
625 Sequence Query Processing 1994 SIGMOD 0.00018980669
944 Cayuga: A General Purpose Event Monitoring System 2007 CIDR 0.00015141297
3,398 Event Queries on Correlated Probabilistic Streams 2008 SIGMOD 7.141911e-05
6,405 Subsequence Matching on Structured Time Series Data 2005 SIGMOD 5.0784401e-05
6,838 Capturing Data Uncertainty in High-Volume Stream Processing 2009 CIDR 4.9109732e-05
8,143 Approximate Substring Matching over Uncertain Strings 2011 VLDB 4.5768015e-05
9,081 Window-Accumulated Subsequence matching Problem is linear 1999 PODS 4.400728e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
9,933 Efficient and Effective KNN Sequence Search with Approximate n-grams 2014 VLDB 4.2500258e-05
3,417 General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows 2002 SIGMOD 7.1195863e-05
65 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00062029383
8,778 The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem 2022 VLDB 4.4543399e-05
5,310 Online Event-driven Subsequence Matching over Financial Data Streams 2004 SIGMOD 5.5753015e-05
7,708 Efficient Top-k Algorithms for Approximate Substring Matching 2013 SIGMOD 4.6721808e-05
9,081 Window-Accumulated Subsequence matching Problem is linear 1999 PODS 4.400728e-05
5,878 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 5.2916009e-05
12,042 E-Matching: Event Processing over Noisy Sequences in Real Time 2013 SIGMOD 4.1945683e-05
8,143 Approximate Substring Matching over Uncertain Strings 2011 VLDB 4.5768015e-05