Shaoyu Yu Zhou

US Patent:

7216133, May 8, 2007

Filed:

Jul 29, 2003

Appl. No.:

10/629254

Inventors:

Yunxin Wu - Kirkland WA, US
Shaoyu Zhou - Issaquah WA, US
Lev Novik - Bellevue WA, US
Irena Hudis - Bellevue WA, US
Ashish B. Shah - Sammamish WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

707203, 707102, 707201

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.

US Patent:

7577691, Aug 18, 2009

Filed:

Aug 2, 2006

Appl. No.:

11/498594

Inventors:

Lev Novik - Bellevue WA, US
Douglas B. Terry - San Carlos CA, US
Irena Hudis - Bellevue WA, US
Jeremie E. Sartor - Redmond WA, US
Shaoyu Zhou - Issaquah WA, US
Tomas Talius - Sammamish WA, US
Yunxin Wu - Kirkland WA, US
Jin He - Redmond WA, US
Mark Scurrell - Sammamish WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

707204, 707 4, 707 8, 707200, 707201, 707203

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.

US Patent:

7620668, Nov 17, 2009

Filed:

May 6, 2005

Appl. No.:

11/124219

Inventors:

Vishal Kathuria - Woodinville WA, US
Martin J. Sleeman - Redmond WA, US
Robin Dhananjay Dhamankar - Redmond WA, US
Hanumantha Rao Kodavalla - Sammamish WA, US
Yunxin Wu - Kirkland WA, US
Shaoyu Zhou - Issaquah WA, US
Lev Novik - Bellevue WA, US
Tomas Talius - Sammamish WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 12/00
G06F 17/30

US Classification:

707204, 707200, 707202

Abstract:

The subject invention relates to systems and/or methods that perform an authoritative and/or a non-authoritative restore of items in a data store. Backups are provided that include data associated with items and metadata related to the items that can include a history of operations and previous synchronizations to enable replications to converge after restoration. The operations that can be performed on the items include, for example, create, delete, update, move, etc. The items in the backups can be restored along with the metadata, which can be utilized to enable synchronization partners to converge based on a desired type of restoration.

US Patent:

7653664, Jan 26, 2010

Filed:

Nov 3, 2006

Appl. No.:

11/592588

Inventors:

Sudarshan A. Chitre - Redmond WA, US
Shaoyu Zhou - Issaquah WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 12/00
G06F 17/30

US Classification:

707201, 707202, 709213

Abstract:

Described is a technology in which an anchor value is determined, for example to synchronize a destination database or data store with modifications made to a source database. The new anchor value is determined in a manner that excludes modifications corresponding to any uncommitted transactions. The new anchor value may be based on a counter value or a date and time value stored with each modification. The new anchor value may be determined by comparing a first set of committed modifications that do not include uncommitted modifications against a second set of modifications that includes committed modifications and uncommitted modifications. Alternatively, the new anchor value may be determined from the earliest start date and time among the modifications that are part of any uncommitted transactions. The anchor may be used (e. g. , via queries) to enumerate modifications for synchronization, and also for detecting conflicts between the source and destination databases.

US Patent:

7778963, Aug 17, 2010

Filed:

Apr 26, 2005

Appl. No.:

11/114519

Inventors:

Lev Novik - Bellevue WA, US
Muhunthan Sivapragasam - Kirkland WA, US
Shaoyu Zhou - Issaquah WA, US
Vivek Jawahir Jhaveri - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 7/00

US Classification:

707610, 707626

Abstract:

The subject invention pertains to data synchronization across replicas. Disclosed are systems and methods of detecting and handling constraint-based conflicts that occur during a synchronization session. In accordance with one particular aspect of the invention, name-constraint violations can be detected. These violations can be resolved by generating a single merged identity that can be utilized to refer to data units, for example on different replicas that had the same name. A property of the merged identity can be merge history, which specifies the identifiers subsumed by the merge.

US Patent:

8572239, Oct 29, 2013

Filed:

Sep 20, 2010

Appl. No.:

12/885897

Inventors:

Fei Cao - Issaquah WA, US
Shaoyu Zhou - Issaquah WA, US
Zhuoqing Wu, Jr. - Bellevue WA, US
Sijian Zhang - Bellevue WA, US
Siddhartha Roy - Bellevue WA, US
Michael A. Elizarov - Sammamish WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/177
G06F 15/16

US Classification:

709224

Abstract:

Large sets of unorganized data may provide little value in identifying useful observations from such data. For example, an online merchant may maintain a database of millions of user IDs (e. g. , a cookie ID, a login ID, a device ID, a network ID, etc. ) along with content viewed and/or actions taken with the user IDs, where minimal associations are known between user IDs. It may be advantageous to link together user IDs of respective users to capture a comprehensive view of respective users' activities. Accordingly, one or more systems and/or techniques for identifying a cluster of nodes based upon transforming a set of node pairings (e. g. , pairings of related nodes) one or more times are disclosed herein. Iterative transformations may be performed until respective nodes are paired with merely their smallest neighboring node and are paired with no other node. In this way, node clusters may be identifiable.

US Patent:

8046424, Oct 25, 2011

Filed:

Aug 27, 2004

Appl. No.:

10/927726

Inventors:

Lev Novik - Bellevue WA, US
Tomas Talius - Sammamish WA, US
Yunxin Wu - Kirkland WA, US
Shaoyu Zhou - Issaquah WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/167
G06F 15/16
G06F 7/00
G06F 17/00

US Classification:

709216, 709213, 709212, 709205, 707622, 707621, 707620

Abstract:

Various embodiments of the present invention are directed to synchronization utilizing one or more optimizations through the utilization of metadata. For several embodiments of the present invention, one method for optimizing synchronization is to reduce the overhead required for said synchronization by having each peer only tracking changes for itself and other peers within its change community (or communities) (a. k. a. , “Intra-Community-Only Change Tracking Optimization”). For certain embodiments of the present invention, another method for optimizing synchronization is to not create synchronization overhead until required. For numerous embodiments of the present invention, yet another method for optimizing synchronization is to minimize redundant use of a partner's unique global ID—a large and cumbersome number—and to instead maintain a table that cross-references each partner (and its unique global ID) with a smaller and much less cumbersome partner key.

US Patent:

20110313847, Dec 22, 2011

Filed:

Jun 18, 2010

Appl. No.:

12/818349

Inventors:

Fei Cao - Issaquah WA, US
Shaoyu Zhou - Issaquah WA, US
Siddhartha Roy - Kirkland WA, US
Michael Elizarov - Sammamish WA, US
Zhuoqing Wu - Redmond WA, US
James Zhang - Bellevue WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06Q 30/00

US Classification:

705 1443, 705 1453

Abstract:

Systems and methods for mapping identifiers are provided. Activity logs illustrate activities and/or events associated with a plurality of identifiers. The identifiers may be registered identifiers, unregistered identifiers, or a combination thereof. When at least two identifiers share a linking attribute, the at least two identifiers may be mapped to one another, along with information associated therewith (if any) such as a user profile. Each subsequent line of an activity line may also be mapped to the identifiers of the initial single line when a linking attribute or an overlapping identifier is present. A number of identifiers associated with each other may be increased by mapping identifiers and, thus, a targeted audience for a customized advertisement may, in turn, be increased.