METHOD AND APPARATUS FOR DYNAMIC CONTENT GENERATION

• US 20080098115A1
• Filed: 10/19/2006
• Published: 04/24/2008
• Est. Priority Date: 10/19/2006
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dube, Parijat, Liu, Zhen, Bouillet, Eric
• Granted Patent: US 7,856,503 B2
• Time in Patent Office: Days
• US Class Current: 709/227
• CPC Class Codes: G06F 16/24568 Data stream processing; Continuous queries
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]

Abstract

One embodiment of the present method and apparatus for synthesizing a data stream includes retrieving meta data from at least one decision tree, the decision tree comprising a plurality of interconnected nodes, and generating the data stream in accordance with the meta data.

Claims

1. A method for synthesizing a data stream, the method comprising:

retrieving meta data from at least one decision tree, the at least one decision tree comprising a plurality of interconnected nodes; and

generating the data stream in accordance with the meta data.

2. The method of claim 1, wherein the retrieving is performed under the director of an iterator.

3. The method of claim 2, wherein the iterator maintains a local state.

4. The method of claim 1, wherein each of the plurality of interconnected nodes implements a logic for generating content.

5. The method of claim 4, wherein at least one of the plurality of interconnected nodes implements a branching logic that specifies a manner in which at least one decision tree is to be traversed.

6. The method of claim 5, wherein the branching logic comprises at least one of:

a dictionary, an N-gram model, a script, a schedule or a select.

7. The method of claim 4, wherein at least one of the plurality of interconnected nodes implements a transform logic that allows modification of content generated by a child node.

8. The method of claim 7, wherein the transform logic comprises at least one of:

content concatenation, encapsulation, arbitrary length repetition of content, stack logic or a logic for creating structured content.

9. The method of claim 4, wherein at least one of the plurality of interconnected nodes implements a logic for generating arbitrary binary data.

10. The method of claim 1, wherein the retrieving comprises:

traversing at least one decision tree from a root node to a leaf node, to create a decision path; and

generating content for the data stream in accordance with mechanisms provided by the leaf node.

11. The method of claim 10, wherein the traversing comprises:

writing the generated content to a first buffer, if a current node in the decision path is a leaf node; and

writing content annotation to a second buffer, if the current node in the decision path is not a leaf node.

12. The method of claim 11, further comprising:

writing content annotation to the second buffer, if the current node in the decision path is a leaf node.

13. The method of claim 11, wherein the content annotation provides information about the decision path.

14. The method of claim 11, wherein the writing content annotation comprises:

identifying, at the current node in the decision path, a node field name that corresponds to a field name of an iterator; and

replacing a field value of the iterator, the field value of the iterator corresponding to the field name of the iterator, with a field value corresponding to the node field name.

15. The method of claim 11, wherein the first buffer and the second buffer are accessible by a data factory.

16. A computer readable medium containing an executable program for synthesizing a data stream, where the program performs the steps of:

retrieving meta data from at least one decision tree, the at least one decision tree comprising a plurality of interconnected nodes; and

generating the data stream in accordance with the meta data.

17. The computer readable medium of claim 16, wherein the retrieving comprises:

traversing at least one decision tree from a root node to a leaf node, to create a decision path; and

generating content for the data stream in accordance with mechanisms provided by the leaf node.

18. The computer readable medium of claim 17, wherein the traversing comprises:

writing the generated content to a first buffer, if a current node in the decision path is a leaf node; and

writing content annotation to a second buffer, if the current node in the decision path is not a leaf node.

19. The computer readable medium of claim 18, wherein the writing content annotation comprises:

identifying, at the current node in the decision path, a node field name that corresponds to a field name of an iterator; and

replacing a field value of the iterator, the field value of the iterator corresponding to the field name of the iterator, with a field value corresponding to the node field name.

20. System for synthesizing a data stream, said system comprising:

means for retrieving meta data from at least one decision tree, the at least one decision tree comprising a plurality of interconnected nodes; and

means for generating the data stream in accordance with the meta data.