CN110928923A - Data storage method and system based on block chain - Google Patents
Data storage method and system based on block chain Download PDFInfo
- Publication number
- CN110928923A CN110928923A CN201911190604.6A CN201911190604A CN110928923A CN 110928923 A CN110928923 A CN 110928923A CN 201911190604 A CN201911190604 A CN 201911190604A CN 110928923 A CN110928923 A CN 110928923A
- Authority
- CN
- China
- Prior art keywords
- data
- user
- tree structure
- block chain
- node
- 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.)
- Pending
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/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- 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
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Development Economics (AREA)
- Mathematical Physics (AREA)
- Fuzzy Systems (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Health & Medical Sciences (AREA)
- Probability & Statistics with Applications (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a data storage method and a system based on a block chain, which comprises the following steps: the method comprises the steps that a block chain link point receives data sent by a user, and the data are identified together and then stored in a front tree structure of a block chain link point memory; and the block link point receives an adding or modifying operation request of data sent by a user, and stores the added or modified data to the front vegetation tree structure after being identified. According to the invention, the block link nodes store data, and the increase and modification of the data in the previous tree structure of the memory, and each path of the previous tree structure corresponds to the historical data information of the same user ID or data ID, so that when a user queries data on the block chain, the historical information of the data can be queried only by querying the path corresponding to the user ID or data ID in the previous tree structure, and all blocks do not need to be traversed, so that the data query progress is accelerated, and the data query efficiency is improved.
Description
Technical Field
The present invention relates to the field of block chain information technology, and more particularly, to a data storage method and system based on a block chain.
Background
The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. The consensus mechanism is a mathematical algorithm for establishing trust and obtaining rights and interests among different nodes in a blockchain system. The blockchain is the underlying technology of bitcoin, like a database ledger, which records all transaction records. The system is characterized in that a plurality of nodes are arranged at different parts of the world, and each node maintains a set of same databases. The data is maliciously tampered and difficult to tamper, and the data loss is extremely rare, so that a platform which is fair and transparent and solves the trust crisis is realized.
The data in the block chain is not stored in a single database or server, but in the disks of all nodes of the block chain, and the block chain combines the data blocks in a sequential connection manner according to the time sequence to form a chain data structure. When a user adds or modifies data in a block chain, one piece of data needs to be stored again according to operation time, and when the user queries the data, the block needs to be traversed to find historical information of the ID of the queried data, but the efficiency of data query through the block is low. Therefore, the existing data storage method of the blockchain is not reasonable, and the data query efficiency of the blockchain is low.
The above techniques are merely for reference and are not necessarily to be construed as prior art.
Disclosure of Invention
Aiming at the defects of the prior art, the invention aims to solve the technical problem that the data query efficiency of the block chain is low due to the fact that the data storage method of the existing block chain is not reasonable.
In order to achieve the above object, in a first aspect, the present invention provides a data storage method based on a block chain, including the following steps:
the block chain link point receives data sent by a user, and the data are identified together and then stored in a front tree structure of a memory of the block chain link point;
and the block chain link point receives an increasing operation request of data sent by a user, and stores the increasing data after identifying to the front vegetation tree structure.
In an optional embodiment, the method further comprises the steps of:
and the block chain link point receives a modification operation request sent by a user for data, and stores the modified data after being identified to the front vegetation tree structure.
It should be noted that, when the block chain node receives data, a hash transaction including the data and transaction information thereof may be constructed, and the constructed transaction is broadcast to the block chain network, so that each node stores the transaction in its own block chain based on a consensus mechanism, thereby realizing multi-party evidence storage of the data. When the transaction only includes the hash of the data, since the hash of the data is already issued to the blockchain, if the written data is tampered, the hash of the tampered data is inconsistent with the hash issued in the blockchain, and therefore, issuing the data to the blockchain is equivalent to multi-party evidence of the data.
Specifically, the transaction described in this specification refers to a piece of data that is created by a user through a client of the blockchain and needs to be finally published to a distributed database of the blockchain.
In an optional embodiment, the method further comprises the steps of:
the block chain node receives a data query request sent by a user, and the data query request queries historical data information corresponding to a user ID or a data ID; the data of the same user ID comprises data corresponding to at least one data ID;
the blockchain node queries the pre-tree structure based on the data query request to find historical data information corresponding to a user ID or a data ID.
Specifically, the history data information of a certain user ID or data ID includes data such as original data of the user ID or data ID, data before and after an addition operation of the data, and data before and after a modification operation of the data.
In addition, it will be appreciated that the delete operation of the data will also be saved in the previous tree structure, and the historical data information of the user query will also include delete information of the data.
In an optional embodiment, the pre-tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same user ID; the data stored by each node in the front tag tree structure also comprises a user ID corresponding to the data and a time stamp for performing relevant operation on the data.
It can be understood that the user may query the historical data information of a certain user ID, or may query the historical data information of a certain data ID. In addition, one user ID may contain a plurality of data, each corresponding to one data ID, and each data may be added or modified. The previous tree structure saves both the data before and after addition or modification and also saves the time stamp of the associated operation.
In particular, the related operations refer to the saving of data, the addition of data, and the modification of data. Further, the related operations may also include a delete operation of the data.
In an optional embodiment, the previous vegetation tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same data ID; the data stored by each node in the front tag tree structure also comprises a data ID corresponding to the data and a time stamp for performing relevant operation on the data.
In an optional embodiment, before the block link node stores the data sent by the user, the data added or modified by the user after identifying to the pre-tree structure, the method further comprises the following steps:
and checking the identity of the user by the block chain link point, and if the identity check is passed, storing the corresponding data after consensus in the front vegetation tree structure.
In a second aspect, the present invention provides a block chain based data storage system, including:
the storage unit is used for receiving data sent by a user, identifying the data together and storing the identified data into a front vegetation tree structure of a block link point memory; and receiving an adding operation request for data sent by a user, and storing the added data after consensus to the front vegetation tree structure.
In an optional embodiment, the storage unit receives a modification operation request for data sent by a user, and stores the modified data into the pre-tree structure after consensus.
In an optional embodiment, the system further comprises:
the query unit is used for receiving a data query request sent by a user, and the data query request queries historical data information corresponding to a user ID or a data ID; querying the front vegetation tree structure based on the data query request to find historical data information corresponding to the user ID or the data ID; the data of the same user ID comprises data corresponding to at least one data ID.
In an optional embodiment, the pre-tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same user ID; the data stored by each node in the front tag tree structure also comprises a user ID corresponding to the data and a time stamp for performing relevant operation on the data.
In an optional embodiment, the previous vegetation tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same data ID; the data stored by each node in the front tag tree structure also comprises a data ID corresponding to the data and a time stamp for performing relevant operation on the data.
In an optional embodiment, the system further comprises:
and the verification unit is used for verifying the identity of the user, and if the identity verification is passed, the corresponding data are identified together and then are stored in the front vegetation tree structure.
In a third aspect, the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the blockchain-based data storage method as provided in the first aspect above.
Generally, compared with the prior art, the above technical solution conceived by the present invention has the following beneficial effects:
the invention provides a data storage method and a data storage system based on a block chain. Because each path of the structure is corresponding to the same user ID or the historical data information of the data ID, based on the data storage method provided by the invention, when a user queries the historical information of the data on the block chain, the historical information of the data can be queried only by querying the path corresponding to the user ID or the data ID in the previous tree, and all blocks in the block chain do not need to be traversed, so that the data query progress of the block chain is accelerated, and the data query efficiency of the block chain is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of embodiments of the invention.
In addition, any one of the embodiments in the present specification is not required to achieve all of the effects described above.
Drawings
FIG. 1 is a flow chart of a block chain-based data storage method according to the present invention;
fig. 2 is an architecture diagram of a data storage system based on a block chain according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
FIG. 1 is a flow chart of a block chain-based data storage method according to the present invention; as shown in fig. 1, the method comprises the following steps:
s101, receiving data sent by a user by a block chain node point, identifying the data commonly and storing the identified data to a front vegetation tree structure in a block chain node point memory;
and S102, the block chain node receives an increasing operation request for data sent by a user, and stores the increasing data after identifying the increasing data to the front vegetation tree structure.
In an optional embodiment, the method further comprises the steps of:
and the block chain link point receives a modification operation request sent by a user for data, and stores the modified data after being identified to the front vegetation tree structure.
Specifically, since each path of the previous redundant structure corresponds to the historical data information of the same user ID or data ID, when a user queries the historical information of data on the block chain, the user only needs to query the path corresponding to the user ID or data ID in the previous tree to query the historical information of the data, and does not need to traverse all blocks in the block chain. Therefore, the data storage method based on the block chain provided by the invention accelerates the data query progress of the block chain and improves the data query efficiency of the block chain.
It should be noted that, when the block chain node receives data, a hash transaction including the data and transaction information thereof may be constructed, and the constructed transaction is broadcast to the block chain network, so that each node stores the transaction in its own block chain based on a consensus mechanism, thereby realizing multi-party evidence storage of the data. When the transaction only includes the hash of the data, since the hash of the data is already issued to the blockchain, if the written data is tampered, the hash of the tampered data is inconsistent with the hash issued in the blockchain, and therefore, issuing the data to the blockchain is equivalent to multi-party evidence of the data.
Specifically, the transaction described in this specification refers to a piece of data that is created by a user through a client of the blockchain and needs to be finally published to a distributed database of the blockchain.
In an optional embodiment, the method further comprises the steps of:
the block chain node receives a data query request sent by a user, and the data query request queries historical data information corresponding to a user ID or a data ID; the data of the same user ID comprises data corresponding to at least one data ID;
the blockchain node queries the pre-tree structure based on the data query request to find historical data information corresponding to a user ID or a data ID.
Specifically, the history data information of a certain user ID or data ID includes data such as original data of the user ID or data ID, data before and after an addition operation of the data, and data before and after a modification operation of the data. In addition, it will be appreciated that the delete operation of the data will also be saved in the previous tree structure, and the historical data information of the user query will also include delete information of the data.
In an optional embodiment, the pre-tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same user ID; the data stored by each node in the front tag tree structure also comprises a user ID corresponding to the data and a time stamp for performing relevant operation on the data.
It can be understood that the user may query the historical data information of a certain user ID, or may query the historical data information of a certain data ID. In addition, one user ID may contain a plurality of data, each corresponding to one data ID, and each data may be added or modified. The previous tree structure saves both the data before and after addition or modification and also saves the time stamp of the associated operation.
In particular, the related operations refer to the saving of data, the addition of data, and the modification of data. Further, the related operations may also include a delete operation of the data.
In an optional embodiment, the previous vegetation tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same data ID; the data stored by each node in the front tag tree structure also comprises a data ID corresponding to the data and a time stamp for performing relevant operation on the data.
In an optional embodiment, before the block link node stores the data sent by the user, the data added or modified by the user after identifying to the pre-tree structure, the method further comprises the following steps:
and checking the identity of the user by the block chain link point, and if the identity check is passed, storing the corresponding data after consensus in the front vegetation tree structure.
Fig. 2 is an architecture diagram of a data storage system based on a block chain according to the present invention, as shown in fig. 2, including: a storage unit 210, a query unit 220, and a verification unit 230.
A storage unit 210, which receives data sent by a user, and stores the data after identifying the data together to a previous tree structure of a block link point memory; and receiving an adding operation request for data sent by a user, and storing the added data after consensus to the front vegetation tree structure.
And a storage unit 210 for receiving a modification operation request for data sent by a user, and storing the modified data in the front vegetation tree structure after recognizing the modified data.
The query unit 220 receives a data query request sent by a user, where the data query request queries historical data information corresponding to a user ID or a data ID; querying the front vegetation tree structure based on the data query request to find historical data information corresponding to the user ID or the data ID; the data of the same user ID comprises data corresponding to at least one data ID.
The checking unit 230 checks the identity of the user, and if the identity check passes, stores the corresponding data into the pre-tree structure after consensus.
In an optional embodiment, the pre-tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same user ID; the data stored by each node in the front tag tree structure also comprises a user ID corresponding to the data and a time stamp for performing relevant operation on the data.
In an optional embodiment, the previous vegetation tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same data ID; the data stored by each node in the front tag tree structure also comprises a data ID corresponding to the data and a time stamp for performing relevant operation on the data.
The processing procedure related to each unit in fig. 2 can refer to the specific method embodiment shown in fig. 1, and is not described herein again.
Those of skill would further appreciate that the various illustrative modules and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
Those skilled in the art will recognize that, in one or more of the examples described above, the functions described in this invention may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
It will be understood by those skilled in the art that all or part of the steps in the method for implementing the above embodiments may be implemented by a program, and the program may be stored in a computer-readable storage medium, which is a non-transitory (non-transitory) medium, such as a random access memory, a read only memory, a flash memory, a hard disk, a solid state disk, a magnetic tape (magnetic tape), a floppy disk (floppy disk), an optical disk (optical disk) and any combination thereof.
The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made on the basis of the technical solutions of the present invention should be included in the scope of the present invention.
Claims (10)
1. A data storage method based on a block chain is characterized by comprising the following steps:
the block chain link point receives data sent by a user, and the data are identified together and then stored in a front tree structure of a memory of the block chain link point;
and the block chain link point receives an increasing operation request of data sent by a user, and stores the increasing data after identifying to the front vegetation tree structure.
2. The method of claim 1, further comprising the steps of:
and the block chain link point receives a modification operation request sent by a user for data, and stores the modified data after being identified to the front vegetation tree structure.
3. The method according to claim 1 or 2, further comprising the steps of:
the block chain node receives a data query request sent by a user, and the data query request queries historical data information corresponding to a user ID or a data ID; the data of the same user ID comprises data corresponding to at least one data ID;
the blockchain node queries the pre-tree structure based on the data query request to find historical data information corresponding to a user ID or a data ID.
4. The method of claim 1 or 2, wherein the pre-tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same user ID; the data stored by each node in the front tag tree structure also comprises a user ID corresponding to the data and a time stamp for performing relevant operation on the data.
5. The method of claim 1 or 2, wherein the pre-tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same data ID; the data stored by each node in the front tag tree structure also comprises a data ID corresponding to the data and a time stamp for performing relevant operation on the data.
6. A blockchain-based data storage system, comprising:
the storage unit is used for receiving data sent by a user, identifying the data together and storing the identified data into a front vegetation tree structure of a block link point memory; and receiving an adding operation request for data sent by a user, and storing the added data after consensus to the front vegetation tree structure.
7. The system of claim 6, wherein the storage unit receives a request for modification operation on data sent by a user, and stores the modified data into the pre-tree structure after consensus.
8. The system of claim 6 or 7, further comprising:
the query unit is used for receiving a data query request sent by a user, and the data query request queries historical data information corresponding to a user ID or a data ID; querying the front vegetation tree structure based on the data query request to find historical data information corresponding to the user ID or the data ID; the data of the same user ID comprises data corresponding to at least one data ID.
9. The system according to claim 6 or 7, wherein the pre-tree structure is from a root node to a leaf node, and data passing through a path is historical data information of the same user ID; the data stored by each node in the front tag tree structure also comprises a user ID corresponding to the data and a time stamp for performing relevant operation on the data.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the blockchain-based data storage method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911190604.6A CN110928923A (en) | 2019-11-28 | 2019-11-28 | Data storage method and system based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911190604.6A CN110928923A (en) | 2019-11-28 | 2019-11-28 | Data storage method and system based on block chain |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110928923A true CN110928923A (en) | 2020-03-27 |
Family
ID=69847431
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911190604.6A Pending CN110928923A (en) | 2019-11-28 | 2019-11-28 | Data storage method and system based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110928923A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111488355A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | User relation storage method and device of business data block chain |
| CN113535855A (en) * | 2021-07-28 | 2021-10-22 | 卫宁健康科技集团股份有限公司 | Block chain-based master data management method, system, computer device, and medium |
-
2019
- 2019-11-28 CN CN201911190604.6A patent/CN110928923A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111488355A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | User relation storage method and device of business data block chain |
| CN113535855A (en) * | 2021-07-28 | 2021-10-22 | 卫宁健康科技集团股份有限公司 | Block chain-based master data management method, system, computer device, and medium |
| CN113535855B (en) * | 2021-07-28 | 2024-01-26 | 卫宁健康科技集团股份有限公司 | Main data management method, system, computer equipment and medium based on block chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109791591B (en) | Method and system for identity and credential protection and verification via blockchain | |
| EP3678346B1 (en) | Blockchain smart contract verification method and apparatus, and storage medium | |
| CN108389129B (en) | Transaction execution method and device based on block chain and electronic equipment | |
| US10417188B2 (en) | Method and system for transferring trust across block chain segments | |
| US20220414090A1 (en) | Blockchain data index method, blockchain data storage method and device | |
| US11823178B2 (en) | Optimization of high volume transaction performance on a blockchain | |
| CN113326317B (en) | Block chain certification method and system based on isomorphic multi-chain architecture | |
| CN103136243B (en) | File system duplicate removal method based on cloud storage and device | |
| AU2019378667C1 (en) | Performing map iterations in blockchain-based system | |
| US20210049715A1 (en) | Blockchain-based data procesing method, apparatus, and electronic device | |
| US11907199B2 (en) | Blockchain based distributed file systems | |
| US20230074102A1 (en) | Method and apparatus for processing data based on block chain, device and readable storage medium | |
| EP3709568A1 (en) | Deleting user data from a blockchain | |
| WO2023011022A1 (en) | Blockchain-based data processing method, and device and computer-readable storage medium | |
| CN113421160B (en) | Transaction tracking and tracing method based on block chain | |
| CN111899019A (en) | Method and system for cross validation and sharing of blacklist and multiple parties | |
| US11868339B2 (en) | Blockchain based distributed file systems | |
| CN111008183B (en) | Storage method and system for business wind control log data | |
| CN110928923A (en) | Data storage method and system based on block chain | |
| CN115114372A (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
| CN112732803B (en) | Consensus block chain transaction query verification method and system | |
| CN113111125A (en) | Business evidence storage method based on block chain | |
| CN111563083B (en) | Report data query method, device and system | |
| CN112860746B (en) | Cache reduction-based method, equipment and system | |
| CN110990485A (en) | Data processing method and device on block chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200327 |
|
| WD01 | Invention patent application deemed withdrawn after publication |