Abstract: A system, method, and computer-readable medium, including authoring and consolidating a semantic layer universe and at least one semantic layer extension (e.g., a collection of semantic layer entities) created on top of the objects of the semantic layer universe, the semantic layer universe and the one or more semantic layer extensions being linked via a repository relationship; and dynamically presenting a consolidated view of relevant objects from the semantic layer universe and possibly entities of the at least one semantic layer extension to provide a user with additional querying metadata.

Abstract: A method, a system, and a computer program product for decompressing data. One or more compressed blocks in a set of stored compressed blocks responsive to a request to access data in the set of stored compressed blocks are identified. String prefixes inside the identified compressed blocks are decompressed using front coding. String suffixes inside the identified compressed blocks are decompressed using a re-pair decompression. Uncompressed data is generated.

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: 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: 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: 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: 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: 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: 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: Connectivity between remote networks is managed by a central engine that collects and stores network data such as network addresses, URLs, hostnames, and/or other information. The engine creates a tunnel proxy, as well as separate respective tunnels with the remote networks. Based upon network data, the engine references the tunnel proxy to create a logical link joining the respective tunnels. Data can then flow between the remote networks through the logical link. The logical link may exist for only a limited time, e.g., as determined by a timer. Certain embodiments may be particularly suited to empower a customer network to manage connectivity with the remote network of a support provider. The customer can initiate connectivity changes without the manual involvement of the support provider. The customer can also authorize the support provider to manage connectivity and initiate changes under prescribed conditions.

Abstract: An employee data replication system receives a request to replicate employee data hosted by a host system. At least one of: a live date corresponding to when the employee data is to be live on the enterprise system or a selection of one or more applications to be used on the enterprise system is identified. A cutoff date for the employee data is calculated based on one or more of the live date and the selection of one or more applications, the cutoff date indicating an oldest date for which the employee data is to be replicated to the enterprise system. Employee data is replicated from the host system to the enterprise system based on the cutoff date, and an indication is provided that the replication has completed.

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.

Abstract: Systems and methods include detection of changes to data of a plurality of source objects of a source system, replicating the data changes to corresponding ones of the plurality of target objects, and, during the detection of changes to data and the replication of the data changes: detecting a first change to a first source object, identifying a first maintenance event based on the detected first change; determining a first one or more solutions to resolve the first maintenance event; presenting the first maintenance event and the first one or more solutions to resolve the first maintenance event to a user; receiving an indication from the user of a first solution of the first one or more solutions to resolve the first maintenance event; and, in response to the indication, executing the first solution.

Abstract: A method may include determining a threshold quantity of attempts to optimistically perform a first transaction operating data stored in a database. The threshold quantity of attempts may be determined based on an expected workload of the first transaction and/or a workload at the database. The first transaction may be performed optimistically including by tracking cache lines accessed by the first transaction and detecting, based on a second transaction writing to a cache line accessed by the first transaction, a conflict between the first transaction and the second transaction. If the first transaction is not successful performed after the threshold quantity of attempts to optimistically perform the first transaction, the first transaction may be performed in a fallback mode including by acquiring a lock to prevent the second transaction from accessing a same data in the database as the first transaction. Related systems and articles of manufacture are also provided.

Abstract: A data storage and retrieval system for a computer memory including a memory slice formed of segments and adapted to contain one or more documents and a checkpoint adapted to persist the memory slice. The checkpoint includes a document vector containing a document pointer corresponding to a document. The document pointer including a segment identifier identifying a logical segment of the memory slice and an offset value defining a relative memory location of the first document within the identified segment. There are checkpoint memory blocks, each storing a copy of a corresponding segment of the memory slice. The segment identifier of the document pointer identifies a checkpoint memory block and the offset value of the document pointer defines a relative location of the document within the checkpoint memory block.