Abstract: A method for performing a multi-fragment index scan operation included in a query pipeline of a query accessing a database table may include performing an index scan on a first chunk of a first fragment of the database table and a second chunk of a second fragment of the database table. A first output of the index scan on the first chunk of the first fragment of the database table and a second output of the index scan on the second chunk of the second fragment of the database table may be merged to generate a partial result set for ingestion by a next operation in the query pipeline. The multi-fragment index scan operation may continue with index scans on subsequent chunks of the first fragment and second fragment of the database table. Related systems and computer program products are also provided.

Abstract: Transient product master data may be used to represent temporarily used objects and resources. Instead of generating complete master data upfront, a placeholder is used in a tracking document for the temporary use. A tracking document for the temporary use includes a placeholder reference. When the product to be used temporarily is selected and ready to be physically moved, attributes and other information of the product may be sent to a management system via an interface. This information may be used to automatically generate transient material master data that is accessible using a reference. This reference may be used to update the placeholder reference in the tracking document and it may be used in further tracking documents.

Abstract: Techniques and solutions are provided for searching for documents upstream, downstream, or both upstream and downstream of a given document, and providing information about relationships between documents in the results. To help users understand relationships between documents, different “voices” can be used in a result display, such as an “active voice” being used for an upstream search and a “passive voice” being used for a downstream search. If desired, results can be limited or filtered, such as limiting a search to a particular relationship type or types, or providing a limit to an amount of indirection between documents. Disclosed techniques can provide more useful information about a document flow, and can reduce computing resources used in generating such displays.

Abstract: Techniques and solutions are provided for determining changes to computing objects based on a change to a related computing object. A model of model objects is created, where a model object represents a computing object of a plurality of computing objects. The model stores information about relationships between the plurality of computing objects. A change to a computing object of the plurality of computing objects is received, and the model is used to determine one or more objects of the plurality of computing objects that are affected by the change, using the relationship information in the model. At least a portion of the plurality of the objects are of differing types.

Abstract: Techniques and solutions are provided for generating allocation tasks for a plurality of tasks requesting one or more instances of an element, the element being associated with a plurality of allocation units. At least one allocation unit is an aggregation unit that comprises multiple instances of the element. Certain disclosed techniques allow for a combination of types of allocation tasks, such as an allocation task that directly allocates one or more instances of an allocation unit to a task, or an allocation task that has subtasks of withdrawing one or more instances of an aggregation unit and then distributing element instances of the aggregation unit or units among a plurality of tasks. Another technique determines whether a multiple of a given aggregation unit can exactly satisfy multiple tasks of the plurality of tasks. Another aspect provides for splitting tasks into groups to allow for more efficient allocation.

Abstract: An intelligent labeling method is disclosed herein. The method can receive a plurality of input instances and access a knowledge graph comprising a plurality of nodes and a plurality of edges connecting the plurality of nodes. The plurality of nodes represent objects and the edges represent relationship between the objects. For at least some selected input instances, the method can identify respective matching objects represented by corresponding nodes of the knowledge graph. A selected input instance shares a common label with the corresponding matching object. For identified matching objects, the method can identify a common class object represented by a corresponding node of the knowledge graph. A percentage of identified matching objects are descendants of the common class object, and the percentage is greater than a predefined threshold. The method can associate a label of the common class object with the plurality of input instances.

Abstract: Systems and methods include configuration of a first database view to read from common versions of rows of a database table or from rows of the database table associated with a first version of the application, the database table storing application content, configuration of a first application server to write to the common versions of rows of the database table, configuration of a second database view to read from common versions of rows of the database table or from rows of the database table associated with a second version of the application, configuration of a second application server to write to rows of the database table associated with the second version of the application, modification of the database table to include rows associated with the second version of the application while the first application server executes the first version of the application and incoming user requests are directed to the first application server, configuration of the second application server to write to common version

Abstract: Automated event monitoring is performed utilizing a Knowledge Graph (KG) constructed by grouping and consolidation of a variety of log Entry Types. A log entry is received by a knowledge graph parser (Kg parser). That parser finds contiguous sub-strings in a log entry that have a parameterized basic-format. The parser figures out which basic-formats are present, where, and with which parameters. Given a sub-string, its basic-format and its parameters, the parser can correctly parse the sub-string to components (e.g., keys and values if a key-value format; fields if a structured format). A result of the parsing is an entity type tree structure. Next, a grouping and consolidation capability functions to modify the KG to incorporate an incoming new entry type structure. The KG may be consumed by a user (e.g., visualization; querying), and may provide an artifact to an event monitoring system to automatically trigger certain actions (e.g., alerts).

Abstract: Provided are systems and methods for creating and managing an interactive process graphs which expedite performance of a multi-user enterprise process between user interfaces and the underlying systems. In one example, a method may include generating a process graph of a user interface process, wherein the process graph comprises nodes corresponding to activities and vertices between the nodes identifying dependencies among the activities, embedding input fields in the nodes of the process graph, embedding, via the process graph, an identifier of a current location of a data object within an instance within the user interface process, and displaying an instance of the process graph corresponding to the instance of the user interface process which includes the embedded input fields in the nodes and the identifier of the current location of the data object within the instance of the user interface process.

Abstract: In an example embodiment, a solution is used to provide container volume replication via a container storage replication log and volume buffer synchronization, which is built on top of a container cloud platform whose container metadata and replication runtime configuration are all managed by a storage manager (a service orchestrated by its job scheduler and service orchestrator). This container volume replication ensures the data security for a long-running service in the container. In the case of any disaster, the in-memory database and application data inside of the container can be recovered via volume replication. This provides container volume replication for long-running containerized applications whose states keep changing.

Abstract: A computer-implemented method can create a node-link model from a hierarchy table, which includes a plurality of records associated with a plurality of objects organized in segments. A record includes a unique identifier, a parent reference, and a value distribution for the associated object. The parent reference is the unique identifier of a parent object directing the value distribution to the associated object. The node-link model includes a plurality of nodes representing the objects and links connecting the nodes and representing value distributions between the objects. The method can generate a visual representation of the node-link model in a user interface and receive an input from the user interface. Responsive to the input, the method can change the visual representation to depict a portion of the node-link model based on a viewable scope of the node-link model and one or more viewable fields specified in the input.

Abstract: Systems and methods include acquisition of a database system workload comprising a plurality of database queries, replay of the database system workload on each of a plurality of database systems to generate a plurality of failed events, each of the plurality of failed events associated with a plurality of attributes, assignment of a root cause to each of the plurality of failed events, and training of a classification model, based on the plurality of failed events an assigned root causes, to infer an output root cause based on an input plurality of attributes.

Abstract: Provided is a system and method which may execute a find operation on a union mount via individual find operations on the underlying file systems that make up the union mount rather than perform the find operation through the union mount itself. As a result, processing time of can be significantly reduced. In one example, the method may include receiving a request for a data item to be retrieved from a union-mounted file system comprising a plurality of layers of files which have been merged together, simultaneously executing, via a file manager, a plurality of find operations on the plurality of layers, respectively, without merging the plurality of layers together, receiving a plurality of sets of search results of the plurality of find operations from the plurality of layers in response to the executing, and merging and displaying the plurality of sets of search results.

Abstract: Programs, systems, and methods for generating electronic reports by a single-action electronic reporting system are described herein. In some embodiments, electronic reporting documents may be generated based on a configuration file. The configuration file may be editable by the user such that the user may select report data types and cumulation data types to be applied to the configuration file for a particular sub-application format. All personnel data associated with employees of a company may be stored such that the personnel data may be accessed and obtained by the single-action electronic reporting system. The user may define the data types, the cumulation data types, and the sub-application for output and presentation of the data.

Abstract: Various examples are directed to systems and methods for operating a database management system (DBMS) in a cloud environment. An assembly worker executing at a first computing device may provide a first database protocol message generated by a process code executing at the first computing device. A translation engine executed at the cloud environment may translate the first database protocol message from a first format to a second format associated with a DBMS instance executing at the cloud environment to generate a translated first database protocol message. The translation engine may cause the translated first database protocol message to be provided to the DBMS instance and may receive, from the DBMS instance, a first reply corresponding to the translated first database protocol message. The first reply may be sent to the process code.

Abstract: A method for processing non-standardized data in a relational database may include identifying, within a sequence of operations forming a query pipeline for executing a query, a first operation ingesting a non-standardized data. In response to identifying the first operation ingesting the non-standardized data, a second operation may be inserted before the first operation. The non-standardized data may be output by a third operation preceding the first operation or a source external to the query pipeline. The second operation may serialize the non-standardized data for ingestion by the first operation, for example, by generating a relational table populated by the non-standardized data. The query may be executed by performing the sequence of operations included in the query pipeline. Related systems and computer program products are also provided.

Abstract: Aspects of the current subject matter are directed to a user-facing approach for migration of unstructured data. A graphical user interface is provided to enable a user to execute a migration process of attachments between content repositories, where the execution is end to end with simple commands and/or user actions through interaction with the graphical user interface. The commands and/or user actions are translated into a background execution of the steps of the migration process in the proper order with proper parameters. Aspects of the current subject matter provide for the migration process to be transparent to the end user. Logs or reports relating to the migration process may be available and accessible to the user.

Abstract: A transaction processing protocol for serverless database management systems can use a transaction scheduler to guarantee consistent serializable execution though analysis of the access pattern of transaction types and appropriate ordering of the transaction's events at runtime. A transaction topology is determined for each type of transaction and these are combined and used to generate a serialization graph. Cycles in the serialization graph are identified and breaking transaction types which may break the cycles are determined. When transaction requests are received, a breaking type of transaction is scheduled as a last transaction in the current epoch and later transactions not having the breaking transaction type are scheduled to execute in the next epoch.

Abstract: The present disclosure involves systems, software, and computer implemented methods for data confidentiality-preserving machine learning on remote datasets. An example method includes receiving connection information for connecting to a remote customer database and storing the connection information in a machine learning runtime. Workload schedule information for allowable time windows for machine learning pipeline execution on remote customer data of the customer is received from the customer. A determination is made that an execution queue includes a machine learning pipeline during an allowed time window. The connection information is used to connect to the remote customer database during the allowed time window. Execution is triggered by the machine learning runtime of the machine learning pipeline on the remote customer database. Aggregate evaluation data corresponding to the execution of the machine learning pipeline on the remote customer database is received and provided to a user.

Abstract: Systems and methods provide a generic factory class to determine one or more classes implementing an interface and/or derived from a base class in response to a call from an application factory class by retrieving a list of the one or more classes implementing the interface or derived from the based class, determining properties of each of the one or more classes, and return, based on the properties, a name of each of one or more of the one or more classes.