[1] NAKAMOTO S. Bitcoin: a peer-to-peer electronic cash system[EB/OL]. (2008-06-10) [2020-07-09]. https://bitcoin.org/bitcoin.pdf.
[2] BUTERIN V. A next-generation smart contract and de-centralized application platform[EB/OL]. (2020-06-03) [2020-07-09]. https://github.com/ethereum/wiki/wiki/White-Paper.
[3] ANDROULAKI E, BARGER A, BORTNIKOV V, et al. Hyperledger fabric: a distributed operating system for per-missioned blockchains[C]//Proceedings of the 13th EuroSys Conference, Porto, Apr 23-26, 2018. New York: ACM, 2018: 1-15.
[4] ZHAO Y L, NIU B N, LI P, et al. A novel enhanced light-weight node for blockchain[C]//Proceedings of the 1st Inter-national Conference on Blockchain and Trustworthy Systems, Guangzhou, Dec 7-8, 2019. Singapore: Springer, 2020: 137-149.
[5] BLOOM B H. Space/time trade-offs in Hash coding with allowable errors[J]. Journal of Communications of ACM, 1970, 13(7): 422-426.
[6] GERVAIS A, CAPKUN S, KARAME G O, et al. On the privacy provisions of Bloom filters in lightweight bitcoin clients[C]//Proceedings of the 30th Annual Computer Security Applications Conference, New Orleans, Dec 8-12, 2014. New York: ACM, 2014: 326-335.
[7] QIAO Y, LI T, CHEN S G. One memory access Bloom filters and their generalization[C]//Proceedings of the 30th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, Shanghai, Apr 10-15, 2011. Piscataway: IEEE, 2011: 1745-1753.
[8] QIAO Y, LI T, CHEN S G. Fast Bloom filters and their generalization[J]. IEEE Transactions on Parallel and Distri-buted Systems, 2014, 25(1): 93-103.
[9] MITZENMACHER M, REVIRIEGO P, PONTARELLI S. OMASS: one memory access set separation[J]. IEEE Trans-actions on Knowledge and Data Engineering, 2016, 28(7): 1940-1943.
[10] KIRSCH A, MITZENMACHER M. Less Hashing, same per-formance: building a better Bloom filter[J]. Journal of Random Structures and Algorithms, 2008, 33(2): 187-218.
[11] SONG H Y, HAO F, KODIALAM M S, et al. IPv6 lookups using distributed and load balanced Bloom filters for 100Gbps core router line cards[C]//Proceedings of the 28th IEEE International Conference on Computer Communica-tions, Joint Conference of the IEEE Computer and Comm-unications Societies, Rio de Janeiro, Apr 19-25, 2009. Pisca-taway: IEEE, 2009: 2518-2526.
[12] XIAO B, HUA Y. Using parallel Bloom filters for multiattribute representation on network services[J]. IEEE Transactions on Parallel and Distributed Systems, 2010, 21(1): 20-32.
[13] MurmurHash[EB/OL]. (2020-02-12) [2020-03-06]. https://en.wikipedia.org/wiki/MurmurHash.
[14] HashMap[EB/OL]. (2018-06-12) [2020-03-06]. https://docs.oracle.com/javase/8/docs/api/java/util/HashMap.html.
[15] SKJEGSTAD M, MASENG T. Low complexity set recon-ciliation using Bloom filters[C]//Proceedings of the 7th ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing, San Jose, Jun 9, 2011. New York: ACM, 2011: 33-41.
[16] LU J Y. Research on high-performance Hashing techniques and their applications[D]. Beijing: Tsinghua University, 2017.
卢建元. 高性能哈希技术及其应用的研究[D]. 北京: 清华大学, 2017.
[17] RAMAKRISHNA M. Practical performance of Bloom filters and parallel free-text searching[J]. Journal of Communica-tions of ACM, 1989, 32(10): 1237-1239.
[18] Coding ASM Intel instruction set codes and cycles[EB/OL].(2012-12-16) [2020-03-06]. http://read.pudn.com/downloads95/ ebook/379824/The Art of Assembly Language Programming/Appendix D.
[19] SIMD[EB/OL]. (2018-01-03)[2020-03-06]. http://simd.sourceforge.net/. |