Abstract: A database system uses an iterative set to store data and relationships among the data in a parallel manner. Unlike a relational database, which is limited to representing two-dimensional relationships (i.e., relationships between pairs of tables), the database system of the present invention may represent N-dimensional relations in a three-dimensional coordinate system. Furthermore, the database system of the present invention may store all database data in a single iterative set, without the need to use multiple tables. As a result of the manner in which data and relationships among data are stored by embodiments of the present invention, embodiments of the present invention may be used to search the database without the need to formulate queries in a formal query language such as SQL.

Abstract: Described are techniques for managing a federated namespace of a data storage system federation. A node identifier is assigned to a node. The node identifier uniquely identifies the node in the data storage system federation and is included in a federated node identifier namespace. A portion of a federated target port identifier namespace may be associated with the node identifier. The portion may include target port identifiers reserved from the federated target port identifier namespace for the node. Data storage management information for the data storage system federation may be updated to indicate that the node identifier is allocated from the federated node identifier namespace and that the portion of the federated target port identifier namespace is assigned to the node identifier.

Abstract: Search results are provided with personalized deeplinks for an end user. User behavior information is gathered regarding web pages visited by the end user. When the end user submits a search query, the website category of a search result is identified and user behavior information regarding web pages visited at other websites within the website category is identified. At least one deeplink is selected for the search result based on that user behavior information. In some instances, user behavior information may be tracked for a group of end users. The user behavior information for the group of end users may be used in conjunction with the user behavior information for the end user to facilitate deeplink selections for search results returned in response to search queries from the end user.

Abstract: Systems and methods for interest-driven business intelligence systems in accordance with embodiments of the invention are illustrated. In one embodiment, an interest-driven distributed data server system includes a processor, an interest-driven distributed data server application, aggregate data storage, and a data source directory, wherein the interest-driven distributed data server application configures the processor to obtain reporting data requirements, determine at least one data dimension using the reporting data requirements, identify at least one data source identified that can provide data associated with the data dimension, generate data source job data, transmit the data source job data to at least one data source, and receive job response data, store the received job response data in the aggregate data storage, build reporting data based on the reporting data requirements, and transmit the reporting data.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: Provided are systems, methods, and computer program products for determining operating hours of entities from user check-ins and check-outs. A method for determination operating hours may include obtaining check-in and check-out data for an entity having operating hours, aggregating the check-in and check-out data over an aggregation period, and determining a start time and an end time of the operating hours of the entity. The method may include aggregating the check-in and check-out data over multiple aggregation periods and determining operating hours for different aggregation periods.

Abstract: A system for a mass centralization approach to full image cloning of multiple computing devices is provided. The system includes a plurality of computing devices and a server. The server includes a processor programmed to receive, from the plurality of computing devices, metadata for files stored on the plurality of computing devices, determine, from the received metadata, an importance level for each of the files, instruct the plurality of computing devices to send a copy of the files to the server in a defined order, the defined order based on the importance level for each of the files, and store the copy of the files on the server.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: Implementations relate to presenting search results to a user. In particular, disclosed techniques include presenting both image search results and 3D model search results to a user. The user can manipulate the 3D model depicted in the 3D model search results by rotating, translating or zooming. Implementations thus provide a rich synergistic exploration experience to the user.

Abstract: A content processing apparatus according to the present disclosure includes: a content input unit that acquires target content that is content to be processed; a content analysis unit that extracts at least one object included in the target content and feature information indicating a feature of the object, and specifies context information based on analytical information and the extracted feature information, the context information indicating contexts of the objects and including attribute information for supplementing the features of the objects, and the analytical information being information for specifying the contexts of the objects; an output control unit that calculates processing priority of each of the objects based on the context information; and a candidate process extracting unit that extracts a candidate process that is executable on the target content based on the context information and the processing priority.

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, generating a query command based on the structured query based on the structured query comprising a first query constraint and a second query constraint, identifying a first set of nodes matching the first query constraint and at least in part matching the second query constraint, identifying a second set of nodes matching the second query constraint, and generating search results based on the first and second set of nodes.

Abstract: Systems and methods of the present disclosure are directed generally to evaluating performance of a content group of a content provider. In some implementations, a system receives a request to display a performance score and accesses a data structure storing keywords, a quality metric for each keyword, and an impression count for each keyword. The quality metric can include a quality score or a first page bid of a keyword. The system can identify keywords of the data structure corresponding to the content group of the content provider. The system can obtain the quality metric and the number of impressions via the data structure for each keyword. The system can determine, for the content group, a performance score using an impression-based weighted average of the quality metric and impression count of each of the keywords.

Abstract: Social data is used to extract actions that end users perform in order to provide deeplinks for search results. Social data from social networking services may be accessed and analyzed to identify actions performed by end users. Additionally, the social data may be analyzed to identify URLs of web pages at which the actions may be performed. Information regarding the actions and corresponding URLs is stored for use by a search engine service to provide deeplinks for search results returned in response to user search queries.

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, generating search results corresponding to the structured query, determine a search intent based on the selected nodes or selected edges referenced in the structured query, and scoring the search results based on the search intent.

Abstract: Systems, methods, and computer readable storage mediums are provided for selecting a media content object for a user using a combination of inputs. A media input seed associated with a user is obtained. A plurality of channels of media content objects is obtained. At least one of the plurality of channels is associated with the media input seed. Also, in some embodiments, each media content object of each of those channels has a score specific to that channel. A combination score for a respective media content object is calculated based at least in part on that respective media content object's channel specific score for each of at least two of the plurality of channels. Then at least some of the media content objects are ranked based at least in part on their respective combination scores. Finally, at least one ranked media content object is then selected for transmission.

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, parsing the structure query to identify a first query constraint and one or more second query constraints, identifying a inverse constraint associated with the first query constraint, and generating a query command based on the structured query, where the query command includes the inverse constraint and the one or more second query constraints.

Abstract: Described herein is a technology for facilitating preference-based data representation. In accordance with one aspect of the technology, preference information is acquired from a user. Rank scores of objects are generated based at least in part on the user preference information. The objects are grouped into one or more clusters of objects based on the rank scores. A visualization of the one or more clusters of objects is then generated.

Abstract: Online interactions using optical disc players are facilitated by extracting information from a user request that was initiated from an optical disc player, and then using the extracted information to identify pre-existing user-specific data. A short code, which is specific to the desired online interaction and associated with the extracted information and pre-existing information, is generated and transmitted back to the optical disc player. This short code is then provided back to the back-end server by the user from a secondary consumer electronic device, and used to retrieve associated information, such as the target website for consummating the desired interaction and the previously-identified pre-existing information. Retrieved information is used to populate data fields on the target website prior the user being re-directed to the target website.

Abstract: Methods and apparatus are provided for fast item identification. A plurality of sensors capture data for an unknown item that is moved past the sensors. The data is processed to produce a plurality of physical attributes related to the unknown item. The physical attributes are used to search a database of physical attributes for a large number of known items where the unknown item is one of the known items. A small set of known items are selected where the physical attributes of the known items match the physical attributes of the unknown item. Further processing of the selected set of known items identifies the unknown item as one of the set of known items.

Abstract: A log is identified which includes one or more transactions to a source database. The log is ingested using a processor included in a storage processor complex, where the storage processor complex includes storage and a processor associated with the storage. The ingested information is transformed into change data appropriate for a target database stored at least in part on the storage processor complex. The change data is applied to the target database.