DBA A Dynamic Bloom Filter Array for Scalable MembershipDBA一个可伸缩的会员动态布隆过滤器阵列.pptVIP

下载本文档

7
0
约9.35千字
约 22页
2017-02-10 发布于上海
举报
版权申诉

DBA A Dynamic Bloom Filter Array for Scalable MembershipDBA一个可伸缩的会员动态布隆过滤器阵列.ppt

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

Detecting Duplicates over Sliding Windows with RAM-Efficient Detached Counting Bloom Filter Arrays Jiansheng Wei?, Hong Jiang?, Ke Zhou??, Dan Feng?, Hua Wang? ?School of Computer, Huazhong University of Science and Technology, Wuhan, ChinaWuhan National Laboratory for Optoelectronics, Wuhan, China?Dept. of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE, USA 2011-7-29 * Background and Motivation Duplicate detection is an important technique for monitoring and analysing data streams. Recent studies estimate that about 294 billion emails are sent per day all over the world in 2010 [1] and around 89.1% of them are spam emails [2]. If all the emails must be scanned for the purposes of anti-spam, anti-virus or homeland security, it is important for the email server to quickly identify duplicates and analyse only unique emails. Since the real-world data streams can be updated frequently and grow to very large sizes, it is impractical to trace and analyse all the elements in such data streams. [1] The Radicati Group, Inc. (2010) Email Statistics Report, 2010-2014. [2] Symantec Corp. (2010) MessageLabs Intelligence: 2010 Annual Security Report. 2011-7-29 * Background and Motivation Existing approaches usually employ a decaying window model to evict stale items and record the most recent elements. Landmark Window Model Jumping Window Model Sliding Window Model The challenge is how to design a membership representation scheme that supports fast search, insertion and deletion of time-ordered elements with low RAM consumption. 2011-7-29 * Background and Motivation To achieve high space efficiency and maintain high query performance, Bloom filters (BFs) have been widely used to represent membership of static data sets. A BF for representing a static set S = {e1, e2, …, en} of n elements consists of an array of m bits and a group of k independent hash functions h1, …, hk with the range of {1, …, m}. A BF faces ch