Efficiently evaluating graph constraints in content-based publish/subscribe

@inproceedings{Broder2011EfficientlyEG,
  title={Efficiently evaluating graph constraints in content-based publish/subscribe},
  author={Andrei Z. Broder and Shirshanka Das and Marcus Fontoura and Bhaskar Ghosh and Vanja Josifovski and Jayavel Shanmugasundaram and Sergei Vassilvitskii},
  booktitle={WWW},
  year={2011}
}
We introduce the problem of evaluating graph constraints in content-based publish/subscribe (pub/sub) systems. This problem formulation extends traditional content-based pub/sub systems in the following manner: publishers and subscribers are connected via a (logical) directed graph G with node and edge constraints, which limits the set of valid paths between them. Such graph constraints can be used to model a Web advertising exchange (where there may be restrictions on how advertising networks… CONTINUE READING