CN109359222A - Date storage method and system, equipment and storage medium - Google Patents
Date storage method and system, equipment and storage medium Download PDFInfo
- Publication number
- CN109359222A CN109359222A CN201810884035.4A CN201810884035A CN109359222A CN 109359222 A CN109359222 A CN 109359222A CN 201810884035 A CN201810884035 A CN 201810884035A CN 109359222 A CN109359222 A CN 109359222A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- merkel tree
- global index
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Abstract
The present invention provides a kind of date storage method and system, equipment and storage medium, this method comprises: global index's table of the Merkel tree corresponding to each block and the Merkel tree of each block is locally stored in each node in block chain network.Wherein, the version number of version is block height, and global index's table is used to carry out data query according to block height.The present invention by for Merkel tree configure it is corresponding, using block height as global index's table of version number, the data query approach that inquiry can directly can be completed by block height inquiry global index's table, by a read operation is provided for system, to greatly improve the reading data performance of system；And robustness of the system when transaction congestion or node collapses occur is advanced optimized.
Description
Technical field
This application involves block chain technical fields, and in particular to a kind of date storage method and system, equipment and storage are situated between
Matter.
Background technique
In the solution of the reading and writing data of current block catenary system, it will usually use Merkel tree (Merkle Tree)
Structure, such as in the system of bit coin by Merkel tree carry out spv verifying, ether mill system in pass through Merkel's prefix
Set the read-write, etc. that (Merkle Patricia Tree, abbreviation MPT) carries out data.
The defect for the scheme that the current structure using Merkel tree carries out data storage is:
The data stored limit the reading performance of system, and the data of one transaction of inquiry are needed through multiple read operation
To complete.For example, the data for inquiring a leaf node need to carry out 20 read operations for one 20 layers of Merkel tree
Complete, cause data query efficiency be only general data library search efficiency 1/20, for it is per second can complete 100,000 times reading
The system of operation, the data per second for being only capable of reading 5000 transactions.
Further, existing scheme just can be carried out after needing the data for writing Merkel tree in node local data base
The common recognition of block causes to be easy to happen transaction congestion when number of transaction increases severely.
If will lead to nothing in addition, existing scheme is collapsed when writing the data of Merkel tree in node local data base
Method generates block.
Summary of the invention
In view of drawbacks described above in the prior art or deficiency, it is intended to provide and a kind of is mentioned by optimizing stored data structure
The date storage method and system, equipment and storage medium of system reading performance are risen, and further expectation optimization system is occurring
Robustness when transaction congestion or node collapses.
In a first aspect, the present invention provides a kind of date storage method, comprising:
Global index's table of the Merkel tree corresponding to each block is locally stored in each node of block chain network, and
The Merkel tree of each block.
Wherein, global index's table is using block height as version number, for carrying out data query according to block height.
Second aspect, the present invention provide a kind of data-storage system, configure in the node of block chain network, including first
Storage unit and the second storage unit.
First memory cell arrangements are used to that the global index of the Merkel tree corresponding to each block to be locally stored in node
Table；
Second memory cell arrangements are used to that the Merkel tree of each block to be locally stored in node.
Wherein, global index's table is using block height as version number, for carrying out data query according to block height.
The third aspect, the present invention also provides a kind of equipment, including one or more processors and memory, wherein memory
Comprising can by instruction that the one or more processors execute so that the one or more processors execute it is each according to the present invention
The date storage method that embodiment provides.
Fourth aspect, the present invention also provides a kind of storage medium for being stored with computer program, which makes to count
Calculation machine executes the date storage method that each embodiment provides according to the present invention.
Date storage method that many embodiments of the present invention provide and system, equipment and storage medium are by for Merkel tree
Configure it is corresponding, using block height as global index's table of version number, block height can directly be passed through by providing for system
Inquiry global index's table, the data query approach that inquiry can be completed by a read operation, to greatly improve system
Reading data performance；
The date storage method and system, equipment and storage medium that some embodiments of the invention provide are further by depositing
Block common recognition, and the data of the corresponding Merkel tree of asynchronous storage are packaged after storing up the data of complete office's concordance list, so as to
Node collapses, which occur, when substantially alleviating block congestion problems when number of transaction increases severely, while also reducing storing data leads to nothing
The risk of method generation block；
The date storage method and system, equipment and storage medium that some embodiments of the invention provide are further by saving
Restore the Merkel tree of each block by global index's table when point collapse, without by other node synchrodatas into
Row restores, and alleviates the communication pressure between node；
The date storage method and system, equipment and storage medium that some embodiments of the invention provide further pass through inquiry
The Merkel tree for the data building latest edition that global index's table obtains, and root node Hash is packaged and is known together, it realizes and is not necessarily to
Being known together to global index's table can ensure that the safety of global index's table；
The date storage method and system, equipment and storage medium that some embodiments of the invention provide are further by complete
The leaf node that only record Merkel tree increases newly or modifies in office's concordance list, matches to significantly reduce for multi version Merkel tree
Set data redundancy brought by global index's table.
Detailed description of the invention
By reading a detailed description of non-restrictive embodiments in the light of the attached drawings below, the application's is other
Feature, objects and advantages will become more apparent upon:
Fig. 1 is the correspondence diagram of multi version Merkel tree and global index's table in one embodiment of the invention.
Fig. 2 is a kind of flow chart for date storage method that one embodiment of the present invention provides.
Fig. 3 is a kind of flow chart of preferred embodiment of method shown in Fig. 2.
Fig. 4 is a kind of structural schematic diagram for data-storage system that one embodiment of the invention provides.
Fig. 5 is a kind of structural schematic diagram of preferred embodiment of system shown in Figure 4.
Fig. 6 is a kind of structural schematic diagram for equipment that one embodiment of the invention provides.
Specific embodiment
The application is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched
The specific embodiment stated is used only for explaining related invention, rather than the restriction to the invention.It also should be noted that in order to
Convenient for description, part relevant to invention is illustrated only in attached drawing.
It should be noted that in the absence of conflict, the features in the embodiments and the embodiments of the present application can phase
Mutually combination.The application is described in detail below with reference to the accompanying drawings and in conjunction with the embodiments.
In the present embodiment, the present invention provides a kind of date storage method, comprising:
S10: being locally stored global index's table of the Merkel tree corresponding to each block in each node of block chain network,
And the Merkel tree of each block.
Wherein, global index's table is using block height as version number, for carrying out data query according to block height.
Specifically, in the present embodiment, above-mentioned Merkel tree concrete configuration is Merkel's State Tree (Merkle State
Tree), level configurations are 20 layers, are stored in key assignments (key-value) database of node local, global index's table is stored in
In another database of node local；In more embodiments, it is normal this field can be configured by Merkel tree according to actual needs
Other different types of Merkel trees, different height, the other different types commonly used in the art for being stored in node local
Database in, Merkel tree and global index's table can also be stored in same database, identical technology can be achieved
Effect.
Fig. 1 is the correspondence diagram of multi version Merkel tree and global index's table in one embodiment of the invention.
As shown in Figure 1, by taking height is 3 layers of Merkel's y-bend State Tree as an example, in A node, as block height H=9
Block be packaged a K4Account is paid (or gathering), remaining sum by V4Become V4' transaction when:
In step slo, a leaf node H is on the one hand increased newly in the kv database of A node local4', and newly-increased phase
Corresponding index node H34' and root node H1234', wherein H4' it is (K4,V4') cryptographic Hash；
On the other hand, global index's table is updated in another database of A node local, increases the record that version number is 9 newly
(K4,V4′)。
Above-mentioned Merkel tree synchronous can carry out with the storage of global index's table, asynchronous can also carry out, below with reference to
The asynchronous preferred embodiment stored is discussed in detail in Fig. 2-4.
In the present embodiment, the leaf node and index node being replaced will retain in the database, in order in block
Chain occurs to carry out data rewind under the scenes such as bifurcated；It in further embodiments, can also be according to the different schemes of actual disposition
The leaf node being replaced and index node are configured to directly delete or clear up after several block height, it can be real
Existing identical technical effect.
It should be evident that configuring corresponding global index by the Merkel tree that above-mentioned storage method is each block
After table, required data can directly be inquired in global index's table by block height, without further according to Merkel tree
Root node Hash carries out layer-by-layer reading and inquiry to Merkel tree.
As shown in Figure 1, in the present embodiment, global index's table is configured to only record the silent of current version in each version
The leaf node for increasing newly or modifying in Ke Er tree, and the leaf node that record is not modified is not repeated；Above-mentioned inquiry is in institute
If the block height of lookup does not find target data, sliding lookup can be carried out by the pointer of database；
In another embodiment, global index's table can also be configured to record the Merck of current version in each version
All leaf nodes of your tree；In this embodiment, above-mentioned inquiry can directly find target data by block height.
Above-described embodiment by for Merkel tree configure it is corresponding, using block height as global index's table of version number,
The number that inquiry can directly can be completed by block height inquiry global index's table, by a read operation is provided for system
According to inquirement way, to greatly improve the reading data performance of system；And further by only being recorded in global index's table
Merkel tree increases newly or the leaf node of modification, configures global index's table institute band to significantly reduce for multi version Merkel tree
The data redundancy come.
Fig. 2 is a kind of flow chart for date storage method that one embodiment of the present invention provides.
As shown in Fig. 2, in a preferred embodiment, step S10 includes:
S101: the Merkel tree of latest edition is constructed；
S103: global index is generated or updated in the first database of node local according to the Merkel tree of latest edition
Table, and information is completed in the storage for generating global index's table, so that the common recognition unit in node is by the Merkel tree of latest edition
Root node Hash, which is packed into block, knows together；
S105: each block is generated or updated in the second database of node local according to the Merkel tree of latest edition
Merkel tree.
Preferably, step S101 includes: by business datum needed for the inquiry transaction of global index's table；And according to industry
The Merkel tree of data of being engaged in and transaction building latest edition.
Specifically, in step s101, when transaction increases leaf node newly in Merkel tree, such as block height H=
When 22, user's first opens up New Account K11, without carrying out remaining sum V11Inquiry, directly increase leaf node and correspondence newly in memory
Index node；
When transaction modifies leaf node in Merkel tree, such as when block height H=23, the account K of user's second4With
The account K of user third6It trades, then needs to inquire account K by above-mentioned global index's table4Remaining sum V4And account K6's
Remaining sum V6；Further according to V4And V6And the number of transaction calculates account K after transaction4Remaining sum V4' and account K6Remaining sum
V6', then increase corresponding leaf node and index node newly in memory, complete the building of the Merkel tree of latest edition.
In step s 103, the Merkel tree according to step S101 constructed latest edition in memory is local in node
First database in generate or update global index's table, and after first database writes global index's table generate storage complete
Information notifies the common recognition unit in node that can carry out the packing of block.Unit know together upon receipt of a notification by latest edition
The root node Hash of Merkel tree is packed into block, then the block broadcast of packing is known together.
Wherein, if the remaining sum that is tampered before the transaction for causing to inquire of global index's table that node is locally stored is incorrect,
Then the root node Hash of the Merkel tree of the remaining sum after calculated transaction, latest edition is incorrect, so as to cause packing
Block can not pass through common recognition；Therefore, this method can ensure that global index's table that node is locally stored is not necessarily to through common recognition, but only
With good grounds correct global index's table block generated can pass through common recognition.
In step s105, when the number of transaction that the needs that node receives are packaged common recognition is less, the data of step S105
Storage synchronous with step S103 can carry out；And when number of transaction is more, the data volume for the Merkel tree for needing to store is more than to be
When the storage performance bottleneck of system, the data storage of step S105 can be with the asynchronous progress of step S103.
Such as the data of the system Merkel tree per second that can store 5000 transactions, but receive peak period node is per second
20000 transactions can be done in real time the data storage of step S103 and packing area since the data volume of global index's table is smaller
Block is known together, and the asynchronous data storage for carrying out step S105 again after peak period.
Simultaneously because the data volume of global index's table is smaller, storage is time-consuming shorter, before the storage of global index's table is completed
The probability that node collapses occur is lower, so that node collapses occur when storing data can also be greatly reduced leads to not generation area
The risk of block.
Above-described embodiment asynchronous is deposited further by being packaged block common recognition after the data for storing complete office's concordance list
The data of corresponding Merkel tree are stored up, so as to substantially alleviate block congestion problems when number of transaction increases severely, while also being dropped
Node collapses occur when low storing data and lead to not the risk for generating block；And it is further obtained by inquiring global index's table
The Merkel tree of the data building latest edition arrived, and root node Hash is packaged and is known together, it realizes without to global index's table
It is known together and can ensure that the safety of global index's table.
Fig. 3 is a kind of flow chart of preferred embodiment of method shown in Fig. 2.As shown in figure 3, in a preferred embodiment
In, after step S103 further include:
S107: after node collapses, restore the Merkel tree of each block in the second database according to global index's table.
Specifically, it after the data of global index's table, which store, to be completed, is saved before the data storage of Merkel tree
Point collapse, or node collapses occur during the data of Merkel tree are stored and carried out, it can be by global index's table second
Restore the Merkel tree of each block in database.
Above-described embodiment further by restoring the Merkel tree of each block by global index's table in node collapses,
Without alleviating the communication pressure between node by being restored to other node synchrodatas.
Fig. 4 is a kind of structural schematic diagram for data-storage system that one embodiment of the invention provides.System shown in Fig. 4 can
It is corresponding to execute the above-mentioned method including step S10.
As shown in figure 4, in the present embodiment, the present invention provides a kind of data-storage system 10, configure in block chain network
Node 20 in, including the first storage unit 101 and the second storage unit 103.
First storage unit 101 is configured to that the global rope of the Merkel tree corresponding to each block is locally stored in node
Draw table；
Second storage unit 103 is configured to that the Merkel tree of each block is locally stored in node.
Wherein, global index's table is using block height as version number, for carrying out data query according to block height.
The data storage principle of system shown in Figure 4 can refer to the above-mentioned method including step S10, and details are not described herein again.
Fig. 5 is a kind of structural schematic diagram of preferred embodiment of system shown in Figure 4.System shown in fig. 5 can be corresponded to and be held
Method shown in row Fig. 2-3.
As shown in figure 5, in a preferred embodiment, data-storage system 10 further includes construction unit 105.
Construction unit 105 is configured to the Merkel tree of building latest edition；
First storage unit 101 is further configured to the Merkel tree according to latest edition the first of 20 local of node
It is generated in database or updates global index's table, and information is completed in the storage for generating global index's table, for being total in node 20
The root node Hash of the Merkel tree of latest edition is packed into block by knowledge unit knows together；
Second storage unit 103 is further configured to the Merkel tree according to latest edition the second of 20 local of node
The Merkel tree of each block is generated or updated in database.
Preferably, the second storage unit 103 is further configured to after node 20 collapses, according to global index's table the
Restore the Merkel tree of each block in two databases.
Preferably, business datum needed for construction unit 105 is further configured to the inquiry transaction of global index's table,
And the Merkel tree according to business datum and transaction building latest edition.
Preferably, the first storage unit 101 is further configured in each version of global index's table only record and work as
The leaf node for increasing newly or modifying in the Merkel tree of preceding version.
The data storage principle of system shown in Figure 5 can refer to method shown in Fig. 2-3, and details are not described herein again.
Fig. 6 is a kind of structural schematic diagram for equipment that one embodiment of the invention provides.
As shown in fig. 6, present invention also provides a kind of equipment 600, including one or more centres as on the other hand
Unit (CPU) 601 is managed, can be added according to the program being stored in read-only memory (ROM) 602 or from storage section 608
The program that is downloaded in random access storage device (RAM) 603 and execute various movements appropriate and processing.In RAM603, also deposit
It contains equipment 600 and operates required various programs and data.CPU601, ROM602 and RAM603 pass through the phase each other of bus 604
Even.Input/output (I/O) interface 605 is also connected to bus 604.
I/O interface 605 is connected to lower component: the importation 606 including keyboard, mouse etc.；It is penetrated including such as cathode
The output par, c 607 of spool (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section 608 including hard disk etc.；
And the communications portion 609 of the network interface card including LAN card, modem etc..Communications portion 609 via such as because
The network of spy's net executes communication process.Driver 610 is also connected to I/O interface 605 as needed.Detachable media 611, such as
Disk, CD, magneto-optic disk, semiconductor memory etc. are mounted on as needed on driver 610, in order to read from thereon
Computer program be mounted into storage section 608 as needed.
Particularly, in accordance with an embodiment of the present disclosure, the date storage method of any of the above-described embodiment description can be implemented
For computer software programs.For example, embodiment of the disclosure includes a kind of computer program product comprising be tangibly embodied in
Computer program on machine readable media, the computer program include the program code for executing date storage method.
In such embodiments, which can be downloaded and installed from network by communications portion 609, and/or from
Detachable media 611 is mounted.
As another aspect, present invention also provides a kind of computer readable storage medium, the computer-readable storage mediums
Matter can be computer readable storage medium included in the device of above-described embodiment；It is also possible to individualism, it is unassembled
Enter the computer readable storage medium in equipment.Computer-readable recording medium storage has one or more than one program, should
Program is used to execute the date storage method for being described in the application by one or more than one processor.
Flow chart and block diagram in attached drawing are illustrated according to the system of various embodiments of the invention, method and computer journey
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
A part of one module, program segment or code of table, a part of the module, program segment or code include one or more use
The executable instruction of the logic function as defined in realizing.It should also be noted that in some implementations as replacements, being marked in box
The function of note can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are actually
It can be basically executed in parallel, they can also be executed in the opposite order sometimes, this is depending on related function.Also it wants
It is noted that the combination of each box in block diagram and or flow chart and the box in block diagram and or flow chart, Ke Yitong
The dedicated hardware based system of functions or operations as defined in executing is crossed to realize, or by specialized hardware and can be calculated
The combination of machine instruction is realized.
Being described in the embodiment of the present application involved unit or module can be realized by way of software, can also be with
It is realized by way of hardware.Described unit or module also can be set in the processor, for example, each unit can
To be the software program being arranged in computer or intelligent movable equipment, it is also possible to the hardware device being separately configured.Wherein, this
The title of a little units or module does not constitute the restriction to the unit or module itself under certain conditions.
Above description is only the preferred embodiment of the application and the explanation to institute's application technology principle.Those skilled in the art
Member is it should be appreciated that invention scope involved in the application, however it is not limited to technology made of the specific combination of above-mentioned technical characteristic
Scheme, while should also cover in the case where not departing from the application design, appointed by above-mentioned technical characteristic or its equivalent feature
Other technical solutions of meaning combination and formation.Such as features described above and (but being not limited to) disclosed herein have similar functions
Technical characteristic replaced mutually and the technical solution that is formed.
Claims (14)
1. a kind of date storage method characterized by comprising
Global index's table of the Merkel tree corresponding to each block and described is locally stored in each node of block chain network
The Merkel tree of each block；
Wherein, global index's table is using block height as version number, for carrying out data query according to the block height.
2. the method according to claim 1, wherein correspondence is locally stored in each node in block chain network
Include: in global index's table of the Merkel tree of each block and the Merkel tree of each block
Construct the Merkel tree of latest edition；
Global index's table is generated or updated in the first database of node local according to the Merkel tree of the latest edition, and
Information is completed in the storage for generating global index's table, so that the common recognition unit in the node is by the Merck of the latest edition
The root node Hash of your tree, which is packed into block, knows together；
The silent of each block is generated or updated in the second database of node local according to the Merkel tree of the latest edition
Ke Er tree.
3. according to the method described in claim 2, it is characterized in that, the Merkel tree according to the latest edition is in node
It is generated in local first database or updates global index's table, and information is completed in the storage for generating global index's table, with
It the root node Hash of the Merkel tree of the latest edition is packed into block knows together for the common recognition unit of the node
Later further include:
After the node collapses, restore the silent of each block in second database according to global index's table
Ke Er tree.
4. according to the method described in claim 2, it is characterized in that, the Merkel tree of the building latest edition includes:
Pass through business datum needed for global index's table inquiry transaction；
According to the Merkel tree of the business datum and the transaction building latest edition.
5. method according to claim 1-4, which is characterized in that global index's table in each version only
Record the leaf node for increasing newly or modifying in the Merkel tree of current version.
6. method according to claim 1-4, which is characterized in that the Merkel tree is Merkel's State Tree,
It is stored in key assignments (key-value) database.
7. a kind of data-storage system configures in the node of block chain network characterized by comprising
First storage unit is configured to that global index's table of the Merkel tree corresponding to each block is locally stored in node；
Second storage unit is configured to that the Merkel tree of each block is locally stored in node；
Wherein, global index's table is using block height as version number, for carrying out data query according to the block height.
8. system according to claim 7, which is characterized in that further include:
Construction unit is configured to the Merkel tree of building latest edition；
First storage unit is further configured to the Merkel tree according to the latest edition the first of node local
It is generated in database or updates global index's table, and information is completed in the storage for generating global index's table, for the node
In common recognition unit the root node Hash of the Merkel tree of the latest edition be packed into block know together；
Second storage unit is further configured to the Merkel tree according to the latest edition the second of node local
The Merkel tree of each block is generated or updated in database.
9. system according to claim 8, which is characterized in that second storage unit is further configured to described
After node collapses, restore the Merkel tree of each block in second database according to global index's table.
10. system according to claim 8, which is characterized in that the construction unit is further configured to described
Business datum needed for the inquiry transaction of global index's table, and, latest edition is constructed according to the business datum and the transaction
Merkel tree.
11. according to the described in any item systems of claim 7-10, which is characterized in that first storage unit further configures
The leaf section for increasing newly or modifying in Merkel tree for only recording current version in each version of global index's table
Point.
12. according to the described in any item systems of claim 7-10, which is characterized in that the Merkel tree is Merkel's state
Tree, is stored in key assignments (key-value) database.
13. a kind of equipment, which is characterized in that the equipment includes:
One or more processors；
Memory, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors
Execute such as method of any of claims 1-6.
14. a kind of storage medium for being stored with computer program, which is characterized in that realize when the program is executed by processor as weighed
Benefit requires method described in any one of 1-6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810884035.4A CN109359222B (en) | 2018-08-06 | 2018-08-06 | Data storage method and system, equipment and storage medium |
| PCT/CN2019/099337 WO2020029932A1 (en) | 2018-08-06 | 2019-08-06 | Method for data storage, system, device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810884035.4A CN109359222B (en) | 2018-08-06 | 2018-08-06 | Data storage method and system, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109359222A true CN109359222A (en) | 2019-02-19 |
| CN109359222B CN109359222B (en) | 2021-07-06 |
Family
ID=65349829
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810884035.4A Active CN109359222B (en) | 2018-08-06 | 2018-08-06 | Data storage method and system, equipment and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109359222B (en) |
| WO (1) | WO2020029932A1 (en) |
Cited By (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109977274A (en) * | 2019-03-31 | 2019-07-05 | 杭州复杂美科技有限公司 | A kind of data query and verification method, system, equipment and storage medium |
| CN109992998A (en) * | 2019-03-31 | 2019-07-09 | 杭州复杂美科技有限公司 | A kind of information storage means and system, equipment and storage medium |
| CN110008233A (en) * | 2019-03-31 | 2019-07-12 | 杭州复杂美科技有限公司 | A kind of information inquiry and know together method, system, equipment and storage medium |
| CN110096505A (en) * | 2019-03-31 | 2019-08-06 | 杭州复杂美科技有限公司 | A kind of date storage method and system, equipment and storage medium |
| CN110287170A (en) * | 2019-06-28 | 2019-09-27 | 杭州复杂美科技有限公司 | Database upgrade method, status data call method, equipment and storage medium |
| CN110334154A (en) * | 2019-06-28 | 2019-10-15 | 阿里巴巴集团控股有限公司 | Based on the classification storage method and device of block chain, electronic equipment |
| CN110442577A (en) * | 2019-07-15 | 2019-11-12 | 杭州复杂美科技有限公司 | A kind of storage of status data, inquiry and management method, equipment and storage medium |
| CN110557277A (en) * | 2019-07-25 | 2019-12-10 | 北京清红微谷技术开发有限责任公司 | method and system for searching nearest common ancestor of two blocks in block chain system |
| CN110704506A (en) * | 2019-09-24 | 2020-01-17 | 杭州复杂美科技有限公司 | State data storage method and data query method |
| WO2020029932A1 (en) * | 2018-08-06 | 2020-02-13 | 杭州复杂美科技有限公司 | Method for data storage, system, device, and storage medium |
| CN110989994A (en) * | 2019-11-18 | 2020-04-10 | 腾讯科技（深圳）有限公司 | Block chain-based code version management method and device, terminal and storage medium |
| CN111026770A (en) * | 2019-10-29 | 2020-04-17 | 北京海益同展信息科技有限公司 | Account book processing method and device for block chain nodes, server and storage medium |
| CN111488343A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | E-commerce data uplink method and device based on business data block chain |
| CN111488611A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | Relation data storage method and device of business data block chain |
| CN111523896A (en) * | 2020-05-06 | 2020-08-11 | 杭州复杂美科技有限公司 | Anti-attack method, device and storage medium |
| US10789222B2 (en) | 2019-06-28 | 2020-09-29 | Alibaba Group Holding Limited | Blockchain-based hierarchical data storage |
| WO2020192316A1 (en) * | 2019-03-22 | 2020-10-01 | 杭州复杂美科技有限公司 | Data storage method, data rollback method, device and storage medium |
| CN111756639A (en) * | 2020-06-19 | 2020-10-09 | 杭州芯讯科技有限公司 | Mirror image data transmission method based on Mercker tree and broadcast self-request |
| CN112269791A (en) * | 2020-11-30 | 2021-01-26 | 上海特高信息技术有限公司 | Construction method of account book index skip list and block chain account book processing method using same |
| WO2021057164A1 (en) * | 2019-09-25 | 2021-04-01 | 支付宝(杭州)信息技术有限公司 | Query method and device for blockchain ledger, and apparatus |
| WO2021068728A1 (en) * | 2019-10-10 | 2021-04-15 | 深圳前海微众银行股份有限公司 | Methods and apparatus for generating state tree of block and validating on-chain data |
| US11036720B2 (en) | 2019-06-28 | 2021-06-15 | Advanced New Technologies Co., Ltd. | Blockchain-based hierarchical data storage |
| US11113272B2 (en) | 2019-07-31 | 2021-09-07 | Advanced New Technologies Co., Ltd. | Method and apparatus for storing blockchain state data and electronic device |
| TWI740392B (en) * | 2019-07-31 | 2021-09-21 | 開曼群島商創新先進技術有限公司 | Computer-implemented method, non-transitory computer-readable medium and computer-implemented system for synchronizing blockchain state data |
| CN113419973A (en) * | 2021-06-17 | 2021-09-21 | 杭州迪普科技股份有限公司 | Message forwarding method and device |
| CN113704271A (en) * | 2021-09-03 | 2021-11-26 | 杭州复杂美科技有限公司 | Mercker tree generation method, illegal node identification method, equipment and storage medium |
| WO2022121345A1 (en) * | 2020-12-09 | 2022-06-16 | 杭州复杂美科技有限公司 | Distributed data storage method, data query method, device, and storage medium |
| WO2023124323A1 (en) * | 2021-12-31 | 2023-07-06 | 杭州趣链科技有限公司 | Data storage method, apparatus, computer device, and storage medium |
| CN110989994B (en) * | 2019-11-18 | 2024-04-26 | 腾讯科技（深圳）有限公司 | Code version management method, device, terminal and storage medium based on block chain |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105630609A (en) * | 2016-02-24 | 2016-06-01 | 杭州复杂美科技有限公司 | Block chain packing and storing method |
| CN107040582A (en) * | 2017-02-17 | 2017-08-11 | 阿里巴巴集团控股有限公司 | A kind of data processing method and device |
| US20170250815A1 (en) * | 2016-01-26 | 2017-08-31 | Stampery Inc. | Systems and methods for certification of data units and/or certification verification |
| CN107562775A (en) * | 2017-07-14 | 2018-01-09 | 阿里巴巴集团控股有限公司 | A kind of data processing method and equipment based on block chain |
| CN107807951A (en) * | 2017-09-18 | 2018-03-16 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
| CN108023896A (en) * | 2017-12-28 | 2018-05-11 | 江苏通付盾科技有限公司 | Block synchronous method and system |
| CN108197226A (en) * | 2017-12-29 | 2018-06-22 | 山大地纬软件股份有限公司 | MPTC account status tree and MPTC block chain method for quickly retrieving |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB201511964D0 (en) * | 2015-07-08 | 2015-08-19 | Barclays Bank Plc | Secure digital data operations |
| CN106372533B (en) * | 2016-09-14 | 2020-04-21 | 中国银联股份有限公司 | Content storage method based on block chain technology |
| CN108345485B (en) * | 2018-01-30 | 2021-05-07 | 口碑(上海)信息技术有限公司 | Identification method and device for interface view |
| CN109408551B (en) * | 2018-08-06 | 2021-07-06 | 杭州复杂美科技有限公司 | Data query method and system, consensus method and system, device and storage medium |
| CN109359222B (en) * | 2018-08-06 | 2021-07-06 | 杭州复杂美科技有限公司 | Data storage method and system, equipment and storage medium |
-
2018
- 2018-08-06 CN CN201810884035.4A patent/CN109359222B/en active Active
-
2019
- 2019-08-06 WO PCT/CN2019/099337 patent/WO2020029932A1/en active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170250815A1 (en) * | 2016-01-26 | 2017-08-31 | Stampery Inc. | Systems and methods for certification of data units and/or certification verification |
| CN105630609A (en) * | 2016-02-24 | 2016-06-01 | 杭州复杂美科技有限公司 | Block chain packing and storing method |
| CN107040582A (en) * | 2017-02-17 | 2017-08-11 | 阿里巴巴集团控股有限公司 | A kind of data processing method and device |
| CN107562775A (en) * | 2017-07-14 | 2018-01-09 | 阿里巴巴集团控股有限公司 | A kind of data processing method and equipment based on block chain |
| CN107807951A (en) * | 2017-09-18 | 2018-03-16 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
| CN108023896A (en) * | 2017-12-28 | 2018-05-11 | 江苏通付盾科技有限公司 | Block synchronous method and system |
| CN108197226A (en) * | 2017-12-29 | 2018-06-22 | 山大地纬软件股份有限公司 | MPTC account status tree and MPTC block chain method for quickly retrieving |
Non-Patent Citations (1)
| Title |
|---|
| 手撕代码: "区块链最基本的技术原理", 《HTTPS://BLOG.CSDN.NET/》 * |
Cited By (38)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020029932A1 (en) * | 2018-08-06 | 2020-02-13 | 杭州复杂美科技有限公司 | Method for data storage, system, device, and storage medium |
| WO2020192316A1 (en) * | 2019-03-22 | 2020-10-01 | 杭州复杂美科技有限公司 | Data storage method, data rollback method, device and storage medium |
| CN109992998A (en) * | 2019-03-31 | 2019-07-09 | 杭州复杂美科技有限公司 | A kind of information storage means and system, equipment and storage medium |
| CN110008233A (en) * | 2019-03-31 | 2019-07-12 | 杭州复杂美科技有限公司 | A kind of information inquiry and know together method, system, equipment and storage medium |
| CN110096505A (en) * | 2019-03-31 | 2019-08-06 | 杭州复杂美科技有限公司 | A kind of date storage method and system, equipment and storage medium |
| CN110096505B (en) * | 2019-03-31 | 2021-05-11 | 杭州复杂美科技有限公司 | Data storage method, system, equipment and storage medium |
| CN109977274A (en) * | 2019-03-31 | 2019-07-05 | 杭州复杂美科技有限公司 | A kind of data query and verification method, system, equipment and storage medium |
| US11386054B2 (en) | 2019-06-28 | 2022-07-12 | Advanced New Technologies Co., Ltd. | Blockchain-based hierarchical data storage |
| CN110334154A (en) * | 2019-06-28 | 2019-10-15 | 阿里巴巴集团控股有限公司 | Based on the classification storage method and device of block chain, electronic equipment |
| US11042518B2 (en) | 2019-06-28 | 2021-06-22 | Advanced New Technologies Co., Ltd. | Blockchain-based hierarchical data storage |
| CN110334154B (en) * | 2019-06-28 | 2020-07-21 | 阿里巴巴集团控股有限公司 | Block chain based hierarchical storage method and device and electronic equipment |
| US11036720B2 (en) | 2019-06-28 | 2021-06-15 | Advanced New Technologies Co., Ltd. | Blockchain-based hierarchical data storage |
| CN110287170B (en) * | 2019-06-28 | 2021-05-11 | 杭州复杂美科技有限公司 | Database upgrading method, state data calling method, device and storage medium |
| CN110287170A (en) * | 2019-06-28 | 2019-09-27 | 杭州复杂美科技有限公司 | Database upgrade method, status data call method, equipment and storage medium |
| US10789222B2 (en) | 2019-06-28 | 2020-09-29 | Alibaba Group Holding Limited | Blockchain-based hierarchical data storage |
| CN110442577A (en) * | 2019-07-15 | 2019-11-12 | 杭州复杂美科技有限公司 | A kind of storage of status data, inquiry and management method, equipment and storage medium |
| CN110557277A (en) * | 2019-07-25 | 2019-12-10 | 北京清红微谷技术开发有限责任公司 | method and system for searching nearest common ancestor of two blocks in block chain system |
| TWI740392B (en) * | 2019-07-31 | 2021-09-21 | 開曼群島商創新先進技術有限公司 | Computer-implemented method, non-transitory computer-readable medium and computer-implemented system for synchronizing blockchain state data |
| US11113272B2 (en) | 2019-07-31 | 2021-09-07 | Advanced New Technologies Co., Ltd. | Method and apparatus for storing blockchain state data and electronic device |
| CN110704506A (en) * | 2019-09-24 | 2020-01-17 | 杭州复杂美科技有限公司 | State data storage method and data query method |
| CN110704506B (en) * | 2019-09-24 | 2022-05-24 | 杭州复杂美科技有限公司 | State data storage method and data query method |
| WO2021057164A1 (en) * | 2019-09-25 | 2021-04-01 | 支付宝(杭州)信息技术有限公司 | Query method and device for blockchain ledger, and apparatus |
| WO2021068728A1 (en) * | 2019-10-10 | 2021-04-15 | 深圳前海微众银行股份有限公司 | Methods and apparatus for generating state tree of block and validating on-chain data |
| CN111026770B (en) * | 2019-10-29 | 2023-08-04 | 京东科技信息技术有限公司 | Ledger processing method and device of blockchain node, server and storage medium |
| CN111026770A (en) * | 2019-10-29 | 2020-04-17 | 北京海益同展信息科技有限公司 | Account book processing method and device for block chain nodes, server and storage medium |
| CN110989994A (en) * | 2019-11-18 | 2020-04-10 | 腾讯科技（深圳）有限公司 | Block chain-based code version management method and device, terminal and storage medium |
| CN110989994B (en) * | 2019-11-18 | 2024-04-26 | 腾讯科技（深圳）有限公司 | Code version management method, device, terminal and storage medium based on block chain |
| CN111488611A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | Relation data storage method and device of business data block chain |
| CN111488343A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | E-commerce data uplink method and device based on business data block chain |
| CN111523896A (en) * | 2020-05-06 | 2020-08-11 | 杭州复杂美科技有限公司 | Anti-attack method, device and storage medium |
| CN111756639B (en) * | 2020-06-19 | 2022-05-10 | 杭州芯讯科技有限公司 | Mirror image data transmission method based on Merckel tree and broadcast self-request |
| CN111756639A (en) * | 2020-06-19 | 2020-10-09 | 杭州芯讯科技有限公司 | Mirror image data transmission method based on Mercker tree and broadcast self-request |
| CN112269791B (en) * | 2020-11-30 | 2024-04-05 | 上海特高信息技术有限公司 | Block chain account book processing method |
| CN112269791A (en) * | 2020-11-30 | 2021-01-26 | 上海特高信息技术有限公司 | Construction method of account book index skip list and block chain account book processing method using same |
| WO2022121345A1 (en) * | 2020-12-09 | 2022-06-16 | 杭州复杂美科技有限公司 | Distributed data storage method, data query method, device, and storage medium |
| CN113419973A (en) * | 2021-06-17 | 2021-09-21 | 杭州迪普科技股份有限公司 | Message forwarding method and device |
| CN113704271A (en) * | 2021-09-03 | 2021-11-26 | 杭州复杂美科技有限公司 | Mercker tree generation method, illegal node identification method, equipment and storage medium |
| WO2023124323A1 (en) * | 2021-12-31 | 2023-07-06 | 杭州趣链科技有限公司 | Data storage method, apparatus, computer device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109359222B (en) | 2021-07-06 |
| WO2020029932A1 (en) | 2020-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109359222A (en) | Date storage method and system, equipment and storage medium | |
| CN109408551A (en) | Data query method and system, common recognition method and system, equipment and storage medium | |
| KR102240557B1 (en) | Method, device and system for storing data | |
| US9575983B2 (en) | Calculating deduplication digests for a synthetic backup by a deduplication storage system | |
| CN109977274A (en) | A kind of data query and verification method, system, equipment and storage medium | |
| US7752165B2 (en) | Persistent query system for automatic on-demand data subscriptions from mobile devices | |
| CN109271446A (en) | A kind of parallel chain method of data synchronization, equipment and storage medium | |
| CN106021267B (en) | To the method and system for concurrently reading and being inserted into of data structure | |
| CN109684333A (en) | A kind of storage of data and method of cutting out, equipment and storage medium | |
| CN109933592A (en) | Date storage method, data rewind method, equipment and storage medium | |
| CN110175188A (en) | A kind of block chain state data buffer storage and querying method, equipment and storage medium | |
| US11100502B1 (en) | Modular, configurable smart contracts for blockchain transaction processing validations | |
| CN109559234A (en) | A kind of storage method, equipment and the storage medium of block chain status data | |
| CN103959264A (en) | Managing redundant immutable files using deduplication in storage clouds | |
| CN109992998A (en) | A kind of information storage means and system, equipment and storage medium | |
| CN105787058B (en) | A kind of user tag system and the data delivery system based on user tag system | |
| CN110489413A (en) | A kind of storage of transaction record, querying method and system, equipment and storage medium | |
| CN110287170A (en) | Database upgrade method, status data call method, equipment and storage medium | |
| CN110392121A (en) | Parallel chain block generation method, equipment and storage medium | |
| CN110442580A (en) | A kind of block chain state date storage method, equipment and storage medium | |
| CN110287264A (en) | Batch data update method, device and the system of distributed data base | |
| CN107239485A (en) | Database operation method, apparatus and system | |
| CN104133891A (en) | Method for storing massive structural data based on relational database | |
| CN109614411A (en) | Date storage method, equipment and storage medium | |
| US20220019907A1 (en) | Dynamic In-Memory Construction of a Knowledge Graph |
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 |