MONADIC EVALUATION OF INJECTED QUERY COMPOSITIONS

• US 20130103715A1
• Filed: 10/21/2011
• Published: 04/25/2013
• Est. Priority Date: 10/21/2011
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Beckman, Brian, Gerson, Elad, Bar-Zeev, Avi, Meijer, Henricus Johannes Maria, Kimchi, Gur, Chenai, Selvi
• Granted Patent: US 9,075,672 B2
• Time in Patent Office: Days
• US Class Current: 707/770
• CPC Class Codes: G06F 16/2456 Join operations
• CPC Class Codes: G06F 16/24566 Recursive queries
• CPC Class Codes: G06F 9/4488 Object-oriented
• CPC Class Codes: G06F 9/547 Remote procedure calls [RPC]; Web services
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]

Abstract

Embodiments enable the evaluation of injected queries within a monad. One or more operators with closures are received from a first process. The operators with closures represent one or more functions to be applied by a second process. The second process evaluates the received operators with closures to apply the functions within the monad. During evaluation, the second process converts the closures to simply typed closures. Further, the second process binds the converted closures within the monad to restrict execution of the functions. In some embodiments, the queries (e.g., sequences of one or more operators with closures) are composed using a set of query operators from the language integrated query (LINQ) framework encoded in uniform resource locators (URLs) in the representational state transfer (REST) style.

Claims

1. A system for bi-directional, dynamically programmable injection of operations into communications between a first process and a second process, said system comprising:

a memory area associated with the second process, said memory area storing a uniform resource locator (URL) having one or more operators with closures embedded therein, said operators with closures corresponding to at least one request for data; and

a processor programmed to;

receive the URL from a first process via a network and store the received URL in the memory area;

extract the operators with closures from the URL stored in the memory area;

evaluate, by the second process, the extracted operators with closures to generate the requested data, said evaluation including;

converting the closures to simply-typed closures, and

binding the operators with converted closures within a monad to encapsulate the generated data from the operators with converted closures; and

send the generated data to the first process.

2. The system of claim 1, wherein the first process is executed by a client device and the second process is executed by a cloud service.

3. The system of claim 1, wherein the first process is executed by a cloud service and the second process is executed by a client device.

4. The system of claim 1, wherein the processor is programmed to bind the operators with converted closures within the monad by applying at least one operation to the data generated from evaluation of each of the operators with converted closures, wherein the same operation is applied to the data generated from a prior operator with converted closures in a pipeline.

5. The system of claim 1, further comprising means for processing query operators embedded in a scripting language in URLs with a monad.

6. The system of claim 1, further comprising means for monadic evaluation of operators with closures by web services.

7. A method comprising:

receiving, from a first process, one or more operators with closures, said operators with closures representing one or more functions to be performed by a second process; and

evaluating, by the second process, the received operators with closures to execute the functions by;

converting the closures to simply-typed closures; and

binding the operators with converted closures within a monad to restrict execution of the functions.

8. The method of claim 7, wherein binding the operators with converted closures within the monad comprises creating a Kleisli composition.

9. The method of claim 7, wherein evaluating the received operators with closures comprises ordering the operators with closures for sequential evaluation.

10. The method of claim 7, wherein converting the closures comprises one or more of the following:

prohibiting recursive evaluation of the closures, and prohibiting self-application of higher-order arguments to closures.

11. The method of claim 7, wherein binding the operators with converted closures within the monad comprises applying at least one operation to output data from execution of each of the functions, wherein the same operation is applied to each of the functions.

12. The method of claim 7, wherein receiving the operators with closures comprises receiving one or more queries coded in a scripting language.

13. The method of claim 7, wherein receiving the operators with closures comprises receiving one or more queries packaged in hypertext markup language.

14. The method of claim 7, wherein evaluating the operators with closures comprises applying a filter to a collection of data to produce a subset of the data.

15. The method of claim 7, wherein a computing device executes the first process and the second process.

16. The method of claim 7, wherein evaluating the operators with closures comprises evaluating query operators selected from the set consisting of:

expand, transform, filter, group, join, order, combine, and aggregate.

17. One or more computer storage media embodying computer-executable components, said components comprising:

a communications interface component that when executed causes at least one processor to receive, from a first process, a communication having a sequence of operators with closures injected therein, said operators with closures representing functions to be performed by a second process to generate output data; and

a script component that when executed causes at least one processor to statically analyze, by the second process, the operators with closures in sequence to execute the functions to generate the output data, said script component including;

a type-checking component that when executed causes at least one processor to convert each of the closures to simply typed closures; and

an encapsulation component that when executed causes at least one process to apply, within a monad, the operators with closures converted by the type-checking component during the static analysis to the output data from a prior stage in the sequence of operators with closures to contain the execution of the functions.

wherein the communications interface component provides the generated output data to the first process.

18. The computer storage media of claim 17, wherein the encapsulation component applies at least one operation with converted closures to a preceding monadic expression in the sequence, wherein the encapsulation component applies the same operation with closures to each element within the preceding monadic expression.

19. The computer storage media of claim 17, wherein the type-checking component prevents recursive execution and self-application of closures.

20. The computer storage media of claim 17, wherein the script component executes the functions over a monadic data collection representing one or more of the following:

an enumerable data collection, a collection of data items distributed over space, and an observable stream representing a collection of data distributed over time.