Philip A Bernstein

US Patent:

6728726, Apr 27, 2004

Filed:

Mar 5, 1999

Appl. No.:

09/263408

Inventors:

Philip A. Bernstein - Bellevue WA
Shankar Pal - Redmond WA
David R. Shutt - Bellevue WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1730

US Classification:

707103, 707 3, 707204

Abstract:

Prefetching and caching persistent objects is disclosed. The system creates a structure context used to identify a set containing a first object and other related objects. The objects have attributes, where each attribute is identified by a name. Upon a fetch of an attribute in the first object, the system also fetches related data. The related data includes other attributes in the object, and attributes in the other objects of the set having the same name as the attribute fetched for the first object.

US Patent:

6766518, Jul 20, 2004

Filed:

Feb 3, 2000

Appl. No.:

09/497594

Inventors:

Philip Alan Bernstein - Bellevue WA
David R. Shutt - Bellevue WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 944

US Classification:

719315

Abstract:

In an interface-based binary object system capable of supporting multiple interfaces into objects created by class templates, a relationship is defined as a pair of complementary collections on two separate interfaces, each interface found on separate objects. A link between objects is formed when an interface of one object lists an object supporting the related interface included in the object and vice versa. The collections may be of objects supporting the related interfaces or may be of specific relationship objects leading to objects supporting the related interfaces. The collections are potentially multi-valued entities that enable relationships to be established between objects according to one-to-one, many-to-one, and many-to-many architectures. By implementing a specific relationship object, behavior may be imparted to the relationship itself thereby providing more robust system behavior. Objects thus linked can be easily traversed so that convenient navigation models can be implemented allowing clients quick access to desired objects by navigating through relationships between objects.

US Patent:

6826568, Nov 30, 2004

Filed:

Dec 20, 2001

Appl. No.:

10/028912

Inventors:

Philip A. Bernstein - Bellevue WA
Jayant Madhavan - Seattle WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1730

US Classification:

707 6, 707101

Abstract:

Systems and methods for automatically and generically matching models are provided, such as may be provided in a matching application or matching component, or provided in a general purpose system for managing models. The methods are generic since the methods apply to hierarchical data sets outside of any particular data model or application. Similarity coefficients are calculated for, and mappings are discovered between, schema elements based on their names, data types, constraints, and schema structure, using a broad set of techniques. Some of these techniques include the integrated use of linguistic and structural matching, context dependent matching of shared types, and a bias toward subtree, or leaf, structure where much of the schema content resides.

US Patent:

6868425, Mar 15, 2005

Filed:

Mar 6, 2000

Appl. No.:

09/515037

Inventors:

Thomas F. Bergstraesser - Kirkland WA, US
Philip A. Bernstein - Bellevue WA, US
Shankar Pal - Redmond WA, US
David R. Shutt - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F017/30

US Classification:

707103R, 707203, 717170

Abstract:

Maintaining versions and workspaces in an object repository is disclosed. The system provides an efficient way to manage versions of objects by only copying objects when absolutely necessary, i. e. when a property value in a particular object has changed. In addition, the system provides a mechanism to control whether or not relationships are propagated to successor versions of an object. A further aspect of the system is that resolution of objects during a relationship traversal can be customized depending on whether or not an application accessing the objects is version-aware. If the application is not version aware, a means for resolving the relationship to a particular object is provided. A still further aspect of the system is that merge behavior is parameterized. When two versions of an object are merged, flags control how conflicts in property values and relationship contents are managed.

US Patent:

6938084, Aug 30, 2005

Filed:

Jul 2, 2001

Appl. No.:

09/895810

Inventors:

Rod Gamache - Seattle WA, US
Michael T. Massa - Seattle WA, US
Sunita Shrivastava - Redmond WA, US
Gor V. Nishanov - Redmond WA, US
David B. Lomet - Redmond WA, US
Philip A. Bernstein - Bellevue WA, US
Rohit Jain - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F015/173

US Classification:

709226, 709220, 709223

Abstract:

A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members, independent from the nodes, maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

US Patent:

7444330, Oct 28, 2008

Filed:

Oct 26, 2004

Appl. No.:

10/973495

Inventors:

Philip A. Bernstein - Bellevue WA, US
Jayant Madhavan - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30
G06F 17/00

US Classification:

707 6, 707101

Abstract:

Systems and methods for automatically and generically matching models are provided, such as may be provided in a matching application or matching component, or provided in a general purpose system for managing models. The methods are generic since the methods apply to hierarchical data sets outside of any particular data model or application. Similarity coefficients are calculated for, and mappings are discovered between, schema elements based on their names, data types, constraints, and schema structure, using a broad set of techniques. Some of these techniques include the integrated use of linguistic and structural matching, context dependent matching of shared types, and a bias toward subtree, or leaf, structure where much of the schema content resides.

US Patent:

7526503, Apr 28, 2009

Filed:

Aug 15, 2005

Appl. No.:

11/204338

Inventors:

Philip A. Bernstein - Bellevue WA, US
Sergey Melnik - Kirkland WA, US
Peter D. Mork - Rockville MD, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/00

US Classification:

707103Y, 707 2, 717104, 717114, 717137

Abstract:

A system and method facilitating data access operations is provided. The system can facilitate an executable, instance-level interaction between a source model (e. g. , schema) expressed in a first metamodel (e. g. , object-oriented metamodel) and a target model expressed in a second metamodel (e. g. , SQL metamodel). The system can produce instance mappings to round-trip the data between the source schema and the generated target schema. Further, an abstraction component can be employed to translate the data access operations on the object model into SQL queries and updates.

US Patent:

7539663, May 26, 2009

Filed:

Nov 15, 2006

Appl. No.:

11/599744

Inventors:

Philip A. Bernstein - Bellevue WA, US
Todd J. Green - Philadelphia PA, US
Sergey Melnik - Kirkland WA, US
Alan Nash - Los Gatos CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 7/00
G06F 17/30

US Classification:

707 2, 707 3

Abstract:

A general-purpose reusable algebraic-based composition algorithm for composing mappings between data schemas. The algorithm handles more expressive mappings, makes a best-effort to eliminate symbols when a perfect answer cannot be obtained, includes new heuristics, and is extensible. A relational algebraic language is provided wherein each mapping is expressed as a set of constraints, and each constraint is either a containment or equality of two or more relational algebraic expressions. The composition mechanism exploits monotonicity properties of algebraic operators in operator arguments, handles NULLs and bag semantics, operates to allow composition to produce a partial result when a complete result is not possible, facilitates symbols elimination one symbol at a time using left composition, for example, as a way of isolating the symbols, supports making a best-effort to eliminate as many symbols as possible from an intermediate schema, and handles unknown or partially known operators via delayed handling.