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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com