Efficient and scalable filtering of graph-based metadata
β Scribed by Haifeng Liu; Milenko Petrovic; Hans-Arno Jacobsen
- Book ID
- 104099585
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 775 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1570-8268
No coin nor oath required. For personal study only.
β¦ Synopsis
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 Webbased content management system that provides an expressive, efficient, and convenient update notification dissemination system.
π SIMILAR VOLUMES
In this paper we present a distributed scalable framework to support ondemand filtering and tracing services for defeating distributed denial of service attacks. Our filtering mechanism is designed to quickly identify a set of boundary filter locations so that attack packets might be dropped as clos