Version Vector Scheme for Data Synchronization on Resource-Constrained Networks

• US 20140317055A1
• Filed: 04/11/2014
• Published: 10/23/2014
• Est. Priority Date: 04/11/2013
• Status: Abandoned Application

• Current Assignee: NEC Laboratories America Inc (NEC Corporation)
• Original Assignee: NEC Laboratories America Inc (NEC Corporation)
• Inventors: Agrawal, Nitin, Aranya, Akshat, Ungureanu, Cristian
• Application Number:
  US14/251,200
• Publication Number:
  US 20140317055A1
• Time in Patent Office: Days
• US Class Current: 707/627
• CPC Class Codes: G06F 16/273 Asynchronous replication or reconciliation

Abstract

Disclosed herein are methods and structures for networks of mobile computers which efficiently synchronizes table data across the mobile computers while exhibiting great tolerance for temporary disconnects.

Claims

1. A computer implemented method for version vector data synchronization on resource constrained networks of one or more mobile client devices and a server device, said client devices executing one or more application programs that use data to be synchronized between the client devices and the server, said method comprising the computer implemented steps of :

providing a table of data to be synchronized between a client and the server, said table resident on one or more clients and the server, said table including a number of rows and columns having rows and columns for storing application and user data;

wherein said table includes a set of metacolumns, said metacolumns comprising _id;

_rev;

_dirty;

_sync;

_; and

_conflict,

assigning a monotonically increasing version ID (_rev) to each row of the table of data;

wherein said version ID is provided by the server to the table upon its first synchronization;

tracking, by the server, any rows which need to be synchronized by examination of the version ID; and

synchronizing the table among the client(s) and the server;

2. The computer implemented method according to claim 1 further comprising the computer implemented steps of:

assigning, by the server, a current version (_trev) to each table wherein upon each new row synchronization with server, said _trev is incremented by 1 and assigned to the row so synchronized.

3. The computer implemented method according to claim 2 further comprising the computer implemented steps of:

assigning, by the client, a set value to the dirty flag (_dirty) included in a row when that row is modified by a client; and

collecting any rows with _dirty flag set prior to any synchronization between the client and the server.

4. The computer implemented method according to claim 3 further comprising the computer implemented steps of:

assigning a set value to the _sync flag contained in a row when that row is pending a synchronization operation; and

clearing that _sync flag value upon completion of the synchronization operation.

5. The computer implemented method according to claim 4, further comprising the computer implemented steps of:

determining whether a conflict is present through the use of the _conflict flag by checking the _rev flag for a row sent by a client to determine whether it equals the server“

s _rev value for that row, if it does, then no other client has submitted concurrent changes and the row is accepted for synchronization by the server, else if the _rev flag for a row sent by the client is less than the servers rev, then a conflict exists.

6. A computer implemented structure providing a version vector scheme for data synchronization on resource constrained networks, said structure comprising the computer implemented elements of:

a table including a number of rows and columns having rows and columns for storing application and user data;

said table including a set of metacolumns, said metacolumns comprising _id;

_rev;

_dirty;

_sync;

_; and

_conflict