Academic
Publications
Efficient Monitoring Algorithm for Fast News Alerts

Efficient Monitoring Algorithm for Fast News Alerts,10.1109/TKDE.2007.1041,IEEE Transactions on Knowledge and Data Engineering,Ka Cheung Sia,Junghoo C

Efficient Monitoring Algorithm for Fast News Alerts   (Citations: 19)
BibTex | RIS | RefWorks Download
Recently, there has been a dramatic increase in the use of XML data to deliver information over the Web. Personal weblogs, news Web sites, and discussion forums are now publishing RSS feeds for their subscribers to retrieve new postings. As the popularity of personal weblogs and the RSS feeds grow rapidly, RSS aggregation services and blog search engines have appeared, which try to provide a central access point for simpler access and discovery of new content from a large number of diverse RSS sources. In this paper, we study how the RSS aggregation services should monitor the data sources to retrieve new content quickly using minimal resources and to provide its subscribers with fast news alerts. We believe that the change characteristics of RSS sources and the general user access behavior pose distinct requirements that make this task significantly different from the traditional index refresh problem for Web-search engines. Our studies on a collection of 10K RSS feeds reveal some general characteristics of the RSS feeds, and show that with proper resource allocation and scheduling the RSS aggregator provides news alerts significantly faster than the best existing approach.
Journal: IEEE Transactions on Knowledge and Data Engineering - TKDE , vol. 19, no. 7, pp. 950-961, 2007
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Closer to our problem setting, reference [15] proposes a pull based aggregator architecture that monitors RSS data sources and quickly retrieves new postings, minimizing the delay between the appearance of a posting at the source and its retrieval by the aggregator...

    Roxana Horincaret al. Best-effort refresh strategies for content-based RSS feed aggregation

    • ...However, in a setting with thousands of clients and event sources, and constrained resources, e.g., limited bandwidth or politeness constraints ([3, 13]), proxies cannot always satisfy all client needs...
    • ...Sia et al. [13] consider a setting with an RSS aggregator that has limited retrieval resources for monitoring a set of RSS feeds; they aim at minimizing the delay in client notications...

    Haggai Roitmanet al. On trade-offs in event delivery systems

    • ...Sia et. al. [15] studied how the RSS aggregation services should monitor the data sources to retrieve new content quickly using minimal resources and to provide its subscribers with fast news alerts...

    Mohan Yanget al. Optimizing content freshness of relations extracted from the web using...

    • ...Finally, in [11] Sia et al. study how the RSS aggregation services should monitor the data sources to retrieve new content quickly using minimal resources and to provide its subscribers with fast news alerts...

    George Adamet al. Efficient extraction of news articles based on RSS crawling

    • ...Ka Cheung Sia et al. [7] proposes a periodic inhomogeneous Poisson process to...
    • ...To derive the minimum value ofܧܹܦ ሺ ܱ ሻ , we refer to the theorem proposed by the work of Ka Cheung Sia et al. [7] to make డாௐ஽ డఛ ೔ ൌ0 for every߬ ௜ ...
    • ...Based on this equation, there are two methods [7] (i.e...

    Jianling Sunet al. Towards a Quality-Oriented Real-Time Web Crawler

Sort by: