CN113111086B - Data storage and query response method and block execution method - Google Patents
Data storage and query response method and block execution method Download PDFInfo
- Publication number
- CN113111086B CN113111086B CN202110385364.6A CN202110385364A CN113111086B CN 113111086 B CN113111086 B CN 113111086B CN 202110385364 A CN202110385364 A CN 202110385364A CN 113111086 B CN113111086 B CN 113111086B
- Authority
- CN
- China
- Prior art keywords
- transaction
- state data
- data
- block
- keys
- 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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
Abstract
The invention provides a data storage and query response method, a block execution method, computer equipment and a storage medium, wherein the method comprises the following steps: determining a plurality of first block chain nodes needing to store first state data in a block chain network according to a pre-configured state data distributed storage rule; deleting the locally stored first state data when the current node is not included in the first blockchain node; and receiving first data query request information including the first key sent by the second blockchain node, and returning the first state data when the first state data corresponding to the first key is locally stored. The method and the device ensure the block execution efficiency in the environment of distributed storage of the state data.
Description
Technical Field
The present application relates to the field of block chaining technologies, and in particular, to a data storage and query response method, a block execution method, a computer device, and a storage medium.
Background
In the prior art, the steps of performing a transaction are: 1. and (2) reading the state data required for executing the transaction from the local, and executing the transaction according to the state data. The transaction is executed serially, the delay of reading the local state data is generally within 1ms, and the delay has little influence on the reading of the state data and the execution of the transaction. But as blocks grow and state data grows, it is desirable to store the state data in a distributed manner. However, if the state data is stored in a distributed manner, the time delay for remotely acquiring the state data among different nodes is generally greater than 1s, so that the time for reading the state data and executing the transaction is greatly prolonged, and a large amount of time is required for executing one block, which affects the overall performance of a block chain.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it is desirable to provide a data storage and query response method, a block execution method, a computer device, and a storage medium that ensure block execution efficiency in an environment of distributed storage of state data.
In a first aspect, the present invention provides a data storage and query response method suitable for a blockchain node, where the method includes:
determining a plurality of first block chain nodes needing to store first state data in a block chain network according to a pre-configured state data distributed storage rule;
deleting the locally stored first state data when the current node is not included in the first blockchain node;
receiving first data query request information including a first key sent by a second blockchain node, and returning first state data when the first state data corresponding to the first key is locally stored; the first state data is used for the second block chain link point to execute a first transaction which can be executed only by reading the first state data, the first transaction comprises keys corresponding to the state data required to be read for executing the first transaction, and the second block chain link point is configured to generate a plurality of data query request information according to the keys and the state data distributed storage rule and simultaneously send the data query request information to the corresponding block chain link points respectively.
In a second aspect, the present invention provides a block execution method applied to a block chain node, where the block chain node is configured to distribute storage status data and store part of status data determined to be stored in a current node according to a distributed storage rule, the method including:
receiving or generating a first block; the first block comprises a plurality of first transactions, and the first transactions comprise second keys corresponding to second state data required to be read for executing the first transactions;
summarizing second keys of the first transactions;
executing for each second key: sending inquiry request information to a plurality of second block chain nodes in which second keys are stored;
and executing the first block according to the returned second state data.
In a third 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 data storage and query response method, a block execution method, provided according to embodiments of the present invention.
In a fourth aspect, the present invention also provides a storage medium storing a computer program, the computer program enabling a computer to execute the data storage and query response method and the block execution method provided according to the embodiments of the present invention.
According to the data storage and query response method, the block execution method, the computer device and the storage medium provided by the embodiments of the invention, a plurality of first block chain nodes needing to store first state data are determined in a block chain network according to a pre-configured state data distributed storage rule; deleting the locally stored first state data when the current node is not included in the first blockchain node; receiving first data query request information including a first key sent by a second blockchain node, and returning first state data when the first state data corresponding to the first key is locally stored; the first state data is used for the second block chain link point to execute a first transaction which can be executed only by reading the first state data, the first transaction comprises keys corresponding to the state data required to be read for executing the first transaction, the second block chain link point is configured with a method for generating a plurality of data query request information according to the keys and a state data distributed storage rule and simultaneously respectively sending the data query request information to the corresponding block chain link points, and block execution efficiency is guaranteed in a state data distributed storage environment.
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 flowchart of a data storage and query response method according to an embodiment of the present invention.
Fig. 2 is a flowchart of a block execution method according to an embodiment of the present invention.
Fig. 3 is a schematic structural diagram of a computer device 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.
Fig. 1 is a flowchart of a data storage and query response method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides a data storage and query response method suitable for a blockchain node, where the method includes:
s12: determining a plurality of first block chain nodes needing to store first state data in a block chain network according to a pre-configured state data distributed storage rule;
s14: deleting the locally stored first state data when the current node is not included in the first blockchain node;
s16: receiving first data query request information including a first key sent by a second blockchain node, and returning first state data when the first state data corresponding to the first key is locally stored; the first state data is used for the second block chain link point to execute a first transaction which can be executed only by reading the first state data, the first transaction comprises keys corresponding to the state data required to be read for executing the first transaction, and the second block chain link point is configured to generate a plurality of data query request information according to the keys and the state data distributed storage rule and simultaneously send the data query request information to the corresponding block chain link points respectively.
Specifically, the block chain records the correspondence between the prefixes and the fragments of the keys corresponding to the state data, and S12 includes "search for a first fragment according to a first prefix of a first key corresponding to the first state data; determining a plurality of nodes in the first fragment as a first block chain node as an example; suppose there are 4 segments in the blockchain network, segment 1 has blockchain nodes 1-node 10, segment 2 has blockchain nodes 11-node 20, segment 3 has blockchain nodes 21-node 30, and segment 4 has blockchain nodes 31-node 40; each node of the segment 1 stores state data with prefixes of a-b, each node of the segment 2 stores state data with prefixes of c-g, each node of the segment 3 stores state data with prefixes of h-n, and each node of the segment 4 stores state data with prefixes of o-z;
assuming that the state data to be stored is the state data in the block (10); in the block (10), only the transfer transaction tx1(addr (A), addr (B) and 10) is carried out, and the state data to be stored in the block (10) is the balance of addr (A) and the balance of addr (B);
for the balance of addr (A):
step S12 is executed by node 1-node 40, and the corresponding key is searched according to the balance of addr (a), where the corresponding key is addr (a), and the block link points storing the balance of addr (a) are node 1-node 10;
node1 is included in node 1-node 10, and then the process is ended; similarly, node 2-node 10 are finished;
if node 11-node 40 are not included in node 1-node 10, then step S14 is executed to delete the balance of addr (a);
the data storage principle of the balance of addr (B) is similar to that of addr (B), and the description is omitted here.
Assuming that block (11) is generated by node11, the block (11) is received by a node 11-removed block chain node; block (11) comprises tx 2-tx 10; keys required for executing tx2 to tx10 are assumed to be k1 to k20, wherein prefixes of k1 to k10 are a, and prefixes of k11 to k20 are z;
node 1-node 40 inquire that each node of segment 1 stores state data with prefixes a-b, and node 11-node 40 generate data inquiry request information { k1, k2, …, k10 };
the node 11-node 40 sends data query request information { k1, k2, …, k10} to a plurality of nodes of the segment 1;
the nodes of the segment 1 execute the step S16 and return the state data of k1, k2, … and k 10; at this time, each of the nodes 1 to 40 has state data of k1, k2, …, and k 10;
node 1-node 40 inquire that each node of segment 4 stores state data with prefix o-z, and node 1-node 30 generate data inquiry request information { k11, k2, …, k20 };
the nodes 1 to 30 send data query request information { k11, k12, … and k20} to a plurality of nodes of the segment 4;
the nodes of the segment 4 execute the step S16 and return the state data of k11, k12, … and k 20; at this time, each of the nodes 1 to 40 has state data of k11, k12, …, and k 20;
the nodes 1 to 40 execute tx2 to tx10 to execute block (11) according to the state data of k1 to k 20.
In more embodiments, the number of fragments, the block chain node configured on each fragment, and the correspondence between fragments and prefixes of keys are not limited to the above examples, and may also be configured according to actual requirements, for example, a prefix may also be a plurality of letters aa-bb and bc-dx, and the same technical effect may be achieved.
In more embodiments, S12 may also be configured according to actual requirements, for example, configured to "perform a hash operation on the first data set where the first state data is located to obtain the first data by calculation; respectively calculating a first exclusive or value of the first data and the node id of each block chain node; the same technical effect can be achieved by determining the first number of block link points with the smallest first exclusive-or value as the first block chain node ".
In further embodiments, when receiving status data of the same key returned by other blockchain nodes, a blockchain node may perform consensus on the status data and perform transactions in the block according to the consensus status data.
In further embodiments, the keys to be read may be sorted, and the blockchain node may preferentially return the status data of the transaction with the earlier sequence number when responding to the query. Thus, the block chain node for executing transaction can execute partial transaction first, that is, read-while-execute can be realized.
Those skilled in the art should understand that the triggering mechanism of S12 can be configured according to actual requirements, for example, configured to execute step S12 immediately after executing one tile; or, step S12 is executed immediately after executing a certain number of consecutive blocks (for example, after executing blocks (1) to (1000)); or, configured to perform step S12 on the non-distributed stored block with the safe execution height; alternatively, the step S12 may be executed when the key of the same prefix reaches a certain value, and the same technical effect may be achieved.
It should be understood by those skilled in the art that when data contained in one fragment is too large, the fragment should be split according to actual requirements, for example, if the size of one fragment exceeds 200G, the fragment will be split into two fragments of 100G (for example, into a fragment x and a fragment y), accordingly, a node on the fragment x should delete 100G of data corresponding to the fragment y, and a node on the fragment y should delete 100G of data corresponding to the fragment x.
Those skilled in the art should understand that the number of the blockchain nodes on different slices is not fixed, but when the number of the blockchain nodes in some slices is too large or too small, the blockchain should appropriately adjust the blockchain nodes in different slices, for example, if the number of the blockchain nodes of slice 1 is 50, and the number of the blockchain nodes of slices 2 to 4 is 20, then some blockchain nodes on slice 1 should be allocated to slices 2 to 4; the adjusted block chain node point should adjust the stored state data, delete the state data which is not needed to be stored, and request the state data which needs to be stored from other block chain node points of the new segment.
In the prior art, the steps of performing a transaction are: 1. and (2) reading the state data required for executing the transaction from the local, and executing the transaction according to the state data. The transaction is executed serially, the delay of reading the local state data is generally within 1ms, and the delay has little influence on the reading of the state data and the execution of the transaction. But as blocks grow, there is more and more status data, and it is desirable to store the status data in a distributed manner. However, if the state data is stored in a distributed manner, the delay for remotely acquiring the state data between different nodes is generally greater than 1s, and if a certain block needs to read the distributed state data 10 times, the block needs at least 10s to finish execution, which affects the overall performance of the block chain.
In the present application, no matter how much state data needs to be read in a distributed manner, all state data are read within 1 s.
The embodiment ensures the block execution efficiency in the environment of distributed storage of the state data.
Preferably, the recording of the correspondence between prefixes and slices of keys corresponding to the state data on the blockchain, and the determining of a plurality of first blockchain link points, at which the first state data needs to be stored, in the blockchain network according to the preconfigured distributed storage rule for the state data includes:
searching a first fragment according to a first prefix of a first key corresponding to the first state data;
and determining a plurality of nodes in the first fragment as first block chain nodes.
The data storage and query response principle of the above embodiments can refer to the method shown in fig. 1, and will not be described herein again.
Preferably, the determining a plurality of first block link points, in which the first status data is to be stored, in the block link network according to the preconfigured distributed storage rule for status data comprises:
performing hash operation on a first data set where the first state data is located to calculate to obtain first data;
respectively calculating a first exclusive or value of the first data and the node id of each block chain node;
a first number of block link points for which the first xor value is the smallest is determined as a first block chain node.
The data storage and query response principle of the above embodiments can refer to the method shown in fig. 1, and will not be described herein again.
Preferably, each first key is stored in the payload field of the first transaction.
Preferably, the first key is stored in the keyist field of the first transaction.
Further preferably, the payload field or the keylist field includes first compressed data, and the first compressed data is obtained by compressing each first key required to be read for executing the first transaction. The compression method comprises common prefix compression and the like, and the prefix compression method is that the existing key: tset1, key: test1, key: teas2, key: sabo, and key: sabo2, which become "key: test1, 6as2, 4sabo, 82" after being compressed, the key does not start with a number, and if the first is a number, it represents that the prefix part corresponding to the number of the last key is compressed; some storage space can be compressed in the above way; the present application does not limit the method of compressing each first key.
Fig. 2 is a flowchart of a block execution method according to an embodiment of the present invention. As shown in fig. 2, in this embodiment, the present invention provides a block execution method applied to a blockchain node, where the blockchain node is configured to distribute storage status data and store a part of status data that should be stored in a current node according to a distributed storage rule, where the method includes:
s22: receiving or generating a first block; the first block comprises a plurality of first transactions, and the first transactions comprise second keys corresponding to second state data required to be read for executing the first transactions;
s24: summarizing second keys of the first transactions;
s26: executing for each second key: sending inquiry request information to a plurality of second block chain nodes in which second keys are stored;
s28: and executing the first block according to the returned second state data.
The principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
The embodiment ensures the block execution efficiency in the environment of distributed storage of the state data.
Preferably, each first key is stored in the payload field of the first transaction.
Preferably, the first key is stored in the keyist field of the first transaction.
Further preferably, the payload field or the keylist field includes first compressed data, and the first compressed data is obtained by compressing each first key required to be read for executing the first transaction; the first compressed data is obtained by compressing each second key required to be read for executing the first transaction;
aggregating the second keys of the first transactions includes:
and respectively decompressing the first compressed data of the first transactions to summarize the second keys of the first transactions.
Common compression methods include common prefix compression and the like, and the method for compressing each first key is not limited in the application.
Assume the following first scenario:
executing a transfer transaction tx10, the required state data being the state data of the transaction initiator address (corresponding key k51) and the state data of the transaction recipient address (corresponding key k 52); but tx10 includes 10 keys (k 51-k 60), and after the state data of k 51-k 60 are read by the blockchain node, tx10 can indeed perform successfully, but the read of k 53-k 60 is invalid, and as tx10 includes many keys, it takes much block space to store tx10, and the number of transactions that can be accommodated by one block is small. The first scenario will cause the problems of low transaction execution efficiency, blocked block chain network congestion, poor user experience, and the like.
The problem generated by the first scenario can be solved by the following method as shown in the preferred embodiment:
preferably, executing the first block according to each returned second status data comprises:
performing, separately for each first transaction:
calculating the sum of the other commission for the first transaction and the read commission consumed for reading the second key;
determining whether the sum is greater than a commission specified for the first transaction:
if so, then execution of the first transaction fails.
In more embodiments, the reading procedure fee consumed by reading the second key may be configured as a fixed value or charged according to the reading amount according to actual requirements, but the present application is not limited specifically, but when the reading procedure fee is configured to be charged according to the reading amount, the scheme is more humanized, and the user experience can be better improved.
Fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
As shown in fig. 3, as another aspect, the present application also provides a computer apparatus including one or more Central Processing Units (CPUs) 301 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)302 or a program loaded from a storage section 308 into a Random Access Memory (RAM) 303. In the RAM303, various programs and data necessary for the operation of the computer apparatus are also stored. The CPU301, ROM302, and RAM303 are connected to each other via a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
The following components are connected to the I/O interface 305: an input portion 306 including a keyboard, a mouse, and the like; an output section 307 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 308 including a hard disk and the like; and a communication section 309 including a network interface card such as a LAN card, a modem, or the like. The communication section 309 performs communication processing via a network such as the internet. A drive 310 is also connected to the I/O interface 305 as needed. A removable medium 311 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 310 as necessary, so that a computer program read out therefrom is mounted into the storage section 308 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 any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 309, and/or installed from the removable medium 311.
As still 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 embodiment; or it may be a computer-readable storage medium, alone, not equipped into a computer device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
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 (15)
1. A data storage and query response method, adapted for blockchain nodes, the method comprising:
determining a plurality of first block chain nodes needing to store first state data in a block chain network according to a pre-configured state data distributed storage rule;
deleting the locally stored first state data when the current node is not included in the first blockchain node;
receiving first data query request information including a first key sent by a second blockchain node, and returning first state data when the first state data corresponding to the first key is locally stored; the first state data is used for the second block chain node to execute a first transaction which can be executed only by reading the first state data, the first transaction comprises keys corresponding to various state data required to be read for executing the first transaction, and the second block chain node is configured to generate a plurality of data query request information according to the keys and the state data distributed storage rule and simultaneously and respectively send the data query request information to the corresponding block chain node.
2. The method according to claim 1, wherein a mapping relationship between prefixes and fragments of keys corresponding to state data is recorded on a blockchain, and the determining a plurality of first blockchain nodes where the first state data needs to be stored in the blockchain network according to a preconfigured state data distributed storage rule comprises:
searching a first fragment according to a first prefix of a first key corresponding to the first state data;
determining a number of nodes in the first tile as the first blockchain node.
3. The method of claim 1, wherein determining a number of first block link points in the block-chain network at which the first status data is to be stored according to a pre-configured distributed storage rule for status data comprises:
performing hash operation on a first data set where the first state data are located to obtain first data through calculation;
respectively calculating a first exclusive or value of the first data and the node id of each block chain node;
determining a first number of block link points for which the first exclusive-or value is the smallest as the first block chain node.
4. The method of claim 1, wherein each of the first keys is stored in a payload field of the first transaction.
5. The method of claim 1, wherein a keyist field is added to the transaction, and each of the first keys is stored in the keyist field of the first transaction.
6. The method of claim 4, wherein the payload field comprises first compressed data resulting from compressing each first key read required to perform the first transaction.
7. The method of claim 5, wherein the keylist field comprises first compressed data resulting from compressing each first key read required to perform the first transaction.
8. A block execution method, wherein block chain nodes store, query response status data according to the method of any one of claims 1 to 7, the method being applied to block chain nodes, the method comprising:
receiving or generating a first block; the first block comprises a plurality of first transactions, and the first transactions comprise second keys corresponding to second state data required to be read for executing the first transactions;
summarizing each of the second keys for each of the first transactions;
respectively executing for each second key: sending inquiry request information to a plurality of second block chain nodes in which the second keys are stored;
and executing the first block according to the returned second state data.
9. The method of claim 8, wherein each of the second keys is stored in a payload field of the first transaction.
10. The method of claim 8, wherein a keylistat field is added to the transaction, and wherein each of said second keys is stored in said keylistat field of said first transaction.
11. The method of claim 9, wherein the payload field comprises first compressed data obtained by compressing second keys required to be read for executing the first transaction;
said aggregating each of said second keys for each of said first transactions comprises:
decompressing the first compressed data of each first transaction respectively to summarize each second key of each first transaction.
12. The method of claim 10, wherein the keylistat field comprises first compressed data resulting from compressing second keys required to be read to perform the first transaction;
said aggregating each of said second keys for each of said first transactions comprises:
and respectively decompressing the first compressed data of each first transaction to summarize each second key of each first transaction.
13. The method of claim 8, wherein executing the first block according to each returned second status data comprises:
performing, separately for each of the first transactions:
calculating the sum of the other commission of the first transaction and the read commission consumed for reading the second key;
determining whether the sum is greater than a commission specified for the first transaction:
if so, execution of the first transaction fails.
14. A computer device, characterized in that the device 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-13.
15. A storage medium storing a computer program, characterized in that the program, when being executed by a processor, carries out the method according to any one of claims 1-13.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110385364.6A CN113111086B (en) | 2021-04-09 | 2021-04-09 | Data storage and query response method and block execution method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110385364.6A CN113111086B (en) | 2021-04-09 | 2021-04-09 | Data storage and query response method and block execution method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113111086A CN113111086A (en) | 2021-07-13 |
| CN113111086B true CN113111086B (en) | 2022-06-24 |
Family
ID=76715575
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110385364.6A Active CN113111086B (en) | 2021-04-09 | 2021-04-09 | Data storage and query response method and block execution method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113111086B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110287226A (en) * | 2019-05-10 | 2019-09-27 | 深圳壹账通智能科技有限公司 | Data query method and device based on block chain |
| CN110493325A (en) * | 2019-07-31 | 2019-11-22 | 阿里巴巴集团控股有限公司 | Block chain state method of data synchronization and device, electronic equipment |
| CN112417054A (en) * | 2020-12-09 | 2021-02-26 | 杭州复杂美科技有限公司 | Distributed data storage method, data query method, device and storage medium |
| CN112506987A (en) * | 2020-11-19 | 2021-03-16 | 杭州趣链科技有限公司 | Block chain based query method, device, equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9037556B2 (en) * | 2012-12-03 | 2015-05-19 | Vmware, Inc. | Distributed, transactional key-value store |
| US10992456B2 (en) * | 2018-10-09 | 2021-04-27 | International Business Machines Corporation | Certifying authenticity of data modifications |
-
2021
- 2021-04-09 CN CN202110385364.6A patent/CN113111086B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110287226A (en) * | 2019-05-10 | 2019-09-27 | 深圳壹账通智能科技有限公司 | Data query method and device based on block chain |
| CN110493325A (en) * | 2019-07-31 | 2019-11-22 | 阿里巴巴集团控股有限公司 | Block chain state method of data synchronization and device, electronic equipment |
| CN112506987A (en) * | 2020-11-19 | 2021-03-16 | 杭州趣链科技有限公司 | Block chain based query method, device, equipment and storage medium |
| CN112417054A (en) * | 2020-12-09 | 2021-02-26 | 杭州复杂美科技有限公司 | Distributed data storage method, data query method, device and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| An efficient distributed storage strategy for blockchain;Qinshen Wang et al.;《ACM TURC "19: Proceedings of the ACM Turing Celebration Conference - China》;20190531;第12-18页 * |
| 区块链系统的数据存储与查询技术综述;王千阁等;《计算机科学》;20181215;第1-5页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113111086A (en) | 2021-07-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109359222B (en) | Data storage method and system, equipment and storage medium | |
| CN110599169B (en) | Data processing method, device, terminal and medium | |
| CN111722918A (en) | Service identification code generation method and device, storage medium and electronic equipment | |
| US7698312B2 (en) | Performing recursive database operations | |
| CN109687953B (en) | Transaction classification method, apparatus and storage medium | |
| CN110727727B (en) | Statistical method and device for database | |
| US20200274943A1 (en) | Data Processing Method and Apparatus, Server, and Controller | |
| US11223471B2 (en) | Blockchain-type data storage | |
| US11249987B2 (en) | Data storage in blockchain-type ledger | |
| CN111159219B (en) | Data management method, device, server and storage medium | |
| CN110837409A (en) | Method and system for executing task regularly | |
| CN111339057A (en) | Method, apparatus and computer readable storage medium for reducing back-to-source requests | |
| CN112785408A (en) | Account checking method and device based on Hash | |
| CN110597461B (en) | Data storage method, device and equipment in block chain type account book | |
| US20120324560A1 (en) | Token data operations | |
| EP3993273A1 (en) | Method and apparatus for data compression in storage system, device, and readable storage medium | |
| CN114676135A (en) | Data storage method, readable medium and electronic device | |
| CN113111086B (en) | Data storage and query response method and block execution method | |
| CN107391541B (en) | Real-time data merging method and device | |
| US20070094287A1 (en) | Block-aware encoding of bitmap for bitmap index eliminating max-slot restriction | |
| CN111741038B (en) | Data transmission method and data transmission device | |
| CN113094397B (en) | Data storage and query response method and block execution method | |
| CN112417054B (en) | Distributed data storage method, data query method, device and storage medium | |
| CN110535922B (en) | State data storage method and parallel chain block generation method | |
| CN109766363B (en) | Streaming data processing method, system, electronic device and storage medium |
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 |