Extending OBDD graphs for composite event matching in content-based pub/sub systems
暂无分享,去创建一个
[1] Marcos K. Aguilera,et al. Matching events in a content-based subscription system , 1999, PODC '99.
[2] E BryantRandal. Graph-Based Algorithms for Boolean Function Manipulation , 1986 .
[3] Dennis Shasha,et al. Filtering algorithms and implementation for very fast publish/subscribe systems , 2001, SIGMOD '01.
[4] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[5] David S. Rosenblum,et al. Design and evaluation of a wide-area event notification service , 2001, TOCS.
[6] John Edward Gough,et al. Efficient Recognition of Events in a Distributed System , 1995 .
[7] Michael J. Franklin,et al. Efficient Filtering of XML Documents for Selective Dissemination of Information , 2000, VLDB.
[8] Jing Li,et al. An Ontology-Based Publish/Subscribe System , 2004, Middleware.
[9] Andre Yee,et al. Integrating Your e-Business Enterprise , 2001 .
[10] Helmut Veith,et al. Efficient filtering in publish-subscribe systems using binary decision diagrams , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.
[11] Hans-Arno Jacobsen,et al. I know what you mean: semantic issues in Internet-scale publish/subscribe systems , 2003, SWDB.
[12] Rajeev Rastogi,et al. Efficient filtering of XML documents with XPath expressions , 2002, The VLDB Journal.
[13] Alexander L. Wolf,et al. Forwarding in a content-based network , 2003, SIGCOMM '03.