Abstract: According to an aspect of the present principles, a method is provided for generating resource description framework benchmarks. The method includes deriving a resultant benchmark dataset with a user specified size and a user specified coherence from and with respect to an input dataset of a given size and a given coherence by determining which triples of subject-property-object to add to the input dataset or remove from the input dataset to derive the resultant benchmark dataset.

Abstract: A method for automated composition of an application including: receiving a customizable template for application composition and a composition goal, wherein the goal comprises a plurality of tags and the goal is incomplete such that more than one possible composition matches the goal; refining the goal by automatically adding refinement tags to the goal; and generating an application flow that matches the customizable template and the refined goal, wherein the application flow comprises data sources, data processing operators, and outputs of the application flow.

Abstract: According to an aspect of the present principles, a method is provided for generating resource description framework benchmarks. The method includes deriving a resultant benchmark dataset with a user specified size and a user specified coherence from and with respect to an input dataset of a given size and a given coherence by determining which triples of subject-property-object to add to the input dataset or remove from the input dataset to derive the resultant benchmark dataset.

Abstract: In at least one embodiment, a method and a system include receiving a trace into a hypotheses generator from a source a trace, translating the trace and a state transition model into a planning problem using the hypotheses generator, producing a set of plans for the trace using at least one planner, translating each plan into hypothesis using the hypotheses generator and/or the planner, and returning the hypotheses from the hypotheses generator. In a further embodiment, the trace includes at least one of a future observation and a past observation. In at least one embodiment, the system includes at least one planner that develops a set of plans, a hypothesis generator, a database, at least one analytic, and at least one sensor where the hypotheses generator and/or the at least one planner converts each plan into a respective hypothesis.

Abstract: In at least one embodiment, a method and a system for determining a set of plans that best match a set of preferences. The method may include receiving into a goal specification interface at least one goal to be accomplished by the set of plans; receiving into a preference engine a pattern that includes preferences; generating a planning problem by using the preference engine; generating a set of plans by at least one planner; and providing the set of plans for selection of one plan to deploy. In a further embodiment, the preferences may be an occurrence or non-occurrence of at least one component, an occurrence of one component over another component, an ordering between at least two components, an existence or non-existence of at least one tag in a final stream, an existence of one tag over another tag in the final stream.

Abstract: A flow pattern is generated from a single flow, in which the flow pattern describes a plurality of flows that are structurally similar to one another and perform similar tasks. End users are then capable of exploring the different flows of the pattern and selecting one or more flows based on high-level goals.

Abstract: A method and computer program product for assembling and deploying multi-platform flow based applications. An information processing flow that produces a result is assembled, the information processing flow includes components connected by data links, a component includes software code that describes at least one of an input constraint or an output constraint of the component, and at least two of the components are deployable on different computing platforms. The information processing flow is partitioned into sub-flows, such that for each sub-flow every component in the sub-flow is deployable on the same computing platform. The sub-flows are deployed on their respective computing platforms.

Abstract: A flow pattern is generated from a single flow, in which the flow pattern describes a plurality of flows that are structurally similar to one another and perform similar tasks. End users are then capable of exploring the different flows of the pattern and selecting one or more flows based on high-level goals.

Abstract: Techniques for automatically partitioning a multi-platform data transform flow graph to one or more target output platforms are provided. The techniques include performing type inference on a transform graph, wherein the transform graph comprises one or more data transforms, automatically partitioning the transform graph to one or more target output platforms based on one or more policies, performing an optimization of the partitioned transform graph, and generating code, from the partitioned transform graph, for each set of the one or more data transforms based on the one or more target output platforms.

Abstract: Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A graph coloring operation is performed on the graph. The graph coloring operation includes assigning each of nodes to a color, where nodes connected by an edge are assigned different colors. A schema is generated that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph based on the color assigned to the node.

Abstract: Techniques for creating a distributed application flow from a set of rules are provided. The techniques include creating a control-flow graph for each rule, creating one or more dependency links between two or more rules, partitioning a resulting graph, wherein the resulting graph comprises one or more control-flow graphs and one or more dependency links, into one or more operators by determining an optimal set of one or more cuts through the resulting graph such that a cost function is minimized, and generating stream processing flow code from the partitioned graph.

Abstract: Techniques for creating a distributed application flow from a set of rules are provided. The techniques include creating a control-flow graph for each rule, creating one or more dependency links between two or more rules, partitioning a resulting graph, wherein the resulting graph comprises one or more control-flow graphs and one or more dependency links, into one or more operators by determining an optimal set of one or more cuts through the resulting graph such that a cost function is minimized, and generating stream processing flow code from the partitioned graph.

Abstract: Techniques for automatically partitioning a multi-platform data transform flow graph to one or more target output platforms are provided. The techniques include performing type inference on a transform graph, wherein the transform graph comprises one or more data transforms, automatically partitioning the transform graph to one or more target output platforms based on one or more policies, performing an optimization of the partitioned transform graph, and generating code, from the partitioned transform graph, for each set of the one or more data transforms based on the one or more target output platforms.

Abstract: A method for automated data exploration including selecting a plurality of analytic flows from an analytic flow pattern, executing a task, wherein the task is tracked by the plurality of analytic flows, receiving feedback for each of the plurality of analytic flows, determining a performance score for each of the plurality of analytic flows, and adjusting the flow according to the performance score.

Abstract: Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A graph coloring operation is performed on the graph. The graph coloring operation includes assigning each of nodes to a color, where nodes connected by an edge are assigned different colors. A schema is generated that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph based on the color assigned to the node.

Abstract: A method (and structure) of storing schema-less data of a dataset in a relational database, includes constructing a hash table for the schema-less data, using a processor on a computer. Data in the dataset is stored in a tuple format including a subject along with at least one other entity associated to the subject. Each row of the hashtable will be dedicated to a subject of the dataset, and at least one of the at least one other entity associated with the subject in the row is to be stored in a pair-wise manner in that row of the hashtable. In an exemplary embodiment, RDF data that uses triples (subject, predicate, object) is stored with the predicate/object stored in the pair-wise manner in its associated subject row.

Abstract: Techniques for generating code for a flow are provided. The techniques include receiving a flow for an application to be deployed, wherein the flow comprises one or more sub-flows, identifying sub-flows of the flow that match existing sub-flows that are already running in separate flows by querying a run-time flow information repository, generating code for the flow, wherein the code comprises newly generated code for each of the sub-flows that do not match existing sub-flows that are already running in separate flows, and wherein the code also comprises one or more connectors to matching sub-flows that are already running in separate flows in lieu of generating new code for the sub-flows that match existing sub-flows that are already running in separate flows, and deploying the generated code for the flow and updating the run-time flow information repository with information pertaining to the flow.

Abstract: According to an aspect of the present principles, a method is provided for generating resource description framework benchmarks. The method includes deriving a resultant benchmark dataset with a user specified size and a user specified coherence from and with respect to an input dataset of a given size and a given coherence by determining which triples of subject-property-object to add to the input dataset or remove from the input dataset to derive the resultant benchmark dataset.

Abstract: A method (and structure) of storing schema-less data of a dataset in a relational database, includes constructing a hash table for the schema-less data, using a processor on a computer. Data in the dataset is stored in a tuple format including a subject along with at least one other entity associated to the subject. Each row of the hashtable will be dedicated to a subject of the dataset, and at least one of the at least one other entity associated with the subject in the row is to be stored in a pair-wise manner in that row of the hashtable. In an exemplary embodiment, RDF data that uses triples (subject, predicate, object) is stored with the predicate/object stored in the pair-wise manner in its associated subject row.

Abstract: A method and computer program product for assembling and deploying multi-platform flow based applications. An information processing flow that produces a result is assembled, the information processing flow includes components connected by data links, a component includes software code that describes at least one of an input constraint or an output constraint of the component, and at least two of the components are deployable on different computing platforms. The information processing flow is partitioned into sub-flows, such that for each sub-flow every component in the sub-flow is deployable on the same computing platform. The sub-flows are deployed on their respective computing platforms.