Hanson algorithm: Filtering cost

• Search cost

  • 1: Computing all satisfied predicates
    • idem counting (d?ln(P))
  • 2: Checking remaining predicates
    • (Checkpred ? sp) ? (N ? pbestmatch )
    • sp is the avg number of predicates per subscriptions
    • pbestmatch is a avg probability of matching each access predicate

Diapositive précédente

Diapositive suivante

Revenir à la première diapositive

Afficher la version graphique