Counting algorithm
Subscriptions consist in a set of predicates
- S1: (2< Aɜ) & (B=6) & (C ɰ) ? pA : (2< Aɜ), pB (B=6), pC:(Cɰ)
- S1: (2< Aɜ) & (C=3)? pA : (2< Aɜ) pC: (C=3)
A Subscription match the event if all its predicates are satisfied.
Idea: Counting the number of satisfied predicates per subscription