CN109408551B - Data query method and system, consensus method and system, device and storage medium - Google Patents
Data query method and system, consensus method and system, device and storage medium Download PDFInfo
- Publication number
- CN109408551B CN109408551B CN201810884295.1A CN201810884295A CN109408551B CN 109408551 B CN109408551 B CN 109408551B CN 201810884295 A CN201810884295 A CN 201810884295A CN 109408551 B CN109408551 B CN 109408551B
- Authority
- CN
- China
- Prior art keywords
- index table
- tree
- global index
- block
- version
- 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.)
- Active
Links
Images
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 invention provides a data query method and system, a consensus method and system, equipment and a storage medium, wherein each node of a block chain network respectively stores a Mercker tree of each block and a global index table corresponding to the Mercker tree of each block, the version number of the version is the height of the block, and the data query method comprises the following steps: receiving a query instruction; wherein, the query instruction comprises the queried first block height; and searching target data in the global index table according to the first block height. The invention realizes that the inquiry of the leaf node data of the Merckel tree in the block chain can be completed through one-time reading operation by configuring the corresponding global index table which takes the block height as the version number for the Merckel tree and searching the target data in the global index table through the inquired block height, thereby greatly improving the data reading performance of the system.
Description
Technical Field
The present application relates to the field of block chain technology, and in particular, to a data query method and system, a consensus method and system, a device, and a storage medium.
Background
In the current solution for reading and writing data in the block chain system, a structure of Merkle Tree (Merkle Tree) is usually used, for example, spv verification is performed through Merkle Tree in bitcoin system, reading and writing data is performed through Merkle Prefix Tree (MPT) in etherhouse system, and so on.
The current data query through the mercker tree has the defect that the query of data of one transaction needs to be completed through multiple read operations, for example, for a mercker tree with 20 layers, the query of data of one leaf node needs to be completed through 20 read operations, so that the efficiency of data query is only 1/20 of the query efficiency of a common database, and for a system capable of completing 10 ten thousand read operations per second, only 5000 transactions of data can be read per second, and the read performance of the system is greatly limited.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it is desirable to provide a data query method and system, a consensus method and system, a device, and a storage medium, which can complete a transaction data query in a blockchain by one read operation.
In a first aspect, the present invention provides a data query method, where each node of a block chain network stores a mercker tree of each block and a global index table corresponding to the mercker tree of each block, where the global index table uses a block height as a version number, and the method includes:
receiving a query instruction; wherein, the query instruction comprises the queried first block height;
and searching target data in the global index table according to the first block height.
In a second aspect, the present invention provides a data query system, configured in a node of a blockchain network, where the node includes a first data storage unit and a second data storage unit;
the first data storage unit is configured to store the Merck tree of each block;
the second data storage unit is configured to store a global index table corresponding to the merkel tree of each tile;
the global index table takes the block height as a version number;
the data query system comprises a receiving unit and a query unit;
the receiving unit is configured to receive a query instruction; wherein, the query instruction comprises the queried first block height;
the query unit is configured to look up the target data in the global index table according to the first block height.
In a third aspect, the present invention further provides a consensus method, including:
searching business data required by transaction through the data query method;
constructing a Merck tree of the latest version according to the business data and the transaction;
updating a global index table according to the Mercker tree of the latest version, and performing Hash packaging on root nodes of the Mercker tree of the latest version to blocks for consensus;
and updating the stored Merck tree of each block according to the latest version of the Merck tree or the updated global index table.
In a fourth aspect, the present invention further provides a consensus system, which includes a searching unit, a constructing unit, a first storage unit, a consensus unit, and a second storage unit;
the searching unit is configured to search the business data required by the transaction through the data query system;
the construction unit is configured to construct a latest version of the Mercker tree according to the business data and the transaction;
the first storage unit is configured to update the global index table according to the latest version of the Merckel tree;
the consensus unit is configured to perform consensus by Hash-packaging the root node of the Mercker tree of the latest version into the block after the first storage unit finishes updating the global index table;
the second storage unit is configured to update the stored Mercker tree of each chunk according to the latest version of the Mercker tree or the updated global index table.
In a fifth aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a method provided according to embodiments of the present invention.
In a sixth aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the methods provided according to the embodiments of the present invention.
The data query method and system, the consensus method and system, the device and the storage medium provided by the embodiments of the present invention configure the corresponding global index table with the block height as the version number for the Mercker tree, and search the target data in the global index table according to the searched block height, so that the query of the leaf node data of the Mercker tree in the block chain can be completed by one-time reading operation, thereby greatly improving the data reading performance of the system;
the data query method and system, the consensus method and system, the device and the storage medium provided by some embodiments of the present invention further record only the added or modified leaf nodes of the merkel tree in the global index table, thereby greatly reducing the data redundancy brought by configuring the global index table for multi-version merkel trees;
the consensus method, the system, the device and the storage medium provided by some embodiments of the present invention construct the tacle tree of the latest version according to the data obtained by querying the global index table, and perform hash packing consensus on the root nodes, thereby ensuring the security of the global index table without performing consensus on the global index table; meanwhile, the blocks are packed for consensus after the complete local index table is updated, and the consensus is not required to be packed after the stored Mercker trees of all the blocks are updated, so that the speed of packing the blocks in the consensus process is greatly improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is a diagram illustrating a correspondence relationship between a multi-version Mercker tree and a global index table according to an embodiment of the present invention.
Fig. 2 is a flowchart of a data query method according to an embodiment of the present invention.
Fig. 3 is a flowchart of a consensus method according to an embodiment of the present invention.
Fig. 4 is a schematic structural diagram of a data query system according to an embodiment of the present invention.
Fig. 5 is a schematic structural diagram of a consensus system according to an embodiment of the present invention.
Fig. 6 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
In this embodiment, each node of the block chain network stores the mercker tree of each block and the global index table corresponding to the mercker tree of each block, and the mercker tree and the global index table use the block height H as the version number.
Specifically, in this embodiment, the merkel Tree is specifically configured as a merkel State Tree (Merkle State Tree), is highly configured as 20 layers, and is stored in a key-value database local to a node, and the global index table is stored in another database local to the node; in further embodiments, the merkel tree may be configured as a merkel tree of other different types commonly used in the art, with different heights, stored in a database of other different types commonly used in the art local to the node, and the merkel tree and the global index table may also be stored in the same database, all of which may achieve the same technical effect.
FIG. 1 is a diagram illustrating a correspondence relationship between a multi-version Mercker tree and a global index table according to an embodiment of the present invention. In the following, referring to fig. 1, the correspondence between the two merkel binary state trees with a height of 3 layers and the global index table is taken as an example to describe in detail the correspondence between the multi-version merkel tree and the global index table in the solution of the present invention.
As shown in fig. 1, the root node hash H of the merkel binary state tree with version number 8 is recorded in the block with the block height H of 81234(ii) a Correspondingly, 4 leaf nodes and 3 index nodes of the Merckel binary state tree are recorded in the local database of each node, and K is recorded through the global index table1-K4During the change of version numbers 1-8. Wherein, K1-K4For 4 accounts, V1-V4Is the balance of the 4 accounts, H1-H4Is (K)1,V1)-(K4,V4) The hash value of (1).
When the block with the block height H equal to 9 is packed with a stroke K4The account pays (or collects) and the balance is V4Becomes V4When trading of' is concerned; correspondingly, a new leaf node H is added to the kv database local to the node4', and adding the corresponding index node H34' Hegen nodePoint H1234', wherein H4' is (K)4,V4') a hash value; database storing global index table record (K) with version number 9 is newly added in global index table4,V4′)。
Therefore, the invention converts the multi-layer three-dimensional tree structure into a planar table structure by configuring the corresponding global index table for the stored Mercker tree of each block, thereby enabling the performance optimization of data query to be feasible. The data query method provided by the present invention is described in detail below with reference to fig. 2.
Fig. 2 is a flowchart of a data query method according to an embodiment of the present invention. As shown in fig. 2, in this embodiment, the present invention provides a data query method, including:
s12: receiving a query instruction; wherein, the query instruction comprises the queried first block height;
s14: and searching target data in the global index table according to the first block height.
Compared with the traditional query method for searching layer by layer according to the root node hash of the Mercker tree until the leaf node of the corresponding data is found, the data query method provided by the invention does not need to search the Mercker tree, and only needs to directly search the global index table.
Specifically, in the present embodiment, the global index table is as shown in fig. 1, and only records leaf nodes added or modified in the merkel tree of the current version in each version, for example, only records modified leaf nodes (K) in version 9 in fig. 14,V4') without repeatedly recording leaf nodes (K) that have not been modified1,V1)、(K2,V2) And (K)3,V3)。
In step S12, a query instruction is received, for example, the query H is 83 version, K3The balance of the account;
in step S14, the global index table is queried as to whether or not K is recorded in the version with H-833Balance of account:
if yes, returning the searched target data;
if not, the pointer of the database is slid forwards to inquire whether the version H-82 records K or not3And (4) the balance of the account is circulated until the target data is found, and the circulation searching process can be completed only by once reading operation.
In another embodiment, the global index table may also record all leaf nodes of the current version of the Mercker tree in each version, e.g., in FIG. 1, version 9 except for the leaf node (K) that records the modifications4,V4') leaves nodes (K) that have not been modified are also recorded1,V1)、(K2,V2) And (K)3,V3)。
The difference between this embodiment and the above-mentioned embodiment in which the global index table only records the newly added or modified leaf nodes in the current version of the merkel tree is that the target data can be directly found in step S14, but more redundant data needs to be recorded in the global index table.
In the embodiment, the corresponding global index table which takes the block height as the version number is configured for the Merckel tree, and the target data is searched in the global index table according to the inquired block height, so that the inquiry of leaf node data of the Merckel tree in a block chain can be completed through one-time reading operation, and the data reading performance of the system is greatly improved;
and in some embodiments, only the newly added or modified leaf nodes of the merkel tree are further recorded in the global index table, so that the data redundancy brought by configuring the global index table for a multi-version merkel tree is greatly reduced.
Fig. 3 is a flowchart of a consensus method according to an embodiment of the present invention. As shown in fig. 3, in this embodiment, the present invention further provides a consensus method performed by a node in a blockchain network, including:
s22: searching business data required by transaction through the data query method;
s24: constructing a Merck tree of the latest version according to the business data and the transaction;
s26: updating a global index table according to the Mercker tree of the latest version, and performing Hash packaging on root nodes of the Mercker tree of the latest version to blocks for consensus;
s28: and updating the stored Merck tree of each block according to the latest version of the Merck tree or the updated global index table.
Specifically, also taking the merkel tree and the global index table shown in fig. 1 as an example, the current block height H is 8, and a stroke K is received4Transaction for payment by account:
in step S22, K is found according to the data query method shown in fig. 24Balance V of account4；
In step S24, according to the found balance V4Calculating balance V after transaction with payment of transaction4', constructing the Mercker tree with the latest version H ═ 9 in the memory;
in step S26, the global index table in the node local database is updated according to the latest version of the mercker tree constructed in step S24, and after writing the full local index table, the root node of the mercker tree of the latest version is hashed H1234' packing into blocks for consensus;
wherein, if the global index table stored locally by the node is tampered to cause the balance V before transaction4If not, the calculated balance V after transaction4', root node hash of the latest version of the Mercker tree H1234' are all incorrect, resulting in failure to agree on the packed blocks; therefore, the method can ensure that the global index table stored locally by the node does not need to be identified, but only the blocks generated according to the correct global index table can be identified;
in step S28, the merkel tree of each chunk is updated synchronously with the update of the global index table in step S26, and the data in the memory is written into the node local database; or after the global index table is updated, updating the merkel tree of each block according to the updated global index table.
According to the embodiment, the latest version of the Mercker tree is constructed according to the data obtained by inquiring the global index table, and the root nodes are subjected to Hash packaging and consensus, so that the safety of the global index table can be ensured without performing consensus on the global index table; meanwhile, the blocks are packed for consensus after the complete local index table is updated, and the block is packed for consensus after the Mercker tree of each block is updated, so that the speed of packing the blocks in the consensus process is greatly improved.
Fig. 4 is a schematic structural diagram of a data query system according to an embodiment of the present invention. The data query system shown in fig. 4 may correspondingly perform the method shown in fig. 2.
As shown in fig. 4, in the present embodiment, the present invention provides a data query system 10, which is configured in a node 20 of a blockchain network, wherein a first data storage unit 201 and a second data storage unit 202 are configured in the node 20;
the first data storage unit 201 is configured to store a merkel tree for each block;
the second data storage unit 202 is configured to store a global index table corresponding to the mercker tree of each tile; the global index table takes the block height as a version number;
the data query system 10 comprises a receiving unit 101 and a query unit 103;
the receiving unit 101 is configured to receive a query instruction; wherein, the query instruction comprises the queried first block height;
the lookup unit 103 is configured to look up the target data in the global index table according to the first block height.
The query principle of the system shown in fig. 4 can refer to the method shown in fig. 2, and is not described herein again.
Fig. 5 is a schematic structural diagram of a consensus system according to an embodiment of the present invention. The system shown in fig. 5 may correspondingly perform the method shown in fig. 3.
As shown in fig. 5, in the present embodiment, the present invention further provides a consensus system 30, which is configured in the node 20 and includes a searching unit 301, a constructing unit 303, a first storage unit 305, a consensus unit 307, and a second storage unit 309.
The searching unit 301 is configured to search the service data required by the transaction through the data querying system 10;
the construction unit 303 is configured to construct the latest version of the mercker tree from the business data and the transaction;
the first storage unit 305 is configured to update the global index table according to the latest version of the merkel tree;
the consensus unit 307 is configured to hash and pack the root node of the merkel tree of the latest version into the block for consensus after the first storage unit 305 has updated the global index table;
the second storage unit 309 is configured to update the merck tree of each block according to the latest version of the merck tree or the updated global index table.
The operation principle of the system shown in fig. 5 can refer to the method shown in fig. 3, and the details are not repeated here.
Fig. 6 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 6, as another aspect, the present application also provides an apparatus 600 including one or more Central Processing Units (CPUs) 601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data necessary for the operation of the apparatus 600 are also stored. The CPU601, ROM602, and RAM603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing a method. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described herein.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (6)
1. A consensus method, wherein each node of a block chain network stores a mercker tree of each block and a global index table corresponding to the mercker tree of each block, and the global index table uses a block height as a version number, the method comprising:
searching the business data in the global index table according to the first block height corresponding to the business data required by the inquired transaction;
constructing a latest version of the Mercker tree according to the business data and the transaction;
updating the global index table according to the Mercker tree of the latest version, and performing Hash packaging on root nodes of the Mercker tree of the latest version to blocks for consensus;
updating the Merck tree of each block according to the Merck tree of the latest version or the updated global index table.
2. The method according to claim 1, wherein the global index table records only leaf nodes newly added or modified in the merkel tree of the current version in each version;
the looking up target data in the global index table according to the first block height comprises:
searching for target data in the version of the first block height:
if not, searching the target data in the previous version, and circulating the current step until the target data is searched.
3. The method according to claim 1, wherein the global index table records in each version all leaf nodes of the merkel tree of the current version.
4. The method according to any of claims 1-3, characterized in that the Mercker tree is a Mercker state tree, stored in a key-value database.
5. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-4.
6. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-4.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810884295.1A CN109408551B (en) | 2018-08-06 | 2018-08-06 | Data query method and system, consensus method and system, device and storage medium |
| PCT/CN2019/099336 WO2020029931A1 (en) | 2018-08-06 | 2019-08-06 | Data query method and system, consensus method and system, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810884295.1A CN109408551B (en) | 2018-08-06 | 2018-08-06 | Data query method and system, consensus method and system, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109408551A CN109408551A (en) | 2019-03-01 |
| CN109408551B true CN109408551B (en) | 2021-07-06 |
Family
ID=65464216
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810884295.1A Active CN109408551B (en) | 2018-08-06 | 2018-08-06 | Data query method and system, consensus method and system, device and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109408551B (en) |
| WO (1) | WO2020029931A1 (en) |
Families Citing this family (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109359222B (en) * | 2018-08-06 | 2021-07-06 | 杭州复杂美科技有限公司 | Data storage method and system, equipment and storage medium |
| CN109408551B (en) * | 2018-08-06 | 2021-07-06 | 杭州复杂美科技有限公司 | Data query method and system, consensus method and system, device and storage medium |
| CN109857727B (en) * | 2019-03-02 | 2021-05-11 | 杭州复杂美科技有限公司 | Local database reconstruction method, device and storage medium |
| EP3593490A4 (en) * | 2019-03-04 | 2020-03-25 | Alibaba Group Holding Limited | Updating blockchain world state merkle patricia trie subtree |
| 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 |
| CN110188096B (en) * | 2019-04-18 | 2021-08-17 | 创新先进技术有限公司 | Index creating method, device and equipment for data record |
| US10990705B2 (en) | 2019-04-18 | 2021-04-27 | Advanced New Technologies Co., Ltd. | Index creation for data records |
| US10853341B2 (en) | 2019-06-28 | 2020-12-01 | Advanced New Technologies Co., Ltd. | Blockchain based hierarchical data storage |
| CN110347684B (en) * | 2019-06-28 | 2020-09-01 | 阿里巴巴集团控股有限公司 | Block chain based hierarchical storage method and device and electronic equipment |
| CN110287170B (en) * | 2019-06-28 | 2021-05-11 | 杭州复杂美科技有限公司 | Database upgrading method, state data calling method, device and storage medium |
| CN110442577A (en) * | 2019-07-15 | 2019-11-12 | 杭州复杂美科技有限公司 | A kind of storage of status data, inquiry and management method, equipment and storage medium |
| CN110442579B (en) * | 2019-08-02 | 2022-06-28 | 杭州复杂美科技有限公司 | State tree data storage method, synchronization method and equipment and storage medium |
| CN110557452B (en) * | 2019-09-04 | 2022-07-29 | 腾讯科技（深圳）有限公司 | Node management method and device of block chain, storage medium and computer equipment |
| CN110597852A (en) * | 2019-09-27 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Data processing method, device, terminal and storage medium |
| AU2019379711B2 (en) | 2019-12-05 | 2022-04-07 | Alipay (Hangzhou) Information Technology Co., Ltd. | Performing map iterations in a blockchain-based system |
| CN111258988B (en) * | 2020-02-05 | 2023-09-05 | 中国工商银行股份有限公司 | Asset management method, device, electronic equipment and medium |
| CN111488610A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | State data query method and device based on service data block chain |
| CN111556115B (en) * | 2020-04-22 | 2023-04-21 | 财付通支付科技有限公司 | Block chain-based data processing method, device, equipment and storage medium |
| CN112131235A (en) * | 2020-09-21 | 2020-12-25 | 中国电子科技网络信息安全有限公司 | Method for realizing transaction credibility verification in block chain system |
| CN112364209B (en) * | 2020-12-09 | 2023-11-28 | 杭州复杂美科技有限公司 | Distributed data storage method, data query method, device and storage medium |
| CN113282570B (en) * | 2021-05-25 | 2022-06-28 | 杭州复杂美科技有限公司 | Block link point allocation method, computer device and storage medium |
| CN114356927A (en) * | 2021-12-31 | 2022-04-15 | 杭州趣链科技有限公司 | Data storage method and device, computer equipment and storage medium |
| EP4215614A1 (en) | 2022-01-24 | 2023-07-26 | Dynacure | Combination therapy for dystrophin-related diseases |
| CN115081031A (en) * | 2022-07-26 | 2022-09-20 | 成都云智数安科技有限公司 | Tamper-proof block chain data storage method and system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105790954A (en) * | 2016-03-02 | 2016-07-20 | 布比（北京）网络技术有限公司 | Method and system for constructing electronic evidence |
| US9679276B1 (en) * | 2016-01-26 | 2017-06-13 | Stampery, Inc. | Systems and methods for using a block chain to certify the existence, integrity, and/or ownership of a file or communication |
| CN107273556A (en) * | 2017-08-23 | 2017-10-20 | 上海点融信息科技有限责任公司 | Block chain data index method and equipment |
| CN107562775A (en) * | 2017-07-14 | 2018-01-09 | 阿里巴巴集团控股有限公司 | A kind of data processing method and equipment based on block chain |
| CN107729371A (en) * | 2017-09-12 | 2018-02-23 | 深圳先进技术研究院 | The data directory and querying method of block chain, device, equipment and storage medium |
| CN107943951A (en) * | 2017-11-24 | 2018-04-20 | 中钞信用卡产业发展有限公司杭州区块链技术研究院 | A kind of search method and system of block chain business information |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101841566B1 (en) * | 2016-10-11 | 2018-05-04 | 주식회사 코인플러그 | Method for issuing, using, refunding, settling and revocating electric voucher using updated status of balance database by respective blocks in blockchain, and server using the same |
| CN108241968B (en) * | 2017-03-26 | 2020-08-14 | 杭州复杂美科技有限公司 | Method for leading processor to participate block chain consensus |
| CN108304475B (en) * | 2017-12-28 | 2020-11-10 | 比特大陆科技有限公司 | Data query method and device and electronic equipment |
| CN109408551B (en) * | 2018-08-06 | 2021-07-06 | 杭州复杂美科技有限公司 | Data query method and system, consensus method and system, device and storage medium |
-
2018
- 2018-08-06 CN CN201810884295.1A patent/CN109408551B/en active Active
-
2019
- 2019-08-06 WO PCT/CN2019/099336 patent/WO2020029931A1/en active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9679276B1 (en) * | 2016-01-26 | 2017-06-13 | Stampery, Inc. | Systems and methods for using a block chain to certify the existence, integrity, and/or ownership of a file or communication |
| CN105790954A (en) * | 2016-03-02 | 2016-07-20 | 布比（北京）网络技术有限公司 | Method and system for constructing electronic evidence |
| CN107562775A (en) * | 2017-07-14 | 2018-01-09 | 阿里巴巴集团控股有限公司 | A kind of data processing method and equipment based on block chain |
| CN107273556A (en) * | 2017-08-23 | 2017-10-20 | 上海点融信息科技有限责任公司 | Block chain data index method and equipment |
| CN107729371A (en) * | 2017-09-12 | 2018-02-23 | 深圳先进技术研究院 | The data directory and querying method of block chain, device, equipment and storage medium |
| CN107943951A (en) * | 2017-11-24 | 2018-04-20 | 中钞信用卡产业发展有限公司杭州区块链技术研究院 | A kind of search method and system of block chain business information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109408551A (en) | 2019-03-01 |
| WO2020029931A1 (en) | 2020-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109408551B (en) | Data query method and system, consensus method and system, device and storage medium | |
| CN109359222B (en) | Data storage method and system, equipment and storage medium | |
| US10891264B2 (en) | Distributed, scalable key-value store | |
| US10387496B2 (en) | Storing graph data in a relational database | |
| US9092475B2 (en) | Database log parallelization | |
| US20130212131A1 (en) | Symbolic hyper-graph database | |
| US10970173B2 (en) | Logging process in a data storage system | |
| US9922086B1 (en) | Consistent query of local indexes | |
| US20200169402A1 (en) | Data storage on tree nodes | |
| US10489356B1 (en) | Truncate and append database operation | |
| WO2016191995A1 (en) | Method and device for partitioning association table in distributed database | |
| US20210081171A1 (en) | Effectively fusing database tables | |
| US8694525B2 (en) | Systems and methods for performing index joins using auto generative queries | |
| US10599614B1 (en) | Intersection-based dynamic blocking | |
| JP7408626B2 (en) | Tenant identifier replacement | |
| CN109614411B (en) | Data storage method, device and storage medium | |
| US10592530B2 (en) | System and method for managing transactions for multiple data store nodes without a central log | |
| CN111708761A (en) | Partitioned autonomous distributed heterogeneous database management system and method | |
| US20230066110A1 (en) | Creating virtualized data assets using existing definitions of etl/elt jobs | |
| US11620285B2 (en) | Automatic database query translation | |
| CN107038617B (en) | Pre-creation method and device of payment order | |
| US20200249876A1 (en) | System and method for data storage management | |
| US9122400B2 (en) | Managing data set volume table of contents | |
| US20200104391A1 (en) | Ensuring integrity of records in a not only structured query language database | |
| US9588996B2 (en) | Point in time recovery support for pending schema definition changes |
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 |