Efficient and Scalable Filtering of Graph-based Metadata

Haifeng Liu, Milenko Petrovic, and Hans-Arno Jacobsen.

J. Web Sem., 3(4)294-310, 2005.


RDF Site Summaries constitute an application of RDF on the Web that has considerably grown in popularity. However, the way RSS systems operate today limits their scalability. Current RSS feed arregators follow a pull-based architecture model,which is not going to scale with the increasing number of RSS feeds becoming available on the Web. In this paper we introduce G-ToPSS, a scalable publish/subscribe system for selective information dissemination. G-ToPSS only sends newly updated information to the interested user and follows a push-based architecture model. G-ToPSS is particularly well suited for applications that deal with large-volume content distribution from diverse sources. G-ToPSS allows use of an ontology as a way to provide additional information about the data disseminated. We have implemented and experimentally evaluated G-ToPSS and we provide results demonstrating its scalability compared to alternative approaches. In addition, we describe an application of G-ToPSS and RSS to a Web-based content management system that provides an expressive, ecient, and convenient update noti cation dissemination system.


Tags: graph-based pub/sub

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
  • G-ToPSS: Fast Filtering of Graph-based Metadata.
    Milenko Petrovic, Haifeng Liu, and Hans-Arno Jacobsen.
    In World Wide Web Conference, pages 539-547, Chiba, Japan, May 2005.
    Nominated for best paper award, i.e., one of four finalist papers. Acceptance rate: 14%. Number of submissions: 550.
    Tags: algorithms, content-based publish/subscribe, event processing, publish/subscribe, topss, graph-based pub/sub