Abstract: During the presentation of an interactive video, a user may interact with the interactive video by, e.g., making selections, choosing options, etc. related to one or more aspects of the interactive video. Such events and details regarding the events may be recorded, stored, and analyzed in the context of one or more campaigns associated with the interactive video, such as marketing campaigns, advertising campaigns, interactive examinations, etc. Once the details regarding the events have been stored, reports may be extracted based upon the details detailing any desired information relevant to the one or more campaigns.

Abstract: A computing server may continuously update a set of nodes that are addable to a data tree based on past interactions of the user with one or more nodes. The computing server may track a recently interacted set of interacted nodes with which the user has interacted within a number of past interactions. The computing server may select a pool of candidate nodes based on the recently interacted set. At least one of the candidate nodes is within a domain boundary of one of the interacted nodes that is in the recently interacted set. The domain boundary may be determined by the degree of relationship. The computing server may present one or more candidate nodes in the pool as a version of the continuously updated set of nodes. The computing server may update the pool of candidate nodes as additional interactions performed by the user updates the recently interacted set.

Abstract: The present specification describes a computer-implemented method. According to the method, an electronic file to be stored is received and a first context determined for the electronic file. The electronic file is split into multiple segments such that the first context of the electronic file is not discernible from any segment. The multiple segments are then distributed amongst multiple remote storage devices.

Abstract: In various aspects of the present disclosure, systems and methods are described to identify and resolve structured queries so they execute consistently and accurately against any data architecture, and for example, dynamic or unstructured database stores. According to one embodiment, a dynamic schema data system implements a query dialect that is configured to expose underlying flexible schemas of the dynamic schema data system, any structured data, unstructured or partially structured data, and expressive querying native to the dynamic schema system in a language that is compatible with structured queries, and for example, compatible with SQL-92. In further embodiments, the query dialect is configured to enable consistency with existing dynamic schema database query semantics (e.g., the known MongoDB database and associated query semantics).

Abstract: Systems and methods for query generation based on a logical data model with one-to-one joins are described. For example, methods may include accessing a join graph representing tables in a database; receiving a first query; selecting a connected subgraph of the join graph that includes the two or more tables referenced in the first query; accessing an indication that a directed edge of the connected subgraph corresponds to a one-to-one join; modifying the connected subgraph based on the indication to obtain a modified subgraph; generating one or more leaf queries based on the modified subgraph; generating a query graph that specifies joining of results from queries based on the one or more leaf queries; invoking a transformed query on the database that is based on the query graph and the queries based on the one or more leaf queries.

Abstract: Disclosed are a log parsing method and device, a server and a storage medium, relating to the field of network operation and maintenance. The method includes: acquiring (101) sample log data; performing (102) clustering processing on the sample log data according to the length of each sample log in the sample log data, and beginning and ending keywords of each sample log in the sample log data, to obtain a plurality of log clusters; determining (103) a quality score of each log cluster of the plurality of log clusters obtained by the clustering processing; and parsing (104) a log according to the plurality of log clusters and quality scores of the plurality of log clusters.

Abstract: A system and method are presented that utilize separate append-only arrays to track metadata and real data for a file. All modifications to the file result in metadata records being appended to the end of the metadata array. Write modification commands cause real data to be appended to the file data array. The location of real data on the file data array is identified by a record in the metadata array. Modification commands can be grouped into sets, which complete as a set. Modification sets can rely upon the completeness of prior sets. Read-like commands cause the creation of a virtual array based upon the records of the metadata array. The created virtual array has the same size as the actual file but does not contain the real data for the file. Rather, the virtual file array maps to the actual data stored in the file data array.

Abstract: The present disclosure provides a data processing method, apparatus, and device for a graph database, and a storage medium. The method includes: after receiving a writing request for first target graph data, determining a B-tree corresponding to each node in the first target graph data, storing graph data of at least one edge type corresponding to the node into a leaf node of the corresponding B-tree, and storing index information of the leaf node into an internal node corresponding to the leaf node in the B-tree; and determining, in a key-value store system, a key-value pair corresponding to the node in the B-tree, storing an index key of the node into a key of the corresponding key-value pair, and storing the graph data or index information stored in the node into a value of the corresponding key-value pair.

Abstract: A memory tier including persistent memory (PMEM) devices is established in nodes of a cluster system having a deduplicated file system. At least a portion of metadata generated by the deduplicated file system is persisted to the memory tier. The portion of metadata includes an index of fingerprints corresponding to data segments stored by the deduplicated file system to a storage pool. A determination is made that an instance of the deduplicated file system has failed. A new instance of the deduplicated file system is started to recover file system services by loading the index of fingerprints from the memory tier.

Abstract: A method and apparatus for updating data router nodes in a distributed storage system are described. The method can include querying, by a first database agent of a database node, a cache data store for health status metrics of the cache data store. The method can also include storing, by the first database agent of the database node, the health status metrics in a data repository. Furthermore, the method can include obtaining, by a second database agent of a router node, the health status metrics from the data repository, and updating, by the second database agent of the router node, a database topology file based on the health status metrics.

Abstract: The disclosed system links an individual dataset to a database. The system receives a target individual dataset associated with a target individual and identifies candidate individual datasets that are potentially related to the target individual dataset. The system identifies a related individual dataset that has data bits that match some data bits in the target individual dataset. The system then identifies a parent node that is a common parent node to both the target individual dataset and the related individual dataset. The system retrieves a data tree that the parent node belongs to with the data tree containing information describing inter-relationships among datasets in the data tree. A node in the data tree is identified to assign the target individual dataset based on strings of matched data bits and number of the matched strings between the target individual dataset and the datasets in the data tree.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system determines activity features for candidates that match parameters of a search from a moderator of an opportunity, wherein the activity features include an amount of interaction between a candidate and additional moderators and a frequency of visits by the candidate to a platform used to conduct the interaction between the candidate and the additional moderators. Next, the system applies a machine learning model to the activity features to produce activeness scores representing levels of activity of the candidates with respect to the platform. The system then generates a ranking of the candidates according to the activeness scores. Finally, the system outputs at least a portion of the ranking as a set of search results of the search.

Abstract: A method, performed by at least one processor, and an apparatus for augmenting multi-turn text-to-SQL datasets is provided. The method and computer program code include generating an SQL-to-text model to converse with a text-to-SQL model, pre-training the SQL-to-text model and the text-to-SQL model based on input training data, sampling an SQL query as a goal query of an interaction between the SQL-to-text model and the text-to-SQL model, generating the interaction based on the goal query, a current utterance, previous utterances in the interaction, an SQL query from a preceding turn of the interaction, and a serialized database, filtering interactions based on a similarity score between the last turn of the interaction and the goal query, and re-training the SQL-to-text model and the text-to-SQL model based on the input training data and the filtered interactions.

Abstract: The present technology pertains to restoring a directory to a state prior to a past synchronization event. A content management system can present an interface including history of synchronization events for a directory, and a user can select to restore a directory to a state prior to any one of the past synchronization events.

Abstract: Methods for improving performance of tiered storage of a data processing service by detecting and reducing thrashing of data blocks between warm and cold storage tiers are disclosed. In order to understand the frequency of hits by incoming queries to data blocks that are not currently stored in the warm storage tier, the elapsed time between query hits to the respective data blocks may be tracked using timers. Times below a given amount of time may be used to indicate thrashing. For example, recently evicted data blocks that are subsequently hit by a query within a short amount of time since eviction may indicate thrashing. In scenarios in which thrashing may be occurring, a threshold corresponding to the number of times a given data block in the cold storage tier receives a query hit before being added to the warm storage tier may be turned on.

Abstract: A computer-implemented method for efficiently performing a database join in a distributed data processing system comprising multiple computational nodes, the method comprising determining a first set of one or more columns of a first database table and a second set of one or more columns of a second database table on which the join is to be performed; estimating a size of the rows of the first table which have a particular combination of values in the first set of columns; computing a salt factor n based on the estimated size of rows and further based on a processing capacity of a computational node of the distributed data processing system; assigning one of n different salt values to each row of the first table having the particular combination of values in the first set of columns; for each row of the second table having the particular combination of values in the second set of columns into n rows, expanding the row into n row, and assigning to each expanded row a different one of the n salt values; and per

Abstract: Various methods, apparatuses/systems, and media for automatically fixing health of a certain component of an application are disclosed. A processor establishes a communication link between an application and a plurality of data sources each storing raw data related to a certain strategy contract data, wherein the raw data includes a header data and a leg data; accesses the plurality of data sources to obtain the raw data from each data source; identifies from the raw data corresponding leg data based on corresponding leg assignment data associated with the strategy contract data; assigns each identified leg data of the strategy contract data a sub key; combines each sub key to generate a unique combination ID; implements the unique combination ID to derive a character string; and executes the derived character string to link together each strategy contract data received from the corresponding data source based on the corresponding leg assignment data.

Abstract: The present invention provides an image processing apparatus including: an image acquisition unit acquiring a candidate of a query image; a skeletal structure detection unit detecting a two-dimensional skeletal structure of a person included in a candidate of the query image; a query evaluation unit computing an evaluation value of a candidate of the query image, based on a detection result of the two-dimensional skeletal structure; a selection unit selecting a query image out of candidates of the query image, based on the evaluation value; a feature value computation unit computing a feature value of the two-dimensional skeletal structure detected from the query image; and a retrieval unit retrieving an analysis target image including a person in a pose similar to a pose of a person included in the query image out of analysis target images, based on a degree of similarity of the computed feature value.

Abstract: The present disclosure relates to extracting key concepts from digital content items and determining associations between the key concepts and candidate terms for use in generating and presenting a correlation graph object based on the determined associations. For example, systems described herein involve determining frequency of co-occurrence between various key concepts and applying a classification model (e.g., a zero-shot classification model) to the key concepts and candidate terms to determine associations between the key concepts and candidate terms for a given domain of interest. The systems further involve generating a graph object and processing graph queries in a way that enables fast and efficient presentation of slices of the graph object that provide a visual depiction of key concepts and edges representing associations between pairs of the key concepts.

Abstract: An example method for managing datasets produced by alert-triggering search queries may include producing a dataset by executing a search query on a portion of data associated with a time window defined relative to a current time. The method may further include responsive to determining that a portion of the dataset satisfies a condition defining an alert, generating an instance of the alert. The method may further include associating, by a memory data structure, the instance of the alert with an identifier of the query and a parameter specifying a time of execution of the query that has triggered the instance. The method may further include receiving a request for the dataset portion. The method may further include substituting, in a definition of the time window, the current time with the time parameter. The method may further include reproducing the dataset portion by re-executing the query using the time window.