introduced bilinear pairing into Chameleon hash and designed a new generation method of Merkle tree based on it for data editing and validation. presented a RESTful decentralized storage framework that combines blockchain and distributed hash table (DHT) to enable on-chain data editing. proposed a redactable blockchain scheme based on unforgeable signatures, which can quickly confirm whether on-chain data has been illegally edited. The on-chain data scalability is currently implemented mainly by editing the on-chain data or deleting it and resubmitting it to the blockchain. The main contributions of this paper are as follows: By integrating the skip list index with blockchain, the new index proposed can implement range search and improve the retrieval efficiency of on-chain data. Moreover, in order to improve the retrieval efficiency of on-chain data, this paper proposes an on-chain data index based on skip lists on the basis of the above on-chain data scalability scheme based on transactions. They can also avoid massive modifications to the blockchain structure and implement direct compatibility with deployed blockchain projects. Compared with existing schemes, the two on-chain data scalability schemes proposed in this paper achieve on-chain data scalability. Through studying on-chain storage media, this paper proposes two on-chain data scalability schemes, based on transaction and based on smart contract, respectively. However, on the blockchain, data are represented in a different form, such as transaction or smart contract, which are called on-chain storage media. The on-chain data are eventually stored in the local database in the form of key-value pairs. To solve the above problems, this paper studies and analyzes the on-chain storage media for the first time. However, both data reading performance and the number of query types affect the retrieval performance of on-chain data. In addition, since LevelDB is a key-value database, there are not many query types that can be supported. The LSM-tree structure has efficient write performance, while its random read performance is not as impressive. Furthermore, although the blockchain can be used as a data storage layer, most current blockchain projects pursue efficient writing speeds and thus choose LevelDB based on LSM-tree. ![]() ![]() Therefore, lack of on-chain data scalability not only makes the blockchain defeat the original purpose of decentralization but also reduces the performance of the whole blockchain system. Secondly, the increasingly high storage cost increases the barrier to participation in blockchain projects, making fewer and fewer nodes in the blockchain. Firstly, data redundancy caused by the inability to extend on-chain data wastes a lot of storage space. When users update or add data, they need to upload all the data to the blockchain again, so duplicate data accumulate on the blockchain. Each node currently participating in the blockchain needs to back up all the data on the blockchain. ![]() However, data on the blockchain cannot be tampered with, which is the main reason why on-chain data are hard to extend. Such a huge amount of IoT devices and data rely on the blockchain to achieve reliable storage, making the blockchain encounter the challenge of inefficient on-chain data scalability and retrieval.
0 Comments
Leave a Reply. |