Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Synchronizing a database to improve freshness
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Best-effort cache synchronization with source cooperation
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Monitoring the dynamic web to respond to continuous queries
WWW '03 Proceedings of the 12th international conference on World Wide Web
Estimating frequency of change
ACM Transactions on Internet Technology (TOIT)
Effective page refresh policies for Web crawlers
ACM Transactions on Database Systems (TODS)
WWW '05 Proceedings of the 14th international conference on World Wide Web
Efficient Monitoring Algorithm for Fast News Alerts
IEEE Transactions on Knowledge and Data Engineering
Effective change detection using sampling
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Recrawl scheduling based on information longevity
Proceedings of the 17th international conference on World Wide Web
Feeding frenzy: selectively materializing users' event feeds
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
RoSeS: a continuous content-based query engine for RSS feeds
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
RoSeS: a continuous query processor for large-scale RSS filtering and aggregation
Proceedings of the 20th ACM international conference on Information and knowledge management
ICWE'12 Proceedings of the 12th international conference on Web Engineering
Feasibility and a case study on content optimization services on cloud
Information Systems Frontiers
| Hi-index | 0.02 |
During the past several years RSS-based content syndication has become a standard technique for efficiently and timely disseminating information on the web. From a data processing perspective RSS feeds are standard XML resources which are periodically refreshed by feed aggregators for generating continuous streams of items. In this article, we study the problem of information loss in the context of a content-based feed aggregation system and we propose a new best-effort refresh strategy for RSS feeds under limited bandwidth. This strategy is evaluated experimentally and compared to other state-of-the-art crawling strategies for web pages.