Abstract: Systems and methods for automated sequencing database generation are disclosed herein. The system can include memory that can include a content library database; a graph database; and a model database. The system can include a user device and at least one server. The at least one server can: receive a content aggregation from the content library database; identify content components of the content aggregation based on a natural language processing analysis of at least a portion of the content aggregation; identify explicit sequencing of the content components; generate an intermediate content graph based on the explicit sequencing of the content components; generate a final content graph from the intermediate content graph based on implicit sequencing of the content components; and store the final content graph within the graph database.

Abstract: Methods, systems, and computer-readable storage media for data migration in an upgrade procedure executed on a software system include actions of initiating the upgrade procedure, determining a first set of tables of a source database that include data to be converted before being first written to a target database, converting data of the first set of tables to provide first converted data, and writing the converted data to one or more tables in the target database.

Abstract: In order to create, at another site, a backup of a volume at a specific time point while minimizing the response time required to update the volume, a first storage apparatus and a second storage apparatus transfer a journal in a first journal volume to the second storage apparatus, the second storage apparatus writes the transferred journal into a second journal volume, the second storage apparatus reads journals in the second journal volume in order of the update, the second storage apparatus reflects the read journals to a second data volume, the first storage apparatus creates, in the first journal volume, a journal including a marker when a specific condition is satisfied, and the second storage apparatus creates a snapshot of the second data volume upon detecting a marker in the read journal.

Abstract: Implementations for searching and analyzing large, object-oriented data sets in an efficient manner involving innovative user interface features and/or search algorithm functionality are disclosed. In one exemplary embodiment, a system may search for information and/or relationships based on specified search criteria and return results that may be displayed dynamically and further filtered or analyzed. Systems may involve object oriented database(s) and a software layer including a specialized user interface between the user and the database(s). The user interface may comprise various tools as well as predefined and configurable features that enable effective search of the data as well as display of search results that are configurable and readily managed to provide immediate and useful search results.

Abstract: Aspects of the present disclosure relate to systems and methods that help a user manage a functional product. Every functional product, be it a service, device, or combination thereof, has one or more documents associated with it. These documents may include such documentation as: (1) Release Notes; (2) Configuration Guides; (3) command line interfaces (CLIs)/application program interfaces (APIs); (4) Data Sheets; (5) Installation Guides; (6) User Manuals; (7) Errata notices; and (8) other documentation. In embodiments, command extracted from the documents along with features available in the functional product and user history (if any) may be used to help suggest one or more commands for a user managing or using the functional product.

Abstract: A computer-implemented method for a partitioned bloom filter merge is provided. A non-limiting example of the computer-implemented method includes partitioning, by a processing device, a bloom filter into N equal size filter partitions. The method further includes distributing, by the processing device, each of the filter partitions to an associated node. The method further includes merging, by the processing device, the filter partitions in each of the associated nodes. The method further includes redistributing, by the processing device, the merged filter partitions to each of the N nodes. The method further includes joining, by the processing device, the merged filter partitions in each of the N nodes to assemble a complete merged bloom filter.

Abstract: Techniques for controlling reactivation of service functions are described. Implementations, for example, enable various ways of controlling and storing service objects that provide service functions.

Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filter node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.

Abstract: A computer-executed method includes storing in a data store data attributes, data objects, and a data analysis tool (DAT). Each data object has an attribute set and an identifier set. The method includes identifying each data object that has an attribute set comprising a data attribute matching each reference data attribute associated with the DAT, and selecting an identified data object as an input data object for the DAT. The DAT generates a new data object as a function of the input data object, which includes analyzing the input data object with reference to an auxiliary data object and creating an identifier set for the new data object that includes an identifier of the new data object for distinguishing the new data object from each other data object in the data store, and the identifier of the auxiliary data object. The new data object is stored in the data store.

Abstract: A method and system are provided that analyze a first digital asset to identify a set of attributes of the first digital asset. Search criteria are then formulated, and a search is conducted. Once search results are obtained, at least one second digital asset that is substantially identical to the first digital asset is identified. Then, metadata between the first digital asset and the second digital asset is shared.

Abstract: Accessing files within user inaccessible lower layer data volumes on a multilayered data volume container is provided. A single dimension variable corresponding to a file request is generated. A file prediction distribution over files in closed lower volumes on the container is calculated by inputting the single dimension variable into a probability density function. A volume closure file recommendation corresponding to a file in a closed lower volume is generated based on the file prediction distribution. The file in the closed lower volume is retrieved.

Abstract: In some example embodiments, a system is provided for executing a primitive call that implements a query operation. The system may include a data processor and a memory. The memory may store instructions that result in operations when executed by the data processor. The operations may include: executing, at an data management engine, the primitive call by at least performing a first operation with respect to a value identifier set, the value identifier set including one or more value identifiers, and the primitive call being configured to access a database storing a plurality of value identifiers; and generating, based at least on a result of the first operation, a result for the primitive call. Related methods and articles of manufacture, including computer program products, are also described.

Abstract: A hybrid deduplication system operates to detect variable-sized deduplication matches, while performing the storage deduplication on fixed-size segments of data. The hybrid deduplication system calculates unique identifiers for variable-sized sections of data within a data stream being written to a deduplicated data store. The hybrid deduplication system then compares those newly-calculated identifiers to identifiers of variable-sized sections of data that have already been stored within the deduplicated data store. If a match is found, the hybrid deduplication system identifies the location of each of the fixed-size data segment(s), already stored in the deduplicated data store, that include the identified variable-sized section of data.

Abstract: Methods, systems and computer program products are provided for generating a playlist. An application programming interface (API) receives a request to generate a playlist, where the request includes a set of rule-primitives. A playlist engine evaluator evaluates a rule corresponding to each rule-primitive in the set of rule-primitives across a catalog of media content, calculates a cost associated with each item in the catalog of media content, and generates a playlist based on the items of the catalog having the lowest costs.

Abstract: The present invention provides an adaptive content generation and dissemination system for generating adaptive content based on a personalized user profile and presenting adaptive content to the user. The system comprises an adaptive and predictive synchronous ecosystem that presents multiple methods for assembling and/or providing content to user terminals, such as, by way of example, content for instruction, training, knowledge transfer, and on-demand help. The present invention utilizes key human sensory learning mechanisms including graphics, video, audio, an/or interactive sessions, to enable different types of learners to efficiently and rapidly consume and thoroughly comprehend complex concepts and detailed information associated with transactions associated with service provider.

Abstract: A data management system accesses a set of vectors containing binary values generates a corresponding set of sequentially ordered vector blocks. Each vector contains a set of two or more binary values and a numerical vector identifier. The data management system generates a block index based on each corresponding set of sequentially ordered vector blocks. The block index includes a set of vector block arrays, each corresponding to a respective sequential position and including one vector block from each of the sets of sequentially ordered vector blocks that are in the respective sequential position. The vector blocks in each vector block array being are ordered sequentially based on two or more sequential binary values in each respective vector block. For each vector block array, the data management system combines pairs of sequentially ordered vector blocks containing matching sets of two or more binary values into combined vector blocks.

Abstract: In one embodiment, a method includes receiving, from a client system of a first user, a text query including one or more n-grams, including an ambiguous n-gram. The method includes searching multiple keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram, each keyword generator having a particular type. The method includes calculating, by a particular scoring algorithm for each keyword generator, a keyword score for each identified keyword suggestion. The scoring algorithm includes multiple weighting factors chosen based on the type of the keyword generator. The method includes generating a set of suggested queries including at least a portion of the text query and one or more identified keyword suggestions and filtering suggested queries from the set based on privacy settings associated with the identified keyword suggestions. The method includes sending, to the client system, instructions for presenting one or more of the suggested queries.

Abstract: Methods, systems, and computer-readable storage media for providing a system that interacts with a plurality of tenant systems, the plurality of tenants including at least a first and a second tenant system, storing tenant-specific content in respective tenant namespaces, the tenant-specific content including first content of the first tenant system stored in a first tenant namespace, and second content of the second tenant system stored in a second tenant namespace, storing shared content in a shared namespace, the shared content including content that is not specific to a tenant in the plurality of tenants, storing an object-oriented data model (OOM) in the shared namespace, the OOM including two or more data objects, and one or more associations between data objects, and processing a request received from one of the first and the second tenant systems based on the OOM, the shared content, and one of the first and second content.

Abstract: One embodiment provides a method including: collecting, from a plurality of collaborative computing systems, system log files comprising a plurality of log messages representing activity within the system, wherein the activity within the system corresponds to system activity and end-user activity; generating a plurality of message templates, each of the plurality of message templates representing an event type by clustering the plurality of messages into groups having similar activity patterns; identifying, from the plurality of message templates, a subset of message templates representing potential end-user events; differentiating end-user events from system events, in the subset of message templates representing potential end-user events, comprising identifying a seed set of event types that represent known end-user events and correlating potential end-user events remaining after identifying the seed set of event types with the known end-user events; and grouping, based upon the differentiating, the event t

Abstract: The disclosed techniques enable push-based piggybacking of a source-driven logical replication system. Logical replication of a data set (e.g., a snapshot) from a source node to a destination node can be achieved from a source-driven system while preserving the effects of storage efficiency operations (deduplication) applied at the source node. However, if missing data extents are detected at the destination, the destination has an extent pulling problem as the destination may not have knowledge of the physical layout on the source-side and/or mechanisms for requesting extents. The techniques overcome the extent pulling problem in a source-driven replication system by introducing specific protocols for obtaining missing extents within an existing replication environment by piggybacking data pushes from the source.