ContinuousMonitoringofTop-kQueriesoverSlidingWind.pptVIP

ContinuousMonitoringofTop-kQueriesoverSlidingWind.ppt

  1. 1、本文档共39页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
ContinuousMonitoringofTop-kQueriesoverSlidingWind.ppt

Continuous Monitoring of Top-k Queries over Sliding Windows Authors: Kyriakos Mouratidis, Spiridon Bakiras Dimitris Papadias Presenter: Kamiru Outline Motivation Problem Setting Related Works Top-k Queries Skyband Solutions Top-k Computation Maintenance Module Skyband Monitoring Algorithm Experimental Evaluation Conclusion Future Works Motivation We define the top-k query first: Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. One real life application is: find the top 5 hotels with the following preference function f(hotel) = -hotel.price + hotel.quality Motivation Existing methods are not applicable to streaming environment The internet traffic flow monitoring is one real life application for the streaming case. The data on the internet have very high data rate Each tuple may include Source IP address, destination IP address, start time, end time, MTU, TTL…etc. Motivation The availability of such records traffic estimation network security troubleshooting For instance, top-k query helps the system to prevent the DDoS (Distributed Denial of Service) attack if it monitors the top-k flows with the largest individual throughput in real time Motivation The server 155.223.2.4 has higher chance to have DDoS attack than 155.223.2.3 on this network. Problem Setting A function f is increasingly monotone on dimension xi if for any pair of tuples (points) p1, p2 with p1.xi≥p2.xi and p1.xj=p2.xj ?j!=i we have score(p1)≥score(p2), where score(pi)=f(p1.x1,…,pn.xn) The decreasingly monotone can be defined as the same with the reverse operation (≤). Problem Setting Notice that a function may be increasingly monotone on some dimensions, and decreasingly monotone on the remaining. For instance, f(p)=p.x1–p.x2, f is increasingly monotone on x1 and decreasingly monotone on x2 Problem Setting Problem definition: Given a set of queries Q and a set of points P. The top-k results (Rq) of query q?Q are {Rq

文档评论(0)

2105194781 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档