CN109634932B - Intelligent contract storage method and storage system - Google Patents
Intelligent contract storage method and storage system Download PDFInfo
- Publication number
- CN109634932B CN109634932B CN201811457208.0A CN201811457208A CN109634932B CN 109634932 B CN109634932 B CN 109634932B CN 201811457208 A CN201811457208 A CN 201811457208A CN 109634932 B CN109634932 B CN 109634932B
- Authority
- CN
- China
- Prior art keywords
- intelligent contract
- storage
- data blocks
- data block
- data
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000005192 partition Methods 0.000 claims abstract description 68
- 238000013507 mapping Methods 0.000 claims abstract description 27
- 230000011218 segmentation Effects 0.000 claims description 4
- 238000004590 computer program Methods 0.000 description 8
- 238000004422 calculation algorithm Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000013500 data storage Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000013508 migration Methods 0.000 description 1
- 230000005012 migration Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to an intelligent contract storage method and a storage system, wherein the intelligent contract storage method comprises the following steps: cutting the intelligent contract file into a plurality of data blocks; acquiring the number of each data block; establishing a mapping index table of data blocks and data block numbers, and storing the mapping index table in a block chain; allocating all data blocks into a plurality of given partitions; and storing the data blocks in each given partition in a plurality of storage devices corresponding to each given partition. The intelligent contract storage method and the storage system only store the mapping index table of the intelligent contract on the block chain, store one intelligent contract in an out-of-chain distributed storage mode, do not occupy the data space of the block chain, do not have the data redundancy problem caused by storing a large number of intelligent contracts, ensure the storage safety and privacy and ensure the consistency of the results of executing the intelligent contracts by each node.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to an intelligent contract storage method and an intelligent contract storage system.
Background
An intelligent contract refers to a set of commitments defined in digital form, including agreements on which contract participants can execute the commitments. The block chain technology has the characteristics of data decentralization, transparency, non-falsification, high reliability and the like, and provides an ideal basis for realizing and supporting the efficient operation of the intelligent contract.
From the technical point of view and the operation mode, the intelligent contract can be regarded as a contract recorded in a digital code form, and meanwhile, the trigger condition contained in the contract is saved. And when the trigger condition is met, the intelligent appointment system automatically identifies the trigger condition and sends out preset data resources, and the result is executed according to a preset program.
Currently, the intelligent contract is generally saved repeatedly as blockchain data of each node, that is, directly stored on the blockchain or some associated information (hash, path, etc.) of the intelligent contract is stored.
The existing intelligent contract storage mode has the following defects that firstly, each node intelligent contract has a large amount of redundancy, and the storage space occupied by block chain data is increased; and secondly, if the individual node intelligent contracts are damaged and lost, the problem that the execution results of the intelligent contracts of all the nodes are inconsistent occurs.
Therefore, an intelligent contract storage method and a storage system are provided.
Disclosure of Invention
In view of the above problems, the present invention is proposed to provide an intelligent contract storage method and a storage system that overcome or at least partially solve the above problems, and can solve the problems of data redundancy and inconsistent intelligent contract execution results of each node.
According to one aspect of the invention, an intelligent contract storage method is provided, which comprises the following steps:
cutting the intelligent contract file into a plurality of data blocks;
acquiring the number of each data block;
establishing a mapping index table of data blocks and data block numbers, and storing the mapping index table in a block chain;
allocating all data blocks into a plurality of given partitions;
and storing the data blocks in each given partition in a plurality of storage devices corresponding to each given partition.
Further, the plurality of storage devices comprise a plurality of copies, and the plurality of copies are distributed in different fault domains;
after the data blocks in each given partition are stored in the plurality of storage devices corresponding to each given partition, the method further includes:
and backing up the data blocks stored in the plurality of storage devices into the plurality of copies.
Further, the intelligent contract storage method further includes: drawing a tree structure according to a host where each storage device is located, a rack where the host is located and a machine room where the rack is located, and filling fault-tolerant rules into the tree structure to generate a tree logic structure of the storage devices;
the step of storing the data blocks in each given partition in a plurality of storage devices corresponding to each given partition includes:
sending a given partition positioning request to a database, and sequentially selecting a machine room, a machine frame in the machine room, a server on the machine frame and storage equipment in the server corresponding to each given partition according to a positioning result fed back by the database;
the data blocks in each given partition are stored in the selected storage device.
Further, the step of obtaining the number of each data block includes:
acquiring a hash value of the intelligent contract file;
acquiring the generation sequence number of each data block when the intelligent contract file is cut;
and combining the hash value of the intelligent contract file and the generation sequence number of each data block into a number of each data block.
Further, the step of cutting the intelligent contract file into a plurality of data blocks comprises:
and cutting the intelligent contract file into a plurality of data blocks according to the maximum size of the data which can be stored in the plurality of storage devices.
According to another aspect of the present invention, there is provided an intelligent contract storage system of the above method, including:
the intelligent contract file cutting module is used for cutting the intelligent contract file into a plurality of data blocks;
the data block number acquisition module is used for acquiring the number of each data block;
the mapping index table establishing module is used for establishing a mapping index table of data blocks and data block numbers and storing the mapping index table in a block chain;
a data block allocation module for allocating all data blocks into a plurality of given partitions;
and the data block storage module is used for storing the data blocks in the given partitions into a plurality of storage devices corresponding to the given partitions.
Further, in the data block storage module, the plurality of storage devices comprise a plurality of copies, and the plurality of copies are distributed in different fault domains;
the data block storage module is further configured to backup the data blocks stored in the plurality of storage devices to the plurality of copies.
Further, the intelligent contract storage system further includes: the storage equipment tree-shaped logical structure generating module is used for drawing a tree-shaped structure according to a host where each storage equipment is located, a rack where the host is located and a machine room where the rack is located, filling fault-tolerant rules into the tree-shaped structure and generating the storage equipment tree-shaped logical structure;
in a data block storage module, comprising:
the selection unit is used for sending a given partition positioning request to the database and sequentially selecting a machine room, a machine frame in the machine room, a server on the machine frame and storage equipment in the server corresponding to each given partition according to a positioning result fed back by the database;
and the storage unit is used for storing the data blocks in the given partitions in the selected storage device.
Further, the data block number obtaining module includes:
the hash value acquisition unit is used for acquiring the hash value of the intelligent contract file;
a segmentation sequence number obtaining unit, configured to obtain a generation sequence number of each data block when the intelligent contract file is segmented;
and the data block number obtaining unit is used for combining the hash value of the intelligent contract file and the generation sequence number of each data block into a data block number.
Further, in the intelligent contract file cutting module, the intelligent contract file cutting module is specifically configured to cut the intelligent contract file into a plurality of data blocks according to the maximum size of the storable data in the plurality of storage devices.
Compared with the prior art, the invention has the following advantages:
1. the intelligent contract storage method and the storage system only store the mapping index table on the block chain, and store the intelligent contracts outside the chain, so that the data space of the block chain is not occupied, and the problem of data redundancy caused by storing a large number of intelligent contracts is avoided;
2. the intelligent contract storage method and the intelligent contract storage system adopt a distributed storage technology to ensure the safety and the privacy of the intelligent contract and are not tampered;
3. according to the intelligent contract storage method and the intelligent contract storage system, each node on the block chain reads and executes an intelligent contract through the mapping index table, once the intelligent contract cannot be read, all the nodes fail, and the results of the intelligent contract execution of each node are consistent.
Drawings
The invention is further illustrated by the following figures and examples.
FIG. 1 is a flow chart of an intelligent contract storage method provided by an embodiment of the invention;
fig. 2 is a schematic structural diagram of an intelligent contract storage system provided by an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
The invention records the hash value of the intelligent contract on the block chain, and adopts the distributed storage network which takes the hash value as the index to store the complete intelligent contract code. The blockchain network only keeps one copy of the intelligent contract, so that a large amount of intelligent contract data redundancy does not exist.
Fig. 1 is a flowchart of an intelligent contract storage method according to an embodiment of the present invention, and referring to fig. 1, the intelligent contract storage method according to the embodiment of the present invention includes the following steps:
102, acquiring the number of each data block;
103, establishing a mapping index table of data blocks and data block numbers, and storing the mapping index table in a block chain;
and 105, storing the data blocks in each given partition in a plurality of storage devices corresponding to each given partition.
Wherein the blockchain node, the given partition, and the storage device form a storage path.
The intelligent contract storage method only stores the mapping index table on the block chain, and stores the intelligent contracts outside the chain, so that the data space of the block chain is not occupied, and the problem of data redundancy caused by storing a large number of intelligent contracts is solved.
Wherein the plurality of storage devices may be all or a range of network nodes. In this case, only one copy of the same intelligent contract is required to be stored in the blockchain network, and the copy is divided into a plurality of data blocks and distributed and stored on all or a certain range of network nodes. When the intelligent contract needs to be executed, the codes are loaded from the outside of the chain through a uniform method.
Before storing the data blocks on each given partition in the plurality of storage devices, the intelligent contract storage method provided by the embodiment of the invention further includes: and obtaining a storage device list according to the given partition sequence number.
In practical applications, a storage device list may be obtained by a flush algorithm (the flush algorithm is a controlled-copy distributed hash algorithm used by the distributed storage system Ceph) according to a given partition number. And then screening, and finding out storage equipment meeting the requirements according to the number of the copies for data storage. The method has two advantages, namely, the data storage position is obtained by calculation without inquiring a metadata server, and decentralized distributed storage is completely realized; and secondly, the problem of data migration caused by the addition and deletion of the storage equipment in the processing of the common hash algorithm is effectively solved.
It is noted that distributed storage technology based on IPFS can also be adopted to realize the off-chain storage of the intelligent contracts.
In particular, a given partition is used to organize and map the storage of data blocks.
In order to backup the database, the plurality of storage devices comprise a plurality of copies, and the plurality of copies are distributed in different fault domains, so that the plurality of copies are isolated from each other, the data block is prevented from being unreadable by the intelligent contract due to damage of the storage device in one copy, and the storage safety of the intelligent contract is improved.
After the data blocks in each given partition are stored in the plurality of storage devices corresponding to each given partition, the method further includes:
and backing up the data blocks stored in the plurality of storage devices into the plurality of copies.
The intelligent contract storage method further comprises the following steps: drawing a tree structure according to a host where each storage device is located, a rack where the host is located and a machine room where the rack is located, and filling fault-tolerant rules into the tree structure to generate a tree logic structure of the storage devices; the step of storing the data blocks in each given partition in a plurality of storage devices corresponding to each given partition includes: sending a given partition positioning request to a database, and sequentially selecting a machine room, a machine frame in the machine room, a server on the machine frame and storage equipment in the server corresponding to each given partition according to a positioning result fed back by the database; the data blocks in each given partition are stored in the selected storage device. The storage device tree logic structure implies failure regions, for example, different racks using different power supplies belong to different failure domains, so that the sink can place copies in different failure domains according to certain rules.
Specifically, the storage device tree logic structure describes a map of the current system resource state, i.e. the logical location of the hard disk distribution. All hardware resources are combined into a tree structure, and then a logical tree structure is generated according to fault-tolerant rules. Wherein child nodes are real storage devices, each device has a number and a weight, and intermediate nodes are containers of devices, such as one cabinet, one rack, one room, and so on. Secondly, storage rules, such as distribution limitation conditions of data and backup requirements, need to be specified for the bus. Each rule represents a series of operations such as selecting a container and committing, etc.
Further, the step of obtaining the number of each data block includes:
acquiring a hash value of the intelligent contract file;
acquiring the generation sequence number of each data block when the intelligent contract file is cut;
and combining the hash value of the intelligent contract file and the generation sequence number of each data block into a number of each data block.
The step of obtaining the number of each data block can ensure that the number of each data block is different, so as to ensure the accuracy of the index.
Further, the step of cutting the intelligent contract file into a plurality of data blocks comprises:
and cutting the intelligent contract file into a plurality of data blocks according to the maximum size of the data which can be stored in the plurality of storage devices.
Specifically, the file is segmented according to the size of the largest storable object, the object generated after each segmentation obtains a unique number, and the object number are subjected to linear mapping. Each object is independently mapped to a given partition. And obtaining the hash value of the object number according to a static hash function specified by the system, such as a division residue remaining method, mapping the object number into a pseudo-random number value which is approximately uniformly distributed, and carrying out bit-wise AND on the pseudo-random number value and a mask to obtain the serial number of the given partition. And obtaining a storage device list through the given partition sequence number. Collectively, these several storage devices are responsible for storing and maintaining all of the storage objects in a given partition. And finding the storage equipment meeting the requirements, namely storing and reading the object data.
The intelligent contract storage method only stores the mapping index table on the block chain, and stores the intelligent contracts outside the chain, so that the data space of the block chain is not occupied, and the problem of data redundancy caused by storing a large number of intelligent contracts is solved.
For simplicity of explanation, the method embodiments are described as a series of acts or combinations, but those skilled in the art will appreciate that the embodiments are not limited by the order of acts described, as some steps may occur in other orders or concurrently with other steps in accordance with the embodiments of the invention. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no particular act is required to implement the invention.
Fig. 2 is a block diagram of an intelligent contract storage system according to an embodiment of the present invention, and referring to fig. 2, an intelligent contract storage system according to an embodiment of the present invention includes:
an intelligent contract file cutting module 201, configured to cut an intelligent contract file into a plurality of data blocks;
a data block number obtaining module 202, configured to obtain a number of each data block;
a mapping index table establishing module 203, configured to establish a mapping index table of data blocks and data block numbers, and store the mapping index table in a block chain;
a data block allocation module 204 for allocating all data blocks into a plurality of given partitions;
and a data block storage module 205, configured to store the data blocks in each given partition in a plurality of storage devices corresponding to each given partition.
The intelligent contract storage system only stores the mapping index table on the block chain, and stores the intelligent contracts outside the chain, so that the data space of the block chain is not occupied, and the problem of data redundancy caused by storing a large number of intelligent contracts is solved.
Further, in the data block storage module, the plurality of storage devices comprise a plurality of copies, and the plurality of copies are distributed in different fault domains;
the data block storage module is further configured to backup the data blocks stored in the plurality of storage devices to the plurality of copies.
Further, the intelligent contract storage system further includes: the storage equipment tree-shaped logical structure generating module is used for drawing a tree-shaped structure according to a host where each storage equipment is located, a rack where the host is located and a machine room where the rack is located, filling fault-tolerant rules into the tree-shaped structure and generating the storage equipment tree-shaped logical structure;
in a data block storage module, comprising:
the selection unit is used for sending a given partition positioning request to the database and sequentially selecting a machine room, a machine frame in the machine room, a server on the machine frame and storage equipment in the server corresponding to each given partition according to a positioning result fed back by the database;
and the storage unit is used for storing the data blocks in the given partitions in the selected storage device.
Further, the data block number obtaining module includes:
the hash value acquisition unit is used for acquiring the hash value of the intelligent contract file;
a segmentation sequence number obtaining unit, configured to obtain a generation sequence number of each data block when the intelligent contract file is segmented;
and the data block number obtaining unit is used for combining the hash value of the intelligent contract file and the generation sequence number of each data block into a data block number.
Further, in the intelligent contract file cutting module, the intelligent contract file cutting module is specifically configured to cut the intelligent contract file into a plurality of data blocks according to the maximum size of the storable data in the plurality of storage devices.
For the system embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.
The invention applies a distributed storage technology to store and read the intelligent contract, reduces data redundancy and improves efficiency and consistency. It is required that only one copy of the same intelligent contract is kept in a blockchain network, and the copy is divided into a plurality of data blocks which are distributed and kept on all or a certain range of network nodes. When the intelligent contract needs to be executed, the codes are loaded from the outside of the chain through a uniform method.
An embodiment of the present invention further provides an intelligent contract execution system, including a processor, a memory, and a computer program stored on the memory and operable on the processor, where the computer program implements the following steps when executed by the processor:
cutting the intelligent contract file into a plurality of data blocks;
acquiring the number of each data block;
establishing a mapping index table of data blocks and data block numbers, and storing the mapping index table in a block chain;
allocating all data blocks into a plurality of given partitions;
and storing the data blocks in each given partition in a plurality of storage devices corresponding to each given partition.
Optionally, the plurality of storage devices include a plurality of copies, and the plurality of copies are distributed in different fault domains; the computer program when executed by the processor further implements the steps of:
and backing up the data blocks stored in the plurality of storage devices into the plurality of copies.
Optionally, the computer program further implements the following steps when executed by the processor:
drawing a tree structure according to a host where each storage device is located, a rack where the host is located and a machine room where the rack is located, and filling fault-tolerant rules into the tree structure to generate a tree logic structure of the storage devices; sending a given partition positioning request to a database, and sequentially selecting a machine room, a machine frame in the machine room, a server on the machine frame and storage equipment in the server corresponding to each given partition according to a positioning result fed back by the database; the data blocks in each given partition are stored in the selected storage device.
Optionally, the computer program further implements the following steps when executed by the processor:
acquiring a hash value of the intelligent contract file; acquiring the generation sequence number of each data block when the intelligent contract file is cut; and combining the hash value of the intelligent contract file and the generation sequence number of each data block into a number of each data block.
Optionally, the computer program further implements the following steps when executed by the processor:
and cutting the intelligent contract file into a plurality of data blocks according to the maximum size of the data which can be stored in the plurality of storage devices.
An embodiment of the present invention provides a computer-readable storage medium, where a computer program is stored, where the computer program, when executed by a processor, implements each process of the foregoing intelligent contract execution method embodiment, and can achieve the same technical effect, and details are not described here to avoid repetition. The computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal (such as a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
The above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (6)
1. An intelligent contract storage method, comprising the steps of:
cutting the intelligent contract file into a plurality of data blocks;
acquiring the number of each data block;
establishing a mapping index table of data blocks and data block numbers, and storing the mapping index table in a block chain;
allocating all data blocks into a plurality of given partitions;
storing the data blocks in each given partition in a plurality of storage devices corresponding to each given partition;
before storing the data blocks on each given partition in the plurality of storage devices, further comprising:
obtaining a storage device list according to the given partition sequence number;
the plurality of storage devices comprise a plurality of copies, and the plurality of copies are distributed in different fault domains;
after the data blocks in each given partition are stored in the plurality of storage devices corresponding to each given partition, the method further includes:
backing up data blocks stored in the plurality of storage devices into the plurality of copies;
further comprising: drawing a tree structure according to a host where each storage device is located, a rack where the host is located and a machine room where the rack is located, and filling fault-tolerant rules into the tree structure to generate a tree logic structure of the storage devices;
the step of storing the data blocks in each given partition in a plurality of storage devices corresponding to each given partition includes:
sending a given partition positioning request to a database, and sequentially selecting a machine room, a machine frame in the machine room, a server on the machine frame and storage equipment in the server corresponding to each given partition according to a positioning result fed back by the database;
storing the data blocks in each given partition in a selected storage device;
the step of obtaining the number of each data block comprises the following steps:
acquiring a hash value of the intelligent contract file;
acquiring the generation sequence number of each data block when the intelligent contract file is cut;
combining the hash value of the intelligent contract file and the generation serial number of each data block into a serial number of each data block;
the step of cutting the intelligent contract file into a plurality of data blocks comprises the following steps:
and cutting the intelligent contract file into a plurality of data blocks according to the maximum size of the data which can be stored in the plurality of storage devices.
2. An intelligent contract storage system implementing the method of claim 1, comprising:
the intelligent contract file cutting module is used for cutting the intelligent contract file into a plurality of data blocks;
the data block number acquisition module is used for acquiring the number of each data block;
the mapping index table establishing module is used for establishing a mapping index table of data blocks and data block numbers and storing the mapping index table in a block chain;
a data block allocation module for allocating all data blocks into a plurality of given partitions;
and the data block storage module is used for storing the data blocks in the given partitions into a plurality of storage devices corresponding to the given partitions.
3. The intelligent contract storage system of claim 2, wherein in the data block storage module, the plurality of storage devices comprise a plurality of copies, the plurality of copies being distributed over different failure domains;
the data block storage module is further configured to backup the data blocks stored in the plurality of storage devices to the plurality of copies.
4. The intelligent contract storage system of claim 3, further comprising: the storage equipment tree-shaped logical structure generating module is used for drawing a tree-shaped structure according to a host where each storage equipment is located, a rack where the host is located and a machine room where the rack is located, filling fault-tolerant rules into the tree-shaped structure and generating the storage equipment tree-shaped logical structure;
in a data block storage module, comprising:
the selection unit is used for sending a given partition positioning request to the database and sequentially selecting a machine room, a machine frame in the machine room, a server on the machine frame and storage equipment in the server corresponding to each given partition according to a positioning result fed back by the database;
and the storage unit is used for storing the data blocks in the given partitions in the selected storage device.
5. The intelligent contract storage system of claim 2, wherein the data block number obtaining module comprises:
the hash value acquisition unit is used for acquiring the hash value of the intelligent contract file;
a segmentation sequence number obtaining unit, configured to obtain a generation sequence number of each data block when the intelligent contract file is segmented;
and the data block number obtaining unit is used for combining the hash value of the intelligent contract file and the generation sequence number of each data block into a data block number.
6. The intelligent contract storage system of claim 2, wherein in the intelligent contract file splitting module, the intelligent contract file splitting module is specifically configured to split the intelligent contract file into a plurality of data blocks according to a maximum size of data storable in the plurality of storage devices.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811457208.0A CN109634932B (en) | 2018-11-30 | 2018-11-30 | Intelligent contract storage method and storage system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811457208.0A CN109634932B (en) | 2018-11-30 | 2018-11-30 | Intelligent contract storage method and storage system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109634932A CN109634932A (en) | 2019-04-16 |
| CN109634932B true CN109634932B (en) | 2021-03-23 |
Family
ID=66070480
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811457208.0A Expired - Fee Related CN109634932B (en) | 2018-11-30 | 2018-11-30 | Intelligent contract storage method and storage system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109634932B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110188097A (en) * | 2019-04-19 | 2019-08-30 | 阿里巴巴集团控股有限公司 | The storage of intelligent contract, execution method and device and electronic equipment in block chain |
| CN110083606B (en) * | 2019-04-25 | 2021-06-08 | 深圳市豪斯莱科技有限公司 | Cross-chain storage method, terminal and storage medium |
| CN110297812A (en) * | 2019-06-13 | 2019-10-01 | 深圳市比比赞科技有限公司 | File memory method, the method for file synchronization, computer equipment and storage medium |
| CN111835808B (en) * | 2019-08-01 | 2023-11-14 | 北京骑胜科技有限公司 | Data storage method and device, data reading method and device, and storage medium |
| CN110489421B (en) * | 2019-08-22 | 2023-11-14 | 腾讯科技（深圳）有限公司 | Data storage method, apparatus, computer readable storage medium and computer device |
| CN110737658B (en) * | 2019-09-06 | 2020-12-18 | 平安国际智慧城市科技股份有限公司 | Data fragment storage method, device, terminal and readable storage medium |
| CN111222160B (en) * | 2019-12-30 | 2022-07-29 | 联动优势科技有限公司 | Intelligent contract execution method and system |
| CN111061698B (en) * | 2019-12-30 | 2023-09-05 | 语联网（武汉）信息技术有限公司 | Method and device for storing Ethernet contract data |
| CN111258725B (en) * | 2020-01-17 | 2023-07-25 | 北京百度网讯科技有限公司 | Data processing method, device, equipment and medium based on block chain |
| CN111541753B (en) * | 2020-04-16 | 2024-02-27 | 深圳市迅雷网络技术有限公司 | Distributed storage system, method, computer device and medium for block chain data |
| CN111950025A (en) * | 2020-08-21 | 2020-11-17 | 安徽高山科技有限公司 | File distributed storage method based on block chain intelligent contract |
| CN113220505B (en) * | 2021-05-26 | 2024-09-10 | 成都易我科技开发有限责任公司 | Backup mirror image data management method, device, system and storage medium |
| CN114091111B (en) * | 2021-09-09 | 2022-11-18 | 深圳前海微众银行股份有限公司 | Method and device for storing intelligent contracts of block chains |
| CN114168159A (en) * | 2021-12-14 | 2022-03-11 | 深圳前海微众银行股份有限公司 | Intelligent contract deployment method, transaction method and device and electronic equipment |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102779180B (en) * | 2012-06-29 | 2015-09-09 | 华为技术有限公司 | The operation processing method of data-storage system, data-storage system |
| US8862847B2 (en) * | 2013-02-08 | 2014-10-14 | Huawei Technologies Co., Ltd. | Distributed storage method, apparatus, and system for reducing a data loss that may result from a single-point failure |
| CN106682215B (en) * | 2016-12-30 | 2020-04-28 | 华为技术有限公司 | Data processing method and management node |
| CN108062202A (en) * | 2017-12-15 | 2018-05-22 | 中链科技有限公司 | A kind of file block storage method and system |
| CN108256076B (en) * | 2018-01-18 | 2022-04-01 | 广州大学 | Distributed mass data processing method and device |
| CN108509514A (en) * | 2018-03-09 | 2018-09-07 | 史玉成 | A kind of big data analysis method and system based on block chain |
| CN108664223B (en) * | 2018-05-18 | 2021-07-02 | 百度在线网络技术（北京）有限公司 | Distributed storage method and device, computer equipment and storage medium |
-
2018
- 2018-11-30 CN CN201811457208.0A patent/CN109634932B/en not_active Expired - Fee Related
Non-Patent Citations (2)
| Title |
|---|
| 《ceph存储 ceph中对crush算法的认知》;skdkjzz;《https://blog.csdn.net/skdkjxy/article/details/41513965》;20141126;全文 * |
| 《时空大数据的存储》;边馥苓;《时空大数据的技术与方法》;20160531;第78-84页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109634932A (en) | 2019-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109634932B (en) | Intelligent contract storage method and storage system | |
| US9846540B1 (en) | Data durability using un-encoded copies and encoded combinations | |
| US10331641B2 (en) | Hash database configuration method and apparatus | |
| CN108287660B (en) | Data storage method and device | |
| EP2933733A1 (en) | Data processing method and device in distributed file storage system | |
| CN109407977B (en) | Big data distributed storage management method and system | |
| CN109582213B (en) | Data reconstruction method and device and data storage system | |
| CN106201771A (en) | Data-storage system and data read-write method | |
| CN102402602A (en) | B+ tree indexing method and device of real-time database | |
| CN110888837B (en) | Object storage small file merging method and device | |
| CN110399096B (en) | Method, device and equipment for deleting metadata cache of distributed file system again | |
| CN107291768B (en) | Index establishing method and device | |
| CN107133228A (en) | A kind of method and device of fast resampling | |
| CN110968647A (en) | Data storage method and device, computer equipment and storage medium | |
| CN111930716A (en) | Database capacity expansion method, device and system | |
| CN111966631A (en) | Mirror image file generation method, system, equipment and medium capable of being rapidly distributed | |
| CN115840731A (en) | File processing method, computing device and computer storage medium | |
| US20230109530A1 (en) | Synchronous object placement for information lifecycle management | |
| CN116452123A (en) | Method and device for generating characteristic value of inventory item and computer equipment | |
| CN108363727B (en) | Data storage method and device based on ZFS file system | |
| US20060129521A1 (en) | System and method for restoring a file directory structure | |
| CN108304555A (en) | Distributed maps data processing method | |
| CN109815047B (en) | Data processing method and related device | |
| CN114968095B (en) | Distributed hard disk management method, system, electronic device and readable storage medium | |
| CN110837345A (en) | Bad block table storage method and device |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210323 |