DMCA
Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe (2011)
Cached
Download Links
| Citations: | 1 - 0 self |
BibTeX
@MISC{Broder11efficientlyevaluating,
author = {Andrei Broder and Shirshanka Das and Marcus Fontoura and Bhaskar Ghosh and Vanja Josifovski and Jayavel Shanmugasundaram and Sergei Vassilvitski},
title = {Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe},
year = {2011}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 can connect advertisers and publishers) and content delivery problems in social networks (where there may be restrictions on how information can be shared via the social graph). In this context, we develop efficient algorithms for evaluating graph constraints over arbitrary directed graphs G. We also present experimental results that demonstrate the effectiveness and scalability of the proposed algorithms using a realistic dataset from Yahoo!’s Web advertising exchange.
Keyphrases
content-based publish subscribe evaluating graph constraint graph constraint present experimental result content delivery problem yahoo web advertising exchange problem formulation following manner efficient algorithm advertising network social network pub sub realistic dataset valid path edge constraint web advertising exchange traditional content-based pub sub system social graph
