A detailed investigation of memory requirements for publish/subscribe filtering algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3760 LNCS, Issue , 2005, Pages 148-165

  Bittner, Sven ^a   Hinze, Annika ^a  

^a UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CACHE MEMORY; COMPUTER SCIENCE; CORRELATION METHODS;

CANONICAL APPROACHES; FILTERING ALGORITHMS; TIME EFFICIENCY;

ALGORITHMS;

EID: 33646685019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575771_12     Document Type: Conference Paper

References (12)

1. G. Ashayer, H. A. Jacobsen, and H. Leung. Predicate Matching and Subscription Matching in Publish/Subscribe Systems. In Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW '02), Vienna, Austria, July 2-5 2002.
2. S. Bittner and A. Hinze. Investigating the Memory Requirements for Publish/Subscribe Filtering Algorithms. Technical Report 03/2005, Computer Science Department, University of Waikato, May 2005.
3. S. Bittner and A. Hinze. On the Benefits of Non-Canonical Filtering in Publish/Subscribe Systems. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW '05), pages 451-457, Columbus, USA, June 6-10 2005.
4. A. Campailla, S. Chaki, E. Clarke, S. Jha, and H. Veith. Efficient Filtering in PublishSubscribe Systems using Binary Decision Diagrams. In Proceedings of the 23rd International Conference on Software Engineering (ICSE 2001), Toronto, Canada, May 2001.
5. A. Carzaniga and A. L. Wolf. Forwarding in a Content-Based Network. In Proceedings of the 2003 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '03), Karlsruhe, Germany, March 2003.
6. F. Fabret, A. Jacobsen, F. Llirbat, J. Pereira, K. Ross, and D. Shasha. Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems. In Proceedings of the 2001 ACM SIGMOD, pages 115-126, Santa Barbara, USA, May 21-24 2001.
7. J. Gough and G. Smith. Efficient Recognition of Events in a Distributed System. In Proceedings of the 18th Australasian Computer Science Conference, Adelaide, Australia, 1995.
8. E. N. Hanson, M. Chaabouni, C.-H. Kim, and Y.-W. Wang. A Predicate Matching Algorithm for Database Rule Systems. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data (SIGMOD 1990), Atlantic City, USA, May 23-25 1990.
9. G. Mühl and L. Fiege. Supporting Covering and Merging in Content-Based Publish/Subscribe Systems: Beyond Name/Value Pairs. IEEE DSOnline, 2(7), 2001.
10. F. Peng and S. S. Chawathe. XPath Queries on Streaming Data. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD 2003), pages 431-442, San Diego, USA, June 9-12 2003.
11. B. Segall and D. Arnold. Elvin has left the building: A publish/subscribe notification service with quenching. In Proceedings of the Australian UNIX and Open Systems User Group Conference (AUUG97), Brisbane, Australia, September 3-5 1997.
12. T. W. Van and H. García-Molina. Index Structures for Selective Dissemination of Information Under the Boolean Model. ACM Transactions on Database Systems, 19(2), 1994.