Abstract: The present disclosure relates to computer-implemented methods, software, and systems for automatic database configuration. One example method includes receiving, at a database associated with a data warehouse application, a request to generate a configuration to acquire data objects based on executing calls to corresponding programming interfaces provided by a source application, wherein the programming interfaces are identified in the received instructions and are associated with acquiring the data objects associated with metadata entities defined at the database; in response to the received instructions, configuring the database to automatically execute one or more calls to acquire relevant data for a metadata entity defined at the database, wherein the metadata entity is associated with a section of a first programming interface; and invoking the first programming interface at the source application, wherein invoking the first programming interface results in acquiring the relevant data.

Abstract: In some implementations, there is provided a method including receiving a query request including a join, wherein the join includes a range between a first predicate of the join and a second predicate of the join; generating a query plan including an index join operator; executing the query plan including the index join operator including getting, from the sorted dictionary, the first value identifier, the second value identifier, and the one or more intervening value identifiers between the first value identifier and the second value identifier and executing the index join operator using the first value identifier, the second value identifier, and the one or more intervening value identifiers to obtain a result set.

Abstract: Techniques and solutions are provided for a table schema that facilitates data denormalization, and which can allow for improved database system performance. Rather than accessing multiple tables, database operations can access a single table, which can reduce the number and complexity of database operations. The table schema includes an attribute subset indicator field. Different values of the attribute subset indicator field can be associated with different contexts, such as different tables or views, which in turn can represent different entity types. A given value of the attribute subset indicator field allows data to be accessed at a coarse granularity, while more-fine grained results can be obtained by providing a value for one or more attribute fields of the table. Different subsets of attributes are retrievable for a given value of the attribute subset indicator field.

Abstract: A method may include allocating, based on a first load requirement of a first tenant, a first bin having a fixed capacity for handing the first load requirement of the first tenant. In response to the first load requirement of the first tenant exceeding a first threshold of the fixed capacity of the first bin, packing a second bin allocated to handle a second load requirement of a second tenant. The second bin may be packed by transferring, to the second bin, the first load requirement of the first tenant based on the transfer not exceeding the first threshold of the fixed capacity of the second bin. In response to the transfer exceeding the first threshold of the fixed capacity of the second bin, allocating a third bin to handle the first load requirement of the first tenant.

Abstract: Methods, systems, and computer-readable storage media for an autoscaling framework that uses a multi-tenant interference model for selectively scaling resources in container orchestration systems based on an estimated performance, an actual performance, and a violation count of each resource unit of a plurality of resource units. In some implementations, the autoscaling framework of the present disclosure mitigates length of response times in applications composed of a set of services.

Abstract: Embodiments may be associated with a unified data processing framework. A first source system may contain first data associated with a first Application Programming Interface (“API”) specification, and a second source system may contain second data associated with a second API specification (different from the first API specification). A cloud system processing layer may receive the first data and the second data and parse the first data and the second data to capture entity metadata. The first data and the second data can then be converted into a universal and extendable data format having nodes arranged in accordance with the metadata. The converted first and second data is stored by the cloud system processing layer in cloud storage. A data retrieval engine may then retrieve information from the cloud storage (including information associated with both the first and second data) in response to a user query.

Abstract: A key protection framework for a platform includes a key protection engine for interfacing between an external key management system (KMS) and an external encryption service. A customer of the platform can select an existing external KMS and external encryption service to use with the framework. The key protection engine can onboard the external KMS with the platform by obtaining a configuration for the external KMS. Information extracted from the configuration can be used to establish a connection between the key protection engine and the external KMS, via which the key protection engine can interface with the external KMS to initiate rotation of a cryptographic key at the external KMS. Responsive to detection of a new version of a master key, the key protection engine can transmit a request to the external KMS to re-encrypt the cryptographic key with the new version of the master key.

Abstract: The present disclosure provides techniques and solutions for determining whether a particular value is in a dataset using summary information. A sorted set of unique values is received. The sorted set of unique values includes gaps between at least certain values. The gaps are determined, and the set of unique values is represented as a gap filter. The gap filter includes a starting value of the set of unique values, a set of gap lengths, and identifiers indicating a number of unique values between respective gaps. The gap filter serves as summary information that can be used to determine whether a value be present in the dataset. In at least some cases, the use of the summary information may provide false positive results. The representation of the gap filter can be modified to improve its compressibility, but may increase the number of false positives produced by the gap filter.

Abstract: The present disclosure provides techniques and solutions for sorting data. In a particular implementation, a sorting technique is provided that places values in a sorted order by adding an offset value to values that are not in a sorted order. The resulting sorted set of values is not truly sorted, in that the set of modified values is sorted, but the underlying data itself is not sorted. In another implementation, a sorting technique can use multiple streams or sets. When an out of order element is encountered, it can be added to a new stream, if such a stream is available. The sorting techniques can be used for a variety of purposes, including provided sorted data for use in generating summary data, or for providing sorted data to be used in determining an intersection between two datasets.

Abstract: Systems and processes for evaluating algorithms for aligning weakly-annotated data to recognized characters in a document are provided. In a method for evaluating an algorithm for aligning annotation data to recognized characters, strong annotations and weak-to-strong annotations, which are generated by applying a weak-to-strong annotation alignment algorithm, for a document are received and matched to generate respective pairs of matched annotations. For each pair of matched annotations, respective metrics are calculated including comparisons of aspects of the strong annotations to the weak-to-strong annotations. The respective metrics are aggregated, and an indication of the aggregated metrics are output to a graphical user interface or targeted application. Aggregated metrics determined for different weak-to-strong annotation alignment algorithms may be compared in order to select or adjust an algorithm to be used for Optical Character Recognition (OCR) operations.

Abstract: The present disclosure involves systems, software, and computer implemented methods for concurrent duplicated sub process control in a workflow engine. One example method includes executing a sub process of a workflow process using an instance of a node that represents the sub process. After executing the sub process, a determination is made as to whether the node is a join node that has multiple direct predecessor nodes in a graph of the workflow process. If the node is a join node, dependent nodes of the join node are identified for which traversal of the graph from a dependent node passes through the join node. A set of active dependent node instances of the dependent nodes are identified and a determination is made as to whether to wait for completion of any particular dependent node instances or if workflow execution can continue beyond the join node.

Abstract: Systems and methods are provided for training a machine learning model to use comments entered by a user submitting an expense to determine a correct expense type. The trained machine learning model is used to predict an expense type by analyzing submitted text comments corresponding to a submitted expense. The expense can be flagged if a mismatch is determined between the expense type of the submitted expense and the predicted expense type, or the submitted expense can be automatically updated to the predicted expense type.

Abstract: Systems, methods, and articles of manufacture, including computer program products, provide a system including at least one data processor and at least one memory storing instructions which, when executed by the at least one data processor, cause operations comprising: generating, by a database execution engine, a query plan including a plurality of operators; inserting, by the database execution engine, an enforce compilation operator into the query plan that includes the plurality of operators, the plurality of operators comprising a first operator, the enforce compilation operator, and a second operator; executing at least the first operator of the query plan; in response to executing the first operator, evaluating, by the database execution engine, an output of the first operator to determine whether a condition is satisfied; and in response to the condition being satisfied, triggering, by the database execution engine, a just-in-time compilation of the second operator.

Abstract: In an example embodiment a mechanism for consumer group versioning is introduced. Here, each application runtime provides a version for any consumer group during its deployment and keeps increasing the version whenever there is an enhancement or bug fix. Thus, both the application and the consumer group will have a version. Once it is recognized that a consumer group assigned to partitions in a topic has an outdated consumer group version number (i.e., a consumer group with the same name/application but a later consumer group version number has been registered with the message broker), the old consumer group is disconnected immediately. This allows the message broker to immediately assign partitions to the consumers in the newer consumer group, thus avoiding the aforementioned delays and associated technical problems.

Abstract: Methods and systems for object-based text searching using group score expressions are provided. A method may include receiving a query including a request to search specified columns of a table for a set of search terms, and a group score filter for use in filtering the table based at least on a group score associated with a plurality of groups of rows of the table, determining the group score for each of a plurality of groups of rows of the table, filtering the table based at least on the group score filter included in the query and the group score determined for each of the plurality of groups of rows of the table, and providing at least one group of rows of the plurality of groups of rows that includes at least the portion of the set of search terms.

Abstract: The present disclosure provides techniques and solutions for determining whether a particular value is in a dataset using summary information. A sorted set of unique values is received. The sorted set of unique values includes gaps between at least certain values. The gaps are determined, and the set of unique values is represented as a gap filter. The gap filter includes a starting value of the set of unique values, a set of gap lengths, and identifiers indicating a number of unique values between respective gaps. The gap filter serves as summary information that can be used to determine whether a value be present in the dataset. In at least some cases, the use of the summary information may provide false positive results. The representation of the gap filter can be modified to improve its compressibility, but may increase the number of false positives produced by the gap filter.

Abstract: Disclosed herein are system, method, and computer program product embodiments for compressing metadata in a Software-as-a-Service (SaaS) system. A metadata compression service operating on a computing device detects one or more global properties in entity metadata of each tenant in a plurality of tenants. The metadata compression service partitions the plurality of tenants into one or more groups and identifies common properties in each group. The metadata compression service compiles the one or more global properties in a global-level list and the one or more common properties for each group in a group-level list. The metadata compression service obtains one or more tenant-specific properties in the entity metadata of each tenant in the plurality of tenants and defines a data structure of an entity object for the tenant using the global-level list, the group-level list for the group that contains the tenant, and the one or more tenant-specific properties.

Abstract: Arrangements for an intelligent client copy tool are provided. In a client copy procedure, access to a target client may be locked and all target data associated with the target client may be deleted. A before trigger for execution before a modifying operation on a database table may be defined. The trigger may be executed and, based on the trigger identifying a query associated with the modifying operation, access to the database table may be locked and an insert operation may be executed. Then, the trigger may be deleted. Thereafter, the modifying operation on the target client may be performed and access to the database table unlocked. A database view of the database table, including pointers to the source client, may be generated. Nonstatic data may be copied from the source client to the target client using the insert operation. After the copying, the target client may be unlocked.

Abstract: The present disclosure provides techniques and solutions for sorting data. In a particular implementation, a sorting technique is provided that places values in a sorted order by adding an offset value to values that are not in a sorted order. The resulting sorted set of values is not truly sorted, in that the set of modified values is sorted, but the underlying data itself is not sorted. In another implementation, a sorting technique can use multiple streams or sets. When an out of order element is encountered, it can be added to a new stream, if such a stream is available. The sorting techniques can be used for a variety of purposes, including provided sorted data for use in generating summary data, or for providing sorted data to be used in determining an intersection between two datasets.

Abstract: The present disclosure relates to computer-implemented methods, software, and systems for the replication of secret keys between server nodes. Keys for encryption and decryption are persisted in a log file on a first database hosted on a primary server. The log file comprises data for executed database transactions at the first database and key management operations at a first key store. In response to triggering a synchronization between the primary server and a secondary server, a set of sequential entries of the log file are replayed at the secondary server from the first database. An execution of a transaction is replicated at a secondary database at the secondary server based on data for an entry at the log file and a key management operation associated with a key at the first key store that is persisted in another entry of the log file is replicated.