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

3356 软件学报 2025 年第 36 卷第 7 期

Conf. on Management of Data. Chicago: ACM, 2017. 775–787. [doi: 10.1145/3035918.3035963]
[35] Wang ZQ, Pavlo A, Lim H, Leis V, Zhang HC, Kaminsky M, Anderson DG. Building a BW-tree takes more than just buzz words. In:
Proc. of the 2018 Int’l Conf. on Management of Data. Houston: ACM, 2018. 473–488. [doi: 10.1145/3183713.3196895]
[36] Levandoski JJ, Lomet DB, Sengupta S. The BW-tree: A B-tree for new hardware platforms. In: Proc. of the 29th IEEE Int’l Conf. on Data
Engineering. Brisbane: IEEE, 2013. 302–313. [doi: 10.1109/ICDE.2013.6544834]
[37] Leis V, Scheibner F, Kemper A, Neumann T. The ART of practical synchronization. In: Proc. of the 12th Int’l Workshop on Data
Management on New Hardware. San Francisco: ACM, 2016. 3. [doi: 10.1145/2933349.2933352]
[38] Nguyen N, Tsigas P. Lock-free cuckoo hashing. In: Proc. of the 34th IEEE Int’l Conf. on Distributed Computing Systems. Madrid: IEEE,
2014. 627–636. [doi: 10.1109/ICDCS.2014.70]
[39] Kelly R, Pearlmutter BA, Maguire P. Concurrent robin hood hashing. arXiv:1809.04339, 2018.
[40] Harris TL, Fraser K, Pratt IA. A practical multi-word compare-and-swap operation. In: Proc. of the 16th Int’l Conf. on Distributed
Computing. Toulouse: Springer, 2002. 265–279. [doi: 10.1007/3-540-36108-1_18]
[41] Arbel-Raviv M, Brown T. Reuse, Don’t recycle: Transforming lock-free algorithms that throw away descriptors. arXiv:1708.01797,
2017.
[42] Kelly R, Pearlmutter BA, Maguire P. Lock-free hopscotch hashing. In: Proc. of the 2020 Symp. on Algorithmic Principles of Computer
Systems. Philadelphia: SIAM, 2020. 45–59. [doi: 10.1137/1.9781611976021.4]
[43] Fatourou P, Kallimanis ND, Ropars T. An efficient wait-free resizable hash table. In: Proc. of the 30th on Symp. on Parallelism in
Algorithms and Architectures. Vienna: ACM, 2018. 111–120. [doi: 10.1145/3210377.3210408]
[44] Williams A. C++ Concurrency in Action. 2nd ed., New York: Manning Publications, 2017.
[45] Prakasam E, Manoharan A. A cache efficient one hashing blocked bloom filter (OHBB) for random strings and the K-mer strings in DNA
sequence. Symmetry, 2022, 14(9): 1911. [doi: 10.3390/SYM14091911]
[46] CAIDA. The CAIDA anonymized Internet traces dataset (April 2008–January 2019). 2019. https://www.caida.org/data/passive/
passive_dataset.xml
[47] Copper BF, Silberstein A, Tam E, Ramakrishnan R, Sears R. Benchmarking cloud serving systems with YCSB. In: Proc. of the 1st ACM
Symp. on Cloud Computing. Indianapolis: ACM, 2010. 143–154. [doi: 10.1145/1807128.1807152]
[48] Marcus R, Kipf A, van Renen A, Stoian M, Misra S, Kemper A, Neumann T, Kraska T. Benchmarking learned indexes. Proc. of the
VLDB Endowment, 2020, 14(1): 1–13. [doi: 10.14778/3421424.3421425]
[49] Powers DMW. Applications and explanations of Zipf’s law. In: Proc. of the 1998 Joint Conf. on New Methods in Language Processing
and Computational Natural Language Learning. Sydney: ACM, 1998. 151–160.
[50] Yu JP, Chen HH, Qian JB, Dong YH. A heterogeneous bloom filter scheme in LSM tree based on hotness prediction. Acta Electronica
Sinica, 2021, 49(11): 2090–2095 (in Chinese with English abstract). [doi: 10.12263/DZXB.20200945]
[51] Zhou Z, Fu WL, Song T, Liu QY. Fast URL lookup using parallel bloom filters. Acta Electronica Sinica, 2015, 43(9): 1833–1840 (in
Chinese with English abstract). [doi: 10.3969/j.issn.0372-2112.2015.09.023]
[52] Li Q, Zhong J, Li X, Li Q. Memory management mechanism for hybrid memory architecture based on new non-volatile memory. Acta
Electronica Sinica, 2019, 47(3): 664–670 (in Chinese with English abstract). [doi: 10.3969/j.issn.0372-2112.2019.03.021]

附中文参考文献:
[19] 吕天根, 洪日昌, 何军, 胡社教. 多模态引导的局部特征选择小样本学习方法. 软件学报, 2023, 34(5): 2068–2082. http://www.jos.org.
cn/1000-9825/6771.htm [doi: 10.13328/j.cnki.jos.006771]
[20] 刘睿诚, 张俊晨, 罗永平, 金培权. 面向非易失内存的异构索引. 软件学报, 2022, 33(3): 832–848. http://www.jos.org.cn/1000-9825/
6456.htm [doi: 10.13328/j.cnki.jos.006456]
[21] 符鹏涛, 罗来龙, 郭得科, 赵翔, 李尚森, 王怀民. 跳跃滤波: 一种面向大数据治理的动态数据摘要设计. 软件学报, 2023, 34(3):
1193–1212. http://www.jos.org.cn/1000-9825/6782.htm [doi: 10.13328/j.cnki.jos.006782]
[28] 谢鲲, 文吉刚, 张大方, 谢高岗. 布鲁姆过滤器查询算法. 软件学报, 2009, 20(1): 96–108. http://www.jos.org.cn/1000-9825/3458.htm
[doi: 10.3724/SP.J.1001.2009.03458]
[50] 俞加平, 陈华辉, 钱江波, 董一鸿. LSM 树中基于热度预测的异构布隆过滤器方案. 电子学报, 2021, 49(11): 2090–2095. [doi:
10.12263/DZXB.20200945]
[51] 周舟, 付文亮, 嵩天, 刘庆云. 一种基于并行 Bloom Filter 的高速 URL 查找算法. 电子学报, 2015, 43(9): 1833–1840. [doi: 10.3969/
j.issn.0372-2112.2015.09.023]