Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Mesh-based content routing using XML
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
On the Integration of Structure Indexes and Inverted Lists
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
ObjectRank: a system for authority-based search on databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
An efficient and resilient approach to filtering and disseminating streaming data
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Towards an internet-scale XML dissemination service
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient pattern matching over event streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
ProSem: scalable wide-area publish/subscribe
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Scalable ranked publish/subscribe
Proceedings of the VLDB Endowment
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Proceedings of the VLDB Endowment
Efficiently evaluating complex boolean expressions
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Computing label-constraint reachability in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient online ad serving in a display advertising exchange
Proceedings of the fourth ACM international conference on Web search and data mining
Towards expressive publish/subscribe systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Efficient filtering in micro-blogging systems: we won't get flooded again
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
| Hi-index | 0.00 |
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.