Abstract: A method includes: obtaining, at a server, an observation record describing a condition at a facility; determining, from the observation record, a set of selection criteria corresponding to the condition; retrieving, from a repository connected to the server, a set of data objects according to the selection criteria; generating, from the retrieved data objects, a contextual dataset associated with the condition; and presenting the contextual dataset to a client computing device.

Abstract: A system, server device, and method are provided for managing document metadata. The method includes storing metadata in a graph separately from documents with which the metadata is associated and connecting metadata in the graph according to a hierarchy, with each node of the graph being classified based on metadata content. The method also includes assigning properties to edges in the graph connecting the nodes; receiving, via a communications module, an instruction to update the metadata; and dynamically updating at least one edge or node in the graph according to the instruction without requiring access to an associated document. The method also includes receiving, via the communications module, an inquiry related to a document; and responding to the inquiry, via the communications module, after accessing metadata associated with the document by navigating the graph.

Abstract: A method includes obtaining a query containing at least one field from which data is being queried, obtaining a dataset having a schema-free data exchange format having multiple fields of data at different physical positions in the dataset, and parsing the dataset by obtaining a structural index that maps logical locations of fields to physical locations of the fields of the dataset, accessing the structural index with logical locations of the fields that index to the physical locations, and providing data from the fields based on the physical locations responsive to the query.

Abstract: Methods and systems are disclosed for providing segments of audio broadcasts in responses to user queries. The segments are provided, for example, in real time, with the segments being precise segments responsive to the search query or other search request, located, isolated, and provided to the requesting party or entity. The queried audio segments are found by matching a medium, known as a “word cloud”, obtained based on the query, with audio segments, obtained based on the query. The word cloud is continuously updated with time relevant terms, associated with the subject of the word cloud. The word cloud is applied to the audio segment to obtain the most relevant audio segments, which are resegmented from the audio segment.

Abstract: Techniques are provided for incremental snapshot copy to an object store. A list of deallocated block numbers of primary storage of a computing device are identified. Entries for the list of deallocated block numbers are removed from a mapping metafile. A list of changed block numbers corresponding to changes between a current snapshot of the primary storage and a prior copied snapshot copied from the primary storage to the object store is determined. The mapping metafile is evaluated using the list of changed block numbers to identify a deduplicated set of changed block numbers without entries within the mapping metafile. An object, comprising data of the deduplicated set of changed block numbers, is transmitted to the object store for storage as a new copied snapshot.

Abstract: Systems and methods include obtaining a set of events, each event in the set of events comprising a time-stamped portion of raw machine data, the raw machine data produced by one or more components within an information technology or security environment and reflects activity within the information technology or security environment. Thereafter, a first neural network is used to automatically identify variable text to extract as a field from the set of events. An indication of the variable text is provided as a field extraction recommendation, for example, to a user device for presentation to a user.

Abstract: The present invention provides a seeded news event clustering and retrieval system configured to first create a candidate data set of documents, second create a set of initial clusters based on nearness or duplicate similarity status, and third create an aggregate cluster by merging initial clusters with seed documents. The invention generates top-level clusters for news events based on an editorially supplied topical label or “seed” component and generates sub-topic-focused clusters based on algorithm. The system uses an agglomerative clustering algorithm to gather and structure documents into distinct result sets.

Abstract: There is provided a computer-implemented method of providing a set of alternative search results, the method including the steps of: (i) receiving a search request; (ii) searching a database to provide a first set of a plurality of search results, each search result including a plurality of attributes; (iii) identifying a best search result as the initially highlighted result; (iv) providing the highlighted search result for display; (v) receiving a selection of an attribute in the highlighted search result; (vi) providing the set of alternative search results, in which the selected attribute is varied with respect to the highlighted search result, and (vii) providing the set of alternative search results for display. Related computer program products, servers and systems are also provided.

Abstract: Methods, apparatus, systems, and computer-readable media are set forth for processing exploration and production data to make such data more readily searchable for clients seeking to leverage the data for analytics and other services. The exploration and production data can be processed to generate a graph database that includes multiple nodes and node edges. The nodes can represent different portions of an exploration and production system, and the node edges can represent relationships between the different portions of the exploration and production system. Search suggestions be auto-filled at an interface of the graph database based on data available at the graph database. In this way, a user can be readily provide detailed search queries, without having to be completely cognizant of all the data available in the graph database.

Abstract: At least some embodiments are directed to a system to compute uniform structured summarization of customer chats. In at least some embodiments, the system may operate a processor and receive a corpus of chats between customers and customer service representatives of an enterprise. Grouping the corpus of chats into subgroup task types and then extracting chat keywords and chat related words for each subgroup task type. Generating an expandable template data structures for each subgroup task type. Processing at least one chat to extract chat utterances and chat snippets ranking the chat utterances and chat snippets. Populating the expandable template data structure based on rankings to generate a chat summary data structure.

Abstract: A data management system includes: a transceiver; a memory; and a processor communicatively coupled to the transceiver and the memory and configured to: receive, via the transceiver, a copy data request for unstructured data; access, via the transceiver in response to the copy data request, a plurality of backed-up files of unstructured data stored in a first data storage device; send, in response to the copy data request, a plurality of Virtual Data Files (VDFs) to a second data storage device, the processor being configured to respond to receipt of information from each of the plurality of VDFs to retrieve a respective backed-up file of unstructured data of the plurality of backed-up files of unstructured data stored in the first data storage device.

Abstract: A method of compressive read mapping. A high-resolution homology table is created for the reference genomic sequence, preferably by mapping the reference to itself. Once the homology table is created, the reads are compressed to eliminate full or partial redundancies across reads in the dataset. Preferably, compression is achieved through self-mapping of the read dataset. Next, a coarse mapping from the compressed read data to the reference is performed. Each read link generated represents a cluster of substrings from one or more reads in the dataset and stores their differences from a locus in the reference. Preferably, read links are further expanded to obtain final mapping results through traversal of the homology table, and final mapping results are reported. As compared to prior techniques, substantial speed-up gains are achieved through the compressive read mapping technique due to efficient utilization of redundancy within read sequences as well as the reference.

Abstract: Systems, methods, and devices for tracking a series of changes to database data are disclosed. A method includes executing a transaction to modify data in a micro-partition of a table of a database by generating a new micro-partition that embodies the transaction. The method includes associating transaction data with the new micro-partition, wherein the transaction data comprises a timestamp when the transaction was fully executed, and further includes associating modification data with the new micro-partition that comprises an indication of one or more rows of the table that were modified by the transaction. The method includes joining the transaction data with the modification data to generate joined data and querying the joined data to determine a listing of intermediate modifications made to the table between a first timestamp and a second timestamp.

Abstract: A hybrid dynamic database schema is described. The schema is a hybrid of both horizontal and vertical database schema, in that, while a vertical schema has only one dimension—dimension value pair per table/record, the hybrid schema of the present invention provides for multiple dimension—dimension value pairs per table/record. The schema provides for additional fields, so called “DimSet” fields, with each additional field comprising one and typically multiple dimension—dimension value pairs. Thus, while a vertical database schema can only perform aggregation/segregation using one isolated dimension—dimension pair, the hybrid schema of the present invention is capable of performing multiple aggregations/segregation processes simultaneously (i.e., in parallel) using the multiple dimension fields. The dynamic nature of the database schema is realized by the ability of the schema to support various different additional fields (i.e.

Abstract: The present invention provides a processing of log file data from multiple log files. Log file data from multiple log files are combined together according to timestamp information. A column of the combined log file can refer to different characteristics, depending on which log file the respective line refers to.

Abstract: A core data-based storage method for radial multidimensional documents according to an embodiment includes classifying first documents with same document type information into a preset folder to obtain a classified folder; acquiring the total number of levels of document level information of all non-core documents; and displaying preset target images at core display positions and/or non-core display positions, and setting a corresponding storage link path for each of the displayed preset target images. The documents may be stored by classification and displayed visually.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform: modeling a webpage as a random field, wherein the random field comprises an undirected graph comprising nodes and edges; identifying a cyclic dependency in the undirected graph, wherein the cyclic dependency involves at least three of the nodes; breaking one or more of the edges of the undirected graph that connects the at least three of the nodes in the cyclic dependency; determining a probability of the webpage having exceeded a predetermined threshold based on compatibility functions of the edges, as updated; and sending instructions to display the webpage based at least in part on the probability of the webpage having exceeded the predetermined threshold. Other embodiments are described.

Abstract: In general, the invention relates to a method for managing data, the method includes obtaining data from a host, applying an erasure coding procedure to the data to obtain a plurality of data chunks and at least one parity chunk, deduplicating the plurality of data chunks to obtain a plurality of deduplicated data chunks, generating storage metadata associated with the plurality of deduplicated data chunks and the at least one parity chunk, storing the storage metadata in an accelerator pool, storing, across a plurality of fault domains, the plurality of deduplicated data chunks and the at least one parity chunk, and initiating storage metadata distribution on the storage metadata across the plurality of fault domains.

Abstract: Aspects of the subject disclosure may include, for example, a method, including: receiving, by a processing system including a processor, a request to play content; querying, by the processing system, for matches between the content and a user library; receiving, by the processing system, recommendations for alternate content of the user library and associated cue points in the content; and presenting, by the processing system, portions of the content and presenting other portions of the content replaced with the alternate content at the associated cue points. Other embodiments are disclosed.

Abstract: Pre-computed query results stored at a database server are re-computed by a computation machine. The pre-computed query results are composed of a plurality of shares. Each share includes a certain number of pre-computed query results. The computation resources of the computation machine needed to re-compute a pre-computed query result of a first share depend on whether or not other pre-computed query results of the first share are re-computed during a given time interval forming a current re-computation cycle. The computation machine receives a request to re-compute pre-computed query results of at least a first share, determines a number of pre-computed query results in the first share to be re-computed in the current re-computation cycle based on a Reinforcement Learning algorithm, and re-computes the determined number of pre-computed query results in the first share.