Method and system for simplified assembly of information processing applications

• US 8,484,611 B2
• Filed: 10/15/2007
• Issued: 07/09/2013
• Est. Priority Date: 10/15/2007
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Bouillet, Eric, Liu, Zhen, Riabov, Anton V.
• Primary Examiner(s): Nguyen, Phillip H
• Application Number:
  US11/872,385
• Publication Number:
  US 20090100407A1
• Time in Patent Office: 2,094 Days
• Field of Search: 717/105, 717/104
• US Class Current: 717/105
• CPC Class Codes: G06F 8/34 Graphical or visual programming
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Abstract

A method for automatic composition of an information processing flow based on a user-specified processing goal, includes: selecting tags from a first plurality of tags, wherein the selected tags specify a processing goal; composing a processing graph in accordance with the processing goal; and displaying a second plurality of tags, wherein the second plurality of tags includes tags that are only relevant to the selected tags.

Claims

1. A method for automatic composition of an information processing flow based on a user-specified processing goal, comprising:

selecting tags from a first plurality of tags, wherein the selected tags specify a processing goal;

composing a processing graph in accordance with the processing goal, wherein the processing graph produces an output feed with annotation containing the selected tags; and

displaying a second plurality of tags in response to the selection of the tags from the first plurality of tags, wherein the second plurality of tags does not include the selected tags,

wherein after the processing graph is composed;

generating a preview of results of the output feed and displaying the preview of results;

displaying implied and guessed tags corresponding to the processing graph; and

displaying a text description of the processing graph.

2. The method of claim 1, further comprising:

displaying the first plurality of tags, wherein the tags are selected by clicking on individual tags in the first plurality of tags.

3. The method of claim 1, wherein the tags are selected by inputting individual tags into a search string.

4. The method of claim 1, wherein the processing graph is composed by using primal data feeds and processing modules described in a planning language.

5. The method of claim 4, wherein descriptions of the primal data feeds and processing modules are represented as actions, with preconditions and effects of the actions corresponding to annotations on inputs and outputs of the primal data feeds and processing modules.

6. The method of claim 5, wherein composing the processing graph comprises:

generating a description of the processing goal, wherein the processing goal is represented using predicates;

invoking a planner to generate a plan for the actions that satisfy the processing goal; and

translating the plan into the processing graph.

7. The method of claim 1, further comprising:

deploying the processing graph in a deployment environment; and

displaying the output feed produced by the processing graph in the deployment environment.

8. The method of claim 7, wherein the processing graph is deployed as a web service, wherein the web service responds to requests by returning an RSS feed or an Atom feed.

9. The method of claim 1, further comprising:

displaying the processing graph.

10. A method for automatic composition of information processing flows based on user-specified processing goals, comprising:

receiving a processing goal, wherein the processing goal corresponds to a set of tags selected from a tag cloud;

wherein after the processing goal is received;

displaying the set of tags corresponding to the processing goal;

generating a processing graph that produces an output feed with annotation containing all tags corresponding to the goal; and

generating a next tag cloud;

wherein after the processing graph is generated;

generating a preview of results of the output feed and displaying the preview of results;

displaying implied and guessed tags corresponding to the processing graph; and

displaying a text description of the processing graph;

wherein after the next tag cloud is generated;

displaying the next tag cloud.

11. The method of claim 10, wherein the next tag cloud is pre-computed or dynamically computed.

12. The method of claim 10, wherein the preview of results is generated by:

deploying the processing graph as a web service in an execution environment;

invoking the web service to retrieve a response; and

displaying the retrieved response from the web service as the preview of results produced by the processing graph.

13. The method of claim 10, further comprising:

modifying the processing goal by selecting tags in the next tag cloud and repeating the steps performed after the processing goal is received.

14. A computer program product comprising a non-transitory computer useable medium having computer program logic recorded thereon for automatic composition of an information processing flow based on a user-specified processing goal, the computer program logic comprising:

program code for receiving selected tags that specify a processing goal, wherein the tags were selected from a first plurality of tags;

program code for composing a processing graph in accordance with the processing goal, wherein the processing graph produces an output feed with annotation containing the selected tags; and

program code for displaying a second plurality of tags in response to the selection of the tags from the first plurality of tags,

the computer program logic further comprises;

program code for generating a preview of results of the output feed and displaying the preview of results;

program code for displaying implied and guessed tags corresponding to the processing graph; and

program code for displaying a text description of the processing graph.