CN109977274B - Data query and verification method, system, equipment and storage medium - Google Patents
Data query and verification method, system, equipment and storage medium Download PDFInfo
- Publication number
- CN109977274B CN109977274B CN201910255596.2A CN201910255596A CN109977274B CN 109977274 B CN109977274 B CN 109977274B CN 201910255596 A CN201910255596 A CN 201910255596A CN 109977274 B CN109977274 B CN 109977274B
- Authority
- CN
- China
- Prior art keywords
- block
- data
- version number
- value
- hash value
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data query and verification method, a data query and verification system, data query and verification equipment and a storage medium, and belongs to the technical field of block chains. The block chain network node receives a query instruction containing the state hash value of the block, and sequentially searches the corresponding version number, the main key and the corresponding value according to the data mapping relation; the version number is the height of the block, and the state hash value of the block is obtained by performing hash calculation on the state hash value containing the previous block, block state data information and the version number of the block; the data mapping relationship and the state hash value of the block are stored on the network node of the block chain. The invention does not need to construct a tree structure to read the historical value and change the current value, which is helpful to the improvement of the efficiency of data reading and writing and can be effectively used for the index of node state data and the data verification.
Description
Technical Field
The present invention relates to the field of block chain technology, and in particular, to a method, system, device, and storage medium for querying and verifying data.
Background
In the current solution for reading and writing data in a block chain system, a Merkle Tree (Merkle Tree) structure is usually adopted, for example, SPV verification is performed through the Merkle Tree in a bitcoin system, data reading and writing are performed through the Merkle prefix Tree (MPT for short) in an etherhouse system, and the like. The defects of the conventional Mercker tree structure are as follows: the stored data limits the reading performance of the system, and the data of one transaction needs to be inquired through multiple reading operations. For example, for a 20-layer merkel tree, the query for the data of a leaf node needs 20 read operations to complete, resulting in 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 per second can be read. In the existing scheme, if data of the merkel tree is written in a local database of a node, a block cannot be generated if the data is crashed, and a great data risk is undoubtedly brought to a user who wants to quickly store and read data information.
Disclosure of Invention
1. Technical problem to be solved by the invention
In order to overcome the technical problems, the invention provides a data query and verification method, a system, equipment and a storage medium. The read-write operation can be executed concurrently without mutual influence, and the data can be stored in a common KVDB in a tiled manner, and a tree structure is not required to be constructed to read a history value and change a current value, which is helpful to the efficiency improvement of data read-write.
2. Technical scheme
In order to solve the problems, the technical scheme provided by the invention is as follows:
a data query method, a block chain network node receives a query instruction containing a state hash value of a block, and sequentially searches a corresponding version number, a main key and a corresponding value according to a data mapping relation; the version number is the height of the block, the data corresponding relation comprises the corresponding relation between the state hash value of the block and the version number of the block, and the corresponding relation between the new main key and the value is formed by splicing the main key and the version number of the block; the state hash value of the block is obtained by carrying out hash calculation on the state hash value containing the previous block, block state data information and the version number of the block; the data mapping relationship and the state hash value of the block are stored on the network node of the block chain.
Further, the data mapping relation and the state hash value of the block are stored in a KV database of the network node of the block chain. Furthermore, the version number of the block and the primary key are spliced into a new primary key, and the new primary key and the value together form the block state data information. Further, the data mapping relationship further includes a corresponding relationship between the version number of the block and the state hash value of the block. Further, the data mapping relationship further includes a primary key of the latest version number, and a corresponding relationship between the value and the value.
The invention also provides a data verification method, wherein on a block chain network node, according to the data query method, the version number, the main key and the corresponding value of the data are searched, the block state data information is calculated, the state hash value of the block is calculated according to the state hash value, the block state data information and the version number of the previous block, the comparison is carried out, if the hash values are consistent, the data is not tampered, and the verification is passed; otherwise, the data is erroneous or altered.
Further, the version number of the block and the primary key are spliced into a new primary key, and the new primary key and the value together form the block state data information. Further, the data mapping relationship further includes a corresponding relationship between the version number of the block and the state hash value of the block. Further, the data mapping relationship further includes a primary key of the latest version number, and a corresponding relationship between the value and the value.
Accordingly, the present invention provides a data query system, and a data query method according to the above, including:
a receiving unit for receiving a query command containing a state hash value of a block;
according to the data mapping relation, a query unit used for sequentially searching the corresponding version number, the main key and the corresponding value;
the first storage unit is used for storing the state hash value of each block;
and the second storage unit is used for storing the data mapping relation.
Further, the second storage unit is a KV database.
A data verification system, a data verification method according to the above, and a data inquiry system according to the above, comprising:
a receiving unit for receiving a query command containing a state hash value of a block;
according to the data mapping relation, a query unit used for sequentially searching the corresponding version number, the main key and the corresponding value;
the first storage unit is used for storing the state hash value of each block;
a second storage unit for storing data mapping relation;
and the verification unit is used for verifying whether the data has errors.
An apparatus, the apparatus comprising:
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 of any of the above.
A storage medium storing a computer program which, when executed by a processor, implements a method as claimed in any one of the preceding claims.
3. Advantageous effects
Compared with the prior art, the technical scheme provided by the invention has the following beneficial effects:
the invention does not need to construct a tree structure to read the historical value and change the current value, which is helpful to the improvement of the efficiency of data reading and writing and can be effectively used for the index of node state data and the data verification. The state data can be conveniently stored, inquired and verified. The storage is convenient, the query efficiency is high, and the verification is simple and effective.
Drawings
Fig. 1 is a flowchart of a data query method according to an embodiment of the present invention.
FIG. 2 is a flowchart of a data verification method according to an embodiment of the invention.
Fig. 3 is a schematic structural diagram of a data query system according to an embodiment of the present invention.
Fig. 4 is a schematic structural diagram of a data verification system according to an embodiment of the present invention.
Fig. 5 is a flowchart of a data storage method according to a preferred embodiment of the present invention.
Fig. 6 is a schematic structural diagram of a data storage system according to an embodiment of the present invention.
FIG. 7 is a diagram illustrating a data access process.
Fig. 8 is a schematic structural diagram of a data storage system provided in a preferred embodiment of fig. 6.
Fig. 9 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
For a further understanding of the present invention, reference will now be made in detail to the embodiments illustrated in the drawings.
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.
The terms first, second, and the like in the present invention are provided for convenience of describing the technical solution of the present invention, and have no specific limiting effect, but are all generic terms, and do not limit the technical solution of the present invention.
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.
Example 1
As shown in fig. 1, a data query method includes the steps of:
s401, receiving a query instruction containing a state hash value of a block by a block chain network node, and S403, sequentially finding a corresponding version number, a main key and a corresponding value according to a data mapping relation; the version number is the height of the block, the data corresponding relation comprises the corresponding relation between the state hash value of the block and the version number of the block, and the corresponding relation between the new main key and the value is formed by splicing the main key and the version number of the block; the state hash value of the block is obtained by carrying out hash calculation on the state hash value containing the previous block, block state data information and the version number of the block; the data mapping relationship and the state hash value of the block are stored on the network node of the block chain.
Further, the data mapping relation and the state hash value of the block are stored in a KV database of the network node of the block chain. Furthermore, the version number of the block and the primary key are spliced into a new primary key, and the new primary key and the value together form the block state data information. Further, the data mapping relationship further includes a corresponding relationship between the version number of the block and the state hash value of the block. Further, the data mapping relationship further includes a primary key of the latest version number, and a corresponding relationship between the value and the value.
The present invention also provides a data verification method, as shown in fig. 2, on the blockchain network node 20, according to the above-mentioned data query method, the steps are: s501, finding the version number, the main key and the corresponding value of the data, calculating block state data information, S503, calculating the state hash value of the block according to the state hash value, the block state data information and the version number of the previous block, comparing, if the hash values are consistent, the data is not tampered, and the verification is passed; otherwise, the data is erroneous or altered.
Further, the version number of the block and the primary key are spliced into a new primary key, and the new primary key and the value together form the block state data information. Further, the data mapping relationship further includes a corresponding relationship between the version number of the block and the state hash value of the block. Further, the data mapping relationship further includes a primary key of the latest version number, and a corresponding relationship between the value and the value.
Accordingly, the present invention provides a data query system, according to the above-mentioned data query method, as shown in fig. 3, including:
a receiving unit 601 for receiving a query instruction containing a state hash value of a block;
a query unit 603 configured to sequentially find a corresponding version number, a corresponding primary key, and a corresponding value according to the data mapping relationship;
a first storage unit 605 for storing the state hash value of each block;
and a second storage unit 607 for storing the data mapping relationship.
Further, the second storage unit 607 is a KV database.
A data verification system, a data verification method according to the above, and a data inquiry system according to the above, as shown in fig. 4, comprising:
a receiving unit 601 for receiving a query instruction containing a state hash value of a block;
a query unit 603 configured to sequentially find a corresponding version number, a corresponding primary key, and a corresponding value according to the data mapping relationship;
a first storage unit 605 for storing the state hash value of each block;
a second storage unit 607 for storing data mapping relations;
a verification unit 609 for verifying whether the data is erroneous.
Corresponding to the query method and the verification method of the present invention is a data storage method, as shown in fig. 5:
s101, carrying out hash calculation on the state hash value of the previous block, the block state data information and the version number together to obtain the state hash value of the block;
s103, storing the state hash value of the block and the data mapping relation in a local database of the network node of the block chain.
The version number is the height of a block, and a local database of the network node of the block chain is a KV database; and splicing the version number and the primary key into a new primary key, and forming the block state data information together with the value. The data mapping relation comprises the corresponding relation between the state hash value and the version number of the block, the main key and the version number are spliced into a new main key, and the corresponding relation between the new main key and the value is the block state data information. The primary key may also contain other identifying information, such as information to distinguish the purpose of the primary key, etc.
The data mapping relationship further includes a correspondence between the version number and the state hash value of the block. The data mapping relationship also comprises a corresponding relationship between a main key of the latest version number and the value.
Historical data in the block chain cannot be modified, and the modification only occurs on the block which is currently generated; therefore, as shown in fig. 7, the proportion of the read history data is high (reading of history block data), and the proportion of the write data is low (modifying data only in the newly generated block). Reading one of the blocks 101, 102, and 103, and writing the block 104 can be performed simultaneously without interference.
The variable value of which the main Key is Key changes in the block height 101 and 10 state 2, and the corresponding Key in the KVDB: 101- > value101 and Key: 102- > value102, new value Key is being written in the current block 104: 104- > value 104;
then for the historical data Key: 101. key: 102 may have many concurrent reads, for Key: 104 has unique current write, these read-write operations can be executed concurrently without mutual influence, and these data can be stored in a flat way in a common KVDB, that is, the data is stored according to a simple kv correspondence without storing additional tree-structured information. The read-write only needs to form a unique main Key (Key: version or Key: height) with the Key according to the block height, and a tree structure is not required to be constructed to read the historical value and change the current value, so that the efficiency of data read-write is greatly improved, and the method can be effectively used for indexing node state data.
As shown in fig. 8, the block heights (version numbers) are 0, 1, 2, and 3, the state hash value h0 of the block having the version number 0 is hash (nil, KVSet, height), the state data KVSet of the block is K1: v1, K2: v 2.; the data mapping relationship includes the correspondence between the state hash value and the version number of the block (hash- > version as shown in fig. 8), the primary key and the version number are spliced into a new primary key, and the correspondence between the value and the value, that is, the block state data information (key: version- > value as shown in fig. 8). The data mapping relationship further includes a correspondence between the version number and the state hash value of the block (version- > hash shown in fig. 8). The data mapping relationship further includes a primary key of the latest version number, and a corresponding relationship between the primary key and a value (latest: key- > value shown in FIG. 8). The storage of the data creates conditions for querying the latest version of the data according to the list. Since the kv database is stored in order according to the key value, the data at the beginning of latest is stored adjacently, if the key value has some common prefixes, the data can be continuously fetched into multiple pieces without consuming performance. If there is no latest: key data, each key corresponds to multiple versions of data, and efficient list operation cannot be directly performed.
And writing the state hash value and the data mapping relation of the block with the version number of 0 into a local key-value database for storage. A state hash value (statehash) h1 of a block having a version number of 1 ═ hash (hO, KVSet, height), and state data KVSet of the block is K1: v1', K3: v3..; the data mapping status relationship includes a correspondence between a status hash value and a version number of the block (hash- > version as shown in fig. 8), a correspondence between a primary key and a version number which are spliced into a new primary key and a value, that is, block status data information (key: version- > value as shown in fig. 8). The data mapping relationship further includes a correspondence between the version number and the state hash value of the block (version- > hash shown in fig. 8). The data mapping relationship further includes a primary key of the latest version number, and a corresponding relationship between the primary key and a value (latest: key- > value shown in FIG. 8). And writing the state hash value and the data mapping relation of the block with the version number of 1 into a local key-value database for storage.
The state hash value (statehash) h2 of the block having the version number of 2 is hash (h1, KVSet, height), and the state data KVSet of the block is K4: v4, K5: v5..; the data mapping relationship includes the correspondence between the state hash value and the version number of the block (hash- > version as shown in fig. 8), the primary key and the version number are spliced into a new primary key, and the correspondence between the value and the value, that is, the block state data information (key: version- > value as shown in fig. 8). The data mapping relationship further includes a correspondence between the version number and the state hash value of the block (version- > hash shown in fig. 8). The data mapping relationship further includes a primary key of the latest version number, and a corresponding relationship between the primary key and a value (latest: key- > value shown in FIG. 8). And writing the state hash value and the data mapping relation of the block with the version number of 1 into a local key-value database for storage.
A state hash value (statehash) h3 of the block with the version number of 3 is hash (h2, KVSet, height), state data KVSet of the block, and a data mapping relationship includes a correspondence between the state hash value and the version number of the block (hash- > version shown in fig. 8), a primary key and a version number are pieced together to form a new primary key, and a correspondence between the value, that is, block state data information (key: version- > value shown in fig. 8). The data mapping relationship further includes a correspondence between the version number and the state hash value of the block (version- > hash shown in fig. 8). The data mapping relationship further includes a primary key of the latest version number, and a corresponding relationship between the primary key and a value (latest: key- > value shown in FIG. 8). And writing the state hash value and the data mapping relation of the block with the version number of 1 into a local key-value database for storage.
As shown in fig. 6, correspondingly, the present embodiment proposes a data storage system distributed on each node 20 of the blockchain network, and according to the data storage method described above, the data storage system includes:
a first storage unit 305 for storing a state hash value of each block;
a second storage unit 307 for storing data mapping relationships;
a hash operation unit 303 for calculating a state hash value of each block.
The second storage unit 307 is a KV database.
And splicing the version number and the primary key into a new primary key, and forming the block state data information together with the value.
The data mapping relation comprises a corresponding relation between a state hash state value and a version number of the block, and a corresponding relation between a new main key and a value is formed by splicing the main key and the version number. The data mapping relationship further includes a correspondence between the version number and the state hash value of the block. The data mapping relationship also comprises a corresponding relationship between a main key of the latest version number and the value.
Example 2
An apparatus, the apparatus comprising:
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 of any of the above.
A storage medium storing a computer program which, when executed by a processor, implements a method as claimed in any one of the preceding claims.
Fig. 9 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 9, as another aspect, the present application also provides an apparatus 500 including one or more Central Processing Units (CPUs) 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the apparatus 500 are also stored. The CPU501, ROM502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication via a network such as the internet, and the processing driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to embodiments disclosed herein, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments disclosed herein include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the method described in any of the embodiments above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511.
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 (14)
1. A data query method is characterized in that a block chain network node receives a query instruction containing a state hash value of a block, and sequentially searches a corresponding version number, a main key and a corresponding value according to a data mapping relation; the version number is the height of the block, the data corresponding relation comprises the corresponding relation between the state hash value of the block and the version number of the block, and the corresponding relation between the new main key and the value is formed by splicing the main key and the version number of the block; the state hash value of the block is obtained by carrying out hash calculation on the state hash value containing the previous block, block state data information and the version number of the block; the data mapping relationship and the state hash value of the block are stored on the network node of the block chain.
2. A data query method as claimed in claim 1, wherein the data mapping relationship and the hash value of the state of the block are stored in KV database of the node of the blockchain network.
3. A data query method as claimed in claim 1, wherein the version number of the block is spliced with the primary key to form a new primary key, and the new primary key and the value together form the block status data information.
4. A data query method as claimed in claim 1, wherein the data mapping relationship further includes a correspondence between a version number of the block and a state hash value of the block.
5. The method according to claim 4, wherein the data mapping relationship further includes a correspondence relationship between a primary key of the latest version number and a value of value.
6. A data verification method, characterized in that, on a blockchain network node, according to the data query method of claim 1, the version number, the primary key, and the corresponding value of the data are found, the block status data information is calculated, the block status hash values are calculated according to the previous block status hash value, the block status data information, and the version number, comparison is performed, and if the hash values match, the data is not tampered, and the verification is passed; otherwise, the data is erroneous or altered.
7. A data verification method as claimed in claim 6, wherein the version number of the block is spliced with the primary key to form a new primary key, and the new primary key and the value together form said block status data information.
8. The data verification method according to claim 6, wherein the data mapping relationship further includes a correspondence between a version number of the block and a state hash value of the block.
9. The data verification method of claim 6, wherein the data mapping further comprises a correspondence between a primary key of the latest version number and a value.
10. A data query system, characterized by a data query method according to claim 1, comprising:
a receiving unit for receiving a query command containing a state hash value of a block;
according to the data mapping relation, a query unit used for sequentially searching the corresponding version number, the main key and the corresponding value;
the first storage unit is used for storing the state hash value of each block;
and the second storage unit is used for storing the data mapping relation.
11. A data query system as claimed in claim 10, wherein said second storage unit is a KV database.
12. A data verification system, characterized by a data verification method according to claim 6 and a data query system according to claim 10 or 11, comprising:
a receiving unit for receiving a query command containing a state hash value of a block;
according to the data mapping relation, a query unit used for sequentially searching the corresponding version number, the main key and the corresponding value;
the first storage unit is used for storing the state hash value of each block;
a second storage unit for storing data mapping relation;
and the verification unit is used for verifying whether the data has errors.
13. 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-9.
14. 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-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910255596.2A CN109977274B (en) | 2019-03-31 | 2019-03-31 | Data query and verification method, system, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910255596.2A CN109977274B (en) | 2019-03-31 | 2019-03-31 | Data query and verification method, system, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109977274A CN109977274A (en) | 2019-07-05 |
| CN109977274B true CN109977274B (en) | 2021-05-11 |
Family
ID=67082037
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910255596.2A Active CN109977274B (en) | 2019-03-31 | 2019-03-31 | Data query and verification method, system, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109977274B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3669281B1 (en) | 2019-07-11 | 2024-04-03 | Advanced New Technologies Co., Ltd. | Shared blockchain data storage |
| WO2019179539A2 (en) * | 2019-07-11 | 2019-09-26 | Alibaba Group Holding Limited | Shared blockchain data storage |
| EP3673620B8 (en) | 2019-07-11 | 2022-02-16 | Advanced New Technologies Co., Ltd. | Shared blockchain data storage |
| CN111046065B (en) * | 2019-10-28 | 2022-06-17 | 北京大学 | Extensible high-performance distributed query processing method and device |
| CN110958303B (en) * | 2019-11-14 | 2022-06-24 | 杭州复杂美科技有限公司 | Block storage and query method, equipment and storage medium |
| CN111414649B (en) * | 2020-03-05 | 2023-03-24 | 合肥达朴汇联科技有限公司 | Data verification method and system based on block chain |
| CN112486561B (en) * | 2020-11-25 | 2024-03-22 | 北京电力交易中心有限公司 | Version backtracking method and device based on block chain and related equipment |
| CN113468224A (en) * | 2021-09-03 | 2021-10-01 | 支付宝(杭州)信息技术有限公司 | Method and device for storing and inquiring state data and executing transaction in block chain |
| CN113505138B (en) * | 2021-09-06 | 2021-12-21 | 支付宝(杭州)信息技术有限公司 | Method and apparatus for state attestation and execution of blocks in a blockchain system |
| CN114003972B (en) * | 2021-12-30 | 2022-06-10 | 北京连琪科技有限公司 | Method for generating block state commitment and certification and verifying block state certification |
| CN118035360B (en) * | 2024-04-12 | 2024-07-12 | 山东浪潮数字商业科技有限公司 | Incremental data identification, positioning and updating method |
| CN118075033B (en) * | 2024-04-19 | 2024-07-05 | 台州市大数据发展有限公司 | Network security protection method and system |
Family Cites Families (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9521186B2 (en) * | 2007-09-13 | 2016-12-13 | International Business Machines Corporation | Method and system for file transfer over a messaging infrastructure |
| CN101163141B (en) * | 2007-11-12 | 2012-01-11 | 中兴通讯股份有限公司 | Method of implementing data immediate processing based on wireless session protocol |
| CN101408899B (en) * | 2008-11-21 | 2010-09-29 | 北京中企开源信息技术有限公司 | Method and apparatus for switching website multiple data sources |
| US8572036B2 (en) * | 2008-12-18 | 2013-10-29 | Datalight, Incorporated | Method and apparatus for fault-tolerant memory management |
| CN101510209B (en) * | 2009-03-30 | 2012-05-30 | 北京金山软件有限公司 | Method, system and server for implementing real time search |
| CN101533414A (en) * | 2009-04-15 | 2009-09-16 | 阿里巴巴集团控股有限公司 | A method and a device for generating unique identifier of database record |
| US10713654B2 (en) * | 2016-01-21 | 2020-07-14 | International Business Machines Corporation | Enterprise blockchains and transactional systems |
| CN105912618B (en) * | 2016-04-07 | 2019-04-23 | 浙江万马新能源有限公司 | The charging pile charging transaction means of communication and device based on block chain |
| US10432411B2 (en) * | 2016-05-10 | 2019-10-01 | Acronis International Gmbh | System and method for file time-stamping using a blockchain network |
| CN106227833A (en) * | 2016-07-26 | 2016-12-14 | 宁圣金融信息服务（上海）有限公司 | Block chaining search engine method, system and device |
| CN107045650B (en) * | 2016-10-25 | 2021-06-11 | 罗轶 | Network car booking system based on block chain |
| CN106570710A (en) * | 2016-10-27 | 2017-04-19 | 纸飞机（北京）科技有限公司 | Commodity anti-counterfeiting method and device |
| CN106548092B (en) * | 2016-10-31 | 2019-07-16 | 杭州嘉楠耘智信息科技有限公司 | File processing method and device |
| CN106341421B (en) * | 2016-10-31 | 2019-04-02 | 杭州云象网络技术有限公司 | A kind of method for interchanging data based on block chain technology |
| CN106874440B (en) * | 2017-02-07 | 2019-11-12 | 杭州秘猿科技有限公司 | A kind of block chain state storage method based on SQL database |
| CN106920167A (en) * | 2017-02-24 | 2017-07-04 | 北京航空航天大学 | A kind of block chain mechanism based on P2P finance and common recognition algorithm |
| CN113111388A (en) * | 2017-03-31 | 2021-07-13 | 唐晓领 | Method, device and system for sharing transaction metadata information by financing parties based on block chain |
| CN107220896A (en) * | 2017-04-23 | 2017-09-29 | 杭州复杂美科技有限公司 | A kind of financing by accounts receivable based on block chain technology |
| CN107046542B (en) * | 2017-04-24 | 2020-04-14 | 杭州云象网络技术有限公司 | Method for realizing consensus verification by adopting hardware at network level |
| CN107317842B (en) * | 2017-05-31 | 2019-11-22 | 北京大学深圳研究生院 | Block chain synchronous method and device based on NDN |
| CN107391298B (en) * | 2017-07-06 | 2021-02-09 | 上海策链信息科技有限公司 | Data storage state detection method and device and computer readable storage medium |
| CN109359222B (en) * | 2018-08-06 | 2021-07-06 | 杭州复杂美科技有限公司 | Data storage method and system, equipment and storage medium |
-
2019
- 2019-03-31 CN CN201910255596.2A patent/CN109977274B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109977274A (en) | 2019-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109977274B (en) | Data query and verification method, system, equipment and storage medium | |
| US10983994B2 (en) | Partition access method for query optimization | |
| US8924373B2 (en) | Query plans with parameter markers in place of object identifiers | |
| Dang et al. | XIAO: Tuning code clones at hands of engineers in practice | |
| CN110795455A (en) | Dependency relationship analysis method, electronic device, computer device and readable storage medium | |
| US9218394B2 (en) | Reading rows from memory prior to reading rows from secondary storage | |
| CN111258966A (en) | Data deduplication method, device, equipment and storage medium | |
| US10296497B2 (en) | Storing a key value to a deleted row based on key range density | |
| CN109670975B (en) | Method, medium, and electronic device for generating a single number in a computer system | |
| Zhu et al. | Matching heterogeneous event data | |
| CN111104426B (en) | Data query method and system | |
| CN109815240B (en) | Method, apparatus, device and storage medium for managing index | |
| US9390111B2 (en) | Database insert with deferred materialization | |
| EP4213042A1 (en) | Merging and unmerging entity representations via resolver trees | |
| US8396858B2 (en) | Adding entries to an index based on use of the index | |
| CN110096505B (en) | Data storage method, system, equipment and storage medium | |
| CN109614411B (en) | Data storage method, device and storage medium | |
| US11080332B1 (en) | Flexible indexing for graph databases | |
| US11163801B2 (en) | Execution of queries in relational databases | |
| WO2014191719A1 (en) | Datasets profiling tools, methods, and systems | |
| CN109815213A (en) | It is deleted on a kind of Append-Only database and the method and system of modification data | |
| US20160283572A1 (en) | Dynamic data partitioning extension | |
| US20240202197A1 (en) | Distributed data storage using materialized intermediate partitions | |
| US20240232170A1 (en) | Merging and unmerging entity representations via resolver trees | |
| Kotsinas | Ranking Queries Over Range Data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |