Tree based matching algorithm

• Predicate matching tree [Aguilera and al.]

  • similar to LeSubscribe algorithm where
    • each cluster contain one single subscription
  • works well if :
    • events distribution is uniform
    • subscriptions have only equality predicates

Diapositive précédente

Diapositive suivante

Revenir à la première diapositive

Afficher la version graphique