Supply chain traceability refers to product tracking from the source to customers, demanding transparency, authenticity, and high efficiency. In recent years, blockchain has been widely adopted in supply chain traceability to provide transparency and authenticity, while the efficiency issue is understudied. In practice, as the numerous product records accumulate, the time- and storage- efficiencies will decrease remarkably. To the best of our knowledge, this paper is the first work studying the efficiency issue in blockchain-based supply chain traceability. Compared to the traditional method, which searches the records stored in a single chunk sequentially, we replicate the records in multiple chunks and employ parallel search to boost the time efficiency. However, allocating the record searching primitives to the chunks with maximized parallelization ratio is challenging. To this end, we model the records and chunks as a bipartite graph and solve the allocation problem using a maximum matching algorithm. The experimental results indicate that the time overhead can be reduced by up to 85.1% with affordable storage overhead.
翻译:供应链的可追踪性是指从来源到客户的产品追踪,要求透明度、真实性和高效率。近年来,供应链链被广泛采用,以供应链可追踪性提供透明度和真实性,而效率问题则没有得到充分研究。在实践中,随着大量产品记录积累,时间和储存效率将显著下降。据我们所知,本文是研究基于供应链链的可追踪性的效率问题的首份工作。与传统方法相比,我们按顺序搜索存储在单个块中的记录,我们在多个块中复制记录,并同时进行搜索,以提高时间效率。然而,用最大限度的平行率将原始搜索记录分配给块块具有挑战性。为此,我们将记录和块建成双面图,用最大匹配算法解决分配问题。实验结果显示,用负担得起的存储间接费用将时间减少85.1%。