首页> 外文会议>ACM SIGMOD international conference on management of data >Feeding Frenzy: Selectively Materializing Users' Event Feeds
【24h】

Feeding Frenzy: Selectively Materializing Users' Event Feeds

机译:喂食狂热:选择性地实现用户的活动源

获取原文

摘要

Near real-time event streams are becoming a key feature of many popular web applications. Many web sites allow users to create a personalized feed by selecting one or more event streams they wish to follow. Examples include Twitter and Facebook, which allow a user to follow other users' activity, and iGoogle and My Yahoo, which allow users to follow selected RSS streams. How can we efficiently construct a web page showing the latest events from a user's feed? Constructing such a feed must be fast so the page loads quickly, yet reflects recent updates to the underlying event streams. The wide fanout of popular streams (those with many followers) and high skew (fanout and update rates vary widely) make it difficult to scale such applications. We associate feeds with consumers and event streams with producers. We demonstrate that the best performance results from selectively materializing each consumer's feed: events from high-rate producers are retrieved at query time, while events from lower-rate producers are materialized in advance. A formal analysis of the problem shows the surprising result that we can minimize global cost by making local decisions about each producer/consumer pair, based on the ratio between a given producer's update rate (how often an event is added to the stream) and a given consumer's view rate (how often the feed is viewed). Our experimental results, using Yahoo!'s web-scale database PNUTS, shows that this hybrid strategy results in the lowest system load (and hence improves scalability) under a variety of workloads.
机译:近实时事件流正在成为许多流行Web应用程序的关键特征。许多网站允许用户通过选择要遵循的一个或多个事件流来创建个性化源。示例包括Twitter和Facebook,允许用户遵循其他用户的活动,以及iGoogle和My Yahoo,允许用户遵循所选RSS流。我们如何有效地构建一个网页,从用户的饲料中显示最新事件?构造此类馈送必须快速,因此页面快速加载,但反映了底层事件流的最新更新。流行流(具有许多追随者的人)和高偏斜(扇出和更新率差异的广泛扇形)使得难以扩展这种应用。我们将与消费者和事件流与生产者联系起来。我们证明,选择性地实现每个消费者饲料的最佳性能:从查询时间检索来自高速生产者的事件,而来自较低速率生产商的事件预先实现。对问题的正式分析显示了令人惊讶的结果,即我们可以通过对每个生产者/消费者对的本地决策来最小化全球成本,基于给定的生产者的更新率之间的比率(多久将事件添加到流中)和a给定消费者的查看率(查看饲料的频率)。我们的实验结果,使用雅虎!的网格数据库pnuts,表明这种混合策略在各种工作负载下导致最低系统负载(并且因此提高可扩展性)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号