一种面向区块链交易检索的高效查询方法  

An Efficient Query Method for Blockchain Transaction Retrieval

作　　者：孙立 戴欢 刘文豪 唐朕 SUN Li;DAI Huan;LIU Web-hao;TANG Zhen(College of Electronic and Information Engineering,Suzhou University of Science and Technology,Jiangsu Suzhou 215009,China)

机构地区：[1]苏州科技大学电子与信息工程学院,江苏苏州215009

出　　处：《计算机仿真》2024年第11期408-415,共8页Computer Simulation

基　　金：国家自然科学基金(61702354,61876121,6197215)。

摘　　要：目前区块链采用第三方存储系统存储块数据以减轻节点存储负担,但这种新的存储方式引入了一个问题:当需要检索特定交易时,如果无法确定包含该交易的块的位置,用户必须从第三方存储系统中获取整个区块链分类账数据,导致巨大的通信成本且查询效率低下。针对以上问题设计了一种面向区块链交易检索的高效查询方法。方法结合布谷鸟过滤器与Merkle树提出一种基于CMerkle树的区块结构,用于快速确认交易是否在区块中并获取区块中的具体交易信息。利用布隆过滤器占用空间少、计算速度快的特点,在大量账户地址检索项目中提供较好的可扩展性和检索效率,使用B+树构建出高效的区块定位结构。实验结果表明,上述方法在保证区块链数据不可篡改的情况下有效提高查询效率。Aiming at the problems of low retrieval efficiency of blockchain query system and the risk of data tam-pering by introducing external databases,an efficient query method for blockchain retrieval is designed.The method combines the cuckoo filter with the Merkle tree to propose a CMerkle tree-based block structure for quickly confir-ming whether a transaction is in a block and obtaining specific transaction information in the block.Utilizing the char-acteristics of the Cuckoo Filter,which occupies less space and has faster computation speed,to provide better scal-ability and retrieval efficiency in a large number of account address retrieval projects,an efficient block localization structure is constructed using the B+tree.The experimental results show that the method can effectively improve the query efficiency under the guarantee of tampering-free blockchain data.

关 键 词：区块链 信息检索 过滤器 查询效率 默克尔树 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]