Method and system for modeling user requests, applications and components used in dynamic application assembly

• US 8,245,122 B2
• Filed: 01/08/2008
• Issued: 08/14/2012
• Est. Priority Date: 01/08/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Liu, Zhen, Riabov, Anton V.
• Primary Examiner(s): HUYNH, CONG LAC T
• Application Number:
  US11/971,068
• Publication Number:
  US 20090177955A1
• Time in Patent Office: 1,680 Days
• Field of Search: 715/200, 715/255
• US Class Current: 715/200
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation

Abstract

A method for determining if a first component can be connected to a second component for inclusion in a processing graph, includes: accessing a first component description, the first component description describing an output object of the first component with a set of tags; accessing a second component description, the second component description describing an input condition of the second component with a set of tags; determining that the first component can be connected to the second component if the set of tags describing the output object includes all tags describing the input condition; and including the first and second connected components in a processing graph if they are connected to each other.

Claims

1. A method for determining if a first component can be connected to a second component for inclusion in a processing graph, comprising:

accessing a first component description, the first component description describing an output object of the first component with a set of tags;

accessing a second component description, the second component description describing an input condition of the second component with a set of tags;

determining that the first component can be connected to the second component if the set of tags describing the output object includes all tags describing the input condition; and

including the first and second connected components in a processing graph if they are connected to each other,

wherein information is propagated from an input port of the second component to an output port of the second component by defining a sticky tag as a label for automatically propagating tags, wherein if a sub-tag of the sticky tag appears in a description of the output object of the first component, the sticky tag is added to the description of an object to be output from the output port of the second component.

2. The method of claim 1, wherein the output object of the first component is described by specifying tags that can be added to or removed from the description of the object when the object is output from the first component.

3. The method of claim 2, wherein the input condition of the second component is described by specifying a tag query that must be satisfied by an object provided to the second component as an input.

4. The method of claim 3, wherein the tag query is a set of tags selected from a list of tags, the tags in the list having a predefined sub-tag relationship.

5. The method of claim 4, wherein the tag query is satisfied if the set of tags describing the output object of the first component includes a sub-tag for each tag describing the input condition of the second component.

6. The method of claim 4, wherein information is propagated from an input port of the second component to an output port of the second component by using a typed tag variable bound to one of the tags describing the output object of the first component and using the typed tag variable to describe an object to be output from the output port of the second component.

7. A method for application assembly, comprising:

receiving a tag query that specifies a goal; and

composing a processing graph that satisfies the goal, wherein the processing graph satisfies the goal if an object output by a component in the processing graph satisfies the tag query, the processing graph being composed by;

accessing a plurality of component descriptions, a first component description describing an output object of the first component with a set of tags and a second component description describing an input condition of the second component with a tag query;

determining that the first component can be connected to the second component if the set of tags describing the output object satisfies the tag query describing the input condition; and

inserting the first and second components into the processing graph if they are connected to each other,

wherein if a first tag is not described by the output object of the first component and the first tag is output from the first component, the first tag is permitted to propagate through the second component if it is related to a sticky tag included in the input condition of the second component.

8. The method of claim 7, wherein the tag query that specifies the goal is selected by a user from a list of tags presented to the user on a computer screen.

9. The method of claim 7, wherein the component descriptions are accessed from a memory, the component descriptions being created by software developers.

10. A computer readable medium tangibly embodying a program of instructions executable by a processor to perform method steps for determining if a first component can be connected to a second component for inclusion in a processing graph, the method steps comprising:

accessing a first component description, the first component description describing an output object of the first component with a set of tags;

accessing a second component description, the second component description describing an input condition of the second component with a set of tags;

determining that the first component can be connected to the second component if the set of tags describing the output object includes all tags describing the input condition; and

including the first and second connected components in a processing graph if they are connected to each other,

wherein information is propagated from an input port of the second component to an output port of the second component by defining a sticky tag as a label for automatically propagating tags, wherein if a sub-tag of the sticky tag appears in a description of the output object of the first component, the sticky tag is added to the description of an object to be output from the output port of the second component.

11. The computer readable medium of claim 10, wherein the output object of the first component is described by specifying tags that can be added to or removed from the description of the object when the object is output from the first component.

12. The computer readable medium of claim 11, wherein the input condition of the second component is described by specifying a tag query that must be satisfied by an object provided to the second component as an input.

13. The computer readable medium of claim 12, wherein the tag query is a set of tags selected from a list of tags, the tags in the list having a predefined sub-tag relationship.

14. The computer readable medium of claim 13, wherein the tag query is satisfied if the set of tags describing the output object of the first component includes a sub-tag for each tag describing the input condition of the second component.

15. The computer readable medium of claim 13, wherein information is propagated from an input port of the second component to an output port of the second component by using a typed tag variable bound to one of the tags describing the output object of the first component and using the typed tag variable to describe an object to be output from the output port of the second component.

16. A computer readable medium tangibly embodying a program of instructions executable by a processor to perform method steps for application assembly, the method steps comprising:

receiving a tag query that specifies a goal; and

composing a processing graph that satisfies the goal, wherein the processing graph satisfies the goal if an object output by a component in the processing graph satisfies the tag query, the processing graph being composed by;

accessing a plurality of component descriptions, a first component description describing an output object of the first component with a set of tags and a second component description describing an input condition of the second component with a tag query;

determining that the first component can be connected to the second component if the set of tags describing the output object satisfies the tag query describing the input condition; and

inserting the first and second components into the processing graph if they are connected to each other,

wherein if a first tag is not described by the output object of the first component and the first tag is output from the first component, the first tag is permitted to propagate through the second component if it is related to a sticky tag included in the input condition of the second component.

17. The computer readable medium of claim 16, wherein the tag query that specifies the goal is selected by a user from a list of tags presented to the user on a computer screen.

18. The computer readable medium of claim 16, wherein the component descriptions are accessed from a memory, the component descriptions being created by software developers.