DBScholar

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
4592
Venue
SIGMOD
Year
2012
Pagerank
5.4119882e-05
Overall Rank
8,542 | 41.40%
DOI
10.1145/2213836.2213868

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{li_sigmod12,
        title = {{Online Windowed Subsequence Matching over Probabilistic Sequences}},
        author = {Li, Zheng and Ge, Tingjian},
        series = {{SIGMOD} '12},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2213836.2213868},
        url = {https://dl.acm.org/doi/10.1145/2213836.2213868},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
12,240 E-Matching: Event Processing over Noisy Sequences in Real Time 2013 SIGMOD 5.093636e-05
12,283 RCSI: Scalable similarity search in thousand(s) of genomes 2013 VLDB 5.093636e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers