2021
DOI: 10.1007/s11390-020-0158-2
|View full text |Cite
|
Sign up to set email alerts
|

SE-Chain: A Scalable Storage and Efficient Retrieval Model for Blockchain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(11 citation statements)
references
References 15 publications
0
11
0
Order By: Relevance
“…However, for the on-chain data, it is proved in practice that the design of new block data storage structure and corresponding indexes can effectively improve the query function and query performance. The index of on-chain data can either serve for real-time transaction verification [ 41 , 67 , 72 ] or improve the access efficiency of transaction history information [ 73 – 75 ]. In a word, a proper index of on-chain data provides not only higher real-time access efficiency in terms of performance, but also supports the traceability query based on historical data in terms of functionality.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, for the on-chain data, it is proved in practice that the design of new block data storage structure and corresponding indexes can effectively improve the query function and query performance. The index of on-chain data can either serve for real-time transaction verification [ 41 , 67 , 72 ] or improve the access efficiency of transaction history information [ 73 – 75 ]. In a word, a proper index of on-chain data provides not only higher real-time access efficiency in terms of performance, but also supports the traceability query based on historical data in terms of functionality.…”
Section: Discussionmentioning
confidence: 99%
“…Each transaction of SE-Chain [ 72 ] is maintained in the AB-M tree (adaptive balanced Merkle tree), which combines the advantages of balanced binary trees (fast retrieval) and Merkle trees (fast verification). Specifically, an AB-M tree is divided into two layers, the lower one is a Merkle tree, and the upper one is a binary tree containing node hash information, so as to meet the verification requirements from leaf node to root node.…”
Section: Database-oriented Blockchainsmentioning
confidence: 99%
“…It alleviates the storage pressure by reducing the amount of data that each participating node needs to store, and reduces the communication overhead by the nodes in the cluster cooperating to store and check blocks. Jia et al [28] proposed a blockchain storage capacity scalable model. The main idea is to store the blocks in the blockchain in a certain proportion in the nodes, and a strategy for blockchain data copy distribution is proposed.…”
Section: Related Workmentioning
confidence: 99%
“…However, the model can lead to the loss of transaction data and thus untraceability. Jia et al [21] proposed a storage capacity scalability model, which determines the number of its storage copies based on block security. Nodes are divided according to their functions, and each node is no longer required to store the complete blockchain information.…”
Section: Introductionmentioning
confidence: 99%