Abstract: A query generation and processing system includes a relational data store, a query generator, and a query processor. The relational data store stores data ingested from data sources in a first and second datasets. The query generator interprets a data expression in a simplified query language to generate a query in a structured query language based on identifying quads corresponding to the first and second datasets in the data expression and determining an implicit join between the quads based on an unambiguous relationship obtainable from a schema of the first and datasets, in which the data expression does not expressly identify a join between the first quad and the second quad. The query processor generates a query pipeline that uses the data of the first and second datasets stored by the relational data store to execute the query generated by the query processor.

Abstract: Generating an optimized supplier allocation plan includes identifying parts and suppliers associated with an allocation problem, where each supplier can supply at least one part. One or more objective functions are selected. Each objective function has part variables, and each part variable represents a quantity of a part to be procured from a supplier. At least one constraint constraining at least one part variable is received. The one or more objective functions are optimized with respect to the at least one constraint to yield a value for each part variable. A quantity of each part to be procured from at least one supplier is determined according to the values to generate the optimized supplier allocation plan.

Abstract: Data expressions in a simplified query language are processed to generate queries in a structured query language which can then be executed against data ingested from one or more data sources. The data expression is parsed to determine quads and to produce a tree of the quads. A derivation graph including nodes representing the quads and including at least one edge representing a derivation relationship between two of the quads determined based on attributes of the quads is generated based on the tree of quads and a data schema. The derivation graph is then queried based on a grain of the quads to generate the query. The simplified query language does not require an expression of a join relationship between the quads within the data expression when an unambiguous relationship between the quads is obtainable from the data schema.

Abstract: A derivation graph including nodes representing quads identified within a data expression in a simplified query language is queried using deferred join processing. A derivation graph is generated based on a first data expression that includes a join between a second data expression and a third data expression, in which the derivation graph includes at least one node representative of the second data expression and at least one node representative of the third data expression. A root node is identified within the derivation graph by determining that the nodes representative of the second data expression and the third data expression are derivable from the root node using the derivation graph. Query language instructions representing the join between the second data expression and the third data expression written in a second query language are then generated using the root node.

Abstract: A query generation and processing system includes a relational data store, a query generator, and a query processor. The relational data store stores data ingested from data sources in a first and second datasets. The query generator interprets a data expression in a simplified query language to generate a query in a structured query language based on identifying quads corresponding to the first and second datasets in the data expression and determining an implicit join between the quads based on an unambiguous relationship obtainable from a schema of the first and datasets, in which the data expression does not expressly identify a join between the first quad and the second quad. The query processor generates a query pipeline that uses the data of the first and second datasets stored by the relational data store to execute the query generated by the query processor.

Abstract: Generating an optimized supplier allocation plan includes identifying parts and suppliers associated with an allocation problem, where each supplier can supply at least one part. One or more objective functions are selected. Each objective function has part variables, and each part variable represents a quantity of a part to be procured from a supplier. At least one constraint constraining at least one part variable is received. The one or more objective functions are optimized with respect to the at least one constraint to yield a value for each part variable. A quantity of each part to be procured from at least one supplier is determined according to the values to generate the optimized supplier allocation plan.

Abstract: An information retrieval system converts unstructured ad-hoc search queries into structured search instructions that retrieve data in a structured relational database or an unstructured database. Data from the database is uploaded into a distributed in-memory database system. Tokens are automatically generated based on attributes, measures, and other metadata extracted from the relational database. The tokens are then compared with the non-structured ad-hoc user search queries. The information retrieval system uses the tokens to identify or predict what structured data is associated with user search queries. The tokens guide the user through a set of search terms that the system then uses to generate the structured query instructions. The structured query instructions retrieve specific data and answers from in the database system.

Abstract: An information retrieval system converts unstructured ad-hoc search queries into structured search instructions that retrieve data in a structured relational database or an unstructured database. Data from the database is uploaded into a distributed in-memory database system. Tokens are automatically generated based on attributes, measures, and other metadata extracted from the relational database. The tokens are then compared with the non-structured ad-hoc user search queries. The information retrieval system uses the tokens to identify or predict what structured data is associated with user search queries. The tokens guide the user through a set of search terms that the system then uses to generate the structured query instructions. The structured query instructions retrieve specific data and answers from in the database system.

Abstract: Generating an optimized supplier allocation plan includes identifying parts and suppliers associated with an allocation problem, where each supplier can supply at least one part. One or more objective functions are selected. Each objective function has part variables, and each part variable represents a quantity of a part to be procured from a supplier. At least one constraint constraining at least one part variable is received. The one or more objective functions are optimized with respect to the at least one constraint to yield a value for each part variable. A quantity of each part to be procured from at least one supplier is determined according to the values to generate the optimized supplier allocation plan.

Abstract: Generating an optimized supplier allocation plan includes identifying parts and suppliers associated with an allocation problem, where each supplier can supply at least one part. One or more objective functions are selected. Each objective function has part variables, and each part variable represents a quantity of a part to be procured from a supplier. At least one constraint constraining at least one part variable is received. The one or more objective functions are optimized with respect to the at least one constraint to yield a value for each part variable. A quantity of each part to be procured from at least one supplier is determined according to the values to generate the optimized supplier allocation plan.

Abstract: An interaction tracking facility records, stores, plays back, distributes and allows recipients to interject new events into a stored set of discrete interaction events of a dashboard. A recorder stores data that identifies dashboard annotation and analysis events so that they can be later retrieved and played back. During playback, the stored events are executed, in stepwise fashion, in another dashboard, recreating the events recorded on the first dashboard as if they were performed on the second dashboard. The second dashboard can be coupled to different data than the original dashboard without changing the stored events. Events are stored in a repository and identified by a URL, which can be sent to a recipient for retrieval. The playback can be stopped at any time, and a branch recording created with a second set of interaction events that are different from or additional to the original recording events.

Abstract: Generating an optimized supplier allocation plan includes identifying parts and suppliers associated with an allocation problem, where each supplier can supply at least one part. One or more objective functions are selected. Each objective function has part variables, and each part variable represents a quantity of a part to be procured from a supplier. At least one constraint constraining at least one part variable is received. The one or more objective functions are optimized with respect to the at least one constraint to yield a value for each part variable. A quantity of each part to be procured from at least one supplier is determined according to the values to generate the optimized supplier allocation plan.

Abstract: Generating an optimized supplier allocation plan includes identifying parts and suppliers associated with an allocation problem, where each supplier can supply at least one part. One or more objective functions are selected. Each objective function has part variables, and each part variable represents a quantity of a part to be procured from a supplier. At least one constraint constraining at least one part variable is received. The one or more objective functions are optimized with respect to the at least one constraint to yield a value for each part variable. A quantity of each part to be procured from at least one supplier is determined according to the values to generate the optimized supplier allocation plan.