基于区块链的农产品供应链溯源数据多条件查询优化方法研究  

Blockchain-based Multi-condition Query Optimization Method for Traceability Data of Agricultural Product Supply Chain

作　　者：高官岳 孙传恒[2,3] 罗娜 徐大明 邢斌[2,3] GAO Guanyue;SUN Chuanheng;LUO Na;XU Daming;XING Bin(College of Information Technology,Shanghai Ocean University,Shanghai 201306,China;National Engineering Research Center for Information Technology in Agriculture,Beijing 100097,China;National Engineering Laboratory for Agri-product Quality Traceability,Bejing 100097,China)

机构地区：[1]上海海洋大学信息学院,上海201306 [2]国家农业信息化工程技术研究中心,北京100097 [3]农产品质量安全追溯技术及应用国家工程研究中心,北京100097

出　　处：《农业机械学报》2024年第3期362-374,共13页Transactions of the Chinese Society for Agricultural Machinery

基　　金：国家重点研发计划项目(2022YFD2001304);江苏省科技计划(重点研发计划现代农业)项目(BE2023315)。

摘　　要：随着基于区块链的农产品溯源系统迅速发展,区块链查询能力面临着巨大挑战。对于供应链参与方来说,区块链中保存的数据多为编码或序列化的数据,使得供应链参与方的审计和监督等存在多条件查询的工作变得十分困难。通常情况下,原生区块链并未提供满足多条件查询的查询方式。因此,为了实现多条件查询并提高查询效率,本研究提出一种农产品溯源数据多条件查询优化方法。首先,该方法采用一种优化的Merkle树结构(n-Tree)对交易信息进行重构,从而提供更高效的条件验证能力。其次,通过自适应多条件区块布隆过滤器判断交易信息中查询条件的存在性,进而快速过滤区块。最后,提出一种应用TWTN-Heap(Time weight and transaction number based heap)结构的索引构建方法,以区块权重为序构建主条件相关的区块号索引列表。产品数据的查询过程包括遍历区块号索引列表、过滤非相关区块以及验证特定查询条件,从而获得条件查询结果。实验结果表明,本研究提出的产品数据条件查询优化方法能够有效地解决农产品供应链面临的条件查询问题,同时保证查询时间消耗维持在15 ms左右,查询效率较默克尔语义字典树(Merkle semantic trie, MST)方法提高60.9%,较原始遍历(Orignal traverse, OT)方法提高87.7%。With the rapid development of blockchain-based agricultural product traceability systems,blockchain query capabilities face great challenges.For supply chain participants,most of the data stored in the blockchain are coded or serialized data,which makes the process of multi-condition query such as audit and supervision of supply chain participants very difficult.In general,native blockchains do not provide a query method to satisfy multi-condition queries.Therefore,in order to realize multi-condition query and improve query efficiency,an optimization method for agricultural product traceability data was proposed.Firstly,the method used an optimized Merkle tree structure(n-Tree)to reconstruct the transaction information,so as to provide more efficient conditional verification ability.Secondly,the adaptive multi-condition block Bloom filter was used to judge the existence of query conditions in the transaction information,and then the blocks were quickly filtered.Finally,an index construction method using time weight and transaction number based heap structure was proposed,and the block number index list related to the main condition was constructed in the order of block weight.The process of querying product data included traversing the block index list,filtering irrelevant blocks,and validating specific query conditions to obtain conditional query results.The experimental results showed that the query method proposed can effectively solve the problem of conditional query in the supply chain of agricultural products.At the same time,the query time consumption was maintained at about 15ms,and the query efficiency was improved by 60.9%compared with Merkle semantic trie method and 87.7%compared with original traverse method.

关 键 词：农产品供应链 区块链溯源 条件查询 n-Tree 布隆过滤器 

分 类 号：TP311.11[自动化与计算机技术—计算机软件与理论]