会议论文

Tian, X.

中文

Advances in Intelligent Systems and Computing

2194-5357

2021

1274 AISC

723-730

10th International Conference on Computer Engineering and Networks, CENet 2020

Proceedings of the 10th International Conference on Computer Engineering and Networks(CENet2020)

16 October 2020 through 18 October 2020

中国陕西西安

Liu Q.Liu X.Shen T.Qiu X.

Springer Science and Business Media Deutschland GmbH

9789811584619

10.26914/c.cnkihy.2020.037192

Acknowledgment. This work was partly supported by the National Science Foundation of China under (Nos. 61503128, 61772182, 61772178), Hunan Provincial Natural Science Foundation of China (No. 2020JJ4152), Double First-Class University Project of Hunan Province (Xiangjiaotong [2018] 469), the Science and Technology Plan Project of Hunan Province (No. 2016TP1020), the General Scientific Research Fund of Hunan Provincial Education Department (No. 18A333), Postgraduate Research and Innovation Projects of Hunan Province (No. Xiangjiaotong [2019]248-998). Hengyang guided science and technology projects and Application-oriented Special Disciplines (No. Hengkefa [2018]60-31) and Postgraduate Scientific Research Innovation Project of Hunan Province (No. CX20190998).

本校为第一机构

Multiple-set membership query problem plays a very important role in many network systems, including packet forwarding architectures in big data centers, routing switching devices and internet firewall systems. Many solutions to multiple-set membership query problem are based on Bloom filters. And each of these solutions has its own merits. Some have high query speed and some have good accuracy. But generally, they cannot have both at the same time. In this paper, we propose a probabilistic data structure named constant-weight group coded Bloom...