Abstract
Various filtering algorithms for publish/subscribe systems have been proposed. One distinguishing characteristic is their internal representation of Boolean subscriptions: They either require conversions into DNFs (canonical approaches) or are directly exploited in event filtering (non-canonical approaches).
In this paper, we present a detailed analysis and comparison of the memory requirements of canonical and non-canonical filtering algorithms. This includes a theoretical analysis of space usages as well as a verification of our theoretical results by an evaluation of a practical implementation. This practical analysis also considers time (filter) efficiency, which is the other important quality measure of filtering algorithms. By correlating the results of space and time efficiency, we conclude when to use non-canonical and canonical approaches.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ashayer, G., Jacobsen, H.A., Leung, H.: Predicate Matching and Subscription Matching in Publish/Subscribe Systems. In: Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW 2002), Vienna, Austria, July 2–5 (2002)
Bittner, S., Hinze, A.: Investigating the Memory Requirements for Publish/Subscribe Filtering Algorithms. Technical Report 03/2005, Computer Science Department, University of Waikato (May 2005)
Bittner, S., Hinze, A.: 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 2005), Columbus, USA, June 6–10 2005, pp. 451–457 (2005)
Campailla, A., Chaki, S., Clarke, E., Jha, S., Veith, H.: Efficient Filtering in Publish-Subscribe Systems using Binary Decision Diagrams. In: Proceedings of the 23rd International Conference on Software Engineering (ICSE 2001), Toronto, Canada (May 2001)
Carzaniga, A., Wolf, A.L.: Forwarding in a Content-Based Network. In: Proceedings of the 2003 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2003 (2003)
Fabret, F., Jacobsen, A., Llirbat, F., Pereira, J., Ross, K., Shasha, D.: Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems. In: Proceedings of the 2001 ACM SIGMOD, Santa Barbara, USA, May 21-24, 2001, pp. 115–126 (2001)
Gough, J., Smith, G.: Efficient Recognition of Events in a Distributed System. In: Proceedings of the 18th Australasian Computer Science Conference, Adelaide, Australia (1995)
Hanson, E.N., Chaabouni, M., Kim, C.-H., Wang, Y.-W.: 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)
Mühl, G., Fiege, L.: Supporting Covering and Merging in Content-Based Publish/Subscribe Systems: Beyond Name/Value Pairs. IEEE DSOnline 2(7) (2001)
Peng, F., Chawathe, S.S.: XPath Queries on Streaming Data. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD 2003), San Diego, USA, June 9-12, 2003, pp. 431–442 (2003)
Segall, B., Arnold, D.: Elvin has left the building: A publish/subscribe notification service with quenching. In: Proceedings of the Australian UNIX and Open Systems User Group Conference (AUUG 1997), Brisbane, Australia, September 3–5 (1997)
Yan, T.W., García-Molina, H.: Index Structures for Selective Dissemination of Information Under the Boolean Model. ACM Transactions on Database Systems 19(2) (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bittner, S., Hinze, A. (2005). A Detailed Investigation of Memory Requirements for Publish/Subscribe Filtering Algorithms. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE. OTM 2005. Lecture Notes in Computer Science, vol 3760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575771_12
Download citation
DOI: https://doi.org/10.1007/11575771_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29736-9
Online ISBN: 978-3-540-32116-3
eBook Packages: Computer ScienceComputer Science (R0)