Abstract:
Disclosed herein are a system, non-transitory computer readable medium, and method to handle a routing problem. It is determined whether a fastest route can be resolved using static routing or time dependent routing.
Abstract:
The present disclosure provides a computer-implemented method (300) of managing content from structured and unstructured data sources. The method (300) includes adding a first item to an information management project, wherein the first item includes unstructured content selected from an unstructured data source and a data link corresponding to the unstructured content (304). The method (300) also includes adding a second item to the information management project, wherein the second item includes a database query and structured data corresponding to the database query (306). The method (300) also includes generating a presentation document based on the information management project, the presentation document comprising the unstructured content and the structured data (308).
Abstract:
Example embodiments relate to predicting execution times of concurrent queries. In example embodiments, historical data is iteratively generated for a machine learning model by varying a concurrency level of query executions in a database, determining a query execution plan for a pending concurrent query, extracting query features from the query execution plan, and executing the pending concurrent query to determine a query execution time. The machine learning model may then be created based on the query features, variation in the concurrency level, and the query execution time. The machine learning model is used to generate an execution schedule for production queries, where the execution schedule satisfies service level agreements of the production queries.
Abstract:
A method for event correlation includes capturing events and arranging the events sequentially in at least one dimension. An event correlator implemented by a computational device convolves a kernel density function with each of the events to produce a convolved function for each event. Co-occurrences between events are found by calculating overlap between convolved functions.