基于状态树的链上数据高效可信查询索引模型及方法

Efficient and trusted query index model and method for blockchain data based on Merkle Patricia tree

区块链技术以其去中心化,不可篡改等特性在分布式数据管理领域中逐渐得到关注。但区块链系统在数据查询处理方面存在查询功能单一、效率低以及查询可信性难以保证等问题。笔者基于以太坊状态树的设计思路,在保证索引不可篡改的前提下,提出一种全局索引结构KMPT,可一次定位目标区块,避免了遍历区块的检索过程,同时结合块内索引TMPT,实现了基于内容的高效区块链数据检索。经实验验证,相比于仅构建块内索引的方法,该索引模型在可接受的索引构建代价内极大提升了查询检索的效率和稳定性,还可同时提供查询数据存在或不存在证明,提升了查询结果的可信性。

Blockchain technology has attracted significantly attention in the field of distributed data management because of its decentralized and immutable nature.However,current blockchain systems face limitations in data query processing including single query function,low query efficiency and difficulties in ensuring query credibility.To address these challenges,in this paper,a global index structure called KMPT is proposed,inspired by the design concept of Ethereum Merkle Patricia tree on the premise of ensuring the immutability of index.The KMPT structure aims to realize the function of locating the target block at one time,avoiding the retrieval process of traversing blocks.Furthermore,by incorporating the intra-block index TMPT,the proposed approach enables high-efficiency content-based blockchain data retrieval.Experiments demonstrate that,compared with the method of only building intra block index,the proposed index model significantly improved the efficiency and stability of query retrieval within the acceptable index construction cost.In addition,it can provide the proof of existence or non-existence of data query at the same time,enhancing the credibility of query results.