CONFLICT PREVENTION FOR PEER-TO-PEER REPLICATION

• US 20100106744A1
• Filed: 10/23/2008
• Published: 04/29/2010
• Est. Priority Date: 10/23/2008
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Wang, Rui
• Application Number:
  US12/256,473
• Publication Number:
  US 20100106744A1
• Time in Patent Office: Days
• US Class Current: 707/783
• CPC Class Codes: G06F 16/1834 implemented based on peer-to-peer networks, e.g. gnutella p2p communication protocols H04L67/104
• CPC Class Codes: G06F 16/2336 Pessimistic concurrency control approaches, e.g. locking or multiple versions without time stamps
• 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

Aspects of the subject matter described herein relate to conflict prevention. In aspects, a peer that seeks to modify a data structure first determines whether it is the owner of the data structure. An owner of the data structure has rights to update the data structure. If the peer is not the owner, the peer sends a request to the owner. The owner responds to the request by changing ownership of the data structure to the peer. Once this change is replicated to the peer, the peer is able to update the data structure as desired.

Claims

1. A method implemented at least in part by a computer, the method comprising:

obtaining information in a replica of a data structure that is replicated on multiple peers, the information indicating an owner peer that has rights to update the data structure;

determining if a peer is the owner peer via the information;

if the peer is not the owner peer, performing actions, comprising;

sending a request for an access token to the owner peer;

receiving a response to the request, the response providing the access token; and

modifying the replica of the data structure after the response is received.

2. The method of claim 1, wherein the data structure corresponds to a row of a relational database and wherein information is included in a hidden column of the row, the hidden column being hidden from applications accessing the data structure but being visible to a database management system.

3. The method of claim 1, wherein sending a request for an access token to the owner peer comprises encoding the request into a log through which a database of a requester peer is published to the owner peer.

4. The method of claim 1, wherein sending a request for an access token to the owner peer comprises contacting the owner peer and sending the request.

5. The method of claim 1, wherein sending a request for an access token to the owner peer comprises a requesting peer sending the request and wherein receiving the response comprises receiving a modification to the replica of the data structure via a replication mechanism that replicates the modification to the multiple peers, the modification indicating that the requesting peer is now the owner peer and is allowed to modify the data structure.

6. The method of claim 1, wherein the access token comprises a field of the data structure that is hidden from applications accessing the replica of the data structure but visible to a database management system that is tasked at least in part with preventing conflicting updates to the data structure, the field encoding an identifier associated with the owner peer.

7. The method of claim 1, further comprising if the peer is the owner peer, modifying the replica of the data structure without sending a request for the access token to another peer.

8. The method of claim 1, wherein the response includes a stub that indicates that the peer is the owner peer, the stub being inserted by a peer that controls inserts into the data structure.

9. A computer storage medium having computer-executable instructions, which when executed perform actions, comprising:

receiving, at a receiving peer, a request for an access token from a requesting peer that is one of a plurality of peers that replicate data, the access token relating to a data structure that the requesting peer seeks to update, the data structure being replicated on the peers, the access token allowing updates to the data structure;

determining if the receiving peer is an owner peer that has exclusive rights to update the data structure; and

if the receiving peer is the owner peer, providing the access token.

10. The computer storage medium of claim 9, further comprising receiving another request for the access token from another requesting peer and determining which of the requesting peers to which to provide the access token.

11. The computer storage medium of claim 9, further comprising if the receiving peer is not the owner peer, refraining from responding to the request.

12. The computer storage medium of claim 9, wherein providing the access token comprises modifying a field of the data structure to indicate that the requesting peer is now the owner of the data structure and providing an indication of the field as modified to at least one of the plurality of peers that replicate data.

13. The computer storage medium of claim 12, wherein the field is hidden from applications that access the data structure but is visible to a database management system tasked at least in part with preventing conflicting updates to the data structure, the field encoding an identifier associated with the owner peer.

14. The computer storage medium of claim 12, wherein the data structure corresponds to a row of a relational database and wherein the data structure includes the information that indicates the owner peer in a hidden column of the row.

15. In a computing environment, an apparatus, comprising:

an update manager operable to update a replica of a data structure that is replicated on a plurality of peers;

an ownership manager operable to determine an owner peer of the data structure based on information included in the replica of the data structure, the owner peer having rights to update the data structure;

a replication mechanism operable to participate in replicating the data structure across the peers; and

a token requester operable to obtain an access token from the owner peer before the update manager updates the replica of the data structure if the data structure is not owned by a peer hosted on the apparatus.

16. The apparatus of claim 15, further comprising a token provider operable to provide the access token to a requesting peer if the data structure is owned by the peer hosted on the apparatus.

17. The apparatus of claim 16, wherein the token provider is further operable to select the requesting peer from a plurality of peers that have requested the access token from the peer hosted on the apparatus.

18. The apparatus of claim 15, further comprising an insert manager that is operable to generate a key with which a new data structure is to be created, the insert manager generating the key based on ranges of keys that have been assigned to the peers.

19. The apparatus of claim 15, wherein the ownership manager is further operable to assume ownership of one or more data structures owned by another peer that is being removed from the plurality of peers that are replicating the data structure.

20. The apparatus of claim 19, wherein the ownership manager is operable to assume ownership of one or more data structure owned by another peer by executing a procedure that updates, for each of the one or more data structures, a field that is hidden from applications executing on the peer hosted on the apparatus, the owner manager being further operable to provide the procedure to other of the peers for execution thereon.