Microsoft Technology Licensing, LLC

Bart De Smet

Henricus Johannes Maria Meijer

John Wesley Dyer

Jeffrey Van Gogh

Colin Joseph Meek

Eric Anthony Rozell

Tihomir Tsvetkov Tarnavski

Lucian Wischik

Savas Parastatidis

Alex Clemmer

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

In non-limiting examples of the present disclosure, systems and methods for rewriting expressions utilizing cooperative visitors are provided. A data request may be received by a computing device, which may then be represented in a data structure, e.g., an expression tree, representative of the data request. A node within the data structure representative of the data request may be visited. Metadata associated with at least one cooperative visitor may be extracted from the node, and the node may then be transformed by applying the at least one cooperative visitor to the node.

Cooperative expression visitors

In non-limiting examples of the present disclosure, systems and methods for interning expression trees are provided. Hash code for a plurality of expression tree nodes is recursively computed and a determination is made as to whether hash code for each of a plurality of expression tree nodes is stored in a cached intern pool. Upon determining that at least one of a plurality of expression tree nodes is not stored in a cached intern pool, one or more functions may be run on at least one of a plurality of expression tree nodes for determining whether at least one of a plurality of expression tree nodes should be stored in a cached intern pool. Normalization of expression trees may also be employed to effectuate effective sharing of expression tree nodes.

Expression tree interning

Higher-order operators are subject to checkpointing as well as recovery. The state of a higher-order operator, comprising an outer subscription and one or more inner subscriptions, is captured and subsequently utilized to recover the operator. In one instance, a data representation of code that can produce an inner subscription is saved. In other instance, an outer subscription is decoupled from inner subscriptions of a higher-order operator.

Checkpointing higher order query operators

A pageable query can be generated based on an event-processing query. The pageable query is a form of the event-processing query that supports swapping the event-processing query into and out of memory. For instance, page-in and page-out triggers can be inserted. After detection of a page-in trigger, the event-processing query can be loaded into the memory, and after detection of a page-out trigger, the event-processing query can be unloaded from memory.

Event processing system paging

A multidimensional object, such as a language-integrated query (LINQ) object, can be generated based upon a grouping set operator and zero or more key selectors. The object can be utilized to query over a non-relational data source. The object can include a sequence of functions corresponding to each grouping related to the grouping set operator in order to provide multidimensional grouping representation. Furthermore, the object includes nested structures for optimized execution of the grouping set operator.

Multidimensional grouping operators

Computation can be encoded in a lightweight and optionally typed data representation. The data representation can be specified in a prefix-based notation potentially including nested function-argument pairs. Further, the data representation can comprise optional static type information associated with at least a portion of computation. Still further, the data representation can be programming language and platform independent or surfaced in a particular programming language or platform.

Lightweight optionally typed data representation of computation

Reactive programming is facilitated. Reactive expressions can be generated automatically from non-reactive expressions or in other words standard expressions. Additionally or alternatively, reactive expressions can be optimized in a number of different ways to minimize computational work.

Reactive expression generation and optimization

A query specified in a source programming language can be analyzed as a function of a type-based state machine that encodes query constraints of a target programming language. The type-based state machine can encode such constraints as types representing states and methods representing transitions between states or types.

Query constraint encoding with type-based state machine

Computation execution can be visualized and debugged. A computation such as a database query plan graph can be extracted from a database query expression. Trace points can be injected into the database query expression while preserving original behavior. Query graphs can be generated with automatic inserting of mechanisms to connect to trace points, enabling visualization of query execution lifecycle states, collection of data traces across operators, and historical debugging with replay of data sets.

Data flow visualization and debugging

Mapping is performed between operations of an abstract asynchronous programming model and a concrete asynchronous programming model. In other words, differences between asynchronous programming models are bridged to enable interaction.

Asynchronous programming model mapping

A method for indicating localization conflicts. The method includes receiving information about a first graphical user interface element and receiving information about a second graphical user interface element. Localization data associated with the first graphical user interface element and the second graphical user interface element is accessed. A determination is made as to if there is a conflict between the first graphical user interface element and the second graphical user interface element. An indication of the results of the determining of whether there is a conflict between the first graphical user interface element and the second graphical user interface element is displayed.

Growing community of inventors

Bellevue, WA, United States of America

Bart De Smet