Blockchain organizes information through a chain structure, and retrieving data from the blockchain requires traversing blocks. This makes traditional retrieval methods unsuitable for intensive query scenarios. To address the inefficiency of blockchain data retrieval, this paper proposes an efficient and secure retrieval method based on Merkle Patricia tries (MPTs). The method uses users’ public keys to construct a global latest state index tree, enabling quick access to the latest transaction information of a queried user as both sender and receiver. The hash of the latest state index tree is stored in the block header to ensure the verifiability and immutability of the index information. Additionally, the transaction structure in the block is reconstructed to include the hash and block height of the previous transaction for the same user. This allows simultaneous retrieval of the current and previous transaction information, improving retrieval speed. Experiments demonstrate that the proposed method significantly enhances retrieval efficiency within acceptable construction costs. Furthermore, the more transaction versions traced back, the greater the advantage of the method.
Hu et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: