CN109639777B - Data synchronization method, device and system and non-volatile storage medium - Google Patents
Data synchronization method, device and system and non-volatile storage medium Download PDFInfo
- Publication number
- CN109639777B CN109639777B CN201811433880.6A CN201811433880A CN109639777B CN 109639777 B CN109639777 B CN 109639777B CN 201811433880 A CN201811433880 A CN 201811433880A CN 109639777 B CN109639777 B CN 109639777B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- nodes
- registration
- cluster
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- 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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/563—Data redirection of data network streams
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multi Processors (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method, a device, a system and a storage medium for data synchronization, wherein the method comprises the following steps: a receiving step of receiving data from a source data side; a registration monitoring step, namely receiving registration of a plurality of nodes, monitoring the registered nodes to determine a node cluster, and determining a main node in the node cluster according to a registration result; a time event sending step, wherein the master node sends out time events according to a preset time interval; and a hash calculation step of acquiring each node in the node cluster, taking data corresponding to the time event in the data as synchronous data, and dividing the synchronous data into each node by using a consistent hash algorithm, wherein each node simultaneously synchronizes the respective synchronous data to a target data side.
Description
Technical Field
The invention relates to a method, a device, a system and a non-volatile storage medium for data synchronization.
Background
And data synchronization for data migration among a plurality of data systems. Different service requirements have different real-time requirements. After the source data is generated, the data synchronization device can be made aware of it by some mechanism and then synchronize it into a downstream data system.
There is a data synchronization system (CN107995302A), in which a server sends a data update notification instruction to a client proxy component, and then the client proxy component performs an update operation. There is also a data synchronization method (CN108197263A) for connecting upstream and downstream systems through a publish-subscribe system. And the upstream system publishes the data updating information to the subscription system and triggers the downstream system to execute the updating operation. In addition, there is a data synchronization method and apparatus (CN108228814A), which determines the address of the target database by querying the data synchronization configuration information, and then synchronizes the data change information of the data table to the target database.
The data synchronization system, method and device are still a publish-subscribe system in nature, the system is passive and needs to be triggered by a message system, and the synchronization operation of the downstream system on the data is still performed by a single node. Moreover, the method does not have the capability of horizontal expansion, and the cluster size cannot be enlarged according to the number so as to ensure the synchronization real-time performance. That is, these methods are only suitable for offline processing of small-batch data, cannot perform real-time synchronization of large-scale data, and cannot meet the requirements of real-time services.
Disclosure of Invention
The invention provides a data synchronization method, which comprises the following steps:
a receiving step of receiving data from a source data side;
a registration monitoring step, namely receiving registration of a plurality of nodes, monitoring the registered nodes to determine a node cluster, and determining a main node in the node cluster according to a registration result;
a time event sending step, wherein the master node sends out time events according to a preset time interval;
a hash calculation step of acquiring each node in the node cluster, taking data corresponding to the time event in the data as synchronous data, dividing the synchronous data into each node by using a consistent hash algorithm,
and a synchronization step, wherein each node simultaneously synchronizes respective synchronization data to a target data side.
In the registration monitoring step, the registration includes registration and preemption, the status of the registered nodes is monitored, the nodes with normal status form the node cluster, the nodes with successful preemption in the node cluster are taken as the master nodes, and other nodes in the node cluster are taken as slave nodes.
Wherein, in the hash calculation step, further comprising:
respectively calculating each node by utilizing the consistent hash algorithm so as to respectively map each node to a hash ring;
respectively calculating the synchronous data by utilizing a consistent hash algorithm so as to respectively map the synchronous data to the hash rings one by one;
and respectively dropping the synchronous data on the hash ring into corresponding nodes on the hash ring in a clockwise direction, so as to divide the synchronous data into each node.
In the registration monitoring step, when the state of the master node is abnormal, the slave nodes are combined into the node cluster, the slave nodes are notified to perform master preemption, and the node which succeeds in master preemption is taken as the master node.
In the registration listening step, when a new node registers, the new node is added to the node cluster as a slave node.
Wherein, in the registration listening step, when it is listened that the state of a node in the slave nodes is abnormal, the abnormal node is deleted from the node cluster.
Wherein, in the synchronizing step, when a slave node in the node cluster receives the time event, the master node and the slave node synchronize respective synchronization data to the target data side at the same time.
The invention also provides a data synchronization device, which comprises:
a plurality of nodes;
a receiving unit that receives data from a source data side;
the registration and monitoring unit is used for receiving registration of a plurality of nodes, monitoring the registered nodes to determine a node cluster, and determining a main node in the node cluster according to a registration result;
the main node sends out time events according to a preset time interval;
a hash calculation unit for acquiring each node in the node cluster, taking data corresponding to the time event in the data as synchronous data, dividing the synchronous data into each node by using a consistent hash algorithm,
each node simultaneously synchronizes respective synchronization data to the target data party.
The present invention also provides a nonvolatile storage medium on which a program for data synchronization is stored, the program being executed by a computer to implement a method of data synchronization, the program including:
receiving an instruction, receiving data from a source data side;
registering a monitoring instruction, monitoring registered nodes to determine a node cluster, and determining a main node in the node cluster according to a registered result;
a time event sending instruction, wherein the master node sends out time events according to a preset time interval;
a hash calculation instruction for acquiring each node in the node cluster, taking data corresponding to the time event in the data as synchronous data, dividing the synchronous data into each node by using a consistent hash algorithm,
and a synchronization instruction, wherein each node simultaneously synchronizes the respective synchronization data to the target data side.
By the invention, active data synchronization can be realized, and large batch of data can be quickly synchronized. When a node fails, data synchronization can be guaranteed to be unaffected, horizontal expansion can be performed according to data volume (namely service requirements), and delay of data synchronization is reduced.
Drawings
FIG. 1 is a block diagram of a data synchronization system according to an embodiment of the present invention;
FIG. 2 is a block diagram of a data synchronization apparatus according to an embodiment of the present invention;
fig. 3 is a flow chart of a method of data synchronization according to an embodiment of the present invention.
Detailed Description
Embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
Fig. 1 is a block diagram of a data synchronization system 10 according to an embodiment of the present invention, and as shown in fig. 1, the data synchronization system 10 includes a source data side 11, a data synchronization apparatus 12, and a target data side 13. The source data party 11 and the target data party 13 are for example different data systems or databases or the like.
Fig. 2 is a block diagram of the data synchronization apparatus 12 according to an embodiment of the present invention, and as shown in fig. 2, the data synchronization apparatus 12 includes a node 1, a node 2, a node 3, a receiving unit 121, a registration and listening unit 122, and a hash calculation unit 123. In this embodiment, there are 3 nodes, but the number of nodes is not limited, and may be any number, and any number of nodes may be increased or decreased. Wherein the node is for example a server.
Fig. 3 is a flowchart of a data synchronization method according to an embodiment of the present invention. As shown in fig. 3, the receiving unit 121 receives data from the source data side 11 at step S31. The data may be data of a single service or data of a plurality of services.
In step S32, the registration and listening unit 122 receives the registration of the plurality of nodes, listens to the registered nodes to determine a node cluster, and determines a master node in the node cluster according to the result of the registration. The registration includes registration and preemption, the registration and monitoring unit 122 monitors the states of the registered nodes, the nodes with normal states form a node cluster, the nodes with successful preemption in the node cluster are taken as master nodes, and other nodes in the node cluster are taken as slave nodes.
Specifically, node 1, node 2, node 3 register at startup with the registration and listening unit 122, respectively, to inform about the existence of these nodes. Here, each node registers in the registration and listening unit 122 at startup.
The registration and monitoring unit 122 monitors the registered states of the node 1, the node 2, and the node 3, and forms a node cluster with the nodes in normal states. For example, if the states of node 1, node 2, and node 3 are all normal, node 1, node 2, and node 3 are grouped into a node cluster. In addition, the node 1, the node 2, and the node 3 also perform preemption in the registration and monitoring unit 122, and the registration and monitoring unit 122 takes the node in the node cluster that succeeds in preemption as a master node and takes other nodes in the node cluster as slave nodes. For example, if node 1 successfully preempts the master, node 1 is the master node, and nodes 2 and 3 are the slave nodes. That is, the current node cluster includes a master node 1, and slave nodes 2 and 3. Wherein the node cluster is a collection of nodes that are registered in the registration and listening unit 122 and the registration and listening unit 122 determines that its status is normal.
At step S33, the master node 1 issues a time event to the registration and listening unit 122 at predetermined time intervals. For example, the master node 1 issues a time event every 1 second, i.e., the master node 1 regularly issues a time event to the registration and listening unit 122. The time event has a time field corresponding to a specific time range.
Next, in step S34, the hash calculation unit 123 acquires each node in the node cluster, and divides the synchronized data into each node using a consistent hash algorithm with data corresponding to a time event in the data as the synchronized data.
Specifically, the hash calculation unit 123 acquires the IP address of each node in the node cluster, i.e., acquires the IP1 of the node 1, the IP2 of the node 2, and the IP3 of the node 3, from the registration and listening unit 122. IP1, IP2, and IP3 are each computed using a consistent hashing algorithm to map node 1, node 2, and node 3 onto a hash ring, respectively.
The hash calculation unit 123 acquires data from the reception unit 121, and takes data corresponding to a time event among the data as synchronization data, that is, data corresponding to a specific time range among the data as synchronization data. Then, the synchronous data are respectively calculated by utilizing a consistent hash algorithm, so that the synchronous data are respectively mapped on the hash rings one by one. Therein, each of the synchronization data has a key (key), which is, for example, a file name or the like of each data. And calculating the key of each data by using a consistent hash algorithm, so that each data in the synchronous data is mapped to the hash ring one by one.
And then, respectively falling the synchronous data on the hash ring into corresponding nodes on the hash ring in a clockwise direction, thereby dividing the synchronous data into each node. That is, these synchronization data fall into node 1, node 2, and node 3, respectively.
Wherein, the consistent hash algorithm is an existing algorithm and is not detailed here.
Next, at step S35, each node simultaneously synchronizes respective synchronization data to the target data side. After receiving the time event sent by the master node 1, the registration and listening unit 122 sends the time event to the slave nodes 2 and 3 in the node cluster, respectively. Upon receiving the time event, the slave nodes 2, 3 synchronize the falling synchronization data to the target data side 13 simultaneously with the master node 1.
The master node sends out the time event at fixed time, namely, actively sends out the synchronization time event, so as to trigger the slave node and the master node to simultaneously carry out data synchronization, therefore, the data synchronization of the invention is active. In addition, the invention uniformly delivers the synchronous data to a plurality of nodes in the node cluster by utilizing the consistent hash algorithm, and simultaneously (parallelly) synchronizes the data, thereby quickly synchronizing large batch of data.
Further, the synchronization data in the present invention corresponds to data within a specific time range, so the synchronization data has a time sequence. In this manner, data can be synchronized according to timing.
In addition, the registration and monitoring unit 122 monitors the node 1, the node 2, and the node 3 in the node cluster, that is, each node may periodically send a heartbeat to the registration and monitoring unit 122, if the registration and monitoring unit 122 periodically receives the heartbeat of the node, it is determined that the state of the node is normal, otherwise, it is determined that the state of the node is abnormal. A state of abnormal indicates that the node has failed and is unavailable, i.e., data synchronization is not possible.
Preferably, when the node cluster includes the master node 1, and the slave nodes 2 and 3, when the registration and monitoring unit 122 monitors that the state of the master node 1 is abnormal, the node 1 is deleted from the current node cluster, the slave nodes 2 and 3 form a new node cluster, and simultaneously the slave nodes 2 and 3 are notified to perform master preemption, the node that succeeds in master preemption is taken as the master node, and the rest of the nodes are taken as slave nodes. For example, if node 2 successfully preempts, then node 2 is considered as the new master and node 3 is considered as the slave. That is, the new node cluster includes the master node 2 and the slave node 3 at this time, and the respective states of the master node 2 and the slave node 3 are normal. Then, the steps S33-S35 are continued, and it is determined whether to resynchronize the current synchronized data with the new node cluster according to the predetermined message semantics to ensure the consistency of the data.
Therefore, even if the master node in the node cluster fails and cannot be normally used, the method and the system can quickly determine the new master node and realize data synchronization by using the new node cluster, thereby avoiding the influence on the data synchronization caused by the failure of the master node and simultaneously ensuring the consistency of the data.
Preferably, in the case that the node cluster includes the master node 1 and the slave nodes 2 and 3, when a new node is registered in the registration and listening unit 122, the registration and listening unit 122 adds the new node to the node cluster as a slave node. For example, when the amount of data to be synchronized increases, nodes may be added accordingly, such as node 4 (not shown). The node 4 registers in the registration and listening unit 122 at start-up, and the registration and listening unit 122 adds the node 4 to the node cluster, where the new node cluster comprises the master node 1, the slave nodes 2, 3, 4. Then, the process proceeds to steps S33-S35, and data synchronization is performed.
In this way, horizontal spreading can be performed according to the data volume (i.e., service requirement) to be synchronized, thereby reducing the delay of data synchronization and providing guarantee for real-time service of the downstream target data party 13.
Preferably, in the case that the node cluster includes the master node 1 and the slave nodes 2 and 3, when the registration and listening unit 122 monitors that the state of the node 2 in the slave nodes 2 and 3 is abnormal, the abnormal node 2 is deleted from the node cluster. The new node cluster includes a master node 1 and a slave node 2. Then, the process proceeds to steps S33-S35, and data synchronization is performed.
Therefore, even when the slave nodes in the node cluster fail to be used normally, the method can quickly delete the failed nodes and continue to perform data synchronization by using other normal nodes.
Furthermore, the present invention also provides a nonvolatile storage medium on which a program for data synchronization is stored, the program being executed by a computer to implement a method for data synchronization, the program including:
receiving an instruction, receiving data from a source data side;
registering a monitoring instruction, monitoring registered nodes to determine a node cluster, and determining a main node in the node cluster according to a registered result;
a time event sending instruction, wherein the master node sends out time events according to a preset time interval;
and a Hash calculation instruction, namely acquiring each node in the node cluster, taking data corresponding to the time event in the data as synchronous data, dividing the synchronous data into each node by utilizing a consistent Hash algorithm, and synchronizing the synchronous data to a target data side by each node.
While the present invention has been described in conjunction with specific embodiments, it is evident that many alternatives, modifications, and variations will be apparent to those skilled in the art in light of the foregoing description. Accordingly, it is intended that such alternatives, modifications, and variations be included within the spirit and scope of the appended claims.
Claims (16)
1. A method of data synchronization, the method comprising:
a receiving step of receiving data from a source data side;
a registration monitoring step, namely receiving registration of a plurality of nodes, monitoring the registered nodes to determine a node cluster, and determining a main node in the node cluster according to a registration result;
a time event sending step, wherein the master node sends out time events according to a preset time interval;
a hash calculation step of acquiring each node in the node cluster, taking data corresponding to the time event in the data as synchronous data, dividing the synchronous data into each node by using a consistent hash algorithm,
a synchronization step, wherein each node simultaneously synchronizes respective synchronous data to a target data side;
wherein the source data party and the target data party are different data systems or databases;
the temporal event has a time field corresponding to a specific time range.
2. The method according to claim 1, wherein in the registration monitoring step, the registration includes registration and preemption, the status of the registered nodes is monitored, the nodes with normal status form the node cluster, the node in the node cluster that succeeds in preemption is taken as the master node, and other nodes in the node cluster are taken as slave nodes.
3. The method of claim 2, wherein in the hash calculation step, further comprising:
respectively calculating each node by utilizing the consistent hash algorithm so as to respectively map each node to a hash ring;
respectively calculating the synchronous data by utilizing a consistent hash algorithm so as to respectively map the synchronous data to the hash rings one by one;
and respectively dropping the synchronous data on the hash ring into corresponding nodes on the hash ring in a clockwise direction, so as to divide the synchronous data into each node.
4. The method of claim 3, wherein in the registration listening step, when the status of the master node is abnormal, the slave nodes are grouped into the node cluster, and the slave nodes are notified to perform master preemption, and the node with successful master preemption is taken as the master node.
5. The method of claim 3, wherein in the registration listening step, when a new node registers, the new node is added to the node cluster as a slave node.
6. The method of claim 3, wherein in the registration listening step, when it is listened that the status of a node among the slave nodes is abnormal, an abnormal node is deleted from the node cluster.
7. The method of any one of claims 1-6, wherein in the synchronizing step, when a slave node in the cluster of nodes receives the time event, the master node and the slave node synchronize respective synchronization data to the target data party simultaneously.
8. An apparatus for data synchronization, the apparatus comprising:
a plurality of nodes;
a receiving unit that receives data from a source data side;
the registration and monitoring unit is used for receiving registration of a plurality of nodes, monitoring the registered nodes to determine a node cluster, and determining a main node in the node cluster according to a registration result;
the main node sends out time events according to a preset time interval;
a hash calculation unit for acquiring each node in the node cluster, taking data corresponding to the time event in the data as synchronous data, dividing the synchronous data into each node by using a consistent hash algorithm,
each node simultaneously synchronizes respective synchronous data to a target data side;
wherein the source data party and the target data party are different data systems or databases;
the temporal event has a time field corresponding to a specific time range.
9. The apparatus of claim 8, wherein the registration comprises registration and preemption, and the registration and listening unit listens to the status of the registered nodes, forms the node cluster with nodes in normal status, and takes a node in the node cluster that succeeds in preemption as the master node and takes other nodes in the node cluster as slave nodes.
10. The apparatus of claim 9, wherein in the hash calculation unit, further comprising:
respectively calculating each node by utilizing the consistent hash algorithm so as to respectively map each node to a hash ring;
respectively calculating the synchronous data by utilizing a consistent hash algorithm so as to respectively map the synchronous data to the hash rings one by one;
and respectively dropping the synchronous data on the hash ring into corresponding nodes on the hash ring in a clockwise direction, so as to divide the synchronous data into each node.
11. The apparatus of claim 10, wherein when the status of the master node is abnormal, the registration and listening unit groups the slave nodes into the node cluster and notifies the slave nodes to preempt, and takes the node that preempts successfully as the master node.
12. The apparatus of claim 10, wherein the registration and listening unit adds a new node to the cluster of nodes as a slave node when the new node registers.
13. The apparatus of claim 10, wherein when the registration and listening unit listens that the status of a node of the slave nodes is abnormal, the abnormal node is deleted from the node cluster.
14. The apparatus of any of claims 8-13, wherein the master node and the slave node synchronize respective synchronization data to the target data party simultaneously when the slave node in the node cluster receives the time event.
15. A system for data synchronization, the system comprising: a source data party, a target data party, and an apparatus for data synchronization as claimed in any one of claims 8-14.
16. A nonvolatile storage medium on which a program for data synchronization is stored, the program being executed by a computer to implement a method for data synchronization, characterized by comprising:
receiving an instruction, receiving data from a source data side;
registering a monitoring instruction, monitoring registered nodes to determine a node cluster, and determining a main node in the node cluster according to a registered result;
a time event sending instruction, wherein the master node sends out time events according to a preset time interval;
a hash calculation instruction for acquiring each node in the node cluster, taking data corresponding to the time event in the data as synchronous data, dividing the synchronous data into each node by using a consistent hash algorithm,
a synchronization instruction, wherein each node simultaneously synchronizes respective synchronization data to a target data side;
wherein the source data party and the target data party are different data systems or databases;
the temporal event has a time field corresponding to a specific time range.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811433880.6A CN109639777B (en) | 2018-11-28 | 2018-11-28 | Data synchronization method, device and system and non-volatile storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811433880.6A CN109639777B (en) | 2018-11-28 | 2018-11-28 | Data synchronization method, device and system and non-volatile storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109639777A CN109639777A (en) | 2019-04-16 |
| CN109639777B true CN109639777B (en) | 2021-12-10 |
Family
ID=66069480
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811433880.6A Active CN109639777B (en) | 2018-11-28 | 2018-11-28 | Data synchronization method, device and system and non-volatile storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109639777B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489059B (en) * | 2019-07-11 | 2022-04-12 | 平安科技（深圳）有限公司 | Data cluster storage method and device and computer equipment |
| CN115550384B (en) * | 2022-11-25 | 2023-03-10 | 苏州浪潮智能科技有限公司 | Cluster data synchronization method, device and equipment and computer readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107193643A (en) * | 2017-03-28 | 2017-09-22 | 中国科学院信息工程研究所 | A kind of highly reliable distributed traffic real-time statistical method and system |
| CN108696595A (en) * | 2018-05-28 | 2018-10-23 | 郑州云海信息技术有限公司 | Distributed type assemblies method of data synchronization, master node, slave node, system and medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106528574A (en) * | 2015-09-14 | 2017-03-22 | 阿里巴巴集团控股有限公司 | Data synchronization method and device |
| CN105516367B (en) * | 2016-02-02 | 2018-02-13 | 北京百度网讯科技有限公司 | Distributed data-storage system, method and apparatus |
| US10191800B2 (en) * | 2016-04-29 | 2019-01-29 | Cisco Technology, Inc. | Metric payload ingestion and replay |
| CN106572153A (en) * | 2016-10-21 | 2017-04-19 | 乐视控股（北京）有限公司 | Data storage method and device of cluster |
| CN108345617B (en) * | 2017-01-24 | 2022-05-06 | 阿里巴巴集团控股有限公司 | Data synchronization method and device and electronic equipment |
-
2018
- 2018-11-28 CN CN201811433880.6A patent/CN109639777B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107193643A (en) * | 2017-03-28 | 2017-09-22 | 中国科学院信息工程研究所 | A kind of highly reliable distributed traffic real-time statistical method and system |
| CN108696595A (en) * | 2018-05-28 | 2018-10-23 | 郑州云海信息技术有限公司 | Distributed type assemblies method of data synchronization, master node, slave node, system and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109639777A (en) | 2019-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10764369B2 (en) | Data storage method and server applicable to distributed server cluster | |
| CN107465767B (en) | Data synchronization method and system | |
| CN107231402B (en) | HTTP request processing method, device and system | |
| CN111190736A (en) | Low-intrusion distributed timing task scheduling system and method based on microservice | |
| WO2020147331A1 (en) | Micro-service monitoring method and system | |
| CN106888245B (en) | Data processing method, device and system | |
| CA2896865C (en) | Method and system for using a recursive event listener on a node in hierarchical data structure | |
| US10069942B2 (en) | Method and apparatus for changing configurations | |
| CN106817408B (en) | Distributed server cluster scheduling method and device | |
| CN103916481B (en) | Method and device for processing data | |
| US20190075084A1 (en) | Distributed Lock Management Method, Apparatus, and System | |
| CN109639777B (en) | Data synchronization method, device and system and non-volatile storage medium | |
| CN110730250B (en) | Information processing method and device, service system and storage medium | |
| JP7083416B2 (en) | RPC member information acquisition method, equipment, electronic devices, storage media and computer program products | |
| CN107229425B (en) | Data storage method and device | |
| CN105743970A (en) | Asynchronous data synchronization method for distributed systems | |
| CN111726388A (en) | Cross-cluster high-availability implementation method, device, system and equipment | |
| Bezerra et al. | Ridge: high-throughput, low-latency atomic multicast | |
| WO2001077841A2 (en) | Method and apparatus for reliable and scalable distribution of data files in distributed networks | |
| CN1725758A (en) | Method for synchronizing a distributed system | |
| CN109587062B (en) | Load balancing information synchronization method, device and processing equipment | |
| CN108881452B (en) | Data synchronization method, device and storage medium | |
| CN111797352A (en) | Method and device for sealing account and sealing system | |
| US20240028611A1 (en) | Granular Replica Healing for Distributed Databases | |
| CN106897365B (en) | Data processing 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 |