Methods, computer program products, and systems are presented. The methods include, for instance: analyzing a dataset associated with a service provided by the data protection service provider in order to determine a policy for when and how to replicate the respective components of the dataset corresponding to the service from a source site to a target site, such that the target site may perform the service with a minimum cost.

Approaches presented herein enable optimization of a cache of compiled XML Path Language (XPath) expressions by removing variability from XPath expressions. More specifically, XPath expressions are identified that are the same but for one or more hardcoded values. These hardcoded values are identified and replaced in an identified XPath expression with an identifier to form a cache optimized XPath expression that lacks the hardcoded value variability of the identified XPath expressions. This cache optimized XPath expression is inserted into a cache optimized function that receives the hardcoded value as arguments and assigns the received hardcoded value to the identifier in the cache optimized XPath expression. The identified XPath expressions are then rewritten as calls to the cache optimized function or to another function wrapping the cache optimized function. Therefore, only the cache optimized XPath expression, instead of several of the identified XPath expressions, is stored in the XPath expression cache.

A database system is operable to determine a plurality of queries for execution. Query data for each query of the plurality of queries is determined, where the query data for the each query indicates a memory usage estimate, an internal runtime estimate, and an external runtime estimate. Query initiation data is generated by determining whether to initiate execution of one query of the plurality of queries at a first temporal period occurring after initiating execution of a subset of the plurality of queries and occurs before the execution of the subset of the plurality of queries is complete, based on the query data of the one query. Execution of the one query is initiated when the query initiation data indicates a determination to initiate execution of the one query in the first temporal period.

Methods, computer program products, and systems are presented. The methods include, for instance: analyzing a dataset associated with a service provided by the data protection service provider in order to determine a policy for when and how to replicate the respective components of the dataset corresponding to the service from a source site to a target site, such that the target site may perform the service with a minimum cost.

Approaches presented herein enable optimization of a cache of compiled XML Path Language (XPath) expressions by removing variability from XPath expressions. More specifically, XPath expressions are identified that are the same but for one or more hardcoded values. These hardcoded values are identified and replaced in an identified XPath expression with an identifier to form a cache optimized XPath expression that lacks the hardcoded value variability of the identified XPath expressions. This cache optimized XPath expression is inserted into a definition of a cache optimized function. The optimized XPath expression receives values as arguments of the cache optimized Xpath function and passes the received values to the variable identifier in the cache optimized XPath expression. The identified XPath expressions can then be rewritten as calls to the cache optimized function. Therefore, only the cache optimized XPath expression, instead of several of the identified XPath expressions, is stored in the cache.

A query operator execution flow includes: identifying an OR operator of the query expression; generating a plurality of parallel sub-flows based on a plurality predicates of the OR operator; and generating a plurality of serial sub-flows of the query operator execution flow based on the OR operator of the query expression. A first consecutive one of the plurality of serial sub-flows includes an identifier appending operator, a second consecutive one of the plurality of serial sub-flows includes a tee operator, a third consecutive one of the plurality of serial sub-flows includes the plurality of parallel sub-flows from the tee operator, and a fourth consecutive one of the plurality of serial sub-flows includes a union distinct operator applied to the plurality of parallel sub-flows. Execution of the query is facilitated by applying the query operator execution flow to a plurality of rows indicated by the query.

A system may determine one or more data sources which the system is configured to access. The system may provide a set of application programming interfaces (APIs) for interacting with data stored in one or more data sources. The APIs may be accessible to one or more web applications which the system is configured to serve. The system may determine that a web application has requested an operation for interacting with the data through one or more APIs in the set of APIs. The system may determine one or more responses based at least in part on the operation requested by the web application. The system may provide the response(s) to the web application.

A database system is operable to generating conjunctive normal form (CNF) processing cost data, disjunctive normal form (DNF) processing cost data, and non-normalized form processing cost data based on a plurality of operators of a query expression indicating a query for execution. Query processing selection data is generated based on the CNF processing cost data, the DNF processing cost data, and the non-normalized form processing cost data. The query processing selection data indicates a selection to execute the query in accordance with exactly one of: a CNF query operator execution flow; a DNF query operator execution flow; or a non-normalized query operator execution flow. Execution of the query is facilitated based on the query processing selection data.

A node of a database system is operable to determine a plurality of query operator execution flows for execution of a plurality of queries. Execution of the plurality of queries is facilitated based on performing a plurality of sequential operator execution steps. At least one of the plurality of sequential operator execution steps includes selecting one of the plurality of queries for execution at the each of the plurality of sequential operator execution steps, selecting one of the plurality of operators of the one of the plurality of query operator execution flows corresponding to the one of the plurality of queries, facilitating execution of the one of the plurality of operators on a queued set of data blocks of the one of the plurality of operators to generate at least one output data block, and advancing to a next one of the plurality of sequential operator execution steps.

This invention is a system for integrating data sets organized in one organization type with data sets organized in a second organization type so that data queries submitted to be processed in the manner of the first organization type can be translated into queries usable by the data set in the second data organization type and the results returned to satisfy the first query.