Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2005 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2005 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Investigating the memory requirements for publish/subscribe filtering algorithms

      Bittner, Sven; Hinze, Annika
      Thumbnail
      Files
      content.pdf
      258.6Kb
      Citation
      Export citation
      Bittner, S. & Hinze, A. (2005). Investigating the memory requirements for publish/subscribe filtering algorithms. (Working paper series. University of Waikato, Department of Computer Science. No. 03/2005). Hamilton, New Zealand: University of Waikato.
      Permanent Research Commons link: https://hdl.handle.net/10289/73
      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 to disjunctive normal forms (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.
      Date
      2005-01-01
      Type
      Working Paper
      Publisher
      Department of Computer Science
      Collections
      • 2005 Working Papers [9]
      Show full item record  

      Usage

      Downloads, last 12 months
      95
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement