A Shifting Framework for Set Queries.
IEEE/ACM Transactions on Networking(2017)
摘要
Set queries are fundamental operations in computer networks. This paper addresses the fundamental problem of designing a probabilistic data structure that can quickly process set queries using a small amount of memory. We propose a shifting bloom filter (ShBF) framework for representing and querying sets. We demonstrate the effectiveness of ShBF using three types of popular set queries: membership...
更多查看译文
关键词
Data structures,Radiation detectors,IEEE transactions,Memory management,Servers,Computer science,Probabilistic logic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要