Method and system for synchronizing data in peer to peer networking environments

• US 20040153473A1
• Filed: 11/19/2003
• Published: 08/05/2004
• Est. Priority Date: 11/21/2002
• Status: Abandoned Application

• Current Assignee: Silicon Chalk, Inc. (Blackboard Incorporated)
• Original Assignee: Silicon Chalk, Inc. (Blackboard Incorporated)
• Inventors: Ma, Eddy, Wright, James, Coatta, Terry, Wong, Joseph, Hutchinson, Norman
• Application Number:
  US10/715,508
• Publication Number:
  US 20040153473A1
• Time in Patent Office: Days
• US Class Current: 707/104.1
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor

Abstract

Methods and systems in accordance with the present invention provide a peer-to-peer replicated hierarchical data store that allows the synchronization of the contents of multiple data stores on a computer network without the use of a master data store. The synchronization of a replicated data store stored on multiple locations is provided even when there is constantly evolving set of communications partitions in the network. Each computer in the network may have its own representation of the replicated data store and may make changes to the data store independently without consulting a master authoritative date store or requiring a consensus among other computers with representations of the data store. Changes to the data store may be communicated to the other computers by broadcasting messages in a specified protocol to the computers having a representation of the replicated data store. The computers receive the messages and process their local representation of the data store according to a protocol described below. As such, each computer has a representation of the replicated database that is consistent with the representations of the data store on the other computers. This allows computers to make changes to the data store even when disconnected via a network partition.

Claims

1. A method in a data processing system having peer-to-peer replicated data stores, comprising:

receiving, by a first data store, a plurality of values sent from a plurality of other data stores; and

updating a value in the first data store based on one or more of the received values for replication.

2. The method of claim 1, wherein the values that are sent from a plurality of other data stores are broadcast from the plurality of other data stores to another plurality of data stores.

3. The method of claim 1, wherein the first data store is a hierarchical replicated data store.

4. The method of claim 1, further comprising the step of:

determining if a value received from one of the plurality of other data stores is consistent with the value of the first data store.

5. The method of claim 4, further comprising the steps of:

identifying the difference between the first data store and the data store from which the value was received if they are not consistent; and

reconciling the first data store and the data store from which the value was received.

6. The method of claim 5, wherein the reconciling further comprises the step of:

updating the least recent data store at the point of the identified difference based on the most recent data store.

7. A method in a data processing system having a first data store and a plurality of other data stores, the first data store having a plurality of entries, each entry having a value, the method comprising the steps of:

receiving by the first data store a plurality of values from the other data stores for one of the entries;

determining by the first data store which of the values is an appropriate value for the one entry; and

storing the appropriate value in the one entry to accomplish replication.

8. The method of claim 7, wherein the determining step further comprises the step of:

determining which of the values is a most recently stored value.

9. The method of claim 7, further comprising the step of:

broadcasting the plurality of values from the other data stores to another plurality of data stores.

10. A data processing system having peer-to-peer replicated data stores, comprising:

a memory comprising program instructions that receive, by a first data store, a plurality of values sent from a plurality of other data stores, and update a value in the first data store based on one or more of the received values for replication; and

a processor for running the program.

11. The data processing system of claim 10, wherein the values that are sent from a plurality of other data stores are broadcast from the plurality of other data stores to another plurality of data stores.

12. The data processing system of claim 10, wherein the first data store is a hierarchical replicated data store.

13. The data processing system of claim 10, wherein the program further determines if a value received from one of the plurality of other data stores is consistent with the value of the first data store.

14. The data processing system of claim 13, wherein the program further identifies the difference between the first data store and the data store from which the value was received if they are not consistent, and reconciles the first data store and the data store from which the value was received.

15. The data processing system of claim 14, wherein the reconciling further comprises the step of:

updating the least recent data store at the point of the identified difference based on the most recent data store.

16. A data processing system having a first data store and a plurality of other data stores, the first data store having a plurality of entries, each entry having a value, the data processing system comprising:

a memory comprising a program that receives by the first data store a plurality of values from the other data stores for one of the entries, determines by the first data store which of the values is an appropriate value for the one entry, and stores the appropriate value in the one entry to accomplish replication; and

a processor for running the program.

17. The data processing system of claim 16, wherein the program further determines which of the values is a most recently stored value.

18. The data processing system of claim 16, wherein the program further broadcasts the plurality of values from the other data stores to another plurality of data stores.

19. A computer-readable medium containing instructions for controlling a data processing system having peer-to-peer replicated data stores to perform a method comprising the steps of:

receiving, by a first data store, a plurality of values sent from a plurality of other data stores; and

updating a value in the first data store based on one or more of the received values for replication.

20. The computer-readable medium of claim 19, wherein the values that are sent from a plurality of other data stores are broadcast from the plurality of other data stores to another plurality of data stores.

21. The computer-readable medium of claim 19, wherein the first data store is a hierarchical replicated data store.

22. The computer-readable medium of claim 19, where in the method further comprises the step of:

determining if a value received from one of the plurality of other data stores is consistent with the value of the first data store.

23. The computer-readable medium of claim 22, where in the method further comprises the steps of:

identifying the difference between the first data store and the data store from which the value was received if they are not consistent; and

reconciling the first data store and the data store from which the value was received.

24. The computer-readable medium of claim 23, wherein the reconciling further comprises the step of:

updating the least recent data store at the point of the identified difference based on the most recent data store.

25. A computer-readable medium containing instructions for controlling a data processing system to perform a method, the data processing system having a first data store and a plurality of other data stores, the first data store having a plurality of entries, each entry having a value, the method comprising the steps of:

receiving by the first data store a plurality of values from the other data stores for one of the entries;

determining by the first data store which of the values is an appropriate value for the one entry; and

storing the appropriate value in the one entry to accomplish replication.

26. The computer-readable medium of claim 25, wherein the determining step further comprises the step of:

determining which of the values is a most recently stored value.

27. The computer-readable medium of claim 26, wherein the method further comprises the step of:

broadcasting the plurality of values from the other data stores to another plurality of data stores.

28. A data processing system having peer-to-peer replicated data stores, comprising:

means for receiving, by a first data store, a plurality of values sent from a plurality of other data stores; and

means for updating a value in the first data store based on one or more of the received values for replication.