Method and apparatus for dynamic content generation

• US 7,856,503 B2
• Filed: 10/19/2006
• Issued: 12/21/2010
• Est. Priority Date: 10/19/2006
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dube, Parijat, Liu, Zhen, Bouillet, Eric
• Primary Examiner(s): Patel; Ashok B
• Assistant Examiner(s): GAZDA, JOSEPH P
• Application Number:
  US11/551,034
• Publication Number:
  US 20080098115A1
• Time in Patent Office: 1,524 Days
• Field of Search: 709227-229
• 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 an artificial 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 arranged in a hierarchy, wherein each of the plurality of interconnected nodes implements a logic for generating content, and

wherein the plurality of interconnected nodes comprises;

at least one root node occupying a highest level of the hierarchy; and

a plurality of leaf nodes, each of the plurality of leaf nodes occupying a level of the hierarchy that is at least one level below the highest level; and

generating the artificial data stream in accordance with the meta data, wherein the artificial data stream simulates one or more real data streams.

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

3. The method of claim 2, wherein the branching logic comprises at least one of:

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

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

5. The method of claim 4, 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.

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

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

traversing the at least one decision tree from a root node occupying a highest level of the hierarchy to a leaf node occupying a level of the hierarchy that is at least one level below the highest level, to create a decision path; and

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

8. The method of claim 7, wherein the traversing comprises:

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

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

9. The method of claim 8, further comprising:

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

10. The method of claim 8, wherein the content annotation provides information about the decision path.

11. The method of claim 8, wherein the writing the 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.

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

18. The method of claim 1, wherein the retrieving is performed under a direction of an iterator.

19. The method of claim 18, wherein the iterator maintains a local state.

13. A non-transitory computer readable medium containing an executable program for synthesizing an artificial data stream, where the program performs steps comprising:

retrieving meta data from at least one decision tree, the at least one decision tree comprising a plurality of interconnected nodes arranged in a hierarchy, wherein each of the plurality of interconnected nodes implements a logic for generating content, and wherein the plurality of interconnected nodes comprises;

at least one root node occupying a highest level of the hierarchy; and

a plurality of leaf nodes, each of the plurality of leaf nodes occupying a level of the hierarchy that is at least one level below the highest level; and

generating the artificial data stream in accordance with the meta data, wherein the artificial data stream simulates one or more real data streams.

14. The non-transitory computer readable medium of claim 13, wherein the retrieving comprises:

traversing the at least one decision tree from a root node occupying a highest level of the hierarchy to a leaf node occupying a level of the hierarchy that is at least one level below the highest level, to create a decision path; and

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

15. The non-transitory computer readable medium of claim 14, wherein the traversing comprises:

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

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

16. The non-transitory computer readable medium of claim 15, wherein writing the 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.

17. System for synthesizing an artificial 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 arranged in a hierarchy wherein each of the plurality of interconnected nodes implements a logic for generating content, and wherein the plurality of interconnected nodes comprises;

at least one root node occupying a highest level of the hierarchy; and

a plurality of leaf nodes, each of the plurality of leaf nodes occupying a level of the hierarchy that is at least one level below the highest level; and

means for generating the artificial data stream in accordance with the meta data, wherein the artificial data stream simulates one or more real data streams.