English

应用科学学报 ›› 2022, Vol. 40 ›› Issue (4): 623-638.doi: 10.3969/j.issn.0255-8297.2022.04.007

• 区块链 • 上一篇    

一种面向区块链溯源的高效查询方法

刘炜1,3, 王栋2,3, 佘维1,3, 潘恒4, 宋轩1, 田钊1   

  1. 1. 郑州大学 软件学院, 河南 郑州 450002;
    2. 郑州大学 信息工程学院, 河南 郑州 450001;
    3. 郑州大学 互联网医疗与健康服务河南省协同创新中心, 河南 郑州 450052;
    4. 中原工学院 前沿信息技术研究院, 河南 郑州 450007
  • 收稿日期:2021-11-13 发布日期:2022-08-03
  • 通信作者: 田钊，博士，研究方向为信息安全、区块链、智能交通。E-mail:tianzhao@zzu.edu.cn E-mail:tianzhao@zzu.edu.cn
  • 基金资助:
    河南省高校科技创新人才支持计划基金（No.21HASTIT031）；河南省重大公益专项基金（No.201300210300）；河南省高等学校青年骨干教师培养计划基金（No.2019GGJS018）；河南省重点研发与推广专项基金（No.212102310039,No.212102310554）；2019年河南省高等教育教学改革研究与实践重大项目基金（No.2019SJGLX001）资助

An Efficient Query Method for Blockchain Traceability

LIU Wei1,3, WANG Dong2,3, SHE Wei1,3, PAN Heng4, SONG Xuan1, TIAN Zhao1   

  1. 1. School of Software, Zhengzhou University, Zhengzhou 450002, Henan, China;
    2. School of Information Engineering, Zhengzhou University, Zhengzhou 450001, Henan, China;
    3. Henan Collaborative Innovation Center of Internet Medical and Health Services, Zhengzhou University, Zhengzhou 450052, Henan, China;
    4. The Frontier Information Technology Research Institute, Zhongyuan University of Technology, Zhengzhou 450007, Henan, China
  • Received:2021-11-13 Published:2022-08-03

PDF

170

摘要： 针对现有区块链溯源系统查询效率较低以及引入外部数据库会面临数据篡改的风险问题，提出了一种面向区块链溯源的高效查询方法。首先结合布隆过滤器与Merkle树提出BMerkle树，进而形成一种新的区块结构，以便快速检索交易是否存在，同时查找存在交易的具体内容。然后在区块链外部添加索引构建一种优化的跳表结构hot_skiplist，可实现区块的快速定位；基于区块访问次数动态调整索引层级，进一步提高访问次数频繁区块的查询效率。最后通过实验验证了该方法能在保证区块链数据不可篡改的情况下有效提高溯源查询效率。

关键词: 区块链, 默克尔树, 查询效率, 布隆过滤器, 跳表

Abstract: In view of the low query efficiency of existing blockchain traceability systems, and the risk of data tampering coming up with the introduction of external databases, we proposes an efficient query method with blockchain-oriented traceability in this paper. First, by combining Bloom filter and Merkle tree, a BMerkle tree is proposed in order to form a new block structure. Under this block structure, the existence of transactions can be quickly retrieved, and the specific content of existing transactions can be found. Then, an optimized skip list structure hot_skiplist is proposed by adding an index outside the blockchain, realizing rapid block positioning, adjusting the index level dynamically based on the number of block accesses, and improving the query efficiency of frequently accessed blocks. Experiments show that this method can effectively improve the efficiency of traceability query under the condition of not tampering with blockchain data.

Key words: blockchain, Merkle tree, query efficiency, Bloom filter, skip list

中图分类号: