A predicate matching algorithm for database rule systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The SIFT information dissemination system
ACM Transactions on Database Systems (TODS)
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Dynamic maintenance of data distribution for selectivity estimation
The VLDB Journal — The International Journal on Very Large Data Bases
Integrating the UB-Tree into a Database System Kernel
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The Multilevel Grid File - A Dynamic Hierarchical Multidimensional File Structure
Proceedings of the Second International Symposium on Database Systems for Advanced Applications
Efficient Distribution-Based Event Filtering
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Event matching in symmetric subscription systems
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Streaming queries over streaming data
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
| Hi-index | 0.01 |
There exists a class of publish/subscribe applications, such as recruitment, insurance, personal service, classified advertisement, electronic commerce, etc., where publisher needs the capability to select subscribers. Such kinds of publish/subscribe applications are called symmetric publish/subscribe system. The existing event matching algorithms designed for traditional publish/subscribe systems (called asymmetric publish/subscribe system) can not be applied to symmetric publish/ subscribe systems efficiently. By extending the existing data model and algorithm, we propose an event matching method for symmetric publish/subscribe system based on dimension transform regarding the query in multidimensional space. An efficient underlying multidimensional index structure is chosen and verified. Our proposal is evaluated in a simulated environment. The results show that, our proposal outperforms the other possible solutions in one or two orders of magnitude. For a typical workload containing one million subscriptions with 16 attributes, an event can be filtered within several milliseconds and the subscription base can be updated within hundreds of microseconds. We can say that our proposal is efficient and practical for symmetric publish/subscribe systems.