A Query Optimization Method of Blockchain Electronic Transaction Based on Group Account

摘要

When an electronic transaction occurs, the blockchain system needs to find out whether the accounts of both parties of the transaction exist. However, However, in the existing blockchain account storage solution, account information query efficiency is low, which seriously affects query performance and user experience. To this end, we propose a blockchain-based electronic transaction lookup scheme for grouped accounts. We combine the characteristics of Merkle Patricia Tree, by constructing the Merkle Patricia Tree account storage structure GMPT (Group Merkel Partricia Tree), to reduce the time of querying the accounts of both parties of the transaction during electronic transactions. At the same time, in order to efficiently cluster accounts, we improved the RFM model and K-Means clustering algorithm, and gave out the RFM model based on blockchain accounts and the improved account grouping algorithm AccountGroup. Experiments show that the blockchain electronic transaction query scheme based on account grouping proposed in this paper can effectively reduce the time to query the accounts of both parties in electronic transactions, optimize the query efficiency, and improve the transaction speed of the blockchain system.