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 method for managing data from different sources into a unified searchable data structure is an application to manage a data library to increase the accuracy and efficiency for retrieving information. The method is intended to be used by employees of individual organizations to find and reference commonly used websites, electronic files, documents, or templates within the organization. The end-user is able to import content from an external source. Metadata from the external source and that specific end-user's behavior influences a set of content tags associated with a content reference for the external source. The content reference is a pointer to the external source to allow the present invention to display the external source along with the set of content tags to the user who navigated or searched within the application.

Abstract: Random cut trees are generated with respective to respective samples of a baseline set of data records of a data set for which outlier detection is to be performed. To construct a particular random cut tree, an iterative splitting technique is used, in which the attribute along which a given set of data records is split is selected based on its value range. With respect to a newly-received data record of the stream, an outlier score is determined based at least partly on a potential insertion location of a node representing the data record in a particular random cut tree, without necessarily modifying the random cut tree.

Abstract: Systems and methods are disclosed for processing queries against multiple dataset sources. One dataset source can include indexers that index and store data. The system can receive a query that identifies a set of data to be processed and a manner of processing the set of data. The set of data can include a first dataset that is accessible by one or more indexers and a second dataset that is accessible by one or more other dataset sources. A query coordinator can define a query processing scheme for obtaining and processing the set of data that includes a dynamic allocation of multiple layers of partitions. The partitions can operate on multiple worker nodes. The query can then be executed based on the query processing scheme.

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: Techniques for dynamically generating deeplink search results in response to navigational search queries. In an aspect, to address user search queries, a general-purpose search engine is provided in parallel with a dedicated engine for specifically ranking deeplinks. Upon identifying a received query as a navigational query, a parallel query is generated from a common domain and user query, and provided to the dedicated engine. The engine accesses relevant deeplink URL's from a search index, which may be frequently refreshed and updated with the most recent Web contents. Ranking of deeplink URL's may be performed according to an algorithm that processes query-level features and document-level features of URL's to be ranked. In an aspect, the algorithm may be trained from search engine logs and/or Web browser logs, by calculating a Log-based Normalized Discounted Cumulative Gain (LNDCG) designed to quantify relevance of search results to queries based on user click behavior.

Abstract: A method for adapting data for changes in attributes associated with the data (e.g., data related to an enterprise) may include techniques for modifying attributes associated with data corresponding to a change in those attributes based on a change in a product (e.g., an application, a computer system, a computer program product, or a service). The data adaptation techniques may include determine attributes that have changed based on adaptation information that indicates changes in attributes associated with data accessed by the product. The adaptation may indicate conditions for those changes, such as a condition that indicates a change to an attribute corresponding to a change from one version of a product to another version of the product. Upon determining that a condition for a change to an attribute has occurred, the attribute may be modified based on the change.

Abstract: Described herein is a method, system, and non-transitory computer readable medium for preventing data loss from both producer and consumer systems in continuous availability event-driven applications. The process for preventing data loss may replicate events at the broker level, and selectively receive replica events at the consumer level to account for the case the originally sent event is not received, while conserving computer and network resources. Alternatively, events and replica events may be received in duplicate. In either mode of reception, machine-learning may be used for implementing algorithms which further help to conserve resources and aid in preventing further data loss.

Abstract: Systems and methods for replicating containers in object storage using intents are disclosed. A DS processing unit, upon reception of a write request may determine the location of replicated instances for the container. DS processing unit can then generate an intent for each fork, to indicate a specific write request received. The DS processing unit may save or persist intent objects within one of the containers, or in a dispersed data structure. A DS unit or DS processing unit may then check for intents whose operation has not been completed, and when resources to perform the operation are available, perform the operation specified in the intent. DS processing unit can remove a pending intent once the job or operation is complete. A clean-up agent could run periodically to complete unfinished jobs that are pending within DS processing unit or DS unit due to containers not being available for whatever reason.

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: The present disclosure provides improved systems, methods, and computer readable media for blending data from data sets that reside on different systems. This is done by generating subqueries from a main data model blend query, sending the subqueries to respective separate systems, accessing the results to all subqueries at a primary system, and performing a blend based on the main data model blend query at the primary system.

Abstract: A system indexes a first backup file, created for a data object when a first time period expired, in a first level of a data structure. The system indexes a second backup file, created for the data object when a second time period expired, in a second level of the data structure, the second time period being shorter than the first time period. The system receives a request to restore the data object to a specified time. The system enables restoration of the data object by identifying a first indexed backup file associated with the specified time in the first level of the data structure, by identifying a part of the second level of the data structure corresponding to the first indexed backup file, and by identifying a second indexed backup file associated with the specified time in the part of the second level of the data structure.

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: A graph database management system includes a computing system in communication with a distributed computing environment comprising a plurality of elements and a database that stores element records associated with corresponding elements of the distributed computing environment. The computing system generates a graph database having a plurality of vertices representing the element records of the distributed computing environment and at least one edge representing a specified relationship between at least one pair of the element records. Thereafter, the computing system may receive a request to view the vertices associated with the at least one pair of element records and their associated edge, and facilitate the display of the vertices and their associated edge on a display in response to the request.

Abstract: Various aspects of the subject technology relate to systems, methods, and machine-readable media for searching and presenting undiscovered images. A system may receive a first user input specifying a search query for content from a client device. The system may initiate an image search in response to receiving the search query. The system may provide a first search result comprising a first list of images to the client device. The system may receive a second user input selecting an image from the first search result from the client device. The system may provide a second search result comprising a second list of images to the client device, based on the second user input, a similarity index, and a filtering criteria.

Abstract: Various methods and systems for providing query result items using an item title demand model are provided. A query is received at a search engine. Based on receiving the query, an item title demand engine is accessed. The item title demand engine operates based on an item title demand model which uses token weights, representing skip probabilities of tokens in item titles, to determine title scores for result item titles for corresponding queries. Based on accessing the item title demand engine, one or more result item titles for the query are identified from items in an item database. An identified result item title is identified based on a title score determined using the item title demand model and a highest skip probability of a token in the result item title. The one or more result item titles are communicated to cause display of the one or more result item titles.

Abstract: An apparatus in one embodiment comprises a processing platform having one or more processing devices. The processing platform is configured to obtain metadata characterizing a plurality of data sets, to generate data set operational signatures for respective ones of at least a subset of the data sets based at least in part on the obtained metadata, and to automatically perform one or more management operations for each of one or more of the data sets based at least in part on respective corresponding ones of the data set operational signatures. The processing platform may be further configured to implement a target signature for a particular data set management policy, and to automatically perform a particular management operation for a given one of the data sets based at least in part on a result of a comparison of the data set operational signature for the given data set to the target signature.

Abstract: Embodiments of the present invention relate to the field of computer technologies, and provide a search method and apparatus to resolve a problem that a reference text, of a text in a professional field, that is determined by using the prior art has relatively low accuracy. The method includes: obtaining n named entities in a current to-be-analyzed target case (S300); determining a first characteristic and a second characteristic (S301); generating, based on the first characteristic and the second characteristic and according to a preset vector generation rule, a target characteristic vector corresponding to the target case (S302); obtaining each historical case in a database and a characteristic vector corresponding to each historical case (S303); and separately calculating a similarity between the target characteristic vector and the characteristic vector corresponding to each historical case, and selecting a historical case whose similarity result meets a preset condition as a reference case (S304).

Abstract: Systems, methods, and computer-readable media provide entity relation extraction across sentences in a document using distant supervision. A computing device can receive an input, such as a document comprising a plurality of sentences. The computing device can identify syntactic and/or semantic links between words in a sentence and/or between words in different sentences, and extract relationships between entities throughout the document. A knowledge base (e.g., a table, chart, database etc.) of entity relations based on the extracted relationships can be populated. An output of the populated knowledge base can be used by a classifier to identify additional relationships between entities in various documents. Machine learning can be applied to train the classifier to predict relations between entities. The classifier can be trained using known entity relations, syntactic links and/or semantic links.

Abstract: A method may include receiving a continuous query identified by an archived relation associated with an application. The method may also include generating a physical query plan. Additionally, the method may include constructing a structured query language (SQL) equivalent expression corresponding to an attribute utilized by the operator and/or constructing an output SQL expression for the identified operator based at least in part on the SQL equivalent expression. Additionally, the method may include constructing the archiver query for the identified operator based at least in part on the output SQL expression. Further, the method may include executing the archiver query to obtain a result set of data records related to the application and/or generating a snapshot output of one or more data values related to the application based at least in part on the result set of data records.