CN111984616A - Method, device and system for updating shared file - Google Patents
Method, device and system for updating shared file Download PDFInfo
- Publication number
- CN111984616A CN111984616A CN202010773252.3A CN202010773252A CN111984616A CN 111984616 A CN111984616 A CN 111984616A CN 202010773252 A CN202010773252 A CN 202010773252A CN 111984616 A CN111984616 A CN 111984616A
- Authority
- CN
- China
- Prior art keywords
- hash value
- file
- updated
- sub
- tree
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 58
- 230000006835 compression Effects 0.000 claims description 135
- 238000007906 compression Methods 0.000 claims description 135
- 238000004590 computer program Methods 0.000 claims description 11
- 230000006837 decompression Effects 0.000 claims description 11
- 239000000126 substance Substances 0.000 claims description 6
- 238000010586 diagram Methods 0.000 description 12
- 230000008569 process Effects 0.000 description 10
- 238000004891 communication Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 125000004122 cyclic group Chemical group 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
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/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/176—Support for shared access to files; File sharing support
-
- 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/14—Details of searching files based on file metadata
- G06F16/148—File search processing
-
- 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/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
-
- 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/17—Details of further file system functions
- G06F16/174—Redundancy elimination performed by the file system
- G06F16/1744—Redundancy elimination performed by the file system using compression, e.g. sparse files
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Library & Information Science (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method, a device and a system for updating a shared file, and relates to the technical field of computers. One embodiment of the method comprises: the shared file stored in the tree structure presented on the block chain can be locally replaced, the replaced file is compressed to package chain and a corresponding new hash value is obtained; and a new root hash value is obtained through the loop operation aiming at the new hash value and the hash value associated in the tree structure; traversing the hash value of the tree structure node through the new root hash value, and further acquiring a shared update file; the method and the device partially overcome the problems of relative nodes on a block chain and re-chaining of the file storage certificate caused by updating a small amount of files, save network resource burden and improve the efficiency of updating shared files.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method, an apparatus, and a system for updating a shared file.
Background
In the business process of an enterprise, files required by the business are often required to be shared, particularly the business between the enterprises is involved, with the development of a block chain technology, the files can be shared between the enterprises based on the block chain, and the adopted method mainly comprises the steps of taking all the shared files as a trade uplink and broadcasting to realize sharing; according to the service scene, the shared file may need to be updated;
in the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
by using the method, when a small number of shared files in a large number of files on a block chain need to be updated, all nodes associated with the small number of files need to be linked up again, so that repeated operation is caused, and waste of network resources and human resources is caused.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for updating a shared file, which can compress a packet chain of a replaced file and obtain a corresponding new hash value by locally replacing a shared file stored in a block chain and having a tree structure; and a new root hash value is obtained by carrying out cyclic operation on the new hash value and the hash value associated with the tree structure; traversing the hash value of the tree structure node through the new root hash value, and further acquiring a shared update file; the method and the device partially overcome the problems of relative nodes on a block chain and re-chaining of the file storage certificate caused by updating a small amount of files, save network resource burden and improve the efficiency of updating shared files.
To achieve the above object, according to a first aspect of the embodiments of the present invention, there is provided a method for updating a shared file, including: acquiring an update file, and searching a file to be updated according to the file name of the update file; forming a first file compression package according to the updated file, performing block chain chaining operation on the first file compression package, and acquiring a first hash value corresponding to the first file compression package from a block chain; replacing a second hash value in a branching tree in a block chain by using the first hash value, wherein a second file compression packet corresponding to the second hash value comprises the file to be updated; the bifurcated tree includes at least three hash values; determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree; obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree; replacing the third hash value corresponding to the position with the fourth hash value; and taking the fourth hash value at the highest level as a new root hash value, and sending the new root hash value.
Optionally, the method of updating a shared file, wherein,
according to the update file, a first file compression package is formed, and the first file compression package comprises: and searching a second file package in which the file to be updated is located according to the file name of the updated file, and generating a first file package according to other files and the updated file when the second file package comprises other files except the file to be updated.
Optionally, the method of updating a shared file, wherein,
and performing compression and encryption operations on the first file packet to form the first file compressed packet.
To achieve the above object, according to a second aspect of the embodiments of the present invention, there is provided a method for updating a shared file, including:
receiving a root hash value; determining a sub-hash value corresponding to the root hash value; circularly executing the following steps until a file compression package corresponding to the sub-hash value is obtained, wherein the file compression package comprises an updated file; determining that the same file compression package hash value as the sub-hash value exists on the block chain, and if so, executing A1; otherwise, executing A2;
a1: acquiring a file compression packet corresponding to the sub-hash value from the block chain;
a2: and determining a lower-level hash value corresponding to the sub-hash value, and taking the lower-level hash value as the sub-hash value.
Optionally, the method of updating a shared file, wherein,
acquiring the update file in the update file compression package corresponding to the sub-hash value, including:
and acquiring an update file compression packet corresponding to the sub-hash value, and performing decompression and decryption operations on the update file compression packet to acquire an update file in the file packet.
To achieve the above object, according to a third aspect of the embodiments of the present invention, there is provided an apparatus for updating a shared file, including: the file updating module, the hash value updating module and the root hash value updating module; wherein the content of the first and second substances,
the file updating module is used for acquiring an updating file and searching a file to be updated according to the file name of the updating file; forming a first file compression package according to the updated file, performing block chain chaining operation on the first file compression package, and acquiring a first hash value corresponding to the first file compression package from a block chain;
the hash value updating module is configured to replace a second hash value in a branching tree in a block chain with the first hash value, where a second file compressed packet corresponding to the second hash value includes the file to be updated; the bifurcated tree includes at least three hash values; determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree; obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree; replacing the third hash value corresponding to the position with the fourth hash value;
and the root hash value updating module is used for taking the fourth hash value at the highest level as a new root hash value and sending the new root hash value.
Optionally, the apparatus for updating a shared file is characterized in that,
according to the update file, a first file compression package is formed, and the first file compression package comprises:
and searching a second file package in which the file to be updated is located according to the file name of the updated file, and generating a first file package according to other files and the updated file when the second file package comprises other files except the file to be updated.
Optionally, the apparatus for updating a shared file is characterized in that,
and performing compression and encryption operations on the first file packet to form the first file compressed packet.
In order to achieve the above object, according to a fourth aspect of the embodiments of the present invention, there is also provided an apparatus for updating a shared file, including: acquiring an update file module; wherein the content of the first and second substances,
the update file acquisition module is used for receiving a root hash value; determining a sub-hash value corresponding to the root hash value; circularly executing the following steps until a file compression package corresponding to the sub-hash value is obtained, wherein the file compression package comprises an updated file; determining that the same file compression package hash value as the sub-hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the sub-hash value from the block chain; a2: and determining a lower-level hash value corresponding to the sub-hash value, and taking the lower-level hash value as the sub-hash value.
Optionally, the apparatus for updating a shared file is characterized in that,
acquiring the update file in the update file compression package corresponding to the sub-hash value, including:
and acquiring an update file compression packet corresponding to the sub-hash value, and performing decompression and decryption operations on the update file compression packet to acquire an update file in the file packet.
To achieve the above object, according to a fifth aspect of the embodiments of the present invention, there is provided a system 900 for sharing files, including the apparatus 700 for updating shared files provided in the third aspect and the apparatus 800 for updating shared files provided in the fourth aspect;
to achieve the above object, according to a sixth aspect of the embodiments of the present invention, there is provided an electronic device for updating a shared file, including: one or more processors; storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to carry out a method as in any one of the above methods of updating a shared file.
To achieve the above object, according to a seventh aspect of the embodiments of the present invention, there is provided a computer readable medium having a computer program stored thereon, wherein the program, when executed by a processor, implements any one of the methods of updating a shared file as described above.
One embodiment of the above invention has the following advantages or benefits: the shared file stored in the tree structure presented on the block chain can be locally replaced, the replaced file is compressed to package chain and a corresponding new hash value is obtained; and a new root hash value is obtained by carrying out cyclic operation on the new hash value and the hash value associated with the tree structure; traversing the hash value of the tree structure node through the new root hash value, and further acquiring a shared update file; the method and the device partially overcome the problems of relative nodes on a block chain and re-chaining of the file storage certificate caused by updating a small amount of files, save network resource burden and improve the efficiency of updating shared files.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a flowchart illustrating a method for updating a file according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating an embodiment of obtaining an update file;
FIG. 3 is a diagram illustrating a method for storing hash values of shared files using a tree structure according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a hash value of an update file stored in a tree structure according to an embodiment of the present invention;
FIG. 5 is a flowchart illustrating an embodiment of obtaining an update file;
fig. 6 is a schematic flowchart of a process for obtaining an updated shared file according to an embodiment of the present invention
FIG. 7 is a block diagram illustrating an apparatus for updating a shared file according to an embodiment of the present invention;
FIG. 8 is a schematic structural diagram of an apparatus for obtaining an updated shared file according to an embodiment of the present invention;
FIG. 9 is a block diagram illustrating a system for obtaining updated shared files according to an embodiment of the present invention;
FIG. 10 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 11 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
As shown in fig. 1, an embodiment of the present invention provides a method for storing an updated shared file, where the method may include the following steps:
step S101: acquiring an update file, and searching a file to be updated according to the file name of the update file; forming a first file compression package according to the updated file, performing block chain chaining operation on the first file compression package, and acquiring a first hash value corresponding to the first file compression package from a block chain;
specifically, in a specific scene, a file stored on a block chain needs to be updated, and when the updated file is acquired, the file to be updated can be searched according to the file name of the updated file; the file to be updated can be stored in one file compression package or a plurality of file compression packages, wherein the file compression package to which the file to be updated belongs can be acquired from a local storage medium synchronous with the block chain or can be acquired from the block chain; further, the first file compression package formed according to the update file includes: and searching a second file package in which the file to be updated is located according to the file name of the updated file, and generating a first file package according to other files and the updated file when the second file package comprises other files except the file to be updated.
It is understood that the updated file and the file to be updated have the same file name, and the second file package where the file to be updated is located is searched by the file name, for example: the file compression package 1 (which is the filename of the second file compression package corresponding to the second file package) contains 100 files, wherein "file 99. aa" is a file to be updated, and other 99 files are files that do not need to be updated, then the file 99.aa "is replaced with the file with the same filename to be updated, and a new file package (i.e., the first file package) is generated with the other 99 files (i.e., including other files except the file to be updated); further, performing compression and encryption operations on the first file package to form the first file compressed package. It is understood that each file compression package is already contained on the blockchain;
further, performing a chain chaining operation on the first file compressed packet, and acquiring a first hash value corresponding to the first file compressed packet from a block chain; the first file compression package of the uplink is a compression package containing an updated file, and replaces the original file compression package; the first file compressed packet may be used as a transaction execution block chain chaining operation, and a hash value returned for the transaction is obtained from the block chain, where the hash value is a first hash value of the file compressed packet, that is, a first hash value corresponding to the first file compressed packet, and the used block chain may be a federation chain, a private chain, or the like. The invention is not limited to the specific tools or methods used to perform the blockchain chaining.
Step S102: replacing a second hash value in a branching tree in a block chain by using the first hash value, wherein a second file compression packet corresponding to the second hash value comprises the file to be updated; the bifurcated tree includes at least three hash values; determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree; obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree; and replacing the third hash value corresponding to the position with the fourth hash value.
Replacing a second hash value in a branching tree in a block chain by using the first hash value, wherein a second file compression packet corresponding to the second hash value comprises the file to be updated; the bifurcated tree includes at least three hash values; determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree; obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree; and replacing the third hash value corresponding to the position with the fourth hash value.
In particular, the following is illustrated in connection with fig. 3 and the corresponding example of fig. 4: wherein FIG. 3 shows a tree structure containing no update files; fig. 4 shows a tree structure containing an update file updated based on the tree structure of fig. 3.
S1: and replacing a second hash value in the bifurcation tree in the block chain by the first hash value.
In step S301 shown in fig. 3, the second bundle 2 hash value is the second hash value in the fork tree; correspondingly, in step S401 shown in fig. 4, the first file package 2 hash value is the first hash value in the fork tree; in step S401, the first file compressed package (first file compressed package 2) corresponding to the first hash value (first file compressed package 2 hash value) includes the update file.
The second file compression package (second file compression package 2) corresponding to the second hash value (second file compression package 2 hash value) in step S301 contains the file to be updated with the same file name; namely, replacing a second hash value in a fork tree in a block chain by using the first hash value, wherein a second file compression packet corresponding to the second hash value comprises the file to be updated; further, the bifurcation trees shown in fig. 3 and 4 respectively include 11 hash values; that is, the bifurcated tree includes at least three hash values; it is understood that the bifurcation tree may be a set number of bifurcation trees, such as: binary trees, ten-way trees, one-hundred-way trees, and the like; or an unfixed number of the branched trees, and the specific shape and content of the branched trees are not limited by the invention.
S2: determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree; as shown in fig. 3, in step S302, at least one third hash value (as shown in fig. 3, a third hash value 1, a third hash value 2, and a root hash value) associated with the second hash value (as shown in fig. 3, the third hash value 1 is at a level close to the root hash value with respect to the second hash value (as shown in fig. 3, the second file compressed package 2 hash value) and located at a higher level than the second hash value is determined; with respect to the third hash value 1, the third hash value 2 is at a level close to the root hash value.
S3: obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree; replacing the third hash value corresponding to the position with the fourth hash value;
specifically, as shown in step S402 in fig. 4, according to the determination of the first hash value (e.g., the first file compressed packet 2 hash value shown in fig. 4) and the forking tree structure (e.g., the forking tree shown in fig. 3 or fig. 4), at least one fourth hash value (e.g., the fourth hash value 1 shown in fig. 4) is obtained, where the at least one fourth hash value (e.g., the fourth hash value 1 shown in fig. 4) and the at least one third hash value (e.g., the third hash value 1 shown in fig. 3) are in one-to-one correspondence with each other in the position of the forking tree (e.g., the forking tree shown in fig. 3 or fig. 4) in the forking tree;
it is understood that the method for obtaining at least one fourth hash value (e.g. the fourth hash value 1 shown in fig. 4) is: and generating an intermediate hash value based on the hash value of the first file compression package 2 (i.e. the first hash value) and the hash values of other file compression packages at the same level (level 1), performing block chain chaining on the intermediate hash value, and acquiring a corresponding fourth hash value. The intermediate hash value can be used as a transaction to execute uplink operation, and a hash value returned for the transaction is obtained from the blockchain, wherein the hash value is the fourth hash value; further, an intermediate hash value is generated based on the fourth hash value 1 and the third hash value 3 of the same level, a block chain chaining operation is performed on the intermediate hash value, a corresponding fourth hash value, such as the fourth hash value 2, is obtained, and layer-by-layer iteration is performed until a new root hash value is obtained; further, each of the third hash values corresponding to the position is replaced with each of the fourth hash values, as shown in fig. 4.
From the descriptions of S1-S3, comparing the examples of FIG. 3 and FIG. 4, the tree structure updates the hash value associated with the update file based on the update file, and is a local update for the data of the whole tree structure; that is, the hash values and file compression packages that are not relevant to updating the file remain unchanged; the problem of re-chaining of all related files and file certificates on a block chain caused by updating of a small number of files is partially solved; the efficiency of updating the shared file is improved.
Step S103: and taking the fourth hash value at the highest level as a new root hash value, and sending the new root hash value.
Specifically, the fourth hash value at the highest level is used as a new root hash value (step S404 shown in FIG. 4 corresponds to step S304 shown in FIG. 3); further, the new root hash value is sent; there are two methods for sending the new root hash value: 1) the new root hash value is sent to the acquirer having the authority to acquire the updated shared file through the blockchain; 2) and sending the new root hash value to an acquirer having the authority to acquire the updated shared file through other modes, such as: official e-mails, etc.; it can be understood that, the new root hash value is sent to an acquirer having authority to acquire the updated shared file, where the acquirer having authority may be one or more parties; for example: the update file is a statement generated by the bank A and the bank B within a predefined time range; generating new root hash values after the steps S101-S103, and sending the new root hash values to the bank A and the bank B which have the authority to acquire the updated statement files; obviously, the way of utilizing the new root hash value improves the security of the file.
As shown in fig. 2, an embodiment of the present invention provides a method for obtaining an updated shared file, where the method may include the following steps:
step S201: receiving a root hash value; determining a sub-hash value corresponding to the root hash value; circularly executing the following steps until a file compression package corresponding to the sub-hash value is obtained, wherein the file compression package comprises an updated file; determining that the same file compression package hash value as the sub-hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the sub-hash value from the block chain; a2: and determining a lower-level hash value corresponding to the sub-hash value, and taking the lower-level hash value as the sub-hash value.
Specifically, according to the new root hash value, descriptions of methods for obtaining files in the updated file compression package corresponding to the updated file compression package hash value from the block chain are consistent with the examples described in steps S501 to S501, and are not described again here; further, acquiring the update file in the update file compression package corresponding to the sub-hash value includes: and acquiring an update file compression packet corresponding to the sub-hash value, and performing decompression and decryption operations on the update file compression packet to acquire an update file in the file packet. Specifically, for each acquired file compression packet, decompression and decryption operations are performed, and the decompression and decryption methods correspond to the compression and encryption methods.
As shown in fig. 5, an embodiment of the present invention provides a method for obtaining an updated shared file based on a hash value of a tree structure, where the method may include the following steps:
step S501: based on the received root hash value.
Specifically, a root hash value is received; determining a sub-hash value corresponding to the root hash value; it is to be understood that the root hash value is a new root hash value; as shown in fig. 5, the sub-hash values corresponding to the root hash value (i.e., the new root hash value) are the lower hash value 1 and the lower hash value 2, respectively.
Step S502-step S503: and circularly executing to obtain the lower-level hash value.
The following describes steps of performing the loop through steps S502 to S503 until a file compression package containing an updated file corresponding to the sub hash value is obtained; specifically, as shown in fig. 5, it is first determined whether the corresponding sub-hash value is a hash value of a compressed file packet containing an update file, and for a lower hash value 1: determining that a same file compression package hash value as the sub-hash value (level 2, lower hash value 1) does not exist on the blockchain, the file compression package including an updated file; determining a lower hash value corresponding to the sub-hash value (level 2, lower hash value 1), and regarding the lower hash value as the sub-hash value, for example: and determining the sub-hash values corresponding to the lower hash value 1 as a lower hash value 1 and a lower hash value 2 (belonging to a level 3).
Further judging whether the corresponding sub-hash value is the hash value of the file compression packet containing the updated file; for the lower hash value 2: it is determined that there is no file compression package hash value (the file compression package includes the update file) on the block chain that is the same as the current hash value (level 2: lower level hash value 2), and as can be seen from the example of fig. 5, the lower level hash value 2 of level 2 is the same as the file compression package 2 hash value.
Similarly, further determining the sub-hash values corresponding to the lower hash value 1 (level 2) as the lower hash value 1 (level 3) and the lower hash value 2 (level 3); further, it is determined that a file compression package hash value (update file compression package 2 hash value, the update file compression package including an update file) identical to the current hash value (level 4: lower level hash value 2) exists on the block chain; it can be understood that the traversal operation may stop after the compressed package of the updated file is found; that is, a root hash value is received; determining a sub-hash value corresponding to the root hash value; circularly executing the following steps until a file compression package corresponding to the sub-hash value is obtained, wherein the file compression package comprises an updated file; determining that the same file compression package hash value as the sub-hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the sub-hash value from the block chain; a2: and determining a lower-level hash value corresponding to the sub-hash value, and taking the lower-level hash value as the sub-hash value.
Step S504: and acquiring the update file compression package and the update file.
Specifically, according to the steps S501 to S503, the update file compression package is obtained; further, obtaining the file compression package corresponding to the current hash value includes: acquiring a file compression packet corresponding to the current hash value, and performing decompression and decryption operations on the file compression packet to acquire files in the file compression packet; specifically, for each acquired file compression packet, decompression and decryption operations are performed, and the decompression and decryption methods correspond to the compression and encryption methods.
As shown in fig. 6, an embodiment of the present invention provides a process for updating a shared file, where the process includes the following steps:
as shown in the schematic flow chart of fig. 6, the process of generating and chaining the updated file and the associated hash value is described by using steps S601-S603; the process of acquiring the updated shared file by the updated file acquirer is described with step S604; for example, the chain of the update file may be performed by a bank headquarters, and the update sharing file acquirer may be an enterprise directly related to the update file in business, for example: bank 1, bank 2, bank 3, etc.
Step S601: acquiring an update file, and searching a file to be updated according to the file name of the update file; according to the updated file, a first file compression package is formed, block chain chaining operation is carried out on the first file compression package, and a first hash value corresponding to the first file compression package is obtained from the block chain.
Specifically, the description of the first file compression package containing the update file is consistent with step S101, and is not repeated herein; further, according to the update file, a first file compression package is formed, which includes: and searching a second file package in which the file to be updated is located according to the file name of the updated file, and generating a first file package according to other files and the updated file when the second file package comprises other files except the file to be updated. And further, performing compression and encryption operations on the first file packet to form the first file compressed packet.
Step S602: replacing a second hash value in a branching tree in a block chain by using the first hash value, wherein a second file compression packet corresponding to the second hash value comprises the file to be updated; the bifurcated tree includes at least three hash values; determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree; obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree; and replacing the third hash value corresponding to the position with the fourth hash value.
Specifically, the step S102 is consistent with the description of replacing the compressed package of the update file and the associated hash value, and will not be described herein again.
Step S603: and respectively executing block chain chaining operation on the first hash value and the fourth hash value, taking the fourth hash value with the highest level as a new root hash value, and sending the new root hash value.
Specifically, the description about generating the new root hash value is consistent with step S103, and is not repeated here.
Step S604: receiving a root hash value; determining a sub-hash value corresponding to the root hash value; circularly executing the following steps until a file compression package corresponding to the sub-hash value is obtained, wherein the file compression package comprises an updated file; determining that the same file compression package hash value as the sub-hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the sub-hash value from the block chain; a2: and determining a lower-level hash value corresponding to the sub-hash value, and taking the lower-level hash value as the sub-hash value.
Specifically, the description about obtaining the lower-level hash value corresponding to the updated root hash value according to the updated root hash value is consistent with step S201, and is not repeated here. Further, acquiring the update file in the update file compression package corresponding to the sub-hash value includes: and acquiring an update file compression packet corresponding to the sub-hash value, and performing decompression and decryption operations on the update file compression packet to acquire an update file in the file packet.
As shown in fig. 7, an apparatus 700 for updating a shared file according to an embodiment of the present invention includes: a file update module 701, a hash value update module 702, and a root hash value update module 703; wherein the content of the first and second substances,
the file updating module 701 is configured to obtain an update file, and search for a file to be updated according to a file name of the update file; forming a first file compression package according to the updated file, performing block chain chaining operation on the first file compression package, and acquiring a first hash value corresponding to the first file compression package from a block chain;
the hash value updating module 702 is configured to replace a second hash value in a forking tree in a block chain with the first hash value, where a second file compressed packet corresponding to the second hash value includes the file to be updated; the bifurcated tree includes at least three hash values; determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree; obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree; replacing the third hash value corresponding to the position with the fourth hash value;
the root hash value updating module 703 is configured to use the fourth hash value at the highest level as a new root hash value, and send the new root hash value.
Optionally, the file updating module 701 further includes: and searching a second file package in which the file to be updated is located according to the file name of the updated file, and generating a first file package according to other files and the updated file when the second file package comprises other files except the file to be updated.
Optionally, the file updating module 701 is further configured to perform compression and encryption operations on the first file package to form the first file compressed package.
As shown in fig. 8, an embodiment of the present invention provides an apparatus 800 for updating a shared file, including: an update file acquisition module 801; wherein the content of the first and second substances,
the update file obtaining module 801 is configured to receive a root hash value; determining a sub-hash value corresponding to the root hash value; circularly executing the following steps until a file compression package corresponding to the sub-hash value is obtained, wherein the file compression package comprises an updated file; determining that the same file compression package hash value as the sub-hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the sub-hash value from the block chain; a2: and determining a lower-level hash value corresponding to the sub-hash value, and taking the lower-level hash value as the sub-hash value.
Optionally, the update file obtaining module 801 is further configured to obtain an update file in the update file compressed packet corresponding to the sub hash value, where the update file obtaining module includes: and acquiring an update file compression packet corresponding to the sub-hash value, and performing decompression and decryption operations on the update file compression packet to acquire an update file in the file packet.
An embodiment of the present invention further provides an electronic device for updating a shared file, including: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are enabled to realize the method provided by any one of the above embodiments.
Embodiments of the present invention further provide a computer-readable medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method provided in any of the above embodiments.
Fig. 10 illustrates an exemplary system architecture 1000 to which the method of updating a shared file or the apparatus for updating a shared file of embodiments of the present invention may be applied.
As shown in fig. 10, the system architecture 1000 may include terminal devices 1001, 1002, 1003, a network 1004, and a server 1005. The network 1004 is used to provide a medium for communication links between the terminal devices 1001, 1002, 1003 and the server 1005. Network 1004 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 1001, 1002, 1003 to interact with a server 1005 via a network 1004 to receive or transmit messages or the like. Various client applications, such as an enterprise application client, a web browser application, a search-type application, an instant messenger, a mailbox client, etc., may be installed on the terminal devices 1001, 1002, 1003.
The terminal devices 1001, 1002, 1003 may be various electronic devices having a display screen and supporting the running of various client applications, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 1005 may be a server that provides various services, such as a background management server that supports a request for acquiring an update file made by a user using the terminal device 1001, 1002, 1003. The background management server can uplink and store the update file to be shared, process the request for acquiring the update file, and return the file to the terminal device.
It should be noted that the method for updating a shared file provided by the embodiment of the present invention is generally executed by the server 1005, and accordingly, the apparatus for updating a shared file is generally disposed in the server 1005.
It should be understood that the number of terminal devices, networks, and servers in fig. 10 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 11, shown is a block diagram of a computer system 1100 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 11 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 11, the computer system 1100 includes a Central Processing Unit (CPU)1101, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)1102 or a program loaded from a storage section 1108 into a Random Access Memory (RAM) 1103. In the RAM 1103, various programs and data necessary for the operation of the system 1100 are also stored. The CPU 1101, ROM 1102, and RAM 1103 are connected to each other by a bus 1104. An input/output (I/O) interface 1105 is also connected to bus 1104.
The following components are connected to the I/O interface 1105: an input portion 1106 including a keyboard, mouse, and the like; an output portion 1107 including a signal output unit such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and a speaker; a storage section 1108 including a hard disk and the like; and a communication section 1109 including a network interface card such as a LAN card, a modem, or the like. The communication section 1109 performs communication processing via a network such as the internet. A driver 1110 is also connected to the I/O interface 1105 as necessary. A removable medium 1111 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1110 as necessary, so that a computer program read out therefrom is mounted into the storage section 1108 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication portion 1109 and/or installed from the removable medium 1111. The above-described functions defined in the system of the present invention are executed when the computer program is executed by a Central Processing Unit (CPU) 1101.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules and/or units described in the embodiments of the present invention may be implemented by software, and may also be implemented by hardware. The described modules and/or units may also be provided in a processor, and may be described as: a processor includes a file update module, a hash value update module, and a root hash value update module; the names of these modules do not in some cases constitute a limitation on the modules themselves, and for example, the root hash value update module may also be described as a "module that generates a new root hash value based on an update file and replaces the original root hash value". It can also be described as: a processor includes a get update file module; for example, the module for obtaining the update file may be further described as a "module for obtaining a root hash value on a blockchain, determining a hash value of a compressed file package, and obtaining an update file included in the compressed file package according to the hash value of the compressed file package".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: acquiring an update file, and searching a file to be updated according to the file name of the update file; forming a first file compression package according to the updated file, performing block chain chaining operation on the first file compression package, and acquiring a first hash value corresponding to the first file compression package from a block chain; replacing a second hash value in a branching tree in a block chain by using the first hash value, wherein a second file compression packet corresponding to the second hash value comprises the file to be updated; the bifurcated tree includes at least three hash values; determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree; obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree; replacing the third hash value corresponding to the position with the fourth hash value; and taking the fourth hash value at the highest level as a new root hash value, and sending the new root hash value.
Receiving a root hash value; determining a sub-hash value corresponding to the root hash value; circularly executing the following steps until a file compression package corresponding to the sub-hash value is obtained, wherein the file compression package comprises an updated file; determining that the same file compression package hash value as the sub-hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the sub-hash value from the block chain; a2: and determining a lower-level hash value corresponding to the sub-hash value, and taking the lower-level hash value as the sub-hash value.
According to the technical scheme of the embodiment of the invention, the problems of relative nodes on a block chain and file storage certificate re-chaining caused by updating a small amount of files are partially solved, the network resource burden is saved, and the efficiency of updating shared files is improved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method of updating a shared file, comprising:
acquiring an update file, and searching a file to be updated according to the file name of the update file;
forming a first file compression package according to the updated file, performing block chain chaining operation on the first file compression package, and acquiring a first hash value corresponding to the first file compression package from a block chain;
replacing a second hash value in a branching tree in a block chain by using the first hash value, wherein a second file compression packet corresponding to the second hash value comprises the file to be updated;
the bifurcated tree includes at least three hash values;
determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree;
obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree;
replacing the third hash value corresponding to the position with the fourth hash value; and taking the fourth hash value at the highest level as a new root hash value, and sending the new root hash value.
2. The method of claim 1,
forming a first file compression package according to the updated file, comprising:
and searching a second file package in which the file to be updated is located according to the file name of the updated file, and generating a first file package according to other files and the updated file when the second file package comprises other files except the file to be updated.
3. The method of claim 2,
and performing compression and encryption operations on the first file packet to form the first file compressed packet.
4. A method of updating a shared file, comprising:
receiving a root hash value; determining a sub-hash value corresponding to the root hash value;
circularly executing the following steps until a file compression package corresponding to the sub-hash value is obtained, wherein the file compression package comprises an updated file;
determining that the same file compression package hash value as the sub-hash value exists on the block chain, and if so, executing A1; otherwise, executing A2;
a1: acquiring a file compression packet corresponding to the sub-hash value from the block chain;
a2: and determining a lower-level hash value corresponding to the sub-hash value, and taking the lower-level hash value as the sub-hash value.
5. The method of claim 4,
acquiring the update file in the update file compression package corresponding to the sub-hash value, including:
and acquiring an update file compression packet corresponding to the sub-hash value, and performing decompression and decryption operations on the update file compression packet to acquire an update file in the file packet.
6. An apparatus for updating a shared file, comprising: the file updating module, the hash value updating module and the root hash value updating module; wherein the content of the first and second substances,
the file updating module is used for acquiring an updating file and searching a file to be updated according to the file name of the updating file; forming a first file compression package according to the updated file, performing block chain chaining operation on the first file compression package, and acquiring a first hash value corresponding to the first file compression package from a block chain;
the hash value updating module is configured to replace a second hash value in a branching tree in a block chain with the first hash value, where a second file compressed packet corresponding to the second hash value includes the file to be updated; the bifurcated tree includes at least three hash values; determining at least one third hash value which is associated with the second hash value and is positioned at the upper level of the second hash value in the fork tree according to the structure of the fork tree; the upper level is a level close to the root hash value in the bifurcated tree; obtaining at least one fourth hash value according to the first hash value and the structure of the bifurcation tree, wherein the at least one fourth hash value is in one-to-one correspondence with the position of the at least one third hash value in the bifurcation tree; replacing the third hash value corresponding to the position with the fourth hash value;
and the root hash value updating module is used for taking the fourth hash value at the highest level as a new root hash value and sending the new root hash value.
7. An apparatus for updating a shared file, comprising: acquiring an update file module; wherein the content of the first and second substances,
the update file acquisition module is used for receiving a root hash value; determining a sub-hash value corresponding to the root hash value;
circularly executing the following steps until a file compression package corresponding to the sub-hash value is obtained, wherein the file compression package comprises an updated file; determining that the same file compression package hash value as the sub-hash value exists on the block chain, and if so, executing A1; otherwise, executing A2; a1: acquiring a file compression packet corresponding to the sub-hash value from the block chain; a2: and determining a lower-level hash value corresponding to the sub-hash value, and taking the lower-level hash value as the sub-hash value.
8. A system for updating a shared file, comprising: the apparatus for sharing files of claim 6, and the apparatus for sharing files of claim 7.
9. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-3 or claims 4-5.
10. A computer-readable medium, on which a computer program is stored, which program, when being executed by a processor, is adapted to carry out the method of any one of claims 1-3 or 4-5.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010773252.3A CN111984616B (en) | 2020-08-04 | 2020-08-04 | Method, device and system for updating shared file |
| PCT/CN2021/110599 WO2022028486A1 (en) | 2020-08-04 | 2021-08-04 | File sharing method, device, and system |
| EP21852328.0A EP4180984A1 (en) | 2020-08-04 | 2021-08-04 | File sharing method, device, and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010773252.3A CN111984616B (en) | 2020-08-04 | 2020-08-04 | Method, device and system for updating shared file |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111984616A true CN111984616A (en) | 2020-11-24 |
| CN111984616B CN111984616B (en) | 2023-08-01 |
Family
ID=73445459
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010773252.3A Active CN111984616B (en) | 2020-08-04 | 2020-08-04 | Method, device and system for updating shared file |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111984616B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022028486A1 (en) * | 2020-08-04 | 2022-02-10 | 中国人民银行数字货币研究所 | File sharing method, device, and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018070783A2 (en) * | 2016-10-11 | 2018-04-19 | 주식회사 코인플러그 | Method for issuing, redeeming, refunding, settling and revoking electronic voucher on basis of utxo and by using merkle tree structure, and server employing same |
| CN110516206A (en) * | 2019-07-23 | 2019-11-29 | 平安科技（深圳）有限公司 | File comparison method, device, computer equipment and storage medium |
| CN110941672A (en) * | 2019-11-21 | 2020-03-31 | 腾讯科技（深圳）有限公司 | Household registration management method, device, equipment and storage medium |
| US20200112437A1 (en) * | 2018-10-09 | 2020-04-09 | International Business Machines Corporation | Certifying authenticity of data modifications |
| CN110998558A (en) * | 2017-08-11 | 2020-04-10 | 国际商业机器公司 | Delayed update of database hash codes in block chains |
-
2020
- 2020-08-04 CN CN202010773252.3A patent/CN111984616B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018070783A2 (en) * | 2016-10-11 | 2018-04-19 | 주식회사 코인플러그 | Method for issuing, redeeming, refunding, settling and revoking electronic voucher on basis of utxo and by using merkle tree structure, and server employing same |
| CN110998558A (en) * | 2017-08-11 | 2020-04-10 | 国际商业机器公司 | Delayed update of database hash codes in block chains |
| US20200112437A1 (en) * | 2018-10-09 | 2020-04-09 | International Business Machines Corporation | Certifying authenticity of data modifications |
| CN110516206A (en) * | 2019-07-23 | 2019-11-29 | 平安科技（深圳）有限公司 | File comparison method, device, computer equipment and storage medium |
| CN110941672A (en) * | 2019-11-21 | 2020-03-31 | 腾讯科技（深圳）有限公司 | Household registration management method, device, equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 赵洋;任化强;熊虎;陈阳;: "基于更新树的动态云数据审计方案", 信息网络安全, no. 12, pages 1 - 7 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022028486A1 (en) * | 2020-08-04 | 2022-02-10 | 中国人民银行数字货币研究所 | File sharing method, device, and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111984616B (en) | 2023-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109146490B (en) | Block generation method, device and system | |
| CN110019080B (en) | Data access method and device | |
| CN111612388A (en) | Method and device for merging target orders | |
| CN110858202A (en) | Method and device for generating where clause in database query statement | |
| CN110572422A (en) | Data downloading method and device | |
| CN110753020A (en) | Network request processing method and device | |
| CN112947919A (en) | Method and device for constructing service model and processing service request | |
| CN111984616A (en) | Method, device and system for updating shared file | |
| CN113536748A (en) | Method and device for generating chart data | |
| EP4180985A1 (en) | File sharing method, apparatus, and system | |
| CN111382953A (en) | Dynamic process generation method and device | |
| CN111161072A (en) | Block chain-based random number generation method, equipment and storage medium | |
| CN111984613B (en) | Method, device and system for sharing files | |
| CN110705935B (en) | Logistics document processing method and device | |
| CN111984614B (en) | Method, device and system for sharing files | |
| CN111984612B (en) | Method, device and system for sharing files | |
| CN112257039B (en) | Identity attribute adding method and device and electronic equipment | |
| CN112836201A (en) | Method, device, equipment and computer readable medium for multi-platform information intercommunication | |
| CN112099841A (en) | Method and system for generating configuration file | |
| CN109657481B (en) | Data management method and device | |
| CN111737218A (en) | File sharing method and device | |
| CN113761566A (en) | Data processing method and device | |
| CN111984615B (en) | File sharing method, device and system | |
| CN113472565B (en) | Method, apparatus, device and computer readable medium for expanding server function | |
| CN110262756B (en) | Method and device for caching data |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |