Palmsource Inc.

Access Company, Ltd.

Access Systems Americas, Inc.

William Leonard Mills

Alvin I Pivowar

Tom Butler

Robert G McKenzie

Atul Gupta

Gerard George Pallipuram

Jayita Poddar

Uma D Gouru

Thomas C Butler

A method and system for N-way synchronization of computer databases. Synchronization of computer databases is structured into three rounds, namely an agenda round, a query round and a report round. In the agenda round, a synchronization agent software module inquires of a common synchronization engine for updates to the agent's database and provides information as to the level of information in the agent's database. During a query round, a common synchronization engine may request information from databases with new information and distribute that database information to databases needing the new information during a report round. Multiple agents, each representing an associated database may participate a synchronization. In addition, various special purpose agents may also receive, provide and otherwise operate on synchronization information.

N-way synchronization of computer databases

One embodiment of the invention enables nodes or endpoints that have been involved with synchronization of data items to determine which version of a data item (if any) has priority over another version of that same data item. For example, one embodiment of the invention can include a method that can include the determination as to whether any data items have matching identities and conflicting priorities after the synchronization process. Provided a first and second data items have matching identities and conflicting priorities, a determination is made as to whether an indication had been made that the first data item is desirable over the second data item. Provided the indication had been made that the first data is desirable over the second data item, it is indicated that the first data item has priority over the second data item.

Determining priority between data items in shared environments

A method and system thereof for identifying records are described. Records on a node are distinguished from other records on the node by assigning each record a unique local identifier. When a record is moved from one node to another node, a unique global identifier is assigned to the record. A translation technique is employed to map the local identifier to the global identifier (and vice versa).

Generating coherent global identifiers for efficient data identification

A method and system for fast synchronization of computer databases using coverage status. First coverage information of a first database and second coverage information of a second database are accessed. Using the coverage information from the two databases, it may be determined which data elements from the second database are more recent than corresponding data elements from the first database. Data elements from the second database that are more recent than corresponding data elements of the first database may be transferred to the first database. In this novel manner, synchronization of two databases may take place without comparing corresponding data elements between the two databases in order to determine if a data element has been modified. By this exchange of coverage information, it is possible to transfer only changed records, in one direction, allowing for a consistent synchronization method that is typically faster than prior art methods.

Fast synchronization of computer databases using coverage status

A method and system thereof for synchronizing a data set comprising a first data set residing on a first node with a second data set residing on a second node. Packets are exchanged with the second node. A packet comprises one or more messages and a message comprises a plurality of elements. At least one of the elements identifies the data set. Other information in the packets is used to identify any data from the first data set that needs to be sent to the second node and any data from the second data set that needs to be received from the second node, in order to synchronize the data set on both nodes. The data so identified can then be exchanged.

Synchronization protocol for synchronizing data between nodes

One embodiment of the present invention enables nodes or endpoints involved with synchronization of data items to determine which version of a data item (if any) has priority over another version of that same data item. Within the present embodiment, when a data item is modified by a node, it is presumed that the modified data item takes priority over the previous version of that data item. Therefore, the 'descendant' data item (modified) takes precedence over its 'ancestor' data item (previous version). By including this type of &#x201c;pedigree&#x201d; information with data items involved with synchronization between different nodes or endpoints, the present embodiment enables the endpoints to determine which version of a data item (if any) has priority over another version of that same data item.

Determining priority between data items

Methods and devices for data serialization are described. Numbers are each encoded as one or more four-bit nibbles. Three bits of a nibble are for encoding some portion of a number and one bit of the nibble is for indicating whether encoding of the number is continued to another nibble. A begin command and an end command are used to bracket and thereby group selected nibbles. The numbers and the commands are serialized in a stream. An interpreter of the stream reads the numbers into data fields of a data object starting at the begin command. The interpreter automatically skips to the end command when the data fields are filled. As such, a newer version of an interpreter can read data serialized using an older version of an encoder, and an older version of an interpreter can read data serialized using a newer version of an encoder.

Growing community of inventors

Yacolt, WA, United States of America

William Leonard Mills