Abstract: Techniques and solutions are described for providing flexible access to data during execution of a data access request. Multiple instances of a data artifact are created, where different instances of the data artifact provide access to different data sources having data associated with the data access request. When a data access request is executed, a particular data artifact instance can be used during execution of the data access request. In some cases, switching logic can be used to determine which data artifact instance is to be used in executing the data access request. Also described are technologies for facilitating creation of data artifact instances corresponding to a modelling artifact.

Abstract: Disclosed herein are system, method, and computer program product embodiments for replicating data from a source database table to a target database table. An embodiment operates by maintaining a master logging table in communication with a source database table and a subscriber logging table. Thereafter, a copy of a first modification of data of the source database table is provided to the master logging table as a record, where the first record includes the copy of the first modification of data. Subsequently, upon determining that the first record in the master logging table is committed, a copy of the first record is provided to the subscriber logging table. And after identifying a first target database associated with the master logging table, the first record is sent to the first target database.

Abstract: A method for performing a parallelized heapsort operation may include updating, by a first worker thread, a first buffer while a second worker thread updates a second buffer in parallel. The first worker thread may update the first buffer by adding, to the first buffer, elements from a first partition of a dataset. The second worker thread may update the second buffer by adding, to the second buffer, elements from a second partition of the dataset. Upon the first buffer reaching a threshold size, the first worker thread may acquire a lock for the first worker thread to update a heap based on the first buffer while the second worker thread is prevented from updating the heap based on the second buffer. A result of a top k query comprising a k quantity of smallest elements from the dataset may be generated based on the heap.

Abstract: Various embodiments for providing a data transfer and management system are described herein. An embodiment operates by determining that data of a column is stored in a column loadable format in which all of the data of the column is moved from the disk storage location to a memory responsive to a data request. A data vector that identifies a plurality of value IDs corresponding to at least a subset of the plurality of rows of the column, is identified. A page format that provides that a portion of the data of the column across a subset of the plurality of rows is moved from the second disk storage location into the memory responsive to the data request is determined. The entries of the data vector are requested, converted from column loadable format into the page persistent format, and stored across one or more memory pages.

Abstract: A method for workload balancing is implemented in a computer system including a primary database system and a secondary database system, the secondary database system being configured as a backup system for the primary database system. The method includes compiling a query received from a client application. The query indicates one or more source tables have corresponding replicate tables. The compiling comprises replace the one or more source tables with the corresponding replicate tables. The method can generate a query execution plan based on the compiled query, determine a per-table result lag based on minimum commit times of the corresponding replicate tables, and compare the per-table result lag with a predefined threshold. Responsive to a determination that the per-table result lag exceeds the predefined threshold, the method can recompile the query by falling back to the one or more source tables from the corresponding replicate tables.

Abstract: Techniques for dynamically filtering data streams are disclosed. In some embodiments, a computer system performs a method comprising: obtaining one or more metrics of a cloud computing environment, the cloud computing environment including a data source, a data consumer, and a network, the data source configured to transmit data to the data consumer via the network; determining a filtering rule based on the one or more metrics, the filtering rule corresponding to a data filtering operation that modifies data transmissions; and configuring a filter adapter of the data source to apply the data filtering operation of the filtering rule to the data transmissions from the data source to the data consumer.

Abstract: System, method, and various embodiments for providing a data access and recommendation system are described herein. An embodiment operates by identifying a column access of one or more data values of a first column of a plurality of columns of a table of a database during a sampling period. A count of how many of the one or more data values are accessed during the column access are recorded. A first counter is incremented by the count. The sampling period is determined to have expired. A load recommendation on how to load data values into the first column based on the first counter is computed. The load recommendation for implementation into the database for one or more subsequent column accesses is provided.

Abstract: Computer-readable media, methods, and systems are disclosed for copying tenant data within a cloud-based microservice architecture including a Kubernetes cluster. Copy tasks are generated for a plurality of microservices and progress of the copy tasks is monitored by updating one or more statuses associated with the copy tasks. One or more job files may be generated for each microservice including executable code for copying the tenant data within the microservice or within a data store associated with the respective microservice.

Abstract: Imputation of missing data can be provided for both normalized and non-normalized data. Data can be partitioned, and data complete records used to impute values for data missing records. Hierarchical clustering can be used to cluster the data. Imputation can rely on a closed record in a same cluster. Record similarity can be used to adjust an observed value, and an estimated mean can also be incorporated. Useful for augmenting datasets that can be applied to analytics, machine learning, and other scenarios.

Abstract: In an example embodiment, a cross-tenant service broker with a router microservice is introduced. The router microservice writes information into the service broker. A data receiver then reads the information from the service broker and stores it in tenant specific storage. A distributer forwards data that belongs to other data centers. In each tenant, data center information is received as part of an application program interface (API). In order to address the fact that the tenancy model of a MAP and a MLAP may be different, a service registry (or service landscape registry, such as SLIS or LIS) kernel service is used to map the MLAP tenant(s) into the correct MAP tenant(s).

Abstract: Technologies are described for determining route proposals for shipment of cargo using unique location identifiers (ULIs). For example, a pickup ULI and a delivery ULI can be received. The pickup ULI and the delivery ULI are in the ULI data structure format defined herein. A first geographic area representing a pickup leg can be determined for shipment of the cargo from the pickup ULI to a first transportation network location and a second geographic area representing a delivery leg can be determined for shipment of the cargo from a second transportation network location to the delivery ULI. The main leg of the shipment occurs between the first transportation network location and the second transportation network location and travels through one or more defined transportation networks. Route proposals can be generated for shipment of the cargo through the pickup leg, main leg, and/or delivery leg.

Abstract: The present disclosure involves systems, software, and computer implemented methods for generating a unified semantic model identifying a user's intentions or goals within operating the system. By determining the intent and desires of the user, tasks and queries associated with or requested by the user can be more effectively optimized, automated, or otherwise improved. In some computing environments, multiple users access a database which includes a collection of software objects. The objects within the database can sometimes form a hierarchy, with a parent-child relationship among them. Traditionally, a developer creating the database and the objects within can only determine a user's intent based on the actions taken by the user within the database. The present solution provides the developer with a higher level model representing different users' intents based on observed data from a number of sources in addition to the user's interaction with the database.

Abstract: Disclosed is a framework for providing microservices for database with embedded container service in a container cloud platform. The framework includes a container cloud manager for performing distributed management of resources in a data center. The container cloud manager includes an orchestrator with a flexible job scheduler and operator pool. The flexible job scheduler and container cloud master form a flexible job management platform for managing jobs of the data center. The flexible job management framework can isolate various types of jobs as well as mix various jobs for efficient usage of hosts or resources in the data center. The operator pool includes optional components of a database. The orchestrator facilitates quick customization and release of database products, such as a HANA database with optional services, as requested by a user in the container cloud platform.

Abstract: Disclosed herein are system, method, and computer program product embodiments for database management coordinators operated by a source server and a target server, respectively. The database management coordinator can be in a state selected from an initial state, a ready state, a transmission state, or a pause state. The database management coordinator operated by the source server can extract data in a first format stored in a first storage device and convert the data in the first format into a second format to be transmitted to the target serer. The database management coordinator operated by the target server can convert the data in the second format into a third format to be stored in a third storage device associated with the target server.

Abstract: Systems, methods, and computer-readable media are disclosed for data unblocking in application platforms. An application platform may comprise a plurality of systems. A system may store data having a residence period. Upon expiration of the residence period, the data may be blocked from further processing. Data which is blocked may need to then be unblocked. Systems may be leading systems or dependent systems. Data unblocking may be triggered from the leading system to the dependent systems. At runtime, the dependent system may receive a trust token which may be used to verify a calling system as the leading system. If a data unblocking request is called from a dependent system, data unblocking may be prevented.

Abstract: Systems and methods to copy a plurality of source data records of a source client to a target client include deletion of a first set of target data records of a plurality of target data records associated with the target client, each of the first set associated with a key which is not identical to any key of a plurality of source data records, insertion of a second set of source data records into the plurality of target data records, each of the second set of source data records associated with a key which is not identical to any key of the plurality of target data records, and update of a third set of target data records associated with a key which matches a key of one of the fourth set of source data records and which is different from one of the fourth set of source data records.

Abstract: Various examples are directed to systems and methods for testing software. A testing system may use test case data describing a first test case failed by a first build of the software application, the first build generated by a first commit operation of the plurality of commit operations to execute a fault localization operation, the fault localization operation to identify a first suspect program element of a first build. The testing system may use the first suspect program element and commit data to select a second commit operation from the plurality of commit operations. The testing system may determine an error-inducing commit operation from the plurality of commit operations and executing a corrective action.

Abstract: Various examples are directed to systems and methods for providing software services to one or more consumer systems. A cloud service provider system accesses a software service build comprising a first feature and a first feature toggle for selectively enabling or disabling the first feature. The cloud service provider system configures the first feature toggle of the software service build to disable the first feature and deploys the software service build to a first environment accessible by a first consumer system. A toggle routine determines that a first toggle condition for the first feature has occurred and modifies the software service build deployed at the first environment to configure the first feature toggle to enable the first feature.

Abstract: In an example embodiment, shards of a database are each stored in in-memory storage as multiple redundant distinct shard instances, but rather than a leader-follower paradigm each redundant shard instance is independent from one another. Each shard contains only an odd number of shard instances, and the number of shard instances is greater than or equal to three. This helps to ensure that enough shard instances are available at any one time to service requests.

Abstract: A thread executing a task at a node in a multi-socket computing system may access a first data structure to obtain a first calibration dataset for the node. The first thread may generate a timestamp based on the first calibration dataset and a first quantity of time measured by a clock at the first node. The real-time duration of the task may be determined based on the timestamp. The first thread may recalibrate the first clock by at least generating, based on the first quantity of time measured by the clock and a second quantity of time measured by a wall clock of an operating system of the multi-socket computing system, a second calibration dataset. The first thread may update the first data structure to include the second calibration dataset while a second thread accesses a second data structure to obtain calibration data.