Abstract: A log-structured data store implementing data backup may implement variable data replication. Write requests may be received at different storage nodes maintaining respective replicas of a portion of a log for data maintained in the log-structured data store. Log records indicating the write requests may be stored in the respective replicas of the log portions at the different storage nodes. The log records may be sent to a backup data store to be durability persisted as part of an archived version of the log. At some of the storage nodes, in response to determining that the log records have been durably persisted in the backup data store, storage space for the log records may be reclaimed. In other remaining storage nodes, the log records may be retained and made accessible for servicing read requests.

Abstract: A data caching method, a node, a machine learning framework and a file system client based on hyper-converged infrastructure are provided. In the data caching method, a computing program requests a computing node to prefetch computing data prior to using the computing data. Then, the computing node acquires and stores the computing data in a cache memory as requested by the computing program. Subsequently, as the computing program requests the computing node to discard the computing data, the computing node discards the computing data from the cache memory as requested by the computing program.

Abstract: An event-related media management system contextualizes media content. The event-related media management system associates media content with contextual event-related data to associate the media content with the events and information about the events. The contextual event-related data can then be used to provide access to the media content, such as through relevant search results or by presenting the media content in organized displays for contextual browsing and navigation. In some embodiments the event-related media management system generates contextualized media content for contextual search, discovery, and advertising.

Abstract: A method may include receiving a data file comprising receivable information associated with at least one transaction; detecting that the data file fails to conform to a defined format; separating the receivable information into a plurality of fields; receiving input identifying remittance information in the plurality of fields; reformatting the data file according to the input into a reformatted data file; and transmitting the reformatted data file for processing of the remittance information.

Abstract: A system and method for customer interaction and experience enhancement which automatically gathers direct and indirect customer communications about products and services, converts them to text where necessary, and analyzes the communications for sentiment and emotional content, and scores and displays the information in a manner conducive to making business decisions based on the customer sentiment and emotion, such as making changes to products or services, troubleshooting customer service interactions, and better marketing.

Abstract: A system and method for improved categorization and sentiment analysis which is fed textual data such as transcriptions or collated data from a network enabled service, or some other source, which then segments textual data into chunks, parses the data chunks, and analyzes it using a plurality of techniques and metadata gathering methods to determine the sentiment of participating individuals concerning entities mentioned in the textual data and to categorize the discussions, for the purpose of taking actions to improve business outcomes.

Abstract: Methods, information handling systems and computer readable media are disclosed for generation of consistent structured data hash values across platforms and structured data formats. In one embodiment, a method includes identifying, at an information handling system, a set of data segments within a set of structured data and expressing the set of structured data in a standard format. This embodiment of the method further includes, for each of the data segments within the set of data segments, applying a hash algorithm to produce a data segment hash value and obtaining a standardized identifier for the data segment. The method continues with assembling an aggregate hash code comprising the standardized identifier and the data segment hash value for each of the data segments, and confirming an association of the aggregate hash code with the set of structured data.

Abstract: Various aspects of the subject technology relate to methods, systems, and machine-readable media for generating histograms according to a set-theoretic approach. The method includes receiving a command to generate at least one histogram from selected data, the selected data comprising a plurality of column groups. The method also includes identifying a superset from the plurality of column groups. The method also includes materializing, in a memory, a superset multi-column group for the superset. The method also includes identifying at least one subset of the superset from the plurality of column groups, the at least one subset comprising at least one column group. The method also includes processing the at least one subset of the superset to form a grouped resultset. The method also includes generating the at least one histogram for the grouped resultset of the at least one subset of the superset.

Abstract: A system for reducing database query latency, the system comprising: a memory storing instructions; and at least one processor configured to execute the instructions to perform operations comprising: receiving data reflecting performance of a role on a virtual server; identifying tokens associated with terms in the received data; mapping an index comprising the tokens and the terms; storing the mapped index in a first database; storing a key-value pair in a second database, the key corresponding to the mapped index, and the value corresponding to a portion of the received data; receiving a query; optimizing the query to reduce query processing time; constructing a search key based on results obtained by running the optimized query against the first database; retrieving a result value from the second database corresponding to the search key.

Abstract: The present teaching relates to ranking search content. In one example, a plurality of documents is received to be ranked with respect to a query. Features are extracted from the query and the plurality of documents. The plurality of documents is ranked based on a ranking model and the extracted features. The ranking model is derived to remove one or more documents from the plurality of documents that are less relevant to the query and order remaining documents based on their relevance to the query. The ordered remaining documents are provided as a search result with respect to the query.

Abstract: Approaches for parallelized data deduplication. An instruction to perform data deduplication on a plurality of files is received. The plurality of files is organized into two or more work sets that each correspond to a subset of the plurality of files. Responsibility for performing each of said two or more work sets is assigned to a set of nodes in a cluster of nodes. The nodes may be physical nodes or virtual nodes. Each node in the set performs data deduplication on a different work set. In performing data deduplication, each node may store metadata describing where shared chunks of data are maintained in a distributed file system. The shared chunks of data are two or more sequences of bytes which appear in two or more of said plurality of files.

Abstract: The present teaching relates to recommending content by analyzing the streamed data. A request is received from a user requesting one or more recommendations from a set of items. A first distribution indicative of an interest distribution of the user in a plurality of topics is obtained. For each item, a second distribution indicative of a classification distribution of the item with respect to the plurality of topics is obtained. A score is estimated based on the first distribution and the second distribution, wherein the score indicates likelihood that the user is interested in the item. The scores associated with the set of items are ranked. The one or more recommendations are presented based on the ranked scores.

Abstract: The present disclosure involves systems, software, and computer implemented methods for compressed columnar data search using fingerprints. One example method includes compressing columnar data that includes dividing the columnar data into multiple data blocks and generating a fingerprint for each data block, storing the compressed columnar data and the generated fingerprints in an in-memory database, receiving a query for the columnar data, for each in-memory data block stored in the in-memory database, determining whether the in-memory data block satisfies the query and in response to a determination that the in-memory data block does not satisfy the query, pruning the in-memory data block from the multiple data blocks to generate an unpruned set of data blocks, decompressing the unpruned set of data blocks, and performing a query search on the decompressed unpruned set of data blocks for the received query.

Abstract: A system gathers information on important and influential people and builds a social graph. The system regularly sends news alert messages to users. This can help users nurture their relationship with persons they are connected to, by providing them with updates on news and other events that happen to persons they are connected to. The watch can be customized with a variety of options, such as including related entities, organizing news alerts with user data, and other options.

Abstract: A method is described for processing keyed data items that are each associated with a value of a key, the keyed data items being from a plurality of distinct data streams, the processing including collecting the keyed data items, determining, based on contents of at least one of the keyed data items, satisfaction of one or more specified conditions for execution of one or more actions and causing execution of at least one of the one or more actions responsive to the determining.

Abstract: An instruction is provided for performing a vector string search. The instruction to be processed is obtained, with the instruction being defined to be a string search instruction to locate occurrence of a substring within a string. The instruction is processed, with the processing including searching the string specified in one operand of the instruction using the substring specified in another operand of the instruction. Based on the searching locating a first full match of the substring within the string, a full match condition indication is returned with position of the first full match in the string, and based on the searching locating only a partial match of the substring at a termination of the string, a partial match condition indication is returned, with the position of the partial match in the string.

Abstract: Example storage systems and methods provide data storage management using parallel processing of filtered transaction logs. Transaction logs are comprised of log entries corresponding to storage operations for at least one storage node. Sets of log entries are sequentially retrieved from the transaction log and filtered through multiple transaction log filters to generate multiple subsets of the log entries. Different metadata operations are executed in parallel using the different filtered subsets of log entries.

Abstract: A program stored on non-transitory computer-readable storage medium executes a method of evaluating a graph over a query. Decomposition instructions decompose the query into a plurality of subqueries. Evaluation instructions evaluate a subquery of the plurality of subqueries and generate a substitution multiset representing a result of the evaluation of the subquery. Filtration instructions or expansion instructions may operate upon the generated substitution set before passing the substitution set to a next subquery to be evaluated. The filtration instructions identify one or more mappings in the substitution multiset that cannot be safely passed to the second subquery and delete the identified one or more mappings from the substitution multiset. The expansion instructions determine, in a case where the subquery is operated upon by a non-distributive query operator, an expansion of the substitution multiset based at least on adding one or more new substitutions to the substitution multiset.

Abstract: Embodiments of systems and methods for information retrieval are disclosed. Embodiments of such systems and methods may perform information retrieval based on a language model that is used to generate a single vector for the search terms of a query. Similarly, a single vector representation of each of the data records to be searched is obtained and the single vector representing the search terms of the query compared to the single vector of each data record to determine a similarity metric. The resulting similarity metrics associated with each of the data records can be used to rank, present or return one or more data records.

Abstract: A computer-implemented method includes receiving a query specifying an operation to perform on a first table of a plurality of data blocks stored. Each data block in the first table includes a respective reference count indicating a number of tables referencing the data block. The method also includes determining that the operation specified by the query includes copying the plurality of data blocks in the first table into a second table and, in response, for each data block of the plurality of data blocks in the first table copied into the second table, incrementing, the respective reference count associated with the data block in the first table, appending, by the data processing hardware, into metadata of the second table, a reference of the corresponding data block copied into the second table.