Abstract: Techniques a provided for performing multi-system operations in which changes are asynchronously committed in multiple systems. Metadata about the multi-system operation is injected into the commit logs of one system involved in a multi-system operation. An event stream is generated based on the commit logs of the one system, and is used to drive the operations that one or more other systems need to perform as part of the multi-system operation. A reconciliation system reads the logs of all systems involved in the multi-system operation and determines whether the multi-system operation completed successfully. Techniques are also provided for using machine learning to generate models of normal execution of different types of operations, detect anomalies, pre-emptively send expectation messages, and automatically suggest and/or apply fixes.

Abstract: Computer-implemented techniques for replication-lag constrained deletion of data in a distributed data storage system. In some aspects, the techniques improve the operation of a computing system by preventing too high of a delete rate that causes severe replication lag while at the same time increasing and decreasing the delete rate over time to a maximum allowable delete rate constrained by measured replication lag in terms of both local replication lag and geographic replication lag. In one implementation, the delete rate is adjusted by increasing or decreasing a pause interval that determines how long a database data deletion process pauses between submitting database deletion commands to a database server.

Abstract: Users consume a wide variety of content from various sources, such as videos accessible through websites. As provided herein, content recommendations that are contextually and/or semantically relevant to current content consumed by a user may be identified and provided to the user. For example, metadata for a video being watched by the user may be identified (e.g., terms extracted from a description, user reviews, a category, and/or other information). The metadata may be used to identify content recommendations based upon the metadata corresponding to terms grouped into a set of refined topic groupings of a graph comprising terms and relationships between terms extracted from a content corpus. The metadata may be matched to relevant terms within the set of refined topic groupings, and content recommendations comprising content corresponding to the relevant terms may be suggested to the user.

Abstract: Systems, methods, and articles of manufacture provide for rolling long-term data storage. Optimized or enhanced rolling long-term data storage may, for example, increase processing performance and reduce operational burdens on memory resources associated with execution of analytical models.

Abstract: In accordance with an embodiment, described herein is a system and method for transaction recovery in a multitenant application server environment. At least one resource manager associated with a partition can be designated as a determiner resource for that partition only, in order to support eliminating transaction logs (TLOG) in processing a two-phase commit transaction. A transaction manager can prepare all other resource managers in the mid-tier transactional system before the determiner resource. Furthermore, the transaction manager can rely on the list of outstanding transactions to be committed that is provided by the determiner resource for recovering the transaction. The transaction manager can commit an in-doubt transaction returned from a resource manager that matches the list of in-doubt transactions returned from the determiner resource. Otherwise, the transaction manager can roll back the in-doubt transaction.

Abstract: In accordance with the present disclosure, files may be deduplicated in a distributed storage system having a plurality of storage volumes. A uniqueness metric for each file may indicate a degree of deduplication of the respective data files in the given storage volume. The uniqueness metric may be used to identify files for rebalancing in the distributed storage system. The uniqueness metric may be efficiently calculated with enough accuracy using a sampling methodology.

Abstract: A plant device management system, which is configured to efficiently manage parameter information for field devices, in order for plant engineering, operation and maintenance is disclosed. The plant device management system includes, but is not limited to, a device parameter set manager, which is configured for creating class parameter set, configuring class parameter set, assigning class parameter set, auditing parameters and so forth. The device parameter set manager of the plant device management system may include, but is not limited to, a device parameter set creator tool, a device parameter set configuring tool, a device template manager and a device parameter auditor.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for processing search information. One of the methods includes receiving search information from a user and sending the search information to a cloud server to cause the cloud server to perform search processing based on the search information. The method further includes pushing display information to the user on a display interface before the cloud server returns a result associated with the search processing.

Abstract: Aspects of the disclosure relate to using smart data filters to create multi-threaded profiles. A computing platform may generate a multi-threaded profile corresponding to a user. Thereafter, the computing platform may receive, via the communication interface and from a user device, external event information corresponding to the multi-threaded profile. Then, the computing platform may determine, based on the external event information, a filter bank corresponding to a first thread of the multi-threaded profile. Subsequently, the computing platform may determine, based on the external event information and the filter bank, a time to live parameter corresponding to the external event information. Next, the computing platform may retrieve, from a multi-threaded profile server and based on the multi-threaded profile and the filter bank, first thread information corresponding to the first thread of the multi-threaded profile.

Abstract: First data of a hierarchical data structure is accessed. A directed graph is generated based on the first data. Generating the directed graph includes creating multiple nodes representing the first data and linking first nodes representing data at a particular level of the hierarchical data structure to second nodes representing data at a lower level of the hierarchical data structure. A query requesting information from the hierarchical data structure is received. A particular node, that is a starting point for searching the directed graph based on the query, is identified within the directed graph. Out-links, that link the particular node to other nodes of the directed graph, are identified. Each of the other nodes, that is connected to the particular node by the out-links, is inspected to determine which of the other nodes represents responsive data matching the query. The query is responded with the responsive data.

Abstract: The illustrative systems and methods advantageously reduce the amount of storage space occupied by data that no longer has a useful life—as established by the data objects' user(s) and overcoming predetermined rules required by information management policies. An illustrative data agent may receive instructions from an illustrative storage manager to perform secondary copy operations for a given set of data objects. The instructions may generally instruct that expiry-marked data objects are to be treated based on parsing each data object's user-supplied expiry timeframe.

Abstract: A database system supporting persistent queries, using an enhanced persistent query service and various data sources. On receiving a request to create a persistent query from a client software application, the persistent query service: creates a query virtual table; parses the persistent query; creates a plurality of intermediate virtual tables; establishes listeners for the query virtual table; creates a plurality of data source virtual tables; causes the plurality of data source virtual tables to retrieve initial data from data sources; and propagates data via intermediate virtual tables to the persistent query virtual table.

Abstract: Described herein are systems and methods for replicating an original sequential data volume to a copied sequential data volume. The two sequential data volumes comprise corresponding data blocks with associated write session identifiers. The write session identifiers may correspond to an applicable write operation. When the original sequential data volume is modified, the copied sequential data volume may also be modified for consistency. The write session identifiers of the two data volumes may be sequentially compared to find a mismatch at a modified data block. The data blocks of the copied sequential data volume are replaced, beginning with the modified data block. Instead of replicating the entire original sequential data volume, the modified data block and any subsequent data blocks are replicated in the copied sequential data volume.

Abstract: The invention relates to a query tool for accessing data from an unstructured data source. According to an embodiment of the present invention, the query tool comprises a computer server comprising at least one processor configured to perform: read data from one or more unstructured data sources; initiate one or more registration processes that identifies a file layout for the data; generate a table structure, using the file layout; receive a query request, via the interactive user interface; graphically represent the query request in a graph to facilitate data access; automatically process the query request based on the graph to generate a query result based on the table structure; and transmit the query result to the interactive user interface.

Abstract: Techniques herein minimize memory needed to store distances between vertices of a graph for use during a multi-source breadth-first search (MS-BFS). In an embodiment, during each iteration of a first sequence of iterations of a MS-BFS, a computer updates a first matrix that contains elements that use a first primitive integer type having a first width to record a distance from a source vertex of a graph to another vertex. The computer detects that a count of iterations of the first sequence of iterations exceeds a threshold. Responsively, the computer creates a second matrix that contains elements that use a second primitive integer type having a second width that is larger than the first width to record a distance from a source vertex of the graph to another vertex. During each iteration of a second sequence of iterations of the MS-BFS, the computer updates the second matrix.

Abstract: A seed value assigned to a database table is determined. Numerically ordered invocation numbers are determined. Unordered pseudorandom numbers are generated based on the seed value and the invocation numbers to index temporally ordered data changes to the database table. It is determined whether the total number of yet-to-be-saved pseudorandom numbers reaches a maximum total number threshold. If so, the yet-to-be-saved pseudorandom numbers and a sequence of corresponding invocation numbers are saved in a sync table.

Abstract: Storage space may be allocated from a non-reserved zone of a file system when the file system is not undergoing an online file system check. When the file system is undergoing an online file system check, storage space is allocated from a soft-reserved zone.

Abstract: A blockchain gateway device and associated method of use for reconciling and insuring the consistency of integrated blockchain networks and legacy database-based systems. The blockchain gateway device and associated blockchain scheme harmonizes and reconciles the data elements from multiple independent blockchain databases.

Abstract: Automated Tiered Storage (ATS) has become widely accepted technique in IT industry. Since IO data has different data densities on storage systems, higher storage capacity and improved performance can be achieved by combining two or more storage device tiers having different performance and cost characteristics. These multiple different storage device tiers can be combined into one automated storage pool, which automatically chooses optimal data placement for achieving both the highest performance and the lowest cost. When the storage device tier information can be stored as metadata for each of the data chunks. When there is a system failure and data needs to recovered, the device tier information metadata can be used to restore data to the predetermined optimum storage device tier of the ATS system which shortens the post-recovery warm-up time.

Abstract: A system, method, and computer-readable medium are disclosed for managing the storage, access and synchronization of offline data. A set of online data, which is available for online access, is persisted as a set of offline data in a local storage associated with a user device and a key-value pair is used to cross-reference the first set of online data and the first set of offline data. An access request for a set of data, corresponding to the first set of online data, is received from a user device application. The access request is then processed to determine whether the first set of online data is available for online access. If it is, then the first set of online data is provided to the user device application for processing. Otherwise, the first set of offline data is provided to the user device application for processing.