Microsoft Technology Licensing, LLC

Colin Joseph Meek

Henricus Johannes Maria Meijer

Jeffrey Van Gogh

Jeffrey Michael Derstadt

Bart De Smet

John Wesley Dyer

Atul Adya

Balan Sethu Raman

Sergey Melnik

Andrew Conrad

Zlatko Michailov

Arthur John Cerdic Vickers

Torsten Walther Grabs

Alexander Douglas James

Jonathan David Goldstein

Badrish Chandramouli

Shyamalan Pather

Amanda K Silver

Pablo Castro

Paul Allen Vick, Jr

Bart J F De Smet

Michael Justin Flasko

Ciprian Gerea

Stephen Frederick Starck

Mohamed Hassan Ali

Tomer Verona

Simon Cavanagh

David E Sceppa

Rafael De Jesús Fernández Moctezuma

Carl Yates Perry

Galex Sunyul Yen

An outer event stream can be modeled to represent duration for an event with an inner event stream. The inner event stream can be generated to represent duration of at least one event from the outer event stream. By modeling the outer event stream to include duration, coincidence between two or more events can be determined. More specifically, the modeling of the outer event stream enables use of operators to identify coincidence between events from event streams.

Reactive coincidence

Application data is synchronized with a database where changes to object data maintained by an application is expressed according to an application schema. Changes to the object data are identified as corresponding to an entity schema. Changes to views of database tables are applied by translation rules to the set of changed entities. The database tables conforming to a database schema are thereafter updated.

View maintenance rules for an update pipeline of an object-relational mapping (ORM) platform

Evaluating an expression tree. A method includes, at a first domain, accessing an expression tree. The expression tree comprises a plurality of nested expressions. The plurality of nested expressions spans a plurality of domains. The expressions in the expression tree are expressed in a common format in spite of the different expressions of the expression tree being intended to be evaluated by different domains. At the first domain, the method includes evaluating one or more references to local variables included in the plurality of nested expressions. The method further includes determining that one or more expressions in the plurality of expressions are to be evaluated by a different domain. The method further includes expanding the one or more expressions in the plurality of expressions to be evaluated by different domains to allow the one or more expressions to be evaluated by the different domain.

Delegation of expression tree evaluation

A database update pipeline may be incorporated into a data access architecture for providing data services to applications, thereby bridging the gap between application data and data as persisted in databases. The update pipeline has the ability to translate changes made to object instances into data store change constructs, and carry those changes over to a data store. Such a pipeline can also advantageously perform the reverse operation, allowing applications to query using the database update pipeline, and receive materialized object instances.

Aspects of the subject matter described herein relate to stream operators. In aspects, a stream event is received. Based on a timestamp associated with the stream event and the number of stream operators that have asked to be activated prior to or at the timestamp, zero or more stream objects are informed of one or more time events and torn down if no longer needed. In addition, a destination stream operator is instantiated, if needed, data (e.g., the timestamp and packet, if any) corresponding to the stream event is provided to a stream operator, output data, if any, is received from the stream operator, and the stream operator is torn down if it no longer needs state data between invocations.

Stream operator

Aspects of the subject matter described herein relate to mapping from application objects to an abstract data model. In aspects, a mapper receives registrations that indicate behavior (e.g., how objects are constructed, modified, or examined) of application objects. The behavior may be specified using user-supplied expressions. The mapper aggregates this data and uses it to map application requests for data access into one or more operations that operate on the abstract data model. A data access layer may then translate the operations into actions to access data corresponding to the requests from a store. If appropriate, data obtained from the store may then be inserted into application objects as indicated by the registrations.

Mapping from objects to data model

There is alteration of a late-bound expression produced by a compiler into an early-bound structure. Alteration of the late-bound expression can occur at runtime and a visitor pattern can be used to create the alteration. In one instance, a conversion from late-bound to early-bound takes place through replacing a late-bound property with a statically typed call. The early-bound structure can translate into an expression tree to enable an implementation of a store specific query operated upon storage.

Translating late bound LINQ expressions into database queries

Query expressions, such as LINQ (language integrated queries) queries, are enabled to be translated to URIs (uniform resource indicators) that may be used to query data sources at REST (representational state transfer) interfaces. A compiler is configured to convert a query into an expression tree. An expression tree normalizer is configured to normalize the expression tree into a normalized expression tree. A resource bound expression tree generator is configured to transform the normalized expression tree into a resource bound expression tree. A URI generator is configured to translate the resource bound expression tree into a URI.

Translating queries to representational state transfer (REST)

A result shaping methodology is part of a bridge (translation layer) between an entity provider and an underlying store provider. The bridge accepts command trees and parameter values from a consumer (e.g., the entity provider), reshapes the trees as necessary for its underlying store provider to execute, executes resulting commands, and assembles the results from the commands into the nested data reader that the initial command tree requested. The result assembly advantageously takes a mapping declaration and compiles it into a set of expression definitions composed from a small number of simple functions. Each collection in the result has a corresponding expression describing how collection elements are realized given relational results. Other expressions describe boundary detection behavior. These expressions are compiled into functions used to shape relational data into arbitrary object graphs or streaming interfaces. Alternative versions of the expressions for performance or graceful contextual error handling are also compiled.

Efficient functional representation of result shaping

A function can be represented as a canonical decision diagram structure. Each vertex of the diagram is associated with a respective function variable. The vertices include at least one vertex that represents a domain of more than two values for the variable associated with the vertex. The decision diagram is used to evaluate the function to determine whether the function is satisfiable or unsatisfiable for given values of the variables.

Determining satisfiability of a function with arbitrary domain constraints

Growing community of inventors

Redmond, WA, United States of America

Colin Joseph Meek