Patents by Inventor Philip A. Bernstein
Philip A. Bernstein has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20090150367Abstract: Described is programmatic access to persistent XML and relational data from applications based upon explicit mappings between object classes, XML schema types, and relations. The mappings are used in data access, that is, they drive query and update processing. A query may be processed into a query for accessing the XML data and another query for second type for accessing the relational data. Mappings support strongly-typed classes and loosely-typed classes, and may be conditional upon other data, may decouple query and update translation performed at runtime from schema translation used at compile time, and/or may be compiled into transformations that produce objects from XML data and transformations that produce XML data from objects. Mappings may be generated automatically or provided by the developer.Type: ApplicationFiled: June 27, 2008Publication date: June 11, 2009Applicant: MICROSOFT CORPORATIONInventors: Sergey Melnik, Philip A. Bernstein, James F. Terwilliger
-
Patent number: 7539663Abstract: 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.Type: GrantFiled: November 15, 2006Date of Patent: May 26, 2009Assignee: Microsoft CorporationInventors: Philip A. Bernstein, Todd J. Green, Sergey Melnik, Alan Nash
-
Patent number: 7526503Abstract: 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.Type: GrantFiled: August 15, 2005Date of Patent: April 28, 2009Assignee: Microsoft CorporationInventors: Philip A. Bernstein, Sergey Melnik, Peter D. Mork
-
Patent number: 7444330Abstract: 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.Type: GrantFiled: October 26, 2004Date of Patent: October 28, 2008Assignee: Microsoft CorporationInventors: Philip A. Bernstein, Jayant Madhavan
-
Publication number: 20080114785Abstract: 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.Type: ApplicationFiled: November 15, 2006Publication date: May 15, 2008Applicant: Microsoft CorporationInventors: Philip A. Bernstein, Todd J. Green, Sergey Melnik, Alan Nash
-
Publication number: 20070226203Abstract: A data access architecture may includes a mapping architecture for mapping data as may be used by an application to data as persisted in a database. Such a mapping architecture uses two types of “mapping views”—one for translating queries and the other for translating updates. A mechanism is provided that automatically generates query and update views from high-level mapping specifications. A validation may be performed to ensure that a mapping specification, when used in conjunction with a mapping architecture, allows data to “roundtrip” from the application to the database, without loss of data.Type: ApplicationFiled: March 16, 2007Publication date: September 27, 2007Applicant: Microsoft CorporationInventors: Atul Adya, Philip A. Bernstein, Sergey Melnik
-
Publication number: 20070055655Abstract: A system that automatically matches schema elements is provided. In one aspect, given a selected element of one schema, the system can calculate the best matching candidate elements of another schema. The calculation can be based on a heuristic combination of factors, such as element names, element types, schema structure, existing matches, and the history of actions taken by the user. Accordingly, the best candidate (according to the calculation) can be emphasized and/or highlighted. The tool can auto-scroll to the best choice. Similarly, the user can request the calculation and display to best candidates by pressing a keyboard key or hot key. As well, the user can prompt display of the best candidates by using the mouse (e.g., moving the mouse over the element E or clicking on E), or both (e.g., mouse over with hot key depressed).Type: ApplicationFiled: January 6, 2006Publication date: March 8, 2007Applicant: Microsoft CorporationInventors: Philip Bernstein, John Churchill, Sergey Melnik
-
Publication number: 20070038651Abstract: 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. For example, the system can support object-to-relational mapping scenarios that are common in business applications. Typically, in such applications the business logic runs on top of an object model, whereas the actual data is persisted in SQL databases. To shield the applications from impedance mismatch and storage management issues, an abstraction component can be employed to translate the data access operations on the object model into SQL queries and updates.Type: ApplicationFiled: August 15, 2005Publication date: February 15, 2007Applicant: Microsoft CorporationInventors: Philip Bernstein, Sergey Melnik, Peter Mork
-
Publication number: 20060219772Abstract: The subject invention pertains to transaction processing systems and methodologies that allows update transactions to read stale data copies and update a data store therewith. Each transactional operation, including a read, can carry or be associated with one or more freshness constraints or tests that specify how fresh a data copy must be in order to be read. More specifically, the subject invention provides systems and methods that extend transactions and serializability to account for out-of-date reads that are justified by freshness requirements.Type: ApplicationFiled: April 1, 2005Publication date: October 5, 2006Applicant: Microsoft CorporationInventors: Philip Bernstein, Raghu Ramakrishnan, Alan Fekete
-
Publication number: 20060136463Abstract: A system that facilitates composition of schema mappings. A general algorithm is provided for composing a broad class of mappings, where one or both mappings are not functions, such as constraints between two schemas and the inverse of functions. A composition component performs composition on schema mappings of disparate data sources, which schema mappings can be expressed by at least one of full, embedded, and second-order dependencies, wherein the second-order dependencies need not be in source-to-target form. The algorithm for composition further includes a procedure that tests whether the composition algorithm will terminate.Type: ApplicationFiled: December 17, 2004Publication date: June 22, 2006Applicant: Microsoft CorporationInventors: Alan Nash, Philip Bernstein, Sergey Melnik
-
Publication number: 20060090095Abstract: 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 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.Type: ApplicationFiled: September 12, 2005Publication date: April 27, 2006Applicant: Microsoft CorporationInventors: Michael Massa, David Dion, Rajsekhar Das, Rushabh Doshi, David Lomet, Gor Nishanov, Philip Bernstein, Rod Gamache, Rohit Jain, Sunita Shrivastava
-
Publication number: 20060036896Abstract: 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.Type: ApplicationFiled: August 12, 2005Publication date: February 16, 2006Applicant: Microsoft CorporationInventors: Rod Gamache, Michael Massa, Sunita Shrivastava, Gor Nishanov, David Lomet, Philip Bernstein, Rohit Jain
-
Publication number: 20050262107Abstract: 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.Type: ApplicationFiled: August 13, 2003Publication date: November 24, 2005Inventors: Thomas Bergstraesser, Philip Bernstein, Shankar Pal, David Shutt
-
Patent number: 6938084Abstract: 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.Type: GrantFiled: July 2, 2001Date of Patent: August 30, 2005Assignee: Microsoft CorporationInventors: Rod Gamache, Michael T. Massa, Sunita Shrivastava, Gor V. Nishanov, David B. Lomet, Philip A. Bernstein, Rohit Jain
-
Publication number: 20050144198Abstract: 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.Type: ApplicationFiled: February 11, 2005Publication date: June 30, 2005Applicant: Microsoft CorporationInventors: Thomas Bergstraesser, Philip Bernstein, Shankar Pal, David Shutt
-
Publication number: 20050060332Abstract: 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.Type: ApplicationFiled: October 26, 2004Publication date: March 17, 2005Applicant: Microsoft CorporationInventors: Philip Bernstein, Jayant Madhavan
-
Patent number: 6868425Abstract: 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.Type: GrantFiled: March 6, 2000Date of Patent: March 15, 2005Assignee: Microsoft CorporationInventors: Thomas F. Bergstraesser, Philip A. Bernstein, Shankar Pal, David R. Shutt
-
Publication number: 20050027681Abstract: 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.Type: ApplicationFiled: August 31, 2004Publication date: February 3, 2005Applicant: Microsoft CorporationInventors: Philip Bernstein, Jayant Madhavan
-
Patent number: 6826568Abstract: 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.Type: GrantFiled: December 20, 2001Date of Patent: November 30, 2004Assignee: Microsoft CorporationInventors: Philip A. Bernstein, Jayant Madhavan
-
Publication number: 20040162841Abstract: 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.Type: ApplicationFiled: February 19, 2004Publication date: August 19, 2004Applicant: Microsoft CorporationInventors: Philip A. Bernstein, Shankar Pal, David R. Shutt