Patent application number | Description | Published |
20090327925 | USER INTERFACE LOCALIZATION CONFLICT INDICATION - 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. | 12-31-2009 |
20120072411 | DATA REPRESENTATION FOR PUSH-BASED QUERIES - A query over one or more push-based data sources is transformed into a data representation of the query. The data representation can subsequently be analyzed, optimized, and remoted, among other things. For example, the data representation can be utilized to generate code for an out-of-process execution engine. Additionally, the data representation can be employed with respect to conversions to and from various types and representations of data. | 03-22-2012 |
20120072442 | MONADIC TYPE PRESERVATION FOR QUERY OPERATORS - Monadic types are preserved for query operators to further query operator compositionality utilizing operators defined over a monad. Query operators that are defined over a monad and are suited to return non-monadic types are constructed or altered to return a monadic type. For instance, aggregate query operators defined over a local or remote sequence monad can be generated that return a monadic type. | 03-22-2012 |
20120078878 | OPTIMIZED LAZY QUERY OPERATORS - Query operators such as those that perform grouping functionality can be implemented to execute lazily rather than eagerly. For instance, one or more groups can be created and/or populated lazily with one or more elements from a source sequence in response to a request for a group or element of a group. Furthermore, lazy execution can be optimized as a function of context surrounding a query, among other things. | 03-29-2012 |
20120079464 | QUERY CONSTRAINT ENCODING WITH TYPE-BASED STATE MACHINE - 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. | 03-29-2012 |
20120084749 | PROGRAMMING LANGUAGE SUPPORT FOR REACTIVE PROGRAMMING - Program language support is provided to facilitate reactive programming. Code can be provided that initiates conversion between a first-class pattern and a second-class pattern, wherein the patterns operate with respect to push-based data. Support is also provided for producing and consuming push-based data in accordance with an iterator pattern, for example. | 04-05-2012 |
20120150514 | REACTIVE COINCIDENCE - 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. | 06-14-2012 |
20120150913 | MULTIDIMENSIONAL DATA-CENTRIC SERVICE PROTOCOL - Data acquisition is facilitated by way of an intermediate representation of a query expression. The intermediate representation can be generated and subsequently transmitted to, and employed by, a plurality of execution environments with respect to query execution. More particularly, the intermediate representation can be transformed into a locally executable query expression. Furthermore, numerous factors can shape the created and transmitted intermediate representation. | 06-14-2012 |
20120151187 | INSTRUCTION OPTIMIZATION - Programs can be optimized at runtime prior to execution to enhance performance. Program instructions/operations designated for execution can be recorded and subsequently optimized at runtime prior to execution, for instance by performing transformations on the instructions. For example, such optimization can remove, reorder, and/or combine instructions, among other things. | 06-14-2012 |
20130097580 | ASYNCHRONOUS PROGRAMMING MODEL MAPPING - 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. | 04-18-2013 |
20130104107 | DATA FLOW VISUALIZATION AND DEBUGGING - 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. | 04-25-2013 |
20130117288 | DYNAMICALLY TYPED QUERY EXPRESSIONS - A dynamic call on dynamic data can be transformed into a dynamic call on a structure representing dynamic data. Specifically, a dynamic query with a code object representation that includes an untyped parameter can be transformed into a dynamic query with a function call with a dynamic meta-object. The function call with the dynamic meta-object tracks operation(s) that correspond to the code object representation that includes an untyped parameter in order to build a structure representing such code object representation. At runtime, the dynamic query is built and the structure representing the code object representation is rebuilt so as to enable a dynamic query with a code object representation that references untyped data. | 05-09-2013 |
20130117326 | EXTERNAL SERIALIZATION AND DESERIALIZATION - An object graph can be transformed from a first form to a second form based on metadata discovered about objects of the object graph external to a corresponding object model. In one instance, transformation can correspond to serialization and deserialization. | 05-09-2013 |
20130117736 | REACTIVE EXPRESSION GENERATION AND OPTIMIZATION - 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. | 05-09-2013 |
20130132333 | MULTIDIMENSIONAL GROUPING OPERATORS - 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. | 05-23-2013 |
20130132962 | SCHEDULER COMBINATORS - Scheduler combinators facilitate scheduling. One or more combinators, or operators, can be applied to an existing scheduler to compose a new scheduler or decompose an existing scheduler into multiple facets. | 05-23-2013 |