Database Paper Browser

Back to papers

History is a mirror to the future: Best-effort approximate complex event matching with insufficient resources

Summary: Proposes best-effort ACEP under resource constraints; learns from past runs to online-prioritize processing, maximizing full matches. Uses reinforcement-learning to update history with low overhead, improving full-match fractions in resource-limited CEP. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11537
Venue
VLDB
Year
2017
Pagerank
4.539516e-05
Overall Rank
8,351 | 41.91%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
259 High-Performance Complex Event Processing over Streams 2006 SIGMOD 0.00030174924
776 Efficient Pattern Matching over Event Streams 2008 SIGMOD 0.00016799754
1,418 ZStream: A Cost-based Query Processor for Adaptively Detecting Composite Events 2009 SIGMOD 0.00012089363
4,880 High-Performance Complex Event Processing over XML Streams 2012 SIGMOD 5.8573822e-05
Previous Page 1 / 1 Next

Semantically Similar Papers