Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Block chain fragment storage and query method based on erasure codes

A query method and block chain technology, applied in the direction of instruments, file access structure, calculation, etc., can solve the problem of waste of storage resources, and achieve the effect of saving storage resources, efficient query, and fast query

Active Publication Date: 2019-06-11
EAST CHINA NORMAL UNIV
View PDF4 Cites 74 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

It is a waste of storage resources if the same storage strategy is adopted regardless of whether the data is hot or cold

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Block chain fragment storage and query method based on erasure codes
  • Block chain fragment storage and query method based on erasure codes
  • Block chain fragment storage and query method based on erasure codes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0043] This embodiment is a block chain fragmentation storage and query method based on erasure codes. For files in erasure code mode, the basic unit that constitutes it is a block group. A block group consists of a certain number of data blocks plus generated check blocks. Taking RS(6,3) as an example, each block group includes 1-6 data blocks and 3 check blocks. The premise of encoding is that each block has the same length. If inconsistent, it should be filled with 0.

[0044] Based on the above block group types, the following indexes are designed:

[0045] An index fileInfo is maintained for each storage node. It consists of three parts, namely range, fileID, and filePosInfo.

[0046] 1: range: is a structure, the start value and end value of the blockID in the current slice file.

[0047] 2: fileID: an int integer, the ID of the current fragmented file.

[0048] 3: filePosInfo: a structure consisting of three parts, block_file_id, file_offset, data_length of int ty...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a block chain fragment storage and query method based on erasure codes. When the block storage reaches a certain threshold, a block is sliced and stored. The method comprises the following steps that firstly, the meta-information of the block file fragments is consented, after the consensus is achieved, the erasure codes are utilized to fragment the block files within thethreshold value into the data blocks and the check blocks, and each node stores one part of the data blocks and the check blocks, so that the storage cost is reduced, and meanwhile, the data fault tolerance under the Bayer fault tolerance is also realized. Besides, when the block files are fragmented, the corresponding index is established, and the corresponding data block or check block can be queried from each node by utilizing the index, so that the block data can be queried efficiently under the condition that the storage space is saved.

Description

technical field [0001] The invention belongs to the field of block chains, and relates to a block chain-based erasure code to solve the problem of full copy storage, store block files in pieces, do not need full copy storage and ensure data fault tolerance, and conveniently The data is queried. Background technique [0002] Blockchain, as a distributed ledger technology, has been adopted by various applications to realize trust connections between multiple participants, and it can effectively record transactions between two parties in a verifiable and permanent manner, such as International settlement, secure transaction settlement, traceability of food ingredients, etc. To ensure immutability, each block is associated with the previous block's hash, a timestamp, and information about the block's Merkle hash root. A consensus protocol is used to ensure the consistency of the data recorded by each participant. [0003] However, there are two serious problems in the current...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/182G06F16/13
Inventor 王润朱燕超张召金澈清
Owner EAST CHINA NORMAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products