Abstract: Extending hierarchical synchronization (sync) scopes to non-hierarchical scenarios may involve a method for synchronizing differently organized data stores comprising mapping different physical organizations to similar logical organizations and utilizing an organization-based synchronization algorithm to synchronize the differently organized stores. Also, the uniqueness constraints of the organizations may be preserved as well as the parent-child ordering constraints of the organizations.

Abstract: Tombstones can be removed from a data store without data corruption. Tombstones placed into a forgotten knowledge list can be compared against each other and/or items in a tombstone table, and deleted when tombstones representing subsequently deleted items are extant. Also, creation database version information can be kept along with database items, and databases can record database version information when they synchronize. If a synchronizing database discovers an item that it does not have, but the creation database version information associated with the item reflects that the synchronizing database “should” have the item, then it can be inferred that the item was subsequently deleted, and item resurrection can be prevented.

Abstract: Update-delete conflicts detected during synchronization can be resolved in favor of the update or the deletion. Resolving the conflict in favor of the deletion results in the entity deleted on one replica being deleted on all selected replicas. Resolving the conflict in favor of the update results in the updated entity, which includes an entity moved from one hierarchy to another, being replicated on all selected replicas. To resolve the conflict in favor of the update, the deletion is treated as though it were reported erroneously. The deleted entity is resurrected in the form of the updated entity. Change version information is maintained in all replicas. Update-delete conflicts are resolvable in accordance with various resolution policies such as the update wins, deletion wins, changes occurring on a particular device wins, and most recent event wins, for example.

Abstract: Filtering trees for selectively notifying subscribers of events are provided, and are constructed with OR nodes to substantially reduce their size. The filtering trees have nodes representing event variables that ultimately branch to leaf nodes thereunder, and the leaf nodes identify which of a set of queries are satisfied by an actual event. A mechanism recursively merges nodes of trees into a single tree, and uses OR nodes when nodes cannot be combined, to essentially add a parallel path in the resulting tree to traverse. Nodes that can be combined are those that represent the same event variable, and may have data points that are merged into a combined node. Threshold gains in efficiency may be evaluated to determine whether the original trees should be kept instead of the resulting tree.

Abstract: Systems, methods, and computer program products for synchronizing items at replicas within a topology is disclosed. Items are stored in physical tables at the replicas. The physical table layouts at each replica can differ but are mapped to a common logical view. When a replica receives an indication that synchronization should be performed, the replica determines if changes have been made at the replica that should be mapped to the logical views. Replicas can facilitate this by comparing local change enumerations for changes made in physical tables to synchronization local change enumerations for changes in the logical views. Any changes that need to be synchronized are sent through the logical views to other replicas in the topology.

Abstract: Caching mechanisms in which when a request to operate on particular identified network data is detected, the mechanism refers to a set of rules to determine whether to operate on a local copy of the identified network data, and whether to operate on the actual network data over the network. The set of rules are at least partially set by a human such as a user or network administrator, or perhaps by an application. The caching mechanism may optionally even block local read operations until the network data is synchronized with the remote copy of the network data. The mechanism may also block local write operations until synchronization is performed and/or the write operation is performed on the remote copy of the network data.

Abstract: A system and method for synchronizing a database having metadata and raw data. Metadata may be fully synchronized between two systems, with copies stored on both systems. Raw data may be selectively synchronized, so that a client system need not store all of the raw data locally. When disconnected, the client system may identify certain portions of the raw data to store locally, and such data may be synchronized when reconnected to a server system.

Abstract: Methods for enabling multi-master synchronization of particular sets of data using filters. In a synchronization request, data including knowledge and filters may be supplied. A response may comprise data including changes that are identified by the filter and that have versions that are not known by the requestor.

Abstract: A system and method for synchronizing a database comprising raw data and metadata derived from the raw data, but when the metadata has not yet been updated. The raw data and the metadata are first synchronized, with the raw data having been assigned a version number. After synchronization, any stale metadata will be updated and assigned the same version number as the raw data.

Abstract: Various embodiments of the present invention are directed to systems and methods for synchronizing mixed elements (MEs) comprising structure data and unstructured filestreams between peer computer systems in a hardware/software interface system environment that does not permit snapshotting of large unstructured ME filestreams during synchronization. For several such embodiments, the method comprises synchronizing the ME in two steps, one for snapshotting the structured data component of the ME (as well as the cv of the filestream but not the filestream itself) and one for locking and transmitting the filestream to the receiving sync peer if and only if, after being locked, it is determined that the filestream is unchanged from the time of the ME data component snapshot.

Abstract: Various embodiments of the present invention are directed to systems and method for detecting conflicts and applying conflict resolutions during manual and automatic conflict resolution operations. Several embodiments are directed to preventing both: (a) non-convergence of conflict resolutions, where partners can end up in a divergent steady state (i.e. have different data in the absence of outstanding conflicts); and (b) a non-terminating ping-pong of conflict resolutions between partners (which can occur with certain inefficient solutions that continuously update metadata for each conflict resolution without end). Certain specific embodiments of the present invention are directed to a method for maintaining knowledge that guarantees convergence of data, even when different partners apply different conflict resolutions.

Abstract: A common information model (CIM) enables management application programs to receive uniformly rendered results regardless of the source of the information. A CIM object manager isolates the applications from internal components which retrieve the information from various sources and through various other components, and provides refinements to that model that improve the exchange of information. In addition to providing uniform rendering of management information to a client applications, the CIM object manager dynamically adapts to complement the capabilities of the information providers, whereby the information providers may do so in a highly flexible manner. The CIMOM also decomposes a client query to determine the appropriate source or sources of information necessary to resolve that query, and further handles client queries having inherited object classes to render appropriate results in a uniform manner.

Abstract: Filtering trees for selectively notifying subscribers of events are provided, and are constructed with OR nodes to substantially reduce their size. The filtering trees have nodes representing event variables that ultimately branch to leaf nodes thereunder, and the leaf nodes identify which of a set of queries are satisfied by an actual event. A mechanism recursively merges nodes of trees into a single tree, and uses OR nodes when nodes cannot be combined, to essentially add a parallel path in the resulting tree to traverse. Nodes that can be combined are those that represent the same event variable, and may have data points that are merged into a combined node. Threshold gains in efficiency may be evaluated to determine whether the original trees should be kept instead of the resulting tree.

Abstract: A common information model (CIM) enables management application programs to receive uniformly rendered results regardless of the source of the information. A CIM object manager isolates the applications from internal components which retrieve the information from various sources and through various other components, and provides refinements to that model that improve the exchange of information. In addition to providing uniform rendering of management information to a client applications, the CIM object manager dynamically adapts to complement the capabilities of the information providers, whereby the information providers may do so in a highly flexible manner. The CIMOM also decomposes a client query to determine the appropriate source or sources of information necessary to resolve that query, and further handles client queries having inherited object classes to render appropriate results in a uniform manner.

Abstract: Systems and methods for replicating replicas in a sync community. Each replica in the sync community stores knowledge that represents changes the replica is aware of. Because each replica has its own knowledge, each replica does not need to know how many replicas are in the sync community or the topology of the sync community. By sending the knowledge with a request for changes, a replicating replica can enumerate the changes to replicate by comparing its knowledge with the received knowledge. After replication, the knowledge is updated. Knowledge may also include made-with-knowledge change IDs that permit each resolution to identify what a replica was aware of when a particular change was made. The made-with-knowledge values are used to detect conflicts during replication.

Abstract: A common information model (CIM) enables management application programs to receive uniformly rendered results regardless of the source of the information. A CIM object manager isolates the applications from internal components which retrieve the information from various sources and through various other components, and provides refinements to that model that improve the exchange of information. In addition to providing uniform rendering of management information to a client applications, the CIM object manager dynamically adapts to complement the capabilities of the information providers, whereby the information providers may do so in a highly flexible manner. The CIMOM also decomposes a client query to determine the appropriate source or sources of information necessary to resolve that query, and further handles client queries having inherited object classes to render appropriate results in a uniform manner.

Abstract: Several embodiments of the present invention employ synchronization adapters for synchronizing information between “WinFS” and non-“WinFS” data sources. Examples of adapters include an adapter that synchronizes address book information between a “WinFS” contacts folder and a non-WinFS mailbox. In these instances, adapter developers might use the “WinFS” synchronization core services API described herein for accessing services provided by the “WinFS” synchronization platform in order to develop schema transformation code between the “WinFS” schema and the non-“WinFS” data source schema. Additionally, the adapter developer provides protocol support for communicating changes with the non-“WinFS” data source. A synchronization adapter is invoked and controlled by using the synchronization controller API and reports progress and errors using this API.

Abstract: Various embodiments of the present invention are directed to conflict handling for conflicts that occur in a peer-to-peer synchronization system, where the ability to correctly and efficiently handle conflicts minimizes data loss while retaining good usability and reduces the need for user intervention during synchronization. Conflict handling in the synchronization service is divided into three stages: (1) conflict detection; (2) automatic conflict resolution and logging; and (3) conflict inspection and resolution.

Abstract: Administering digital security is disclosed. Data and method items are stored on a computer system in a volume. The volume is divided up into non-overlapping security zones. Each item exists in a security zone. Security rules are granted to principals where the security rules apply to items in a particular zone. The security rules specify what principals have what rights; such as read, write delete and execute; to what items. Administrative rights can be delegated by principals by splitting a security zone to form two security zones. Principals who have administrative rights to the security zone assign additional principals to one of the security zones while maintaining all administrative rights to the other zone. Thus principals can retain certain administrative rights to certain items exclusively to themselves while delegating administrative rights to other items to other principals.

Abstract: A protocol for replicating replicas in a sync community. Each replica maintains a knowledge that represents changes that the replica is aware of. Each replica does not typically maintain knowledge about other replicas. The protocol includes messages that include knowledge about changes on the various replicas. Using the knowledge, the replicas can enumerate changes and send the changes using asynchronous messages that do not need to be received in any particular order. The protocol enables filters to ensure that a valid replication is possible using a minimum knowledge argument. The protocol also enables replicas to partially replicate using filtered knowledge.