Abstract: Technologies are described for improving the performance of distributed database systems. The technologies provide suggested table distributions that can reduce the performance overhead associated with database operations that involve multiple nodes, and can provide more even distribution of computing resource use. In a particular example, a method includes minimizing a scoring function that includes a plurality of performance metrics, at least a portion of the metrics being associated with a weight. Candidate table distributions can be analyzed in an iterative manner to determine a lowest-score distribution. A final table distribution can be output, such as to a user.

Abstract: An interface is provided for process status determination. The provided interface includes logic for process status determination based on analytics rules for evaluation of processes that are executed at an engine, such as a BPM engine. Process instances are executed through the engine. The execution of process instances may be associated with performing execution tasks at external systems. When the process instances are executed through the process engine, process definitions may be stored at a database coupled to the engine. Enhanced metadata is stored for the process instances' executions at a database metadata table. The enhanced metadata may be stored and utilized for process status determination according to the analytics rules. Process status results are generated based on the enhanced metadata. The enhanced metadata may be evaluated according to the defined analytics rules. An aggregation result is generated based on evaluation of the determined process status results.

Abstract: In an example embodiment, software objects of a first database type are delivered to a first schema having a first physical name and stored in the software object database. A definition is created for the first schema including a logical name for the first schema. The first schema is activated by replacing, at a time subsequent to the first schema being delivered to the software object database, the logical name for the first schema stored in the definition with a physical name for the first schema.

Abstract: Data recovery in a database includes performing a backward scan of a transaction log that records transactions made on the database. The backward scan includes traversing log records starting from a latest-in-time log record toward the beginning of the transaction log. Each log record can be replayed to recover data for a database row associated with the log record. An earlier-in-time log record is skipped if the associate database row has been recovered by later-in-time log record.

Abstract: Systems and methods are disclosed for connection multiplexing in a parallel processing environment. An example method includes requesting, responsive to a request to perform multiple database operations in a single transaction, a connection identifier for a physical connection to the database, providing the connection identifier to each of a plurality of workers, and performing the multiple database operations using the plurality of workers. Each worker may obtain a work item from a work queue, initiate a database request for the work item, and provide the database request to a database server. The database request represents one of the multiple database operations and includes the connection identifier. The database server may determine that the connection identifier corresponds to the physical connection, add the request to a connection queue associated with the physical connection, and execute requests from the connection queue against the database via the physical connection.

Abstract: Disclosed herein are system, method, and computer program product embodiments for cache partitioning to accelerate concurrent workload performance of in-memory databases. An embodiment operates by storing a first bitmask, associating the first bitmask with a first processor core, setting a subset of the bits of the first bitmask, wherein the subset of the bits of the first bitmask represents a first portion of shared last-level cache, and wherein any part of the first bitmask excluding the subset of the bits of the first bitmask represents a second portion of the lowest-level cache, and disallowing eviction of any cache line in the second portion of the lowest-level cache by the first processor core.

Abstract: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for test optimization based on actual use of configuration parameters. Actions include receiving a parameter set from a monitoring system, the parameter set including multiple configuration parameters corresponding to development artifacts detected by the monitoring system, retrieving statistical data from a central data analysis infrastructure, the statistical data being retrieved from application systems executing software created out of the development artifacts, processing the parameter set using the statistical data to generate parameter clusters, and providing the parameter clusters to an integrated development environment to generate a test scope proposal based on the parameter clusters.

Abstract: Disclosed herein are system, method, and computer program product embodiments for using a smart shipping to track one or more products contained therein. An embodiment operates by a transporting unit comprising a microcontroller, a transceiver, and a reliever, each of which is in communication with each other. The microcontroller is also in communication with a server external to the transporting unit. The transceiver is configured to o detect a transmitter attached to a product when the product is inside of the transporting unit. The receiver is configured to receive identifying information and a geographical location pertaining to the product. The microcontroller is then configured to send a message containing the identifying information and the geographical location pertaining to the product to the server.

Abstract: Techniques and solutions are described for receiving query results from one or more query services. A system implementing disclosed techniques can receive an identifier for the query used by a query service and an identifier for the query used by the issuing computer system. The query service and the computer system that issued the query can use different schemas for query results. A mapping can be established that maps elements of one schema to the other schema. This mapping, and a mapping of the query identifiers, can be used to convert query results to a format useable by the computing system that issued the query. By converting query results from multiple query services, which may have different formats, to a common format of the issuing computing system, the use of multiple query services is facilitated.

Abstract: Disclosed herein are system, method, and computer program product embodiments for vehicular telematics with virtual-reality monitoring capabilities. An example system may establish a data connection to a plurality of sensors corresponding to at least one component of a vehicle, retrieve status information corresponding to the at least one component of the vehicle, from the plurality of sensors, send the status information retrieved from the plurality of sensors to a data set, receive at least one result of predictive analytics performed with the data set, and generate output via an interface. Other embodiments may additionally place requests for new parts or service based on the at least one result of the predictive analytics. The data set may be a structured database or an unstructured cluster. Big data analytics may use simulations for predictions. Output may leverage virtual reality or augmented reality to improve ease of use and intuitiveness for any role of users.

Abstract: Some embodiments may be associated with a cloud computing environment. A device layer may execute a kernel and determine that a write to disk storage is requested by an application executing in the cloud computing environment. A kernel function at the device layer may mark buffers of a page in a page cache that correspond to the requested write as dirty. An event-driven mechanism may send an event to an entry handler in user space, wherein the event has a block number associated with the dirty buffer as a payload. the block numbers received via events may be accumulated in the user space until it is determined that a pre-determined condition associated with the accumulated block numbers is satisfied. At that point, blocks associated with the accumulated block numbers may be saved to a persistent data store as an incremental backup.

Abstract: Methods and apparatus, including computer program products, for block compression of tables with repeated values. In general, value identifiers representing a compressed column of data may be sorted to render repeated values contiguous, and block dictionaries may be generated. A block dictionary may be generated for each block of value identifiers. Each block dictionary may include a list of block identifiers, where each block identifier is associated with a value identifier and there is a block identifier for each unique value in a block. Blocks may have standard sizes and block dictionaries may be reused for multiple blocks.

Abstract: Secure substring searching on encrypted data may involve a first preprocessing comprising fragmenting a plaintext string slated for remote secure storage, in a plurality of overlapping plaintext substrings. A second preprocessing encrypts these substrings into ciphertexts (e.g., utilizing Frequency-Hiding Order Preserving Encryption) further including position information of the substring. A search index and a secret state result from the first and second preprocessing. The ciphertexts and search index are outsourced to a database within an unsecure server. An engine within the server determines candidate ciphertexts matching a query request received from a secure client. The engine returns ciphertexts to the client for decryption according to the secret state. Preprocessing may be delegated to a third party for outsourcing search index/ciphertexts to the server, and the secret state to the client.

Abstract: A system for query execution and planning with pipelining and shared states for query operators is provided. In some implementations, the system performs operations comprising identifying a plurality of operators for executing a query and generating an indication that a first operator and a second operator share information when the first operator and the second operator require the same data which is not present when the query is received. The operations can further include executing the first operator to generate at least a portion of the data, storing the data in a location based upon the indication, and providing, based upon the indication, the stored data for the second operator. Related systems, methods, and articles of manufacture are also described.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving, by a first dispatcher in a dispatching layer, a first request to run a first task for a first application, the first request including a first application priority. A determination is made that the first application priority is lower than at least one higher application priority of another application. Execution of the first application is suspended based on determining that the first application priority is lower than the at least one higher application priority. An indication that an application having a higher application priority has finished is received. A determination is made that the first application priority is a highest application priority of currently-running applications. The first task for the first application is dispatched to a first application server.

Abstract: Systems and methods are described herein for job execution using system critical threads. An in-memory database system having pages loaded into a memory and having associated physical disk storage generates a safety critical thread pool. The safety critical thread pool has one or more safety critical threads associated with flushing the pages to the physical disk storage. Execution of the one or more safety critical threads is initiated within the safety critical thread pool. A job request to access data stored within the physical disk storage is received. Utilization levels of the one or more safety critical threads are monitored. Execution of the job request is permitted based on the utilization levels associated with the one or more safety critical threads.

Abstract: Authentication data for providing access to a resource to a user is received from a requester. The authentication data encapsulates data required by both a first authentication solution and a second authentication procedure both for providing access to a resource. The first and second authentication solutions can differ in authentication modality with the second authentication solution utilizing at least one machine learning model. Thereafter, using the received authentication data, both of the first and second authentication solutions are initiated. Authentication results are received from both of the first and second authentication solutions. The requester is provided with access to the resource if the both of the received authentication results indicate that authentication of the user was successful. Related apparatus, systems, techniques and articles are also described.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving a request to run a first task for a first application, the request including a first application priority. At least one second application priority of at least one currently running application is identified. A dispatching algorithm is executed, to dispatch the first task to a first application server based on the first application priority and the at least one second application priority. Destination information is returned, in response to the request, for the first application server, for execution of the first task for the first application, at the first application server, using the first resources.

Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a memory optimization system for inverted indexes. An embodiment operates by determining a value identifier corresponding to a value to be searched for in a database based on a query. From a lookup table, a prefix of an offset corresponding to a location in a compressed posting list that identifies row locations where the value is found in the database is retrieved. From a directory page, a suffix of the offset corresponding to the location is retrieved. The offset is generated based on the prefix and the suffix. From the posting list, row identifiers corresponding to the generated offset are retrieved. The retrieved row identifiers are returned responsive to the query.

Abstract: Persisting data in logical tiers of an in-memory database based on aging rules of the database system. The database system can be configured to age data by moving the data from a first logical tier supporting high performance data access to a second logical tier supporting lower performance data access, thereby improving the operational efficiency of the database system.