MSRG Publication:: Approximate Matching in Publish/Subscribe

Approximate Matching in Publish/Subscribe

Haifeng Liu and Hans-Arno Jacobsen.

In IEEE CIRA, pages 1-6, July 2003.


The publish/subscribe paradigm has found wide-spread applications, including selective information dissemination, location-based services, enterprises application integration, and network management. However, all existing publish/subscribe system models cannot capture any kind of uncertainty naturally inherent to many real world scenarios about formulated. To address this shortcoming, this paper proposes a new publish/subscribe system model to process uncertainties in both subscriptions and publications. The system model is evaluated in an implementation of a publish/subscribe system supporting uncertainties in publications and subscriptions through an approximate matching semantic.


Readers who enjoyed the above work, may also like the following:

  • Optimized Cluster-based Filtering Algorithm for Graph Metadata.
    Haifeng Liu, Milenko Petrovic, Hans-Arno Jacobsen, and Zhaohui Wu.
    Information Sciences, 181(24)5468-5484, December 2011.
    Tags: graph-based pub/sub
  • Predictive Publish/Subscribe Matching.
    Vinod Muthusamy, Haifeng Liu, and Hans-Arno Jacobsen.
    In ACM Distributed Event-based Systems (DEBS), pages 14-25, July 2010.
    Acceptance rate: 25% .
    Tags: algorithms, content-based publish/subscribe, publish/subscribe, pub/sub applications, predictive publish/subscribe, topss, event processing, p-topss, probabilistic data management
  • Efficient and Scalable Filtering of Graph-based Metadata.
    Haifeng Liu, Milenko Petrovic, and Hans-Arno Jacobsen.
    J. Web Sem., 3(4)294-310, 2005.
    Tags: graph-based pub/sub