CN109347893A - A kind of file memory method and device of block chain network - Google Patents

A kind of file memory method and device of block chain network Download PDF

Info

Publication number
CN109347893A
CN109347893A CN201810902977.0A CN201810902977A CN109347893A CN 109347893 A CN109347893 A CN 109347893A CN 201810902977 A CN201810902977 A CN 201810902977A CN 109347893 A CN109347893 A CN 109347893A
Authority
CN
China
Prior art keywords
files
identification
blocks
file
memory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201810902977.0A
Other languages
Chinese (zh)
Inventor
朱达欣
王宇
蔡鸿志
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xuanzhang Technology Co Ltd
Original Assignee
Xuanzhang Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xuanzhang Technology Co Ltd filed Critical Xuanzhang Technology Co Ltd
Priority to CN201810902977.0A priority Critical patent/CN109347893A/en
Priority to US16/244,027 priority patent/US20200052885A1/en
Priority to CA3030250A priority patent/CA3030250A1/en
Publication of CN109347893A publication Critical patent/CN109347893A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9024—Graphs; Linked lists
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
    • H04L9/0637—Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operation
    • G06F11/1402—Saving, restoring, recovering or retrying
    • G06F11/1446—Point-in-time backing up or restoration of persistent data
    • G06F11/1458—Management of the backup or restore process
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/13—File access structures, e.g. distributed indices
    • G06F16/137—Hash-based
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/182—Distributed file systems
    • G06F16/1834—Distributed file systems implemented based on peer-to-peer networks, e.g. gnutella
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/84—Using snapshots, i.e. a logical point-in-time copy of the data

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Software Systems (AREA)
  • Power Engineering (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Quality & Reliability (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses the file memory method and device of a kind of block chain network, this document storage method includes: S1, and input file is divided into multiple blocks of files；S2 establishes the corresponding relationship between the index value of multiple memory nodes and the identification id of multiple memory nodes；S3 carries out Hash operation to a blocks of files in multiple blocks of files, and obtains the first identification id according to the result of Hash operation and corresponding relationship；S4 stores a blocks of files to corresponding first memory node of the first identification id.Above-mentioned technical proposal of the invention provides a kind of method that memory node is distributed using hash value, because the hash value of each blocks of files is fixed and is not modifiable, so the file to come up for submission, corresponding storage relationship can be inquired, simply so as to avoid the cheating in scheduling.

Description

A kind of file memory method and device of block chain network
Technical field
The present invention relates to block chain technical field, it particularly relates to a kind of file memory method of block chain network and Device.
Background technique
There are two types of the storage methods of existing block catenary system.One is the method for centralization storage, this method can be occupied Many IDC (Internet Data Center, Internet data center) resource storages, but all because of not all file It is often accessed, and the quantity accounting of popular accessed file is not in fact high, so there are many high-performance, high quality Memory space stores the file of poor benefit.Another storage method is distributed P2P storage method, and this method price is low It is honest and clean, but it is slow to share speed, and most of host is personal node, therefore flow throughput performance is bad.
Current existing file memory method is to go to distribute by machine performance and memory space, in file distribution It feels concerned about system to go to distribute by certain formula, there is unjustnesses.For block catenary system, a kind of file memory method is needed, Can each business of fair dealing, and not by other means influenced and can simple authentication it is whether fair and reasonable.
Summary of the invention
In view of the above problems in the related art, the present invention proposes the file memory method and dress of a kind of block chain network It sets.
The technical scheme of the present invention is realized as follows:
According to an aspect of the invention, there is provided a kind of file memory method of block chain network, comprising:
Input file is divided into multiple blocks of files by S1；
S2 establishes the corresponding relationship between the index value of multiple memory nodes and the identification id of multiple memory nodes；
S3 carries out Hash operation to a blocks of files in multiple blocks of files, and according to the result of Hash operation and described Corresponding relationship obtains the first identification id；
S4 stores one blocks of files to corresponding first memory node of the first identification id.
According to an embodiment of the invention, carrying out secure hash algorithm 1 (SHA-1) operation to one blocks of files.
According to an embodiment of the invention, step S3 includes: to obtain multiple results addeds of 1 operation of secure hash algorithm To Mi；Take K=Mi mod MaxPP, wherein MaxPP indicates the quantity of the multiple memory node；Using K as index value, The first identification id is obtained in the corresponding relationship.
According to an embodiment of the invention, before step S2 further include: block chain network is added according to each memory node Time be each memory node be arranged index value.
According to an embodiment of the invention, after step s4 further include: according to the result of Hash operation and the corresponding pass System obtains the second identification id；By the backup data store of one blocks of files to corresponding second storage of the second identification id On node.
According to an embodiment of the invention, wherein, taking Kj=(K+j) mod MaxPP, wherein j is to be less than or equal to more than or equal to 1 The integer of MaxPP；By KjAs index value, the second identification id is obtained in the corresponding relationship；J parts of Backup Datas are deposited In storage to j the second memory nodes, the identification id of the j the second memory nodes is with K respectively1To KjIt is obtained as index value Identification id.
According to an embodiment of the invention, after step s4 further include: S5, when the file stored in multiple memory nodes When last access time is more than predetermined value, the All Files block of the file of the storage is dispatched to host network node storage.
According to an embodiment of the invention, step S5 includes: the All Files block for obtaining the file of the storage；It establishes multiple The second corresponding relationship between the index value of host network node and the identification id of multiple host network nodes；To all texts A blocks of files in part block carries out the second Hash operation, and according to the result of the second Hash operation and second corresponding relationship Obtain third identification id；
A blocks of files in the All Files block is stored into host network node corresponding to third identification id On.
According to an embodiment of the invention, in step S5 further include: according to the result of the second Hash operation and second pair described It should be related to obtain the 4th identification id；The backup data store of a blocks of files in the All Files block to the described 4th is known On the corresponding host network node of other id.
According to another aspect of the present invention, a kind of file storage device of block chain network is provided, comprising:
Piecemeal module, for input file to be divided into multiple blocks of files；
Relationship establishes module, for establishing between the index value of multiple memory nodes and the identification id of multiple memory nodes Corresponding relationship；
Hash operation module for carrying out Hash operation to a blocks of files in multiple blocks of files, and is transported according to Hash The result and corresponding relationship of calculation obtain the first identification id；
Memory module, for a blocks of files to be stored the first memory node corresponding to the first identification id.
Above-mentioned technical proposal of the invention provides a kind of method that memory node is distributed using hash value, because often The hash value of a blocks of files is fixed and is not modifiable, so can simply look into for the file that submission comes up Corresponding storage relationship is ask, so as to avoid the cheating in scheduling.
Detailed description of the invention
It in order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, below will be to institute in embodiment Attached drawing to be used is needed to be briefly described, it should be apparent that, the accompanying drawings in the following description is only some implementations of the invention Example, for those of ordinary skill in the art, without creative efforts, can also obtain according to these attached drawings Obtain other attached drawings.
Fig. 1 is the flow chart of the file memory method of block chain network according to an embodiment of the present invention；
Fig. 2 is the structural schematic diagram of block chain network according to an embodiment of the present invention；
Fig. 3 is the flow chart of the file memory method of the block chain network of specific embodiment according to the present invention；
Fig. 4 is the flow chart of the file memory method of the block chain network of specific embodiment according to the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on Embodiment in the present invention, those of ordinary skill in the art's every other embodiment obtained belong to what the present invention protected Range.
As shown in Figure 1, the present invention provides a kind of file memory method of block chain network, this document storage method packet It includes:
Input file is divided into multiple blocks of files by step S102；
Step S104 establishes the corresponding pass between the index value of multiple memory nodes and the identification id of multiple memory nodes System；
Step S106 carries out hash (Hash) operation to a blocks of files in multiple blocks of files, and according to hash operation Result and corresponding relationship obtain the first identification id；
Step S108 stores a blocks of files to corresponding first memory node of the first identification id.
Above-mentioned technical proposal of the invention provides a kind of method that memory node is distributed using hash value, because often The hash value of a blocks of files is fixed and is not modifiable, so can simply look into for the file that submission comes up Corresponding storage relationship is ask, so as to avoid the cheating in scheduling.
Fig. 2 shows an exemplary embodiments of block chain network.The block chain network include: management node SP and With multiple memory node PP of management node SP communication connection.Each memory node PP is communicatively coupled to multiple network hosts respectively Node P.Wherein, the function of management node SP includes: task schedule, the address of cache of reading data, the state of memory node PP Information full dose in management node SP is synchronous；The storage index relative information of data stores in the cluster that multiple SP nodes form And backup.The function of memory node PP include: complete data store tasks, provide stablize quick data access accelerate service, To host network node P distribution data store tasks, management multiple host network node P connected to it.Host network node P Function include: provide data access share with upstream bandwidth flow.
Below in conjunction with shown in Fig. 2, the file memory method of block chain network of the invention is specifically described.It should manage Solution, in other examples, file memory method of the invention can also be applied to the block chain network of other frameworks.It can be Additional step is provided before, during and/or after step described in Fig. 3 to Fig. 4.Can for different embodiment replacements or Remove described some steps.
Fig. 3 shows the flow chart of file block and file distribution.In conjunction with shown in Fig. 2 and Fig. 3, management node SP is responsible for text The piecemeal of part is dispatched.Management node SP can distribute a fixed identification id to each memory node PP, for example, identification id can It is formed by 54 byte integer words.
At step S302, piecemeal is carried out to input file, can be specifically 32M by each file block size to input text Part carries out piecemeal, conduct the last one blocks of files less than 32M.
In addition, can also be according to the time that block chain network is added in each memory node before carrying out step S304 Index value is arranged in each memory node.Specifically, being arranged for newly-increased memory node PP according to the time that network is added The index value of each memory node PP is arranged according to the serial number of sequence for sequence.For example, the index of the memory node PP of first addition Value is 0, and the index value of the memory node PP of second addition is 1, and so on.Similar, for newly-increased network host section Point P is also ranked up according to the time that network is added, the index value of each host network node P is arranged according to the serial number of sequence. Such as the index value of the host network node P of first addition is 0, the index value of the host network node P of second addition is 1, and so on.In other examples, according to actual needs, each storage section can also be set in another suitable way The index value of point PP, each host network node P.
At step S304, establish corresponding between the index value of multiple memory nodes and the identification id of multiple memory nodes Relationship.Specifically, define piecemeal after multiple blocks of files total quantity be N, setting i be blocks of files index value, i=0 ..., N-1；Array [i] is enabled to indicate i-th of blocks of files, Maxi indicates maximum file block number.When to each memory node PP according to being added Between be arranged index value indexPP, index value indexPP is numbered from 0, until maximum memory node PP several MaxPP-1.It presses A number is established according to index value and comes recording indexes value and the corresponding relationship of PPid, and pparr [indexPP] indicates index The PPid of indexPP.
At step S306, hash operation is done to i-th of blocks of files, uses SHA-1hash (array in the present embodiment [i]) 5 32 integer numbers are obtained, this 5 numbers are added and obtain value Mi.Take K=Mi mod MaxPP, that is, K removes for Mi With the remainder of MaxPP.PPid is obtained by pparr [K], the corresponding memory node PP of the PPid is arrived into the storage of this document block.
At step S308, the Backup Data of blocks of files is stored.Specifically, taking Kj=(K+j) mod MaxPP, Wherein j is the integer for being less than or equal to MaxPP more than or equal to 1；By KjAs index value, the second identification is obtained in corresponding relationship id；By in j parts of backup data stores to j the second memory nodes, the identification id of j the second memory nodes is with K respectively1To Kj The identification id obtained as index value.
In the embodiment shown in fig. 3, the value of above-mentioned j is 2, wherein K1=(K+1) mod MaxPP, K2=(K+2) mod MaxPP, by 2 parts of backup data stores to pparr [K1] and pparr [K2] corresponding memory node PP.
In one embodiment, file memory method of the invention further include: when the file stored in multiple memory nodes Last access time be more than predetermined value when, by the All Files block of the file of storage be dispatched to host network node storage.Example Such as, for the file being stored in multiple memory node PP, management node SP can scan memory node at a certain time interval The listed files of PP storage, to inquire the last access time of file, if the last access time of a file is greater than 3 A month, then the blocks of files for being stored in this document of memory node PP originally is dispatched to host network node P storage.Such text Part way to manage can be described as cold and hot way to manage.Specifically, method as shown in Figure 4 can be used in management node SP, will deposit originally The blocks of files stored up in the file of memory node PP is dispatched to host network node P storage.
As shown in figure 4, being more than the source file of predetermined value for last access time, obtaining the source document at step S402 The All Files block of part.
In addition, can be multiple host network node P setting identification id and index value, be before carrying out step S404 The mode of the setting identification of mode and memory node the PP id and index value of multiple host network node P setting identification id and index value Similar, details are not described herein again.
At step S404, the index value of multiple host network node P and the identification id of multiple host network node P are established Between corresponding relationship.The method for establishing the corresponding relationship can be similar with the method described at step S304.Specifically, definition The total quantity of multiple blocks of files after piecemeal is N, and setting i is the index value of blocks of files, i=0 ..., N-1；Enable array [i] table Show i-th of blocks of files, Maxi indicates maximum file block number.Index value is arranged according to the time is added to each host network node P IndexP, index value indexP are numbered from 0, until maximum host network node P several MaxP-1.It is established according to index value One number comes recording indexes value and the corresponding relationship of Pid, and parr [indexP] indicates the Pid of index indexP.
At step S406, hash operation is done to i-th of blocks of files, uses SHA-1hash (array in the present embodiment [i]) 5 32 integer numbers are obtained, this 5 numbers are added and obtain value Mi.Take K=Mi mod MaxP.Pass through parr [K] Pid is obtained, the corresponding host network node P of the Pid is arrived into the storage of this document block.
It is similar to memory node PP with the backup data store of blocks of files at step S408.K1=(K+1) mod MaxP, K2=(K+2) mod MaxP, K3=(K+3) mod MaxP, K4=(K+4) mod MaxP, extremely by 4 parts of backup data stores parr[K1]、parr[K2]、parr[K3] and parr [K4] corresponding host network node P.
According to an embodiment of the invention, additionally providing a kind of file storage device of block chain network, comprising:
Piecemeal module, for input file to be divided into multiple blocks of files；
Relationship establishes module, for establishing between the index value of multiple memory nodes and the identification id of multiple memory nodes Corresponding relationship；
Hash operation module for carrying out Hash operation to a blocks of files in multiple blocks of files, and is transported according to Hash The result and corresponding relationship of calculation obtain the first identification id；
Memory module, for a blocks of files to be stored the first memory node corresponding to the first identification id.
In one embodiment, secure hash algorithm 1 (SHA-1) operation is carried out to a blocks of files.
In one embodiment, Hash operation module includes: the first operation submodule, for transporting secure hash algorithm 1 The multiple results addeds calculated obtain Mi；Second operation submodule takes K=Mi mod MaxPP, wherein MaxPP indicates multiple and deposits Store up the quantity of node；Third operation submodule, for obtaining the first identification id in corresponding relationship using K as index value.
In one embodiment, further include setup module, for according to each memory node be added block chain network when Between be each memory node setting index value.
In one embodiment, further include backup module, obtain for the result and corresponding relationship according to Hash operation Two identification id；Being also used to will be in the backup data store of a blocks of files to corresponding second memory node of the second identification id.
In one embodiment, wherein take Kj=(K+j) mod MaxPP, wherein j is to be less than or equal to more than or equal to 1 The integer of MaxPP；By KjAs index value, the second identification id is obtained in corresponding relationship；By j parts of backup data stores to j On second memory node, the identification id of j the second memory nodes is with K respectively1To KjThe identification id obtained as index value.
In one embodiment, further includes: cold and hot management module, for working as the file stored in multiple memory nodes most When access time is more than predetermined value afterwards, the All Files block of the file of the storage is dispatched to host network node storage.
In one embodiment, cold and hot management module includes:
Acquisition submodule, the All Files block of the file for obtaining the storage；
Relationship setting up submodule, for establishing the index value of multiple host network nodes and the knowledge of multiple host network nodes The second corresponding relationship between other id；
Hash operation submodule, for carrying out the second Hash operation to a blocks of files in the All Files block, and Third identification id is obtained according to the result of the second Hash operation and second corresponding relationship；
Sub-module stored, it is corresponding to third identification id for storing a blocks of files in the All Files block Host network node on.
In one embodiment, cold and hot management module is also used to result and the second corresponding relationship according to the second Hash operation Obtain the 4th identification id；By the backup data store of a blocks of files in the All Files block to the 4th id pairs of the identification On the host network node answered.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention Within mind and principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.

Claims (10)

1. a kind of file memory method of block chain network characterized by comprising
Input file is divided into multiple blocks of files by S1；
S2 establishes the corresponding relationship between the index value of multiple memory nodes and the identification id of multiple memory nodes；
S3 carries out Hash operation to a blocks of files in multiple blocks of files, and according to the result of Hash operation and the correspondence Relationship obtains the first identification id；
S4 stores one blocks of files to corresponding first memory node of the first identification id.
2. the file memory method of block chain network according to claim 1, which is characterized in that one blocks of files Carry out secure hash algorithm 1 (SHA-1) operation.
3. the file memory method of block chain network according to claim 2, which is characterized in that step S3 includes:
Multiple results addeds of 1 operation of secure hash algorithm are obtained into Mi；
Take K=Mi mod MaxPP, wherein MaxPP indicates the quantity of the multiple memory node；
Using K as index value, the first identification id is obtained in the corresponding relationship.
4. the file memory method of block chain network according to claim 1, which is characterized in that also wrapped before step S2 It includes:
It is that index value is arranged in each memory node according to the time that block chain network is added in each memory node.
5. the file memory method of block chain network according to claim 3, which is characterized in that also wrap after step s4 It includes:
The second identification id is obtained according to the result of Hash operation and the corresponding relationship；
It will be in the backup data store of one blocks of files to corresponding second memory node of the second identification id.
6. the file memory method of block chain network according to claim 5, which is characterized in that wherein,
Take Kj=(K+j) mod MaxPP, wherein j is the integer for being less than or equal to MaxPP more than or equal to 1；
By KjAs index value, the second identification id is obtained in the corresponding relationship；
By in j parts of backup data stores to j the second memory nodes, the identification id of the j the second memory nodes is with K respectively1 To KjThe identification id obtained as index value.
7. the file memory method of block chain network according to claim 1, which is characterized in that also wrap after step s4 It includes:
S5, when the last access time of the file stored in multiple memory nodes being more than predetermined value, by the file of the storage All Files block be dispatched to host network node storage.
8. the file memory method of block chain network according to claim 7, which is characterized in that step S5 includes:
Obtain the All Files block of the file of the storage；
Establish the second corresponding relationship between the index value of multiple host network nodes and the identification id of multiple host network nodes；
Second Hash operation is carried out to a blocks of files in the All Files block, and according to the result of the second Hash operation and Second corresponding relationship obtains third identification id；
A blocks of files in the All Files block is stored to the corresponding host network node of third identification id.
9. the file memory method of block chain network according to claim 8, which is characterized in that also wrap after step s 5 It includes:
The 4th identification id is obtained according to the result of the second Hash operation and second corresponding relationship；
By the backup data store of a blocks of files in the All Files block to the corresponding network master of the 4th identification id On machine node.
10. a kind of file storage device of block chain network characterized by comprising
Piecemeal module, for input file to be divided into multiple blocks of files；
Relationship establishes module, corresponding between the index value of multiple memory nodes and the identification id of multiple memory nodes for establishing Relationship；
Hash operation module, for carrying out Hash operation to a blocks of files in multiple blocks of files, and according to Hash operation As a result the first identification id is obtained with corresponding relationship；
Memory module, for a blocks of files to be stored the first memory node corresponding to the first identification id.
CN201810902977.0A 2018-08-09 2018-08-09 A kind of file memory method and device of block chain network Pending CN109347893A (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CN201810902977.0A CN109347893A (en) 2018-08-09 2018-08-09 A kind of file memory method and device of block chain network
US16/244,027 US20200052885A1 (en) 2018-08-09 2019-01-09 File storage method and apparatus for blockchain network
CA3030250A CA3030250A1 (en) 2018-08-09 2019-01-16 File storage method and apparatus for blockchain network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810902977.0A CN109347893A (en) 2018-08-09 2018-08-09 A kind of file memory method and device of block chain network

Publications (1)

Publication Number Publication Date
CN109347893A true CN109347893A (en) 2019-02-15

Family

ID=65291387

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810902977.0A Pending CN109347893A (en) 2018-08-09 2018-08-09 A kind of file memory method and device of block chain network

Country Status (3)

Country Link
US (1) US20200052885A1 (en)
CN (1) CN109347893A (en)
CA (1) CA3030250A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109918044A (en) * 2019-02-26 2019-06-21 太原理工大学 A kind of lot/sort method based on block chain technology
CN110149373A (en) * 2019-04-28 2019-08-20 平安科技（深圳）有限公司 Date storage method, device, medium and server based on point to point network
US20200213089A1 (en) 2019-04-04 2020-07-02 Alibaba Group Holding Limited Data storage method, apparatus, system and device
WO2020199711A1 (en) * 2019-04-04 2020-10-08 创新先进技术有限公司 Data storage method, system, device and apparatus

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110674140B (en) * 2019-09-29 2022-04-15 腾讯科技（深圳）有限公司 Block chain-based content processing method, device, equipment and storage medium
WO2022021357A1 (en) * 2020-07-31 2022-02-03 华为技术有限公司 File block download method and apparatus

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106775497A (en) * 2017-01-19 2017-05-31 郑志超 Distributed storage method and equipment based on block chain
CN106815530A (en) * 2016-12-26 2017-06-09 北京爱接力科技发展有限公司 Data deposit card method, data verification method and device
CN107273410A (en) * 2017-05-03 2017-10-20 上海点融信息科技有限责任公司 Distributed storage based on block chain
CN108062202A (en) * 2017-12-15 2018-05-22 中链科技有限公司 A kind of file block storage method and system
CN108108127A (en) * 2017-12-15 2018-06-01 中链科技有限公司 A kind of file reading and system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106815530A (en) * 2016-12-26 2017-06-09 北京爱接力科技发展有限公司 Data deposit card method, data verification method and device
CN106775497A (en) * 2017-01-19 2017-05-31 郑志超 Distributed storage method and equipment based on block chain
CN107273410A (en) * 2017-05-03 2017-10-20 上海点融信息科技有限责任公司 Distributed storage based on block chain
CN108062202A (en) * 2017-12-15 2018-05-22 中链科技有限公司 A kind of file block storage method and system
CN108108127A (en) * 2017-12-15 2018-06-01 中链科技有限公司 A kind of file reading and system

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109918044A (en) * 2019-02-26 2019-06-21 太原理工大学 A kind of lot/sort method based on block chain technology
CN109918044B (en) * 2019-02-26 2021-03-30 太原理工大学 Block chain technology-based drawing/sorting method
US20200213089A1 (en) 2019-04-04 2020-07-02 Alibaba Group Holding Limited Data storage method, apparatus, system and device
WO2020199711A1 (en) * 2019-04-04 2020-10-08 创新先进技术有限公司 Data storage method, system, device and apparatus
US10917231B2 (en) 2019-04-04 2021-02-09 Advanced New Technologies Co., Ltd. Data storage method, apparatus, system and device
CN110149373A (en) * 2019-04-28 2019-08-20 平安科技（深圳）有限公司 Date storage method, device, medium and server based on point to point network
WO2020220641A1 (en) * 2019-04-28 2020-11-05 平安科技（深圳）有限公司 Data storage method and apparatus based on point-to-point network, and medium and server
CN110149373B (en) * 2019-04-28 2022-01-07 平安科技（深圳）有限公司 Data storage method, device, medium and server based on peer-to-peer network

Also Published As

Publication number Publication date
CA3030250A1 (en) 2020-02-09
US20200052885A1 (en) 2020-02-13

Similar Documents

Publication Publication Date Title
CN109347893A (en) A kind of file memory method and device of block chain network
CN110622474B (en) Secure block link routing techniques
CN113364735B (en) Data cross-link access control method, system, equipment and terminal under multi-link scene
CN108777625A (en) Verification method, device and system, storage medium, the electronic device of signature
CN102413156B (en) Distributed data storage system and method
US20200167745A1 (en) Data management system and method of distributing a digital content file
CN107819891A (en) Data processing method, device, computer equipment and storage medium
CN101729425B (en) Method and equipment for flow sending in VRRP networking
CN102510568A (en) Internet access data processing system and method for mobile terminal
CN103108009B (en) File sharing method based on off-line space and device
CN101729423B (en) Method and device for transmitting data between common public radio interface CPRI ports
CN109005252A (en) A kind of IPv6 address generating method, equipment, system and the medium of fictitious host computer
Ding et al. Blockchain-assisted spectrum trading between elastic virtual optical networks
CN107105013A (en) Processing method, server, terminal and the system of file
CN112561510A (en) Payment system, method, device, equipment and storage medium
CN108320173A (en) Integration processing method and device based on block chain technology
CN109728984A (en) A kind of access system, method and device
CN103065096B (en) A kind of data guard method, Apparatus and system
CN103973747B (en) A kind of method and apparatus for obtaining content
CN105224541B (en) Uniqueness control method, information storage means and the device of data
CN108134824A (en) A kind of travel products running log recording method and system
CN105279217A (en) Reconstructable content objects
CN106446050A (en) Method and system for subscription by aiming at changed data of database
CN114138468A (en) Self-adaptive distribution method and device for packaging task quantity and storage medium
CN108337208A (en) Data guard method, alternative based on cloud storage and cloud storage system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20190215