Using publish/subscribe middleware for mobile systems
ACM SIGMOBILE Mobile Computing and Communications Review
Modeling Uncertainties in Publish/Subscribe Systems
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Supporting arbitrary Boolean subscriptions in distributed publish/subscribe systems
Proceedings of the 3rd international Middleware doctoral symposium
Historic data access in publish/subscribe
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
The arbitrary Boolean publish/subscribe model: making the case
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Composite subscriptions in content-based publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
An efficient information dissemination for publish/subscription system on grid
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Efficiently evaluating complex boolean expressions
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Predictive publish/subscribe matching
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Efficient online ad serving in a display advertising exchange
Proceedings of the fourth ACM international conference on Web search and data mining
GPX-matcher: a generic boolean predicate-based XPath expression matcher
Proceedings of the 14th International Conference on Extending Database Technology
Towards highly parallel event processing through reconfigurable hardware
Proceedings of the Seventh International Workshop on Data Management on New Hardware
Towards vulnerability-based intrusion detection with event processing
Proceedings of the 5th ACM international conference on Distributed event-based system
Fine-grained parallel XML filtering for content-based publish/subscribe systems
Proceedings of the 5th ACM international conference on Distributed event-based system
A detailed investigation of memory requirements for publish/subscribe filtering algorithms
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Composite subscriptions in content-based publish/subscribe systems
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Processing flows of information: From data stream to complex event processing
ACM Computing Surveys (CSUR)
Pub/Sub on stream: a multi-core based message broker with QoS support
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
| Hi-index | 0.00 |
An important class of publish/subscribe matching algorithms work in two stages. First, predicates are matched and then matching subscriptions are derived. We observe that in practice, the domain types over which predicates are defined are often of fixed enumerable cardinality. Based on this observation we propose a table-based look-up scheme for fast predicate evaluation that finds all matching predicates for each type with one table lookup. We compare this scheme to alternative general-purpose implementations. This observation may also suggests that matching in publish/subscribe systems could equally well be implemented with standard database technology. We propose two DBMS-based matchingalgorithms and compare the better one with a special purpose publish/subscribe matching algorithm implementation. We provide first evidence that for application scenarios that require large subscription workloads and process many events a DBMS-based solution is not a feasible alternative.