Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Efficient filtering in publish-subscribe systems using binary decision diagrams
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
ACM Computing Surveys (CSUR)
Query Merging: Improving Query Subscription Processing in a Multicast Environment
IEEE Transactions on Knowledge and Data Engineering
Filter Similarities in Content-Based Publish/Subscribe Systems
ARCS '02 Proceedings of the International Conference on Architecture of Computing Systems: Trends in Network and Pervasive Computing
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Evaluating Advanced Routing Algorithms for Content-Based Publish/Subscribe Systems
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Subscription Summarization: A New Paradigm for Efficient Publish/Subscribe Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Summary-based routing for content-based event distribution networks
ACM SIGCOMM Computer Communication Review
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Tree pattern aggregation for scalable XML data dissemination
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient probabilistic subsumption checking for content-based publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Filter merging for efficient information dissemination
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Containment of conjunctive queries with arithmetic expressions
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Content-Based Routing in Networks with Time-Fluctuating Request Rates
NET-COOP '09 Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization
| Hi-index | 0.00 |
Filter-based publish/subscribe and content-based routing have been proposed for flexible information dissemination in distributed environments. A content-based router is part of an overlay structure, in which each router forwards events to neighbouring routers and local clients based on their interests. Filter merging or summarization has been proposed as an optimization strategy in this environment. These techniques combine filters to reduce the number of propagated filters and thus the size of distributed state. In this paper, we present the algorithms for generic dynamic filter merging and filter mergeability detection, and discuss integration with routing tables. The algorithms are based on a formal framework of merging rules. Experimental results are examined and analyzed for both desktop systems and small devices. The results indicate that dynamic filter merging is feasible given that the workload is mergeable.