Abstract: In an example embodiment, machine learning models are trained and used to predict a growth classification of time fields and category fields of application tables of Enterprise Resource Planning (ERP) software databases. These predictions can then be used to forecast future technological needs or the future table size more precisely.

Abstract: The present disclosure relates to computer-implemented methods, software, and systems for providing extension application mechanisms. Memory is allocated for a virtual environment to run in an address space of an application that is to be extended with extension logic in a secure manner. The virtual environment is configured for execution of commands related to an extension functionality of the application. A virtual processor for an execution of a command of the commands is initialized at the virtual environment. The virtual processor is operable to manage one or more guest operating systems (OS). A first guest OS is loaded at the allocated memory and application logic of the extension functionality is copied into the allocated memory. The virtual environment is started to execute the first guest OS and the application logic of the extension functionality in relation to associated data of the application in the allocated memory.

Abstract: Disclosed herein are system, method, and computer program product embodiments for accessing a database collection. In some embodiments, an application generates a database collection. The database collection is configured to store documents (e.g., records). The application generates a database table definition. The database table definition is a proxy or adapter for the database collection. The application receives a request to be executed to be executed on the database collection from a client device. The request specifies the database table definition. The application accesses the database collection, via the database, to process the request using the database table definition.

Abstract: Systems, methods, and computer media for determining compatible users through machine learning are provided herein. Previous interactions between some users in a group can be used to determine a first set of user-to-user compatibility scores. Both the first set of compatibility scores and attributes for the users in the group can be provided as inputs to a machine learning model that can be used to determine a second set of user-to-user compatibility scores for user pairs who do not have an interaction history. Along with input constraints, the first and second sets of user-to-user compatibility scores can be used to select compatible user groups.

Abstract: Intelligent mapping from created item information to sustainability reference content from a variety of sources can be implemented to facilitate created item footprint management and other sustainability applications. The difficult task of finding appropriate emission factors across a portfolio can be automated. Assisted search can be implemented using enhanced search techniques. Fallback mappings can be implemented to accommodate different levels of granularity during search. A machine learning model can be trained based on a variety of input data, including confirmed mappings, mapping history, and rules. The process of mapping to emission datasets can thus be simplified, enabling footprint calculations to proceed.

Abstract: Various examples are directed to systems and methods for upgrading a cloud-implemented application. A cloud service may receive a request from a user group to access the application. The cloud service may access consumer context data comprising a plurality of context properties of the user group and may access a rollout strategy map comprising a first rollout record. The cloud service may compare the plurality of context properties of the first user group to first selector data indicated by a first rollout record. Based on the comparing, the cloud service may add the first version of the application to a list of permissible versions for the first user group.

Abstract: A method for graph processing in a scalable graph processing framework may include applying a two-dimensional partitioning scheme to partition a graph. One or more partitions of the graph may be distributed to each graph core such that each graph core executes a graph processing algorithm on one or more partitions of the graph. The executing of the graph processing algorithm may include the graph cores exchanging vertex labels via a crossbar interconnecting the plurality of graph cores. Each graph core in the scalable graph processing framework may be coupled with a single memory channel upon which the partitions of the graph are distributed. The graph cores may synthesized on a field programmable gate array (FPGA) based on one or more user defined functions (UDFs). Related systems and computer program products are also provided.

Abstract: A system, method and computer product for managing distributed transactions of a database. A transaction manager is provided for each of a plurality of transactions of the database. Each transaction manager is configured to perform functions that include generating a transaction token that specifies data to be visible for a transaction on the database. The database contains both row and column storage engines, and the transaction token includes a transaction identifier (TID) for identifying committed transactions and uncommitted transactions. A last computed transaction is designated with a computed identifier (CID), record-level locking of records of the database is performed using the TID and CID to execute the transaction, and the plurality of transactions of the database are executed with each transaction manager.

Abstract: Some embodiments provide a program that retrieves a set of notifications describing failures that occurred on a set of monitored devices. The program further determines a set of topics based on the set of notifications. The program also determines failure modes associated with the set of topic from a plurality of failure modes defined for the set of monitored devices. The program further determines failure modes associated with the set of notifications based on the set of topics and the failure modes associated with the set of topics. The program also receives a particular notification that includes a particular set of words describing a failure that occurred on a particular monitored device in the set of monitored devices. The program further determines a failure mode associated with the particular notification based on the particular set of words and the determined failure modes associated with the set of notifications.

Abstract: Computer-readable media, methods, and systems are disclosed for database table partition pruning based on statistical information associated with non-partition columns. A tree partition specification is received defining partitions for a plurality of computed column statistics. Respective partitions are created for the plurality of computed column statistics based on the tree partition specification. A request is received to compute statistics for a plurality of columns of the plurality of computed column statistics to result in a plurality of computed column statistics. In response to determining that one or more modifications have been made to the partitioned database, the plurality of computed column statistics is marked as invalid. The computed column statistics are refreshed in response to modifications of the partitioned table. Thereafter, the statistics are marked as valid. Unnecessary table partitions are pruned based on the statistics, and the associated query is executed.

Abstract: An application executing on a pod may generate a content request for a particular version of content. The application sends a request including an identifier of the version of the content to a repository in a cluster of pods. The repository determines, using the identifier, whether the version of the content is stored in the cluster or stored at a database in a different cluster. The application receives a response from the repository that may indicate that the version of the content is stored in the cluster and the response may include an identifier of a content pod storing the version of the content. The application sends the content request to the content pod storing the version of the content and may receive the version of the content without querying the database for the version of the content.

Abstract: In some example embodiments, there may be provided a method including detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator.

Abstract: Embodiments facilitate testing of software functions, by elaborating upon a small volume test sample originally provided by a developer. Where the original test sample is determined to be numerical, embodiments perform repetition techniques to generate corpuses of test data of varying scope representing operation over different timescales. For original test samples of greater complexity (e.g., including text and/or hierarchical output states of the software function), embodiments select a relevant Machine Learning (ML) model and apply that ML model to generate the corpuses of test data. These are then available for loading to measure one or more performance parameters (e.g., runtime, memory consumption; processing consumption; bandwidth) of the software function. Broadly reported non-linear behavior of performance parameter(s) may reveal lack of suitability of the generated data corpuses for testing. More specific non-linear behavior may indicate failure of the software function to pass certain tests.

Abstract: Technologies are described providing adaptive query routing in a replicated database environment. The technologies can be used with a variety of replication protocols. Prepared statements, such as for queries, from a database client can be routed to a source node, or a source node and available replica nodes, when a replica node becomes unavailable. When a replica node becomes available again, a prepared statement can be updated to indicate that the updated prepared statement can be executed at nodes including the replica node that is available again. Prepared statement routing can also be used when a portion of replicated data becomes unavailable at a replica node, but a portion of replicated data remains available.

Abstract: Disclosed herein are various embodiments a code simplification system. An embodiment operates by determining that a software version of a coordinator node is different from a software version of one or more worker nodes, Commits by the one or more worker nodes to a database are disabled based on the determination that the software versions differ. An update is performed on each of the one or more worker nodes. An acknowledgement that the update on each of the one or more worker nodes has completed is received, and the commits to the database by the one or more worker nodes is enabled.

Abstract: Methods and apparatus are disclosed for efficient factor analysis of a large population of data records, using factors that are categorical variables. Computation is balanced between extracting key factors by training a machine learning classifier on a reduced sample of data records, for computational efficiency, and scoring the categorical values of the key factors on the entire population, for accuracy of results. A joint factor is constructed by combining all proposed root factors, and the sample is generated by stratified sampling on the joint factor. The key factors are selected from candidate factors which can be combinations of the root factors. Original variables of a dataset, whether categorical or not, can be binned to obtain new categorical factors. Variations and user interfaces are also disclosed.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a metadata model definition comprising a set of entity definitions specifying a set of entities, a set of semantic key definitions specifying a set of semantic keys associated with the set of entities, and a set of relationship definitions specifying a set of relationships between the set of entities. The set of semantic keys are configured to be used by an application to refer to the set of entities. The program further determines a set of technical keys for the set of entities. The set of technical keys are configured to be used by the device to refer to the set of entities. The program also stores the metadata model definition and the set of technical keys in a set of records.

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: Systems and methods provide reception of a call to a first function, determination of a first configuration file associated with the first function, the first configuration file indicating a primary function, a secondary function and a relationship between a first property of the primary function and a second property of the secondary function, calling of the primary function and reception of a corresponding first result set, calling of the secondary function, the call to the secondary function including a filter on the second property based on values of the first result set associated with the first property, reception of a second result set corresponding to the call to the secondary function, generation of a composed result set based on the first result set, the second result set, and the relationship, and return of the composed result set in response to the call to the first function.

Abstract: Systems and methods include reception, at a first device, of a wireless communication packet from a second device, determination, at the first device, of a received service identifier included in the wireless communication packet, determination, at the first device, of whether the received service identifier matches a first service identifier or a second service identifier, if the received service identifier matches the first service identifier or the second service identifier, establishment, at the first device, of a connection to a server of the second device using a device address included in the wireless communication packet, requesting, using the connection and at the first device, of a user identifier from the server of the second device, if the received service identifier matches the first service identifier, transmission, from the first device to a remote server, of a first indication of proximity of a user of the first device to a user associated with the user identifier and a second indication of pr