CN112165519B - Synchronous node realization method and system for synchronizing data according to needs - Google Patents
Synchronous node realization method and system for synchronizing data according to needs Download PDFInfo
- Publication number
- CN112165519B CN112165519B CN202011014493.6A CN202011014493A CN112165519B CN 112165519 B CN112165519 B CN 112165519B CN 202011014493 A CN202011014493 A CN 202011014493A CN 112165519 B CN112165519 B CN 112165519B
- Authority
- CN
- China
- Prior art keywords
- transaction
- block
- node
- parameters
- address
- 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
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000001360 synchronised effect Effects 0.000 title claims abstract description 18
- 238000005457 optimization Methods 0.000 claims description 9
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000012795 verification Methods 0.000 description 5
- 239000002699 waste material Substances 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 238000004321 preservation Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
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/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Technology Law (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical 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 method and a system for realizing synchronous nodes for synchronizing data according to requirements. The method for realizing the synchronous nodes for synchronizing the data according to the requirement comprises the following steps: when the node is started, configuring condition parameters according to service requirements; when the node receives the transaction, judging whether the transaction meets the condition parameters or not; and when the transaction meets the condition parameters, executing the transaction, acquiring an execution result of the transaction, and storing the transaction after the transaction is executed. According to the technical scheme, the technical problems that in the related technology, the blockchain system cannot synchronize corresponding blockchain data according to the requirements of different users, so that hard disk resources and bandwidth are wasted and node service experience is poor are solved.
Description
Technical Field
The present invention relates to the field of blockchain technologies, and in particular, to a method and a system for implementing synchronization nodes for synchronizing data as needed.
Background
The blockchain technology is a brand new distributed infrastructure and computing mode which uses a blockchain data structure to verify and store data, uses a distributed node consensus algorithm to generate and update data, uses a cryptography mode to ensure the safety of data transmission and access, and uses an intelligent contract consisting of automated script codes to program and operate the data.
DApp is an abbreviation for (Decentralized Application), chinese transliteration is an application that is decentralised, and can also be understood as a distributed application. The DApp is based on a block chain, mainly appears on distributed platforms or networks such as Ethernet, EOS and the like, does not depend on any central server, and achieves the purpose of decentralization. Unlike traditional APP, DApp emphasizes the decentralization that must run on a distributed operating system, but not on iOS and Android traditional platforms. While not relying on any central node, DApp is not open to smart contracts. It can also be said that depending on the constraint of the intelligent contract, the DApp does not need to listen to any centralized server or node to realize autonomy. In addition, the DApp must also be stored securely, guaranteeing privacy.
Over time, transactions on the blockchain will increase, which in turn will cause the blockchain to increase in data capacity, requiring all nodes to store the full amount of data files due to the redundant backup of the blockchain.
At this time, if a user wants to create a blockchain node by himself to develop DApp, the user can select a full node or a light node of a blockchain to meet the service requirement according to the node protocol of the current blockchain.
However, if the full node is selected, when the transaction amount is large, the defects of wasting disk storage space, wasting bandwidth and slow synchronous data exist; if a light node is selected, there is a DApp service that the node cannot support the user very comprehensively, and only some of the verification functions can be satisfied.
The inventors have found that when a certain chain is running long enough and the amount of transactions is increasing, there are many problems and it is not necessary at all if every user chooses to use all nodes when developing the DApp. There should be a way to avoid problems with longer and longer chain runs and more transactions as much as possible, based on the different business needs of the user, and then to select the appropriate node type.
The main problem to be solved by the invention is to solve the problem that the blockchain node can synchronize corresponding blockchain data and provide services according to the requirements of different users.
Therefore, it is necessary to provide a new method and system for implementing synchronization nodes to synchronize data on demand, so as to solve the above technical problems.
Disclosure of Invention
The invention mainly aims to provide a method and a system for realizing synchronous nodes for synchronizing data according to needs, and aims to solve the technical problem that a blockchain system cannot synchronize corresponding blockchain data according to the needs of different users in the related art.
In order to achieve the above object, the present invention provides a method for implementing synchronization nodes for synchronizing data on demand, including the steps of:
when the node is started, configuring condition parameters according to service requirements;
when the node receives the transaction, judging whether the transaction meets the condition parameters or not;
and when the transaction meets the condition parameters, executing the transaction, acquiring an execution result of the transaction, and storing the transaction after the transaction is executed.
Preferably, the method further comprises the following steps:
and when the transaction does not meet the condition parameters, executing the transaction, and acquiring an execution result of the transaction so as to judge the block correctness.
Preferably, the condition parameters include at least: time parameters, address parameters, and other custom parameters.
Preferably, when the condition parameters include at least a time parameter and an address parameter, after the step of configuring the condition parameters according to the service requirement when the node is started, the method further includes the following steps:
when the node receives a block, judging whether the block meets the time parameter or not;
when the block meets the time parameter, acquiring the transaction in the block; and entering a step of judging whether the transaction meets the condition parameters when the node receives the transaction, wherein in the step, the condition parameters are the address parameters.
Preferably, the method further comprises the following steps:
and synchronizing the block header information for judging the correctness of the block when the block does not meet the time parameter.
In order to solve the technical problem, the invention also provides a synchronous node realization system for synchronizing data according to needs, which comprises:
the configuration module is used for configuring condition parameters according to service requirements when the node is started;
the judging module is used for judging whether the transaction meets the condition parameters or not when the node receives the transaction;
and when the transaction meets the condition parameters, executing the transaction, acquiring an execution result of the transaction, and storing the transaction after the transaction is executed.
Preferably, the judging module is further configured to execute the transaction when the transaction does not meet the condition parameter, and obtain an execution result of the transaction, so as to judge block correctness.
Preferably, the condition parameters include at least: time parameters, address parameters, and other custom parameters.
Preferably, when the condition parameters include at least a time parameter and an address parameter, the optimization judgment module is further included:
the optimization judging module is used for judging whether the block meets the time parameter or not when the node receives the block;
and when the block meets the time parameter, acquiring the transaction in the block.
Preferably, the optimization judging module is further configured to synchronize the block header information for judging the block correctness when the block does not satisfy the time parameter.
The invention provides a synchronous node realization method for synchronizing data according to needs, wherein when a node is started, condition parameters are configured according to service requirements; when the node receives the transaction, judging whether the transaction meets the condition parameters or not; and when the transaction meets the condition parameters, executing the transaction, acquiring an execution result of the transaction, and storing the transaction after the transaction is executed. The waste of hard disk resources can be reduced; bandwidth resources can be saved; the method can enable the nodes to rapidly synchronize corresponding service data and normally provide node services.
Drawings
FIG. 1 is a workflow diagram of a first embodiment of a method for implementing on-demand synchronization of data for a synchronization node in accordance with the present invention;
FIG. 2 is a flowchart illustrating a second embodiment of a method for implementing on-demand synchronization of data for a synchronization node according to the present invention;
FIG. 3 is a block diagram of a preferred embodiment of a synchronization node implementation system for synchronizing data on demand in accordance with the present invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
To facilitate an understanding of the technology, it may be assumed that a certain blockchain developed is chain a.
The block link points divide the node block data according to the following dimensions according to the support service:
(1) All data of all blocks of the chain A are owned;
(2) Owning transaction information data associated with all of the chain a's own DApp business contract addresses;
(3) Owning transaction information data related to all the sending addresses of the transactions sent from the self nodes of the chain A;
(4) Possess chain a for a certain period of time or obtain node related transaction information data from a point in time later (i.e., obtain node related transaction data according to a period of time).
The dimension of the node block data can be used as a basis, and corresponding condition parameters can be matched when the node block data is started. In the case that the condition parameters are not set according to the service requirements, the condition parameters may default to the full data of all the blocks of the synchronous chain a.
In a first scenario: when a node only needs to meet the traffic needs of a certain DApp of chain a.
That node need not be a mineworker node, and theoretically only the transaction data related to the DApp service need be saved. A large amount of transaction data unrelated to the DApp service is not saved in the node, because in this service scenario, if all the block full data of the chain a is saved, a large amount of waste of hard disk resources is caused, and when the node is started from 0, the time from starting to normally providing service for the node is increased.
In a second scenario: the node only needs to have the related transaction information data of the chain a from a certain point in time and the transaction information data related to the self DApp service.
Other business scenarios and so on.
The invention provides a method for realizing synchronous nodes for synchronizing data according to requirements.
First embodiment
Referring to fig. 1, in order to achieve the above object, in a first embodiment of the present invention, a method 100 for implementing synchronization nodes for synchronizing data on demand includes the following steps:
s10, when a node is started, configuring condition parameters according to service requirements;
the condition parameters include at least: time parameters, address parameters, and other custom parameters.
It will be appreciated that the time parameter may be a certain period of time or after a certain point in time; the address parameters may be: the DApp service contract address, the send address and the receive address of the node transaction. The other custom parameters may be the full amount of data for all blocks of the default synchronous chain a.
The condition parameters may be a single time parameter, address parameter, and other custom parameters.
The condition parameter may also be a combination of a time parameter and an address parameter.
When the condition parameter is a single address parameter;
specifically, when the node is started, all transaction data information parameters related to the self DApp service contract address of the chain a are configured, for example, the application contract address is configured to be 0 xaaaaaaaaaaaaaaaaaaa.
S20, when the node receives the transaction, judging whether the transaction meets the condition parameters or not;
and S30, executing the transaction when the transaction meets the condition parameters, acquiring an execution result of the transaction, and storing the transaction after the transaction is executed.
Specifically, when a node is receiving a transaction, if the received address of the transaction is the contract address 0 xaaaaaaaaaaaaaaaaaaaaa, executing the transaction in the node; and obtaining the execution result of the transaction, and storing the transaction after the execution is finished.
And S31, executing the transaction when the transaction does not meet the condition parameters, and acquiring an execution result of the transaction so as to judge the block correctness.
When the node receives a transaction, if the received address of the transaction is not the contract address 0xaaaaaaaaaaaaaaaaaaa, only the transaction is executed and the transaction result is obtained to judge the correctness verification of the block, but the transaction preservation operation is not performed.
Thus, the data stored by the nodes are ensured to be effective and correct; and is related to self DApp service, saving a lot of memory space. The waste of hard disk resources can be reduced; bandwidth resources can be saved; the method can enable the nodes to rapidly synchronize corresponding service data and normally provide node services.
Second embodiment
Referring to fig. 2, based on the method 100 for implementing a synchronization node of on-demand synchronization data provided in the first embodiment of the present invention, another method 200 for implementing a synchronization node of on-demand synchronization data is provided in the second embodiment of the present invention, and steps S10 to S31 in this embodiment are the same as those in the first embodiment, and are not described in detail herein, except that:
when the condition parameters comprise a time parameter and an address parameter, wherein the time parameter is the time x years x months x days x minutes x seconds of the synchronous starting block, and the address parameter is the DApp application related address 0 xbbbbbbbbbbbbbbbbbbb;
after the step S10, the method further includes the following steps:
s11, when the node receives a block, judging whether the block meets a time parameter or not;
when the block meets the time parameter, acquiring the transaction in the block; step S20 is performed, wherein in the step S20, the condition parameter is the address parameter.
Specifically, when the block received by the node is after the set start time, the transaction in the block is read, such as the transaction a. If the sending address or the receiving address of the transaction is 0 xbbbbbbbbbbbbbbbbbbbbbbbbbbb, executing the transaction, and storing the transaction;
when the block received by the node is after the set starting time, the transaction in the block is read, for example, the transaction A is read, if the sending address or the receiving address of the transaction is not 0 xbbbbbbbbbbbbbbbbbbbbb, only the transaction is executed, and the transaction execution result is obtained for the correctness verification of the block, but the transaction is not saved.
S13, synchronizing the block header information when the block does not meet the time parameter, so as to be used for judging the correctness of the block.
When a node receives a block, if the block is before the set start time, only the synchronization block header information is needed to check the correctness of the block.
The invention also provides a synchronous node realization system for synchronizing data according to the requirement
Referring to fig. 3, a synchronization node implementation system for synchronizing data on demand includes:
the configuration module is used for configuring condition parameters according to service requirements when the node is started;
the condition parameters include at least: time parameters, address parameters, and other custom parameters.
It will be appreciated that the time parameter may be a certain period of time or after a certain point in time; the address parameters may be: DApp service contract address, send address, receive address. The other custom parameters may be the full amount of data for all blocks of the default synchronous chain a.
The condition parameters may be a single time parameter, address parameter, and other custom parameters.
The condition parameter may also be a combination of a time parameter and an address parameter.
When the condition parameter is a single address parameter;
specifically, when the node is started, all transaction data information parameters related to the self DApp service contract address of the chain a are configured, for example, the application contract address is configured to be 0 xaaaaaaaaaaaaaaaaaaa.
The judging module is used for judging whether the transaction meets the condition parameters or not when the node receives the transaction;
and when the transaction meets the condition parameters, executing the transaction, acquiring an execution result of the transaction, and storing the transaction after the transaction is executed.
Specifically, when a node receives a transaction, if the receiving address of the transaction is the contract address 0 xaaaaaaaaaaaaaaaaaaaaa, executing the transaction in the node and obtaining a transaction execution result, and storing the transaction after the execution is completed.
Preferably, the judging module is further configured to execute the transaction when the transaction does not meet the condition parameter, and obtain an execution result of the transaction, so as to judge block correctness.
When the node receives a transaction, if the received address of the transaction is not the contract address 0xaaaaaaaaaaaaaaaaaaa, only the transaction is executed and the transaction result is obtained to judge the correctness verification of the block, but the transaction preservation operation is not performed.
Thus, the data stored by the nodes are ensured to be effective and correct; and is related to self DApp service, saving a lot of memory space.
Preferably, when the condition parameters include a time parameter and an address parameter, the time parameter is x years, x months, x days, x minutes, x seconds of the synchronization start block, and the address parameter is a DApp application related address 0 xbbbbbbbbbbbbbbbbbbbbb.
The optimization judgment module is also included: the optimization judging module is used for judging whether the block meets the time parameter or not when the node receives the block;
and when the block meets the time parameter, acquiring the transaction in the block.
When the block received by the node is after the set starting time, reading the transaction in the block, for example, reading the transaction A, and if the sending address or the receiving address of the transaction is 0 xbbbbbbbbbbbbbbbbbbbbb, executing the transaction and storing the transaction;
when the block received by the node is after the set starting time, the transaction in the block is read, for example, the transaction A is read, if the sending address or the receiving address of the transaction is not 0 xbbbbbbbbbbbbbbbbbbbbb, only the transaction is executed, and the transaction execution result is obtained for the correctness verification of the block, but the transaction is not saved.
Preferably, the optimization judging module is further configured to synchronize the block header information for judging the block correctness when the block does not satisfy the time parameter.
When a node receives a block, if the block is before the set start time, only the synchronization block header information is needed to check the correctness of the block.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in part in the form of a software product stored in a computer readable storage medium (e.g. ROM/RAM, magnetic disk, optical disk) as described above, comprising instructions for causing a terminal device to enter the method according to the embodiments of the present invention.
In the description of the present specification, the descriptions of the terms "one embodiment," "another embodiment," "other embodiments," or "first through X-th embodiments," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, method steps or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The foregoing embodiment numbers of the present invention are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
The foregoing description is only of the preferred embodiments of the present invention, and is not intended to limit the scope of the invention, but rather is intended to cover any equivalents of the structures or equivalent processes disclosed herein or in the alternative, which may be employed directly or indirectly in other related arts.
Claims (2)
1. The method for realizing the synchronous node of the on-demand synchronous data is characterized by comprising the following steps:
when the node is started, configuring condition parameters according to service requirements;
when the node receives the transaction, judging whether the transaction meets the condition parameters or not;
executing the transaction when the transaction meets the condition parameters, acquiring an execution result of the transaction, and storing the transaction after the transaction is executed;
the method also comprises the following steps:
when the transaction does not meet the condition parameters, executing the transaction, and acquiring an execution result of the transaction so as to judge the correctness of the block;
the condition parameters include at least: time parameters, address parameters, and other custom parameters; the time parameter is a certain period of time or after a certain time point; the address parameters are DApp service contract address, sending address and receiving address of node transaction; the other custom parameters are the full data of all blocks of the default synchronous chain;
when the condition parameters at least comprise time parameters and address parameters, the step of configuring the condition parameters according to service requirements when the node is started further comprises the following steps:
when the node receives a block, judging whether the block meets the time parameter or not;
when the block meets the time parameter, acquiring the transaction in the block;
entering a step of judging whether the transaction meets the condition parameters when the node receives the transaction, wherein in the step, the condition parameters are the address parameters;
the method also comprises the following steps:
synchronizing block header information for determining block correctness when the block does not satisfy the time parameter;
assume that a certain blockchain developed is chain a;
the block link points divide the node block data according to the following dimensions according to the supporting service:
(1) Having the full data of all blocks of the chain A;
(2) Owning transaction information data associated with the chain a and its own DApp service contract address;
(3) Having transaction information data related to all transmission addresses of transactions transmitted from the own node of the chain A;
(4) The related transaction information data of the chain A after a certain period of time or from a certain point of time is owned, namely, the node related transaction data is acquired according to the period of time.
2. A synchronization node implementation system for synchronizing data on demand, comprising:
the configuration module is used for configuring condition parameters according to service requirements when the node is started;
the judging module is used for judging whether the transaction meets the condition parameters or not when the node receives the transaction;
executing the transaction when the transaction meets the condition parameters, acquiring an execution result of the transaction, and storing the transaction after the transaction is executed;
the judging module is further used for executing the transaction when the transaction does not meet the condition parameters, and acquiring an execution result of the transaction so as to judge the correctness of the block;
the condition parameters include at least: time parameters, address parameters, and other custom parameters; the time parameter is a certain period of time or after a certain time point; the address parameters are DApp service contract address, sending address and receiving address of node transaction; the other custom parameters are the full data of all blocks of the default synchronous chain;
when the condition parameters at least comprise time parameters and address parameters, the method further comprises an optimization judging module:
the optimization judging module is used for judging whether the block meets the time parameter or not when the node receives the block;
when the block meets the time parameter, acquiring the transaction in the block;
the optimization judging module is also used for synchronizing the block header information when the block does not meet the time parameter, so as to judge the correctness of the block;
assume that a certain blockchain developed is chain a;
the block link points divide the node block data according to the following dimensions according to the supporting service:
(1) Having the full data of all blocks of the chain A;
(2) Owning transaction information data associated with the chain a and its own DApp service contract address;
(3) Having transaction information data related to all transmission addresses of transactions transmitted from the own node of the chain A;
(4) The related transaction information data of the chain A after a certain period of time or from a certain point of time is owned, namely, the node related transaction data is acquired according to the period of time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011014493.6A CN112165519B (en) | 2020-09-24 | 2020-09-24 | Synchronous node realization method and system for synchronizing data according to needs |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011014493.6A CN112165519B (en) | 2020-09-24 | 2020-09-24 | Synchronous node realization method and system for synchronizing data according to needs |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112165519A CN112165519A (en) | 2021-01-01 |
| CN112165519B true CN112165519B (en) | 2024-03-26 |
Family
ID=73863661
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011014493.6A Active CN112165519B (en) | 2020-09-24 | 2020-09-24 | Synchronous node realization method and system for synchronizing data according to needs |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112165519B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108769144A (en) * | 2018-05-11 | 2018-11-06 | 中国联合网络通信集团有限公司 | Storage processing method, transaction node, memory node and communication equipment |
| CN108764870A (en) * | 2018-05-29 | 2018-11-06 | 阿里巴巴集团控股有限公司 | Transaction processing method and device, electronic equipment based on block chain |
| CN110011788A (en) * | 2019-04-10 | 2019-07-12 | 深圳市网心科技有限公司 | A kind of data processing method based on block chain, system and relevant device |
| CN110245190A (en) * | 2019-06-11 | 2019-09-17 | 南京荣链科技有限公司 | A kind of block data fragmented storage method, terminal and medium |
| WO2020177547A1 (en) * | 2019-03-05 | 2020-09-10 | 深圳前海微众银行股份有限公司 | Blockchain system and transaction processing method for blockchain system |
-
2020
- 2020-09-24 CN CN202011014493.6A patent/CN112165519B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108769144A (en) * | 2018-05-11 | 2018-11-06 | 中国联合网络通信集团有限公司 | Storage processing method, transaction node, memory node and communication equipment |
| CN108764870A (en) * | 2018-05-29 | 2018-11-06 | 阿里巴巴集团控股有限公司 | Transaction processing method and device, electronic equipment based on block chain |
| WO2020177547A1 (en) * | 2019-03-05 | 2020-09-10 | 深圳前海微众银行股份有限公司 | Blockchain system and transaction processing method for blockchain system |
| CN110011788A (en) * | 2019-04-10 | 2019-07-12 | 深圳市网心科技有限公司 | A kind of data processing method based on block chain, system and relevant device |
| CN110245190A (en) * | 2019-06-11 | 2019-09-17 | 南京荣链科技有限公司 | A kind of block data fragmented storage method, terminal and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112165519A (en) | 2021-01-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112003703B (en) | Method and device for transmitting authenticatable message across chains | |
| CN108510389B (en) | Intelligent contract calling method and device based on block chain and readable storage medium | |
| CN112968967B (en) | Block synchronization method and device | |
| CN112615871B (en) | Method and device for transmitting authenticatable message across chains | |
| CN109062601A (en) | MES system client-side program update method, device, equipment and medium | |
| CN111064626B (en) | Configuration updating method, device, server and readable storage medium | |
| CN109344006A (en) | A kind of mirror image management method and mirror image management module | |
| CN111861482A (en) | Block chain account checking method and system | |
| CN111654399B (en) | Networking method, device, equipment and storage medium based on SD-WAN | |
| CN111628886A (en) | Method and device for building block chain network under private cloud environment, and computer equipment | |
| US20220326940A1 (en) | Service Upgrade Method, Apparatus, and System | |
| CN111143023A (en) | Resource changing method and device, equipment and storage medium | |
| CN104023061A (en) | High availability cluster scheme of OSS (Open Storage service) for LUSTRE | |
| CN113315754A (en) | Intelligent linkage method, device, equipment and medium for firewall of container visit | |
| CN112615868B (en) | Method and device for transmitting authenticatable message across chains | |
| CN108111630B (en) | Zookeeper cluster system and connection method and system thereof | |
| CN112165519B (en) | Synchronous node realization method and system for synchronizing data according to needs | |
| CN116088913B (en) | Integrated device, method and computer program product for whole vehicle upgrade software | |
| CN108418857B (en) | Zookeeper cluster system and connection method and device thereof | |
| CN112291081A (en) | Method, system and storage medium for auditing controller cluster data by cloud management platform | |
| CN115756304A (en) | Method, device, equipment and readable medium for realizing configuration data consistency | |
| CN112804313B (en) | Data synchronization method, device, equipment and medium based on cross-domain edge node | |
| CN112910978B (en) | Method and system for synchronizing network configuration data | |
| CN112910697A (en) | Fault processing method and device | |
| CN107332679B (en) | Centerless information synchronization method and device |
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 |