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
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Optimizing Pub/Sub Systems by Advertisement Pruning

      Bittner, Sven; Hinze, Annika
      DOI
       10.1007/11914952_35
      Link
       www.springerlink.com
      Find in your library  
      Citation
      Export citation
      Bittner, S. & Hinze, A. (2006). Optimizing Pub/Sub Systems by Advertisement Pruning. In Proceedings of OTM Confederated International Conferences, CoopIS, DOA, GADA, and ODBASE 2006, Montpellier, France, October 29 - November 3, 2006.(pp. 1503-1521). Berlin, Germany: Springer.
      Permanent Research Commons link: https://hdl.handle.net/10289/1751
      Abstract
      Supporting advertisements in large publish/subscribe services has an improving influence on the system scalability. The additional application of event routing optimizations based on subscriptions further increases the event throughput and decreases the memory usage of publish/subscribe systems. However, also advertisement-based optimizations can improve these system properties but have been widely neglected so far. In particular, no current optimizations are applicable to advertisements defined as arbitrary Boolean filter expressions.

      In this paper, we outline the final milestone on the way to practically support the arbitrary Boolean publish/subscribe model: We firstly develop a novel optimization approach, advertisement pruning, that is tailored to arbitrary Boolean advertisements. Secondly, we present a detailed evaluation of the optimization potential of this advertisement-based solution. We finally analyze the effects of additionally optimizing subscriptions on the advertisement pruning optimization.
      Date
      2006
      Type
      Conference Contribution
      Publisher
      Springer
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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