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
4531
Venue
SIGMOD
Year
2012
Pagerank
4.5392079e-05
Overall Rank
8,300 | 42.32%
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,050 E-Matching: Event Processing over Noisy Sequences in Real Time 2013 SIGMOD 4.1905499e-05
12,094 RCSI: Scalable similarity search in thousand(s) of genomes 2013 VLDB 4.1905499e-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.00044946098
143 TelegraphCQ: Continuous Dataflow Processing for an Uncertain World 2003 CIDR 0.00041688468
204 Monitoring Streams – A New Class of Data Management Applications 2002 VLDB 0.00034696955
259 High-Performance Complex Event Processing over Streams 2006 SIGMOD 0.00030155645
484 Composite Event Specification in Active Databases: Model & Implementation 1992 VLDB 0.00022067136
626 Sequence Query Processing 1994 SIGMOD 0.00018961452
945 Cayuga: A General Purpose Event Monitoring System 2007 CIDR 0.0001512921
3,395 Event Queries on Correlated Probabilistic Streams 2008 SIGMOD 7.1402267e-05
6,401 Subsequence Matching on Structured Time Series Data 2005 SIGMOD 5.0735622e-05
6,837 Capturing Data Uncertainty in High-Volume Stream Processing 2009 CIDR 4.9063121e-05
8,146 Approximate Substring Matching over Uncertain Strings 2011 VLDB 4.5724134e-05
9,077 Window-Accumulated Subsequence matching Problem is linear 1999 PODS 4.3965098e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
9,934 Efficient and Effective KNN Sequence Search with Approximate n-grams 2014 VLDB 4.245954e-05
3,418 General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows 2002 SIGMOD 7.1129681e-05
65 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00061977022
8,775 The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem 2022 VLDB 4.4500701e-05
5,314 Online Event-driven Subsequence Matching over Financial Data Streams 2004 SIGMOD 5.5702825e-05
7,707 Efficient Top-k Algorithms for Approximate Substring Matching 2013 SIGMOD 4.6676985e-05
9,077 Window-Accumulated Subsequence matching Problem is linear 1999 PODS 4.3965098e-05
5,883 Ranked Subsequence Matching in Time-Series Databases 2007 VLDB 5.2865165e-05
12,050 E-Matching: Event Processing over Noisy Sequences in Real Time 2013 SIGMOD 4.1905499e-05
8,146 Approximate Substring Matching over Uncertain Strings 2011 VLDB 4.5724134e-05