Abstract: Technologies are described for establishing a connection to an IMDB (in-memory database) via a GUI, automatically detecting an IMDB version, and selecting at least one script from a plurality of scripts based on the detected IMDB version. Differences among the plurality of scripts can relate to data parameter differences in different IMDB versions. The selected at least one script to be executed returns data of a type recognized in the detected IMDB version.

Abstract: Optimization of procedures for enterprise applications can take both declarative query statements and imperative logic into account in a unified optimization technique. An input procedure can implement complex analytical queries and also include iterative control flow logic such as loops. Alternative query execution plans for the procedure can be enumerated by moving queries out of and into loop boundaries via hoist and sink operations. Program correctness can be preserved via excluding some operations via dependency graphs. Sink subgraphs can also be used. Query inlining can also be supported, resulting in synergies that produce superior execution plans. The computing execution resource demand of the respective alternatives can be considered to arrive at an optimal query execution plan that can then be used to actually implement execution of the procedure. Execution performance can thus be greatly improved by performing counterintuitive optimizations.

Abstract: Provided is a system and method in which configuration content from central system is repackaged and distributed to applications on a host platform. In one example, the method may include receiving, via a host platform, configuration content from a central system, the configuration content comprising one or more configuration objects of a tenant, identifying an application of the tenant on the host platform which uses the one or more configuration objects based on a configuration object to application mapping, and distributing the one or more configuration objects to the identified application of the tenant on the host platform.

Abstract: Systems and methods are describe herein for managing a transaction between two parties. A distributed ledger management service (DLMS) microservice receives an electronic document pertaining to a transaction from a user. The electronic document includes transactional data. A document type is determined by the DLMS microservice. A portion of the transactional data is extracted from the electronic document based on the document type. The portion of the transactional data is provided to a distributed ledger node for decentralized storage and further reporting to a third party.

Abstract: Methods and apparatus are disclosed for staged query compilation. One or more intermediate plans between a query and its execution plan are stored according to a common specification for plan data structures. Data sources, a plan flow, and annotations can be stored in respective fields of the plan data structure, which can be extended with a field for a serialized execution plan. Plan data structures provide a stable interface for integration of local and external software modules, and decouple plan representation from plan optimization. Use cases are disclosed for integrating offline optimization with inline software modules, for integrating local query handling with external services, for caching intermediate plans, and for archiving plans across version changes of optimizers. A hub architecture flexibly supports numerous compilation workflows. Disclosed technologies are suitable for cloud deployments and for migration of databases into the cloud.

Abstract: A computer-implemented method includes receiving a request of data records for a data schema, obtaining a schema alignment which maps the data schema to a subset of an ontology of a knowledge graph, generating at least one query based on the subset of the ontology of the knowledge graph, obtaining a list of data records by executing the at least one query on the knowledge graph to obtain a list of data records, and persisting the list of data records to the data schema.

Abstract: Systems and methods include extraction of a plurality of clauses from each of a plurality of electronic documents, determination, for each of the plurality of clauses and using a machine-learned algorithm, an associated clause type, identification of one or more data privacy protection entities present within each of one or more of the plurality of clauses, determination, for each of the one or more of the plurality of clauses, of a weighted frequency for each of the one or more data privacy protection entities present within the clause based on a type of the data privacy protection entity, determination of a weighted frequency associated with each of the plurality of electronic documents based on the determined weighted frequency for each of the one or more data privacy protection entities present within clauses of the plurality of electronic documents, and storage of an identifier of each of the plurality of electronic documents in association with a respective determined weighted frequency.

Abstract: Technologies are described for routing structured query language (SQL) statements to elastic compute nodes (ECNs) using workload classes within a distributed database environment. The elastic compute nodes do not store persistent database tables. For example, a SQL statement can be received for execution within the distributed database environment. A workload class can be identified that matches properties of the SQL statement. Based on the workload class, a routing location hint can be obtained that identifies a set of elastic compute nodes. The SQL statement can then be routed to one of the identified elastic compute nodes for execution. Execution of the SQL statement at the elastic compute node can involve retrieving database data from other nodes which store persistent database tables.

Abstract: A variety of scenarios for generating mock data based on original data are described. Characteristics of the original data can be reflected in the mock data without having access to the actual original data. Instead, statistical artifacts representing the original data can be used to instantiate reconstructed database tables. In relational database scenarios, foreign key relationships can be preserved even if the actual values are not known. The reconstructed database tables can be used as mock data in a variety of circumstances, including testing, and is especially useful to recreate characteristics of the original data when the original data cannot be made available for size, confidentiality, or privacy reasons.

Abstract: A system and method to determine an event for an executing integration flow defining how messages are passed between a sender system and a receiver system; determine message processing states of messages of the integration flow before an event time; determine message processing states of messages of the integration flow after the event time; determine, based on an evaluation of failed message processing states for the messages before and after the event time, whether the event is associated with a problem; assign, in response to the determination that the event time is associated with a problem, one or more categories to the problem; and store a record of the assignment of the one or more categories to the problem.

Abstract: Systems and processes for calculating sustainability footprints and controlling associated systems are provided herein. Activity data may be received for an organization, and emissions factors may be determined for the activity data. Absolute, relative, and/or average relative footprints may be calculated for the organization based on the activity data and the emissions factors. An indication of the absolute, relative, and/or average relative footprints may be generated for display on a graphical user interface of a computing device.

Abstract: Technologies are described for managing shared read-only objects in hybrid distributed database systems. For example, data structures can be maintained for managing the shared read-only objects, comprising a data structure storing a “deleted at” value for each shared read-only object, a data structure storing a “deleted at” value for each secondary node, a data structure storing a indication of which secondary nodes are reading which shared read-only objects, and a data structure storing a reference count indicating a number of active read transactions for each shared read-only object. The shared read-only objects that can be garbage collected can be identified using, at least in part, the data structures. The identified shared read-only objects can then be garbage collected.

Abstract: Certain embodiments of the disclosure concern a computer-implemented method. For a distributable product, the method can store a representation of a production process involving a plurality of prerequisites and input quality parameters, receive a request to promise availability of a first quantity of the product having specific instances of the input quality parameters, simulate production of a second quantity of the product having the specific instances of the input quality parameters, output one or more promised delivery terms, and reserve resources in a production system for production of the second quantity of the product. The second quantity is smaller than or equal to the first quantity.

Abstract: Technologies are described for ranking test cases related to changes in a software code base using at least a portion of a call graph that is generated from the software code base. The at least a portion of the call graph comprises method nodes corresponding to methods in the software code base. The method nodes represent control flow relationships between the methods in the software code base. The at least a portion of the call graph also comprises test case nodes. Each test case node is connected to one or more method nodes corresponding to coverage of the one or more method nodes by the test case node. Using the at least a portion of the call graph, the test case nodes are automatically ranked. Ranking of the test case nodes is performed by evaluating various criteria associated with the at least a portion of the call graph.

Abstract: Systems, methods, and computer media are described for dynamically mitigating slow web pages. Wait time thresholds can be established for individual pages or categories of pages. The wait time thresholds reflect a delay time determined to be acceptable to users. Pages for which wait time thresholds are established can be monitored, and when requests to load one of the pages results in a delay beyond the threshold, which indicates a slow page, alternative content can be provided to the requesting user. The alternative content is selected to be useful to the user in accomplishing the user's goal despite the delay and can be a help page or information for accessing desired information in another way.

Abstract: Methods, systems, and computer-readable storage media for receiving, by an AMS, a policy definition file defining policies to be enforced during execution of an instance of an application within the cloud platform, providing, by the AMS, an enhanced policy definition file indicating authorizations for roles for a policy of the policy definition file, providing an authentication bundle for execution of policy decisions at the instance, the authentication bundle provided based on the enhanced policy definition file, the authentication bundle distributed to application containers within the cloud platform, and during execution of the instance: transmitting, by the instance, an authorization request from the instance to an ADC, the ADC including an OPA and being executed within the container and executing policy decisions based on the authentication bundle, receiving, by the instance, a policy decision from the ADC and enforcing the policy based on the policy decision.

Abstract: A method, a system, and a computer program product for execution master data substitution. One or more first data objects in a master data storage are determined for replacement. One or more second data objects are identified for replacing the first data objects for storage in the master data storage. Replacement of the first data objects with the second data objects is performed in accordance with one or more data object requirements. Replacement of the first data objects by the second data objects is executed in accordance with the one or more data object requirements. A resulting replacement data set is generated and stored.

Abstract: Systems and methods include determination of a first logical page number of a first database page to be persisted, identification of a first blockmap page associated with the first logical page number, determination, from the first blockmap page, of a block number associated with the first logical page number, determination that the block number is an object key, determination, in response to the determination, that the block number is an object key, determination of a first object key to associate with the first logical page number, and writing of the first database page to the object store using the first object key.

Abstract: Transformation rule generation and validation functionality is provided herein. Transformation rules can be generated for one or more mappings in an alignment between a source database and a target database. The transformation rules can transform instance data from the source data model to a form matching the target data model. One or more transformation rules can be generated for a mapping between fields in a source database and a field in a target database. The transformation rules can be generated based on one or more source fields and a target field of a mapping, and one or more identified functions. Evaluating the transformation rules can include generating test data based on the transformation rules applied to instance data from the source database. The test data can be evaluated against instance data from the target database. The transformation rules and the evaluation results can be provided in a user interface.

Abstract: A computer-implemented method for database management is provided. The method comprises: receiving, from a client device , first data to be stored in a database system that comprises first data storage configured to store a data table and a deletion history table; storing the first data in second data storage that is external to the database system and that is in communication with the database system via a network; obtaining a link that enables access, via the network, to the first data stored in the second data storage; storing the link in the data table; and performing a deletion operation of the first data, in response to a request from the client device to delete the first data from the database system, wherein the deletion operation comprises: deleting the link from the data table without deleting the first data from the second data storage; and storing the link in the deletion history table with a timestamp corresponding to a point in time when the link is deleted from the data table.