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

An Efficient Query Method for Blockchain Traceability

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

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.