Abstract: Methods and apparatus are disclosed for identifying one or more objects (e.g., a logo, brand or commercial) depicted in a video. Textual information is identified from search results pages returned by a reverse image search engine for images extracted from the video. Base query records are generated corresponding to the search results pages that have textual information satisfying a base search term. Object query records are generated corresponding to the base query records that satisfy an object search term. A statistical criterion is applied to the object query records to identify an object depicted in the video. In some disclosed examples, the statistical criterion includes a threshold that is measured against the object query records and/or the base query records.

Abstract: Systems and methods of evaluating search query terms in a computer network environment are provided. A data processing system can obtain, from a computing device via a computer network, a first search query and a second search query, and can determine a relationship between the first search query and the second search query. The data processing system can generate a structured search query representative of the first search query and the second search query, and can select, based on the structured search query, a content item for display by the computing device. The data processing system can receive an indication of a click on the content item, and can provide, to a content publisher computing device, a representation of the structured search query and the indication of the click on the content item.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing knowledge panels. In one aspect, a method includes determining an entity that is referenced by a received search query. Content items relevant to the entity are identified. A set of knowledge modules is selected for presentation in a knowledge panel for the entity. The knowledge panel can be a portion of a search results page in which knowledge modules are presented. Data that causes the knowledge modules to be presented in the knowledge panel is provided to a user device.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for populating a form using a search query. In one aspect, a method include actions of providing a form for display on a user device. Additional actions include, while a particular field of the form is selected, receiving a request to perform a search query, in response to receiving the request, receiving one or more query terms, obtaining a result of performing a search query that includes the one or more query terms, and automatically populating the particular field of the form with the result of the search query.

Abstract: Systems and methods for implementing bulk handling in asynchronous processing are described. For example, an exemplary system includes a processor and a memory to execute instructions at the system; a broker to enqueue received messages; a push connection from the broker to a thread, in which the broker is to push an initial message to the thread for processing; a pull connection from the thread to the broker, in which the thread is to request one or more additional messages for bulk processing with the initial message from the broker; a query interface to issue a database query from the thread to a data store, the database query specifying the initial message and the one or more additional messages as a set of messages to obtain a lock for the set of messages; and a message processing engine to handle the set of messages in bulk based on whether the lock for the set of messages is obtained.

Abstract: Aspects described herein relate to methods and systems for comparing data stored in disparate parallel systems using hash sums. A database having a parallel system architecture may comprise a plurality of nodes each storing a plurality of records. A central node may initiate parallel calculation of a set of node hash sums for each individual node. Calculating a node hash sum for an individual node may comprise calculating, by the individual node, a set of hash values for each individual record of the plurality of records stored by the individual node and combining each hash value of the set of hash values to generate the node hash sum for the individual node. The central processor may combine each node hash sum to generate a database hash sum. The central processor may store the generated database hash sum and/or utilize it in comparisons with database hash sums for other databases.

Abstract: Implementations provide an interface for initiating actions related to content the user is viewing on a mobile device. A method includes performing recognition on content captured from a display of a mobile device and identifying a plurality of entities in the content. The method may include issuing a query for each of the plurality of entities, ranking the plurality of entities based on the search results, generating an action card for at least some of the highest ranked entities, and providing the action cards for display on the mobile device. Alternatively or additionally, the method may include determining at least one contact in a contacts data store that corresponds to an entity and generating an action card for the entity, the action card having a first action that uses first information from the contacts data store and a second action that uses second information from the contacts data store.

Abstract: An online media station can be automatically generated based on a user's media preference data. Media preference data can include a user's media item purchase history. The media preference data is analyzed and media preference clusters are generated from the analyzed media preference data. Generated media preference clusters are ranked based on a predetermined set of ranking rules. The top ranked media preference clusters are selected dependent upon the user's number of slots available for customized media stations. One or more media station seeds are selected from each media preference cluster selected based on a set of predetermined selection rules. An algorithmic media station is automatically generated from the one or more media station seeds and provided to an electronic device of the user.

Abstract: Techniques are disclosed for sorting an input data set. A sort tool determines a distribution of values of a data set that includes a plurality of data records. The sort tool partitions the data set into a plurality of subsets based on the distribution. Each of the data records is inserted into one of the subsets based on a corresponding sort value of the data record. The sort tool identifies one or more of the subsets that contain at least two distinct sort values. In each of the identified subsets, the data records are sorted by a corresponding sort value of the data record.

Abstract: Systems and methods for rendering automatic annotation for electronic books with external information provided by an information database. A computer implemented method is used to automatically determine key terms and match the key terms with correct information from external information sources for presentation at an e-book page. The key terms can be detected based on a TF-IDF based content analysis process. The detected key terms can be processed by a disambiguation process to select the pertinent definition for multi-sense terms according to one or more selected information sources. Hyperlinks can be embedded in the key terms for direct and convenient link to the matching external information in response to user interactions.

Abstract: Techniques are disclosed for sorting an input data set. A sort tool determines a distribution of values of a data set that includes a plurality of data records. The sort tool partitions the data set into a plurality of subsets based on the distribution. Each of the data records is inserted into one of the subsets based on a corresponding sort value of the data record. The sort tool identifies one or more of the subsets that contain at least two distinct sort values. In each of the identified subsets, the data records are sorted by a corresponding sort value of the data record.

Abstract: A social networking system selects a set of groups for presentation to a user of the social networking system. To select groups, the social networking system identifies candidate groups and selects the set of groups from the candidate groups. To identify certain candidate groups, the social networking system determines a location associated with various groups based on locations associated with users included in the group. For example, the social networking system determines a centroid of a group based on locations associated with users included in the group and associates the centroid with the group if at least a threshold percentage of distances between locations associated with users included in the group and the centroid do not exceed a threshold distance. Groups associated with locations within a threshold distance of a location associated with the user are identified as candidate groups.

Abstract: A computerized datacenter entity information method includes obtaining datacenter entity information at an initial time, compressing and storing the datacenter entity information as a datacenter entity frame of reference, obtaining datacenter entity information changes, and compressing and storing the datacenter entity information changes with respect to the datacenter entity frame of reference. In another implementation, the computerized datacenter entity information method includes obtaining datacenter entity information at an initial time, compressing and storing the datacenter entity information as a datacenter entity frame of reference, obtaining datacenter entity information changes, and compressing and storing the datacenter entity information changes with respect to the datacenter entity frame of reference.

Abstract: A system for a distributed archive and data restoration which achieves both high-speed processing and security is provided. A random number is generated by a seed random number generator, and inputted to a key random number generator as a seed, and each data fragment is obtained by dividing a source data file to be archived, and is redundantly stored on (n?k+1) storage mediums identified as destination storage mediums among n storage mediums on the basis of the random number generated by the key random number generator each time where n is an integer no less than 2 and k is an integer no more than value of n.

Abstract: In an approach for supporting queries for hash-based data structures, a processor creates an ordered set of seeds, wherein the ordered set of seeds are a subset of values in a key domain. A processor links each hashed key of a plurality of hashed keys to at least another hashed key of the plurality of hashed keys using the ordered set of seeds, wherein the ordered set of seeds allows retrieval access to data located in the hash-based data structure.

Abstract: A system is disclosed for improving the efficiency and quality of real-time extracting, transforming, and/or loading data using customer information control system (CICS) interval control element (ICE) chain processing.

Abstract: Methods and systems to suggest information to be used with an item being listed for sale may include analyzing a plurality of stored entries of words and identifying certain entries based on desirability scores associated with those entries. The entries and the desirability scores may be identified based on their frequency of use in the plurality of stored entries and/or in the title information or other information associated with items offered for sale.

Abstract: In one embodiment, a method of performing point-in-time recovery (PITR) in a massively parallel processing (MPP) database includes receiving, by a data node from a coordinator, a PITR recovery request and reading a log record of the MPP database. The method also includes determining a type of the log record and updating a transaction table when the type of the log record is an abort transaction or a commit transaction.

Abstract: A system (100) for generating a computer readable data file representative of a mapping between a first representation of a set of concepts or of a data structure (e.g. a database schema) and a second representation of a set of concepts or of a data structure (e.g. an ontology), each representation comprising a plurality of complex representational elements (e.g. tables in a database schema and concepts in an ontology) each of which may itself include a number of associated subordinate representational elements (e.g. columns/fields of a table in a database schema and attributes of a concept in an ontology).

Abstract: Similarity analysis of software is disclosed. An input file is received. Pairs of files that consist of the input file and files included in a corpus are categorized into one of a possible match and a mismatch. Those pairs classified as possible matches are analyzed using a pairwise component analysis.