Page 452 - 《软件学报》2025年第7期
P. 452

李猛 等: 代价敏感的指纹可变哈希布谷鸟过滤器                                                         3373


                     detection. Information Processing & Management, 2023, 60(3): 103306. [doi: 10.1016/J.IPM.2023.103306]
                  [2]  Saeed  ASM,  George  LE.  Fingerprint-based  data  deduplication  using  a  mathematical  bounded  linear  hash  function.  Symmetry,  2021,
                     13(11): 1978. [doi: 10.3390/sym13111978]
                  [3]  Dutta S, Narang A, Bera SK. Streaming quotient filter: A near optimal approximate duplicate detection approach for data streams. Proc.
                     of the VLDB Endowment, 2013, 6(8): 589–600. [doi: 10.14778/2536354.2536359]
                  [4]  Khalid A, Esposito F. Optimized cuckoo filters for efficient distributed SDN and NFV applications. In: Proc. of the 2020 IEEE Conf. on
                     Network Function Virtualization and Software Defined Networks. Leganes: IEEE, 2020. 77–83. [doi: 10.1109/NFV-SDN50289.2020.
                     9289870]
                  [5]  Broder A, Mitzenmacher M. Network applications of bloom filters: A survey. Internet Mathematics, 2004, 1(4): 485–509. [doi: 10.1080/
                     15427951.2004.10129096]
                  [6]  Nikolaevskiy I, Lukyanenko A, Polishchuk T, Polishchuk V, Gurtov A. IsBF: Scalable in-packet bloom filter based multicast. Computer
                     Communications, 2015, 70: 79–85. [doi: 10.1016/j.comcom.2015.05.002]
                  [7]  Reviriego P, Pontarelli S. Perfect cuckoo filters. In: Proc. of the 17th Int’l Conf. on Emerging Networking Experiments and Technologies.
                     ACM, 2021. 205–211. [doi: 10.1145/3485983.3494852]
                  [8]  Fan B, Andersen DG, Kaminsky M. MemC3: Compact and concurrent MemCache with dumber caching and smarter hashing. In: Proc. of
                     the 10th USENIX Conf. on Networked Systems Design and Implementation. Lombard: USENIX Association, 2013. 371–384.
                  [9]  Chen ZH, Huang JW, Wang QL, Liu JL, Li ZY, Zhou SW, He ZD. MEB: An efficient and accurate multicast using bloom filter with
                     customized hash function. In: Proc. of the 7th Asia-Pacific Workshop on Networking. Hong Kong: ACM, 2023. 157–163. [doi: 10.1145/
                     3600061.3600062]
                 [10]  Abdennebi A, Kaya K. A bloom filter survey: Variants for different domain applications. arXiv:2106.12189, 2021.
                 [11]  Dai  HP,  Zhong  YK,  Liu  AX,  Wang  W,  Li  M.  Noisy  bloom  filters  for  multi-set  membership  testing.  In:  Proc.  of  the  2016  ACM
                     SIGMETRICS Int’l Conf. on Measurement and Modeling of Computer Science. Antibes Juan-les-Pins: ACM, 2016. 139–151. [doi: 10.
                     1145/2896377.2901451]
                 [12]  Laufer RP, Velloso PB, Duarte OCMB. Generalized bloom filters. Technical Report, Rio de Janeiro: COPPE/UFRJ, 2005.
                 [13]  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]
                 [14]  Ting D, Cole R. Conditional cuckoo filters. In: Proc. of the 2021 Int’l Conf. on Management of Data. ACM, 2021. 1838–1850. [doi: 10.
                     1145/3448016.3452811]
                 [15]  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, 2023. 467–484.
                 [16]  Li SS, Luo LL, Guo DK, Zhao YW. Stable cuckoo filter for data streams. In: Proc. of the 27th Int’l Conf. on Parallel and Distributed
                     Systems. Beijing: IEEE, 2021. 138–145. [doi: 10.1109/ICPADS53394.2021.00023]
                 [17]  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]
                 [18]  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]
                 [19]  Breslow AD, Jayasena NS. Morton filters: Faster, space-efficient cuckoo filters via biasing, compression, and decoupled logical sparsity.
                     Proc. of the VLDB Endowment, 2018, 11(9): 1041–1055. [doi: 10.14778/3213880.3213884]
                 [20]  Zhang F, Chen HH, Jin H, Reviriego P. The logarithmic dynamic cuckoo filter. In: Proc. of the 37th Int’l Conf. on Data Engineering.
                     Chania: IEEE, 2021. 948–959. [doi: 10.1109/ICDE51399.2021.00087]
                 [21]  Fu PT, Luo LL, Li SS, Guo DK, Cheng GY, Zhou Y. The vertical cuckoo filters: A family of insertion-friendly sketches for online
                     applications.  In:  Proc.  of  the  41st  Int’l  Conf.  on  Distributed  Computing  Systems.  Washington:  IEEE,  2021.  57–67.  [doi:  10.1109/
                     ICDCS51616.2021.00015]
                 [22]  Chen HH, Liao LY, Jin H, Wu J. The dynamic cuckoo filter. In: Proc. of the 25th Int’l Conf. on Network Protocols. Toronto: IEEE, 2017.
                     1–10. [doi: 10.1109/ICNP.2017.8117563]
                 [23]  Dayan N, Twitto M. Chucky: A succinct cuckoo filter for LSM-tree. In: Proc. of the 2021 Int’l Conf. on Management of Data. ACM,
                     2021. 365–378. [doi: 10.1145/3448016.3457273]
                 [24]  Gebretsadik FG, Nayak S, Patgiri R. EBF: An enhanced bloom filter for intrusion detection in IoT. Journal of Big Data, 2023, 10(1): 102.
                     [doi: 10.1186/s40537-023-00790-9]
   447   448   449   450   451   452   453   454   455   456   457