Noisy Bloom Filters for Multi-Set Membership Testing

Author:

Dai Haipeng1,Zhong Yuankun2,Liu Alex X.2,Wang Wei2,Li Meng2

Affiliation:

1. StaNanjing University., Nanjing, China

2. Nanjing University., Nanjing, China

Funder

Huawei Innovation Research Program (HIRP)

National Natural Sci- ence Foundation of China

Jiangsu High-level Innovation and Entrepreneurship (Shuangchuang) Program

Publisher

ACM

Reference26 articles.

Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A One-Pass Clustering Based Sketch Method for Network Monitoring;IEEE/ACM Transactions on Networking;2023-12

2. Seesaw Counting Filter: A Dynamic Filtering Framework for Vulnerable Negative Keys;IEEE Transactions on Knowledge and Data Engineering;2023-12-01

3. A Pareto optimal Bloom filter family with hash adaptivity;The VLDB Journal;2022-07-26

4. B h BF: A Bloom Filter Using B h Sequences for Multi-set Membership Query;ACM Transactions on Knowledge Discovery from Data;2022-03-09

5. Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying;Proceedings of the 2021 International Conference on Management of Data;2021-06-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3