CN108108372B - Automatic correction processing method and device for data conflict - Google Patents
Automatic correction processing method and device for data conflict Download PDFInfo
- Publication number
- CN108108372B CN108108372B CN201611055574.4A CN201611055574A CN108108372B CN 108108372 B CN108108372 B CN 108108372B CN 201611055574 A CN201611055574 A CN 201611055574A CN 108108372 B CN108108372 B CN 108108372B
- Authority
- CN
- China
- Prior art keywords
- data
- subscriber
- data node
- node
- operation time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- G06F16/275—Synchronous replication
-
- 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
- G06F16/273—Asynchronous replication or reconciliation
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data conflict automatic correction processing method and device, wherein the method comprises the following steps: the first data node receives a copy request for updating the subscriber data from the second data node; the first data node analyzes the copy request to obtain the subscriber data which is carried in the copy request and needs to be updated, and the current and last operation time; the first data node determines whether data conflict occurs between the first data node and the second data node according to the latest local operation time and the current and last operation time; if the data conflict is determined to occur, the first data node corrects the data of the subscriber stored by the first data node by using the data of the subscriber stored by the second data node. The embodiment of the invention can timely find the data conflict of the subscribers among the data nodes, and correct the data of the subscribers which are stored in a plurality of records of a plurality of tables and conflict when the data conflict is found, thereby ensuring the consistency of the data of the subscribers.
Description
Technical Field
The invention relates to the field of distributed databases (Distributed Database, DDB), in particular to a method and a device for automatically correcting and processing Data conflict (DH).
Background
Generally, data is an organized collection of data objects that are systematically recorded in an in-memory database or storage medium for access by an application server (Application Server, AS) or computing system. Each data object is classified according to different applications, for example, according to network element type and tenant type.
In a distributed database, there are typically different copies to store the data of a certain data object.
Distributed databases are developed today, and in order to meet different access requirements of application servers, replication techniques are typically used to synchronize data between different replicas. By synchronizing, changes to data objects in one copy are recorded and synchronized updates are propagated to other copies, where corresponding data objects of the other copies perform the same changes.
Due to network failure and other factors, when the respective copies work independently or the synchronization time is long, the same data object is modified concurrently, so that data collision occurs. Correction of the data is required to ensure its consistency.
That is, with the continuous development of wireless communication technology and computing technology, research into supporting distributed databases has become an important direction. Research on distributed databases mainly comprises techniques of storage, replication, inquiry, data consistency and the like, wherein maintenance of data consistency is an important task of the distributed databases. However, because of the complex networking model of mobile communication, the environments of all sites have large differences, and the factors such as network faults in operation make it difficult to effectively work the technology for maintaining data consistency. When the data is inconsistent, the database records of the memory databases of the two sites are inconsistent, and the application of different data queried from the two sites affects the mobile communication business process, for example, the position information of the user is different, so that the position update and the call process can be affected.
The methods for handling conflicts commonly used in the industry currently include:
1. and overlapping the data of one site with the data of the other site in conflict to ensure the consistency of the data.
2. The two stations in conflict are combined according to the records, namely the old records are covered by the new records.
Because the data of a subscriber is stored in a plurality of records in a plurality of tables, the above method cannot completely solve the problem of consistency of the data of the subscriber, and therefore a method is required to ensure consistency of the data of the subscriber.
Disclosure of Invention
According to the method and the device for automatically correcting and processing the data conflict, the problem of consistency of the subscriber data is solved.
The method for automatically correcting and processing the data conflict provided by the embodiment of the invention comprises the following steps:
the first data node receives a copy request for updating the subscriber data from the second data node;
the first data node analyzes the received replication request to obtain the subscription user data which is carried by the replication request and needs to be updated, and the current and last operation time;
the first data node determines whether data conflict occurs between the first data node and the second data node according to the latest local operation time of the subscriber data and the current and last operation times carried by the copy request;
and if the data conflict between the first data node and the second data node is determined, the first data node corrects the data of the subscriber stored by the first data node by utilizing the data of the subscriber stored by the second data node.
Preferably, the determining, by the first data node, whether a data collision occurs between the first and second data nodes according to the latest local operation time of the subscriber data and the current and last operation times carried by the replication request includes:
and comparing the latest local operation time with the current operation time and the last operation time carried by the replication request respectively to determine whether data conflict occurs.
Preferably, the determining whether the data collision occurs by comparing the latest local operation time with the current operation time and the last operation time carried by the copy request includes:
if the latest local operation time is earlier than the current operation time carried by the replication request and is different from the last operation time carried by the request, determining that data conflict occurs between the first and second data nodes, otherwise, determining that no data conflict occurs between the first and second data nodes.
Preferably, the first data node corrects the data stored by itself for the subscriber by using the data stored by the second data node, including:
the first data node obtains all data of the subscriber from the second data node by initiating a correction request for correcting the data of the subscriber to the second data node;
the first data node corrects the data of the subscriber stored in a plurality of records of a plurality of tables by using all the data of the subscriber acquired from the second data node.
Preferably, the method further comprises:
and if the latest local operation time is the same as the last operation time carried by the replication request, the first data node updates the data of the subscriber, which is stored by the first data node, by using the data of the subscriber, which is carried by the replication request and needs to be updated.
Preferably, the method further comprises:
and if the latest local operation time is later than the current operation time carried by the replication request, the first data node ignores the replication request.
According to an embodiment of the present invention, there is provided a storage medium storing a program for implementing the above-described data conflict automatic correction processing method.
According to an embodiment of the invention, an automatic correction processing device for data collision comprises:
a receiving module, configured to receive a replication request from a second data node for updating subscription data;
the analysis module is used for obtaining the subscription user data which is carried by the replication request and needs to be updated and the current and last operation time by analyzing the received replication request;
the conflict judging module is used for determining whether data conflict occurs between the first data node and the second data node according to the latest local operation time of the subscriber data stored in the first data node and the current and last operation times carried by the copy request;
and the automatic correction module is used for correcting the data of the subscriber stored in the first data node by utilizing the data of the subscriber stored in the second data node when the data conflict between the first data node and the second data node is determined.
Preferably, the conflict determination module determines whether a data conflict occurs by comparing the latest local operation time with the current operation time and the last operation time carried by the copy request.
Preferably, the conflict determination module determines that a data conflict occurs between the first and second data nodes when the latest local operation time is earlier than the current operation time carried by the replication request and is different from the last operation time carried by the replication request, otherwise determines that no data conflict occurs between the first and second data nodes.
Preferably, the automatic correction module initiates a correction request for correcting the data of the subscriber to the second data node, acquires all the data of the subscriber from the second data node, and corrects the data of the subscriber stored in the plurality of records of the plurality of tables of the first data node using all the data of the subscriber acquired from the second data node.
The technical scheme provided by the embodiment of the invention has the following beneficial effects:
the embodiment of the invention can timely find the data conflict of the subscribers among the data nodes, and correct the data of the subscribers which are stored in a plurality of records of a plurality of tables and conflict when the data conflict of the subscribers is found, thereby ensuring the consistency of the data of the subscribers.
Drawings
FIG. 1 is a block diagram of a method for automatically correcting and processing data collision according to an embodiment of the present invention;
FIG. 2 is a block diagram of an apparatus for automatically correcting and processing data collision according to an embodiment of the present invention;
FIG. 3 is a flow chart of data synchronization under a normal business process provided by an embodiment of the present invention;
FIG. 4 is a flow chart for discovering data conflicts and automatically correcting conflicting data when anomalies (e.g., broken links, restored links) occur in accordance with an embodiment of the present invention;
FIG. 5 is a flow chart of the discovery conflict data of FIG. 4;
fig. 6 is a flowchart of updating correction data of fig. 4.
Detailed Description
The following detailed description of the preferred embodiments of the present invention is provided in conjunction with the accompanying drawings, and it is to be understood that the preferred embodiments described below are merely illustrative and explanatory of the invention, and are not restrictive of the invention.
Fig. 1 is a block diagram of a method for automatically correcting and processing data collision according to an embodiment of the present invention, where, as shown in fig. 1, the steps include:
step S101: the first data node receives a replication request from the second data node for updating the subscription data.
After the application server modifies the data of the subscriber on the second data node, the second data node records the current operation time, adds the modified data of the subscriber, the current operation time and the last operation time into the replication request, and sends the replication request to other data nodes of the distributed database, so that the other data nodes apply the modified data of the subscriber according to the replication request, and the purpose that the data of the subscriber stored by each data node is consistent is achieved.
Step S102: and the first data node analyzes the received replication request to obtain the subscription user data which is carried by the replication request and needs to be updated and the current and last operation time.
Step S103: and the first data node determines whether data conflict occurs between the first data node and the second data node according to the latest local operation time and the current and last operation time of the subscriber data.
Step S103 includes: the first data node determines whether data collision occurs by comparing the latest local operation time with the current operation time and the last operation time respectively. Specifically, if the latest local operation time is earlier than the current operation time and is different from the last operation time, determining that data collision occurs between the first and second data nodes, otherwise, determining that no data collision occurs between the first and second data nodes.
Step S104: if the data conflict between the first data node and the second data node is determined, the first data node corrects the data of the subscriber stored by the first data node by using the data of the subscriber stored by the second data node.
Step S104 includes: the first data node obtains all data of the subscriber from the second data node by initiating a correction request for correcting the data of the subscriber to the second data node, and corrects the data of the subscriber stored in a plurality of records of a plurality of tables using all the data of the subscriber obtained from the second data node.
The method further includes, if the comparison in step S103 shows that the latest local operation time is the same as the last operation time carried by the replication request, indicating that the data of the subscriber stored in the first data node is not the latest data, and at this time, updating the data of the subscriber stored in the first data node by using the data of the subscriber to be updated carried by the replication request.
The method further includes, if the comparison in step S103 shows that the latest local operation time is later than the current operation time carried by the replication request, indicating that the data of the subscriber stored in the first data node is the latest data, and at this time, the first data node ignores the replication request without updating the data of the subscriber.
It should be noted that, to ensure data consistency of each data node, each data node may send a copy request every predetermined time, for example, every 100 ms.
The embodiment of the invention provides a data conflict automatic correction processing method, and the specific content of the method is expanded by the traditional distributed database replication technology. Specifically, the application server completes the modification operation of a record on a certain subscriber data copy, updates the modification to the data copy, synchronizes the modification record to corresponding other copies, and the other copies modify the record of the local same data object according to the synchronized record. During the process of modifying the local identical data object by other copies according to the synchronous record, firstly, the conflict is found, and then the correction is carried out according to the specific conflict content, so that the data consistency is ensured. The related content is as follows:
1. the time of each operation of the subscriber data is recorded.
2. A subscriber record conflict is found.
3. And automatically correcting the contract user data conflict.
It will be appreciated by those skilled in the art that all or part of the steps in implementing the method of the above embodiment may be implemented by a program to instruct related hardware, and the program may be stored in a computer readable storage medium, and the program includes steps S101 to S104 when executed. The storage medium may be ROM/RAM, magnetic disk, optical disk, etc.
Fig. 2 is a block diagram of an apparatus for automatically correcting and processing data collision according to an embodiment of the present invention, as shown in fig. 2, including: the system comprises a receiving module 10, an analyzing module 20, a conflict judging module 30 and an automatic correcting module 40.
A receiving module 10 for receiving a copy request from the second data node for updating the subscription data.
And the analyzing module 20 is configured to obtain the subscription data, the current operation time and the last operation time, which are carried by the replication request and need to be updated, by analyzing the received replication request.
And the conflict judging module 30 is configured to determine whether a data conflict occurs between the first and second data nodes according to the latest local operation time of the subscriber data stored in the first data node and the current and last operation times carried by the replication request. Specifically, the conflict determination module 30 determines whether a data conflict occurs by comparing the latest local operation time with the current and last operation times carried by the copy request, respectively.
And an automatic correction module 40, configured to correct the data of the subscriber stored in the first data node by using the data of the subscriber stored in the second data node when it is determined that the data conflict occurs between the first and second data nodes.
The working procedure is as follows: after the application server modifies the data of the subscriber on the second data node, the second data node adds the modified data of the subscriber, the current operation time and the last operation time to the replication request and sends the replication request to other data nodes of the distributed database, so that the modification is updated to corresponding data copies of the subscriber of other data nodes. After the receiving module 10 of the first data node receives the replication request from the second data node, the analyzing module 20 analyzes the received replication request to obtain the subscriber data, which need to be updated, carried in the received replication request, and the current and last operation time. The conflict determination module 30 determines that a data conflict occurs between the first and second data nodes when the latest local operation time is earlier than the current operation time carried by the copy request and is different from the last operation time carried by the copy request, and at this time, the automatic correction module 40 corrects the data of the subscriber stored in the plurality of records of the plurality of tables of the first data node by initiating a correction request for correcting the data of the subscriber to the second data node, acquiring all the data of the subscriber from the second data node, and using all the data of the subscriber acquired from the second data node.
Fig. 3 is a flow chart of data synchronization under a normal service flow provided in an embodiment of the present invention, as shown in fig. 3, the steps include:
step 201: AS1 sends a modify operation message to Data Node (Data Node, DN) 1.
That is, AS1 modifies the subscriber data on DN 1.
Step 202: after the DN1 completes the modification of the subscription data, a successful response is returned to the AS 1.
That is, if DN1 successfully modifies the corresponding subscriber data according to the modification operation message from AS1, a response message indicating that the modification is successful is returned to AS 1.
Step 203: DN1 sends the modified subscriber data record to DN2 in an asynchronous manner, keeping DN2 consistent with DN 1's subscriber data.
Step 204: DN2 applies the same data record to keep the recorded subscription data and DN1 consistent, if DN2 applies the same modified record successfully, a response message indicating successful copying is returned to DN 1.
Step 205: AS2 sends a modify operation message to DN 2.
That is, AS2 modifies the subscription data on DN 2.
Step 206: DN2 completes the modification of the subscription data and returns a successful response to AS 2.
That is, if DN2 successfully modifies the corresponding subscriber data according to the modification operation message from AS2, a response message indicating that the modification is successful is returned to AS 2.
Step 207: DN2 asynchronously transmits the modified subscriber data record to DN1, keeping the subscriber data of DN1 consistent with DN 2.
Step 208: DN1 applies the same data record to keep the recorded subscription data and DN2 consistent, if DN1 applies the same modified record successfully, a response message indicating successful copying is returned to DN 2.
FIG. 4 is a flowchart of discovering data conflicts and automatically correcting conflicting data when an anomaly (e.g., a broken link, a restored link) occurs, according to an embodiment of the present invention, as shown in FIG. 4, comprising the steps of:
step 301: AS1 sends a modify operation message to DN 1.
That is, AS1 modifies the subscriber data on DN 1.
Step 302: after the DN1 completes the modification of the subscription data, a successful response is returned to the AS 1.
That is, if DN1 successfully modifies the corresponding subscriber data according to the modification operation message from AS1, a response message indicating that the modification is successful is returned to AS 1.
Step 303: DN1 sends modified subscriber data records to DN2 in an asynchronous manner due to a broken link failure.
Step 304: AS2 sends a modify operation message to DN 2.
That is, AS2 modifies the subscription data on DN 2.
Step 305: DN2 completes the modification of the subscription data and returns a successful response to AS 2.
That is, if DN2 successfully modifies the corresponding subscriber data according to the modification operation message from AS2, a response message indicating that the modification is successful is returned to AS 2.
Step 306: DN2 asynchronously transmits the modified subscriber data record to DN1, keeping the subscriber data of DN1 consistent with DN 2.
Step 307: DN1 applies the subscriber data record and discovers the data conflict, and a response message indicating the data conflict is returned to DN 2.
Step 308: DN1 sends a correction data request (i.e., correction request) to DN2, where the request carries the KEY of the subscriber (i.e., the identification of the subscriber).
Step 309: DN2 sends a correction data response (i.e., a correction response) to DN1, which includes all of the subscriber's data, thereby causing DN1 to update the subscriber data record, maintaining consistency with DN2 data.
It should be noted that, the data nodes send replication requests at predetermined intervals (for example, 100 ms), and once a data collision is found, data correction is performed in the manner of step 308 and step 309, so as to ensure data consistency of each data node. For this embodiment, after 100ms, DN1 may send a copy request to DN2, so that the data records of the subscribers in DN2 are consistent with DN1, and the data records of the subscribers in DN1 and DN2 are the latest data records.
FIG. 5 is a flow chart of the discovery conflict data of FIG. 4, as shown in FIG. 5, including the steps of:
step S401: DN1 begins the data collision determination flow.
Step S402: DN1 compares the latest local operation time of the signing user recorded by DN1 with the current operation time in the received copy request, and judges whether the latest local operation time is later than the current operation time, if yes, step S406 is executed, otherwise step S403 is executed.
Wherein, the latest local operation time is the latest operation time of the subscriber data recorded by DN 1.
The current operation time in the copy request is the time when the AS2 performs the modification operation on the DN 2.
Wherein, the last operation time in the copy request is the last operation time of the subscriber data recorded by DN 2.
Step S403: DN1 compares the latest local operation time of the subscriber recorded by DN1 with the last operation time in the copy request received by DN1, and judges whether the latest local operation time is the same as the last operation time, if so, step S407 is executed, otherwise step S404 is executed.
Step S404: DN1 finds that it collides with DN 2's data about the subscriber.
Step S405: DN1 returns a response message to DN2 indicating a data collision.
Step S406: DN1 ignores the copy request.
Step S407: and the DN1 updates the data of the subscriber stored by itself by using the data of the subscriber needing to be updated carried by the copy request.
Step S408: DN1 applies the same modified record success and returns a response message to DN2 indicating that the copy was successful.
Step S409: DN1 ends the data collision determination procedure.
FIG. 6 is a flow chart of updating correction data of FIG. 4, as shown in FIG. 6, comprising the steps of:
step S501: DN1 begins the data correction flow.
Step S502: DN1 scans all subscriber records in the correction response.
Step S503: for each record, DN1 determines whether the latest local operation time of the record is later than the current operation time of the record in the correction response, if so, step S506 is executed, otherwise, step S504 is executed.
Step S504: DN1 corrects the content of the self-stored corresponding record by using the record content in the correction response.
Step S505: DN1 determines whether all records of the subscriber in the correction response have been traversed, and if all records have been traversed, step S507 is executed, otherwise step S503 is executed.
Step S506: DN1 ignores the record.
Step S507: DN1 begins the data correction flow.
As can be seen from the flow chart of fig. 6, the correction flow provided by the embodiment of the present invention is to update the corresponding data of DN1 by using the data of the latest records of the tables of DN2, and if the record of DN2 is not the latest, the record of DN1 does not need to be corrected.
Although the present invention has been described in detail hereinabove, the present invention is not limited thereto and various modifications may be made by those skilled in the art in accordance with the principles of the present invention. Therefore, all modifications made in accordance with the principles of the present invention should be understood as falling within the scope of the present invention.
Claims (6)
1. A data collision automatic correction processing method comprises the following steps:
the first data node receives a copy request for updating the subscriber data from the second data node;
the first data node analyzes the received replication request to obtain the subscription user data which is carried by the replication request and needs to be updated, and the current and last operation time;
the first data node determines whether data conflict occurs between the first data node and the second data node according to the latest local operation time of the subscriber data and the current and last operation times carried by the copy request;
if the data conflict between the first data node and the second data node is determined, the first data node corrects the data of the subscriber stored by the first data node by using the data of the subscriber stored by the second data node;
wherein, the determining, by the first data node, whether a data collision occurs between the first and second data nodes according to the latest local operation time of the subscriber data and the current and last operation times carried by the replication request includes:
if the latest local operation time is earlier than the current operation time carried by the replication request and is different from the last operation time carried by the request, determining that data conflict occurs between the first and second data nodes, otherwise, determining that no data conflict occurs between the first and second data nodes.
2. The method of claim 1, wherein the first data node correcting the data of the subscriber stored by itself using the data of the subscriber stored by the second data node comprises:
the first data node obtains all data of the subscriber from the second data node by initiating a correction request for correcting the data of the subscriber to the second data node;
the first data node corrects the data of the subscriber stored in a plurality of records of a plurality of tables by using all the data of the subscriber acquired from the second data node.
3. The method of claim 1, further comprising:
and if the latest local operation time is the same as the last operation time carried by the replication request, the first data node updates the data of the subscriber, which is stored by the first data node, by using the data of the subscriber, which is carried by the replication request and needs to be updated.
4. The method of claim 1, further comprising:
and if the latest local operation time is later than the current operation time carried by the replication request, the first data node ignores the replication request.
5. An automatic correction processing apparatus for data collision, comprising:
a receiving module, configured to receive a replication request from a second data node for updating subscription data;
the analysis module is used for obtaining the subscription user data which is carried by the replication request and needs to be updated and the current and last operation time by analyzing the received replication request;
the conflict judging module is used for determining whether data conflict occurs between the first data node and the second data node according to the latest local operation time of the subscriber data stored in the first data node and the current and last operation times carried by the copy request;
the automatic correction module is used for correcting the data of the subscriber stored in the first data node by utilizing the data of the subscriber stored in the second data node when the data conflict between the first data node and the second data node is determined;
and the conflict judging module determines that data conflict occurs between the first and second data nodes when the latest local operation time is earlier than the current operation time carried by the replication request and is different from the last operation time carried by the replication request, otherwise, determines that no data conflict occurs between the first and second data nodes.
6. The apparatus of claim 5, the auto-correction module obtains all data of the subscriber from the second data node by initiating a correction request to the second data node for correcting the data of the subscriber, and corrects the data of the subscriber stored in the plurality of records of the first data node using all data of the subscriber obtained from the second data node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611055574.4A CN108108372B (en) | 2016-11-25 | 2016-11-25 | Automatic correction processing method and device for data conflict |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611055574.4A CN108108372B (en) | 2016-11-25 | 2016-11-25 | Automatic correction processing method and device for data conflict |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108108372A CN108108372A (en) | 2018-06-01 |
| CN108108372B true CN108108372B (en) | 2023-05-23 |
Family
ID=62204338
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611055574.4A Active CN108108372B (en) | 2016-11-25 | 2016-11-25 | Automatic correction processing method and device for data conflict |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108108372B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109753389A (en) * | 2019-01-03 | 2019-05-14 | Oppo广东移动通信有限公司 | Guarantee method, apparatus, storage medium and the server of data consistency |
| CN113448493B (en) * | 2020-03-27 | 2024-04-26 | 伊姆西Ip控股有限责任公司 | Method, electronic device and computer readable medium for backing up data |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101241492A (en) * | 2007-02-06 | 2008-08-13 | 中兴通讯股份有限公司 | EMS memory data storage apparatus possessing capacity dynamic control function and its accomplishing method |
| US8645429B1 (en) * | 2011-04-20 | 2014-02-04 | Google Inc. | Resolving conflicting graph mutations |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7523110B2 (en) * | 2005-03-03 | 2009-04-21 | Gravic, Inc. | High availability designated winner data replication |
| US7606838B2 (en) * | 2006-02-22 | 2009-10-20 | Microsoft Corporation | Distributed conflict resolution for replicated databases |
| WO2015183301A1 (en) * | 2014-05-30 | 2015-12-03 | Hitachi Data Systems Corporation | Metadata favored replication in active topologies |
-
2016
- 2016-11-25 CN CN201611055574.4A patent/CN108108372B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101241492A (en) * | 2007-02-06 | 2008-08-13 | 中兴通讯股份有限公司 | EMS memory data storage apparatus possessing capacity dynamic control function and its accomplishing method |
| US8645429B1 (en) * | 2011-04-20 | 2014-02-04 | Google Inc. | Resolving conflicting graph mutations |
Non-Patent Citations (2)
| Title |
|---|
| 对移动数据库复制技术中冲突问题的研究;连向辉等;《黑龙江科技信息》;20070415(第07期);全文 * |
| 移动数据库复制与同步技术的研究与应用;印志鸿等;《科技创新导报》;20101121(第33期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108108372A (en) | 2018-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4732661B2 (en) | How to synchronize the client database with the server database | |
| CN103152398A (en) | Method and system for file synchronization among multiple terminal files | |
| CN101741830A (en) | Method, system, client and server for realizing multi-client data synchronization | |
| CN107231400B (en) | Data synchronization method and device | |
| JP2011511368A5 (en) | ||
| US20090293069A1 (en) | Method and apparatus for synchronizing data between terminals | |
| CN110545207B (en) | Synchronous automatic intelligent DNS system and configuration method | |
| CN108108372B (en) | Automatic correction processing method and device for data conflict | |
| CN111314333B (en) | Account management method, account management device, account management equipment and computer readable storage medium | |
| CN110213359B (en) | Internet of vehicles networking data pushing system and method based on D2D | |
| CN113766027A (en) | Method and equipment for forwarding data by flow replication cluster node | |
| CN114185991A (en) | Method and related device for realizing data synchronization based on distributed database | |
| CN105915636A (en) | Contact person information synchronization method and apparatus thereof | |
| CN112000850A (en) | Method, device, system and equipment for data processing | |
| CN112749172A (en) | Data synchronization method and system between cache and database | |
| JP2004171278A (en) | Data duplication management method, information processing method in node, node, data duplication management program and recording medium recorded with the program | |
| CN111090648B (en) | Relational database data synchronization conflict resolution method | |
| US11366827B2 (en) | Data replication | |
| CN107153699B (en) | Method and device for dynamically expanding cluster server | |
| CN110647298B (en) | Data storage control method and device | |
| CN109995848B (en) | System configuration data management method based on block chain and intelligent contract | |
| CN108712470B (en) | Routing data synchronization method and device, computer device and storage medium | |
| CN101534480A (en) | Cross network file synchronizing method based on mobile software agent | |
| CN111211985B (en) | Forwarding table item updating method, device and system | |
| CN111683382A (en) | Configuration 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 |