Abstract: A collection of data is displayed. A filter user input is received from a user in order to filter the data. The filter user input can be on a grid-based filter, it can be on a filter pane, or on a column header filter. The data is filtered, based upon the filter user input, and the filtered data is displayed.

Abstract: An apparatus and a computer-implemented method for processing data are disclosed. The apparatus comprises a memory device that stores first history data, and at least one processor configured to modify a first portion of the first history data, transmit first information to a recipient device reflecting the modification to the first portion of the first history data, determine that the recipient device has modified a second portion of the second history data associated with the first portion based on the first information, receive input data, and responsive to the confirmation, transmit one or more reference tokens reflecting a relationship between the modified first history data and one or more portions of the input data, wherein the one or more first reference tokens allows the recipient device to reconstruct the one or more portions of the input data from the modified second portion of the second history data.

Abstract: The present disclosure discusses systems and methods for replicating backups between deduplicated storage devices. Differences between related backups may be identified, and only those differences may be transferred. This may minimize data transfer and optimize resource consumption.

Abstract: Systems and methods for searching for a media asset are described. In some aspects, the system includes control circuitry that receives a first search query from a user. The control circuitry identifies media assets related to the first search query from a content database. The control circuitry receives a second search query following the first search query. The control circuitry determines whether a media asset from the media assets is related to the second search query. In response to determining that less than a threshold number of media assets from the media assets are related to the second search query, the control circuitry transmits an instruction requesting the user to repeat the second search query. The control circuitry receives a third search query related to the first search query. The control circuitry determines a media asset from the media assets that is related to the third search query.

Abstract: According to one embodiment of the present invention, a system maps one or more virtual relations to a table of a relational database management system. The system generates a structured query language (SQL) statement for the table from a SQL statement for a virtual relation by applying the mapping to one or more elements of the SQL statement for the virtual relation. Embodiments of the present invention further include a method and computer program product for mapping virtual relations to a table in substantially the same manners described above.

Abstract: According to one embodiment of the present invention, a system maps one or more virtual relations to a table of a relational database management system. The system generates a structured query language (SQL) statement for the table from a SQL statement for a virtual relation by applying the mapping to one or more elements of the SQL statement for the virtual relation. Embodiments of the present invention further include a method and computer program product for mapping virtual relations to a table in substantially the same manners described above.

Abstract: This document relates to trend response management. One example can detect a trending topic and identify content associated with the trending topic. The example can take an action relating to the content that decreases a trend-induced processing spike and/or enhances a user search experience associated with the trending topic.

Abstract: A system and method is provided in which access patterns of data blocks are used to predict future accesses to the data blocks. One of the types of patterns that may be used in connection with the system described herein is depended blocks. Dependent blocks are blocks that are often referenced one after another in a short period of time. For example, one block (block b) is commonly referenced after another block (block a) a noted time period. The system described herein provides a block dependency algorithm that enables a search task involving searching of block dependencies with respect to proposed dependency definitions. In an embodiment, the search task may be performed based on using of a branch and bound methodology. A search tree is built in which a set of activity vectors (V) are ordered, and a search algorithm is used to traverse and “prune” branches of the tree.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for predicate application using partial compression dictionary match. A search strategy is developed for each predicate to be applied to compressed data. The compressed data is searched using the search strategy to locate the compression symbols identified in the search strategy. In response to locating a compression symbol from the search strategy in the compressed data, a respective row and applying the predicate is decompressed and a respective row that matches the predicate is returned to a database engine or an application.

Abstract: Apparatus and systems, including computer program products, implementing and using techniques for predicate application using partial compression dictionary match. A search strategy is developed for each predicate to be applied to compressed data. The compressed data is searched using the search strategy to locate the compression symbols identified in the search strategy. In response to locating a compression symbol from the search strategy in the compressed data, a respective row and applying the predicate is decompressed and a respective row that matches the predicate is returned to a database engine or an application.

Abstract: A system can provide unique user metrics associated with a node in a hierarchy and the node's decedents in real time. This can occur by merging sketches of the node and its decedents to form a merged sketch, and retrieving the unique user metrics from the merged sketch. The sketches and the merged sketch may each be a separate data form, such as a hash. The hierarchy may include an online content taxonomy and the sketches of each node may include unique user metrics associated with the node, such as user interaction metrics associated with a category of content of the node. The system may build sketches for the nodes of a hierarchy, associate each sketch with its ancestor sketches, invert the associations, tie corresponding descendant sketches of an ancestor sketch based on the inversions, and merge the descendant sketches with their ancestor sketches to generate the merged sketches.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for storing semi-structured data. One of the methods includes maintaining a plurality of schemas; receiving a first semi-structured data item; determining that the first semi-structured data item does not match any of the schemas in the plurality of schemas; and in response to determining that the first semi-structured data item does not match any of the schemas in the plurality of schemas: generating a new schema, encoding the first semi-structured data item in the first data format to generate the first new encoded data item in accordance with the new schema, storing the first new encoded data item in the data item repository, and associating the first new encoded data item with the new schema.

Abstract: According to one embodiment of the present invention, a system with a plurality of memories, generates a first filter associated with a first memory, and generates one or more second filters each associated with a corresponding memory. Each second filter is generated with a size at least partially accommodated within the storage capacity of the associated memory. The system determines absence of items from a set by selectively probing the generated filters in an ascending order of data access speed to the associated memories and aborts further probing for an item in response to a probe indicating that the item is absent from the set. Embodiments of the present invention further include a method and computer program product for testing set membership in substantially the same manners described above.

Abstract: According to one embodiment of the present invention, a system with a plurality of memories, generates a first filter associated with a first memory, and generates one or more second filters each associated with a corresponding memory. Each second filter is generated with a size at least partially accommodated within the storage capacity of the associated memory. The system determines absence of items from a set by selectively probing the generated filters in an ascending order of data access speed to the associated memories and aborts further probing for an item in response to a probe indicating that the item is absent from the set. Embodiments of the present invention further include a method and computer program product for testing set membership in substantially the same manners described above.

Abstract: A replication chain comprising one or more replication nodes of a multi-tenant stream management system is assigned to store data records of a partition of a particular data stream. A data record of the partition is received at a selected replication node of the replication chain. In a sequential order, a respective replica of the data record is stored at each replication node of the chain. An acknowledgement of a successful storage of the data record is provided after the replications are completed.

Abstract: A user feedback module, executable by a processing device from memory is disclosed. The user feedback module receives from a user device a selection of a seed media item. The seed media item includes a seed label. The user feedback module further generates a list, the list includes the seed label and a set of related labels based on the seed label. The seed label and each related label include a separate label weight. The user feedback module also identifies multiple media items associated with an associate label. The associate label includes at least one of the seed label or a related label of the first set of related labels. The user feedback module also transmits to the user device a first media item from the multiple media items. The user feedback module adjusts the label weight of the associate label based on a user feedback on the first media item.

Abstract: In accordance with aspects of the disclosure, systems and methods are provided for normalizing data representing entities and relationships linking the entities including defining one or more graph rules describing searchable characteristics for the data representing the entities and relationships linking the entities, applying the one or more graph rules to the data representing the entities and the relationships linking the entities, identifying one or more matching instances between the one or more graph rules and the data representing the entities and the relationships linking the entities, and performing one or more actions to update the one or more matching instances between the one or more graph rules and the data representing the entities and the relationships linking the entities.

Abstract: Described are techniques and systems to migrate data from a first data structure to a second data structure stored in datastores which are replicated with one another. A “hot” datastore is replicated with one or more “warm” datastores. Triggers maintain consistency between the first data structure and the second data structure. Migration may involve testing using the second data structure of the “warm” datastore. Data processed by the first data structure on the “hot” datastore is distributed via replication to the “warm” datastore, and then by a trigger to the second data structure. Data processed by the second data structure on the “warm” datastore is distributed via trigger to the first data structure, and then by replication to the “hot” datastore. Once performance of the second data structure is deemed acceptable, the “warm” datastore may be designated as “hot” and synonyms therein may direct data to the second data structure.

Abstract: A method for determining a common sequence of statements from one or more sets of ordered statements. A data object is created that has a first group of data entries, which is created from a first sequence of statements of a first set of statements. Each data entry defines a link between a source and destination statement from the first sequence. Data entries created from a second sequence of statements of a second set are added to the first group of data entries. Each data entry from the second sequence defines a link between a source statement and a destination statement from the second sequence. A second group of data entries is created, which is determined from the first group of data entries that have an equivalent source and destination statements. The second group of data entries is stored in a database as the common sequence of statements.

Abstract: Techniques are disclosed for maintaining a search index used to support application searches. The techniques include receiving application data from one or more data sources, identifying an application referenced in the application data. The techniques further include extracting a plurality of attributes corresponding to the application from the application data based on an application specific search schema. The techniques also include generating an application representation of the application based on the plurality of attributes and the application specific search schema. The techniques also include updating a search index with the application representation.