Page 434 - 《软件学报》2025年第7期

王瀚橙 等: 无锁并发布谷鸟过滤器 3355

[8] Dai HP, Li M, Liu AX, Zheng JQ, Chen GH. Finding persistent items in distributed datasets. IEEE/ACM Trans. on Networking, 2020,
28(1): 1–14. [doi: 10.1109/TNET.2019.2946417]
[9] Zhao QC, Huang C, Dai LH. VULDEFF: Vulnerability detection method based on function fingerprints and code differences. Knowledge-
based Systems, 2023, 260: 110139. [doi: 10.1016/J.KNOSYS.2022.110139]
[10] Yang JS, Jia WC, Gao Z, Guo ZH, Zhou Y, Pan Z. Cuckoo-store engine: A Reed-Solomon code-based ledger storage optimization
scheme for blockchain-enabled IoT. Electronics, 2023, 12(15): 3328. [doi: 10.3390/electronics12153328]
[11] Sajitha M, Kavitha D, Reddy PC. An optimized clone node detection in WSN using cuckoo filter. SN Computer Science, 2023, 4(2): 167.
[doi: 10.1007/S42979-022-01586-Z]
[12] The Apache software foundation. Bloom filter index. 2022. https://doris.apache.org/docs/1.2/data-table/index/bloomfilter/
[13] Honarkhah M, Talebzadeh A. HyperLogLog in presto: A significantly faster way to handle cardinality estimation. 2018. https://
engineering.fb.com/2018/12/13/data-infrastructure/hyperloglog/
[14] Ray N, Yang FJ. How we scaled HyperLogLog: Three real-world optimizations. 2014. https://metamarkets.com/2014/engineering-
hyperloglog-optimizations-for-real-world-systems/
[15] Ghemawat S, Dean J. LevelDB. 2023. https://github.com/google/leveldb
[16] Meta Inc. Rocksdb. 2023. https://github.com/facebook/rocksdb
[17] Gu R, Li SM, Dai HP, Wang HC, Luo YL, Fan B, Basat RB, Wang K, Song ZY, Chen SW, Wang BN, Huang YH, Chen GH. Adaptive
online cache capacity optimization via lightweight working set size estimation at scale. In: Proc. of the 2023 USENIX Annual Technical
Conf. Boston: USENIX Association, 2023. 467–484.
[18] Sutter H. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb’s Journal, 2005, 30(3): 202–210.
[19] Lü TG, Hong RC, He J, Hu SJ. Multimodal-guided local feature selection for few-shot learning. Ruan Jian Xue Bao/Journal of Software,
2023, 34(5): 2068–2082 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6771.htm [doi: 10.13328/j.cnki.jos.006771]
[20] Liu RC, Zhang JC, Luo YP, Jin PQ. Heterogeneous index for non-volatile memory. Ruan Jian Xue Bao/Journal of Software, 2022, 33(3):
832–848 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6456.htm [doi: 10.13328/j.cnki.jos.006456]
[21] Fu PT, Luo LL, Guo DK, Zhao X, Li SS, Wang HM. Jump filter: Dynamic sketch design for big data governance. Ruan Jian Xue
Bao/Journal of Software, 2023, 34(3): 1193–1212 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6782.htm [doi: 10.
13328/j.cnki.jos.006782]
[22] Li XZ, Andersen DG, Kaminsky M, Freedman MJ. Algorithmic improvements for fast concurrent cuckoo hashing. In: Proc. of the 9th
European Conf. on Computer Systems. Amsterdam: ACM, 2014. 27. [doi: 10.1145/2592798.2592820]
[23] Rinberg A, Spiegelman A, Bortnikov E, Hillel E, Keidar I, Rhodes L, Serviansky H. Fast concurrent data sketches. In: Proc. of the 25th
ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming. San Diego: ACM, 2020. 117–129. [doi: 10.1145/3332466.
3374512]
[24] Arpaci-Dusseau RH, Arpaci-Dusseau AC. Operating Systems: Three Easy Pieces. North Charleston: CreateSpace Independent Publishing
Platform, 2018.
[25] Abraham S, Peter BG, Greg G. Operating System Concepts. 10th ed., Hoboken: John Wiley & Sons, 2018.
[26] The Apache Software Foundation. Atomic instructions. 2023. https://brpc.incubator.apache.org/docs/rpc-in-depth/atomic-instructions/
[27] Bloom BH. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 1970, 13(7): 422–426. [doi: 10.
1145/362686.362692]
[28] Xie K, Wen JG, Zhang DF, Xie GG. Bloom filter query algorithm. Ruan Jian Xue Bao/Journal of Software, 2009, 20(1): 96–108 (in
Chinese with English abstract). http://www.jos.org.cn/1000-9825/3458.htm [doi: 10.3724/SP.J.1001.2009.03458]
[29] Wang HC, Dai HP, Li M, Yu J, Gu R, Zheng JQ, Chen GH. Bamboo filters: Make resizing smooth. In: Proc. of the 38th IEEE Int’l Conf.
on Data Engineering. Kuala Lumpur: IEEE, 2022. 979–991. [doi: 10.1109/ICDE53745.2022.00078]
[30] Fan B, Andersen DG, Kaminsky M, Mitzenmacher MD. Cuckoo filter: Practically better than bloom. In: Proc. of the 10th ACM Int’l on
Conf. on Emerging Networking Experiments and Technologies. Sydney: ACM, 2014. 75–88. [doi: 10.1145/2674005.2674994]
[31] Voras I, Žagar M. Adapting the bloom filter to multithreaded environments. In: Proc. of the 15th IEEE Mediterranean Electrotechnical
Conf. Valletta: IEEE, 2010. 1488–1493. [doi: 10.1109/MELCON.2010.5476244]
[32] Pandey P, Conway A, Durie J, Bender MA, Farach-Colton M, Johnson R. Vector quotient filters: Overcoming the time/space trade-off in
filter design. In: Proc. of the 2021 Int’l Conf. on Management of Data. ACM, 2021. 1386–1399. [doi: 10.1145/3448016.3452841]
[33] Bender MA, Farach-Colton M, Johnson R, Karner R, Kuszmaul BC, Medjedovic D, Montes P, Shetty P, Spillane RP, Zadok E. Don’t
thrash: How to cache your hash on flash. Proc. of the VLDB Endowment, 2012, 5(11): 1627–1637. [doi: 10.14778/2350229.2350275]
[34] Pandey P, Bender MA, Johnson R, Patro R. A general-purpose counting filter: Making every bit count. In: Proc. of the 2017 ACM Int’l