Abstract: Methods, systems, and apparatus for generating user interface elements for an entity in response to a search query. The method includes receiving a request that includes the entity and one or more context terms. In response to determining to provide the search results page including knowledge elements, the method identifies knowledge elements for the entity that include facts relating to the entity and identifies content in at least one knowledge element of the knowledge elements for the entity that relates to data identifying the entity and the one or more context terms. The method generates the user interface elements for at least some of the knowledge elements, including generating a user interface element for the knowledge element that includes a change of appearance of the content. The user interface elements are provided in the search results page in response to the request.

Abstract: Methods, systems, and apparatus for receiving a request that includes an entity identifier of an entity referenced by a search query and one or more context terms that are included in the search query; determining that the one or more context terms describe a relationship connecting the entity referenced by the search query with a plurality of other entities; and in response to determining that the one or more context terms describe the relationship, generating user interface elements that provide facts related to the entity referenced. Generating the user interface may include identifying relationship knowledge elements that include facts relating to at least some of the other entities connected to the entity by the relationship, and identifying one or more additional knowledge for the entity referenced by the search query. The ranking the relationship knowledge elements may be highest ranked knowledge elements in the user interface elements.

Abstract: Methods, systems, and apparatus for receiving a request that includes an entity identifier of an entity referenced by a search query and one or more context terms that are included in the search query; determining that the one or more context terms describe a relationship connecting the entity referenced by the search query with a plurality of other entities; and in response to determining that the one or more context. terms describe the relationship, generating user interface elements that provide facts related to the entity referenced. Generating the user interface may include identifying relationship knowledge elements that include facts relating to at least some of the other entities connected to the entity by the relationship, and identifying one or more additional knowledge for the entity referenced by the search query. The ranking the relationship knowledge elements may be highest ranked knowledge elements in the user interface elements.

Abstract: Methods, systems, and apparatus for receiving a request that includes an entity identifier of an entity that is referenced by a search query submitted by a user and one or more context terms that are referenced by the search query; identifying a plurality of knowledge elements that are related to the entity; identifying one or more context terms that are associated with the entity that is referenced by the search query; assigning, rank scores to the plurality of knowledge elements, based at least on identifying the one or more context terms that are associated with the entity that is referenced by the search query; selecting one or more of the knowledge elements from among the knowledge elements based at least on the rank scores assigned to the knowledge elements; and providing, in response to the request, information associated with the entity and the one or more selected knowledge elements.

Abstract: Methods, systems, and apparatus for receiving a request that includes an entity identifier of an entity that is referenced by a search query submitted by a user and one or more context terms that are referenced by the search query; identifying a plurality of knowledge elements that are related to the entity; identifying one or more context terms that are associated with the entity that is referenced by the search query; assigning, by one or more computers, rank scores to the plurality of knowledge elements, based at least on identifying the one or more context terms that are associated with the entity that is referenced by the search query; selecting one or more of the knowledge elements from among the knowledge elements based at least on the rank scores assigned to the knowledge elements; and providing, in response to the request, information associated with the entity and the one or more selected knowledge elements.

Abstract: Modeling data as an undirected graph can include a set of entities and a set of attributes. A set of relationships can be defined to represent semantic associations with each association connecting at least two entities. Attributes can be associated with entities rather than with relationships. A hierarchical query language with a set of atomic operations on modeled data can be employed. The modeled data can be displayed on a display unit.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The system may use an index of constraints organized by edge. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, whether a member node represents a change to the saved query result. The system may then update a saved query result for the query using the member node identified during the traversal in accordance with the change.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The system may use an index of constraints organized by edge. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, whether a member node represents a change to the saved query result. The system may then update a saved query result for the query using the member node identified during the traversal in accordance with the change.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, that a collapsed definition for a first query that includes the constraint indicates a member node is responsive to the first query. The system may then update a saved query result for the first query using the member node identified during the traversal in accordance with the collapsed definition.

Abstract: In general, aspects of the present disclosure are directed to techniques for migrating social networking connections in a social network from one profile to another profile. A first incoming connection from a third profile in a social network to a first profile in the social network may be determined. A first outgoing connection to a fourth profile in the social network from the first profile in the social network may be determined. A second incoming connection from the third profile to a second profile may be created based at least in part on the first incoming connection. A second outgoing connection to the fourth profile from the second profile may be created based at least in part on the first outgoing connection.

Abstract: Methods, systems, and apparatus for receiving a request that includes an entity identifier of an entity that is referenced by a search query submitted by a user and one or more context terms that are referenced by the search query; identifying a plurality of knowledge elements that are related to the entity; identifying one or more context terms that are associated with the entity that is referenced by the search query; assigning, by one or more computers, rank scores to the plurality of knowledge elements, based at least on identifying the one or more context terms that are associated with the entity that is referenced by the search query; selecting one or more of the knowledge elements from among the knowledge elements based at least on the rank scores assigned to the knowledge elements; and providing, in response to the request, information associated with the entity and the one or more selected knowledge elements.

Abstract: A system for automatically generating entity collections comprises a data graph including entities connected by edges and instructions that cause the computer system to determine a set of entities from the data graph and to determine a set of constraints that has a quantity of constraints. A constraint in the set represents a path in the data graph shared by at least two of the entities in the set of entities. The instructions also cause the computer system to generate candidate collection definitions from combinations of the constraints, where each candidate collection definition identifies at least one constraint and no more than the quantity of constraints. The instructions also cause the computer system to determine an information gain for at least some of the candidate collection definitions, and store at least one candidate collection definition that has an information gain that meets a threshold as a candidate collection.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, that a collapsed definition for a first query that includes the constraint indicates a member node is responsive to the first query. The system may then update a saved query result for the first query using the member node identified during the traversal in accordance with the collapsed definition.

Abstract: An efficient system for evaluating collection membership in a large data graph. The system includes a data graph of nodes connected by edges and an index of constraints from collection definitions, a definition specifying at least one condition with at least one constraint, where a constraint has a constraint type and a constraint expression. Multiple conditions in the definition may be conjunctive. The system may also include instructions that, when executed by the at least one processor, cause the system to: evaluate an edge for a node in the data graph against the index to determine conditions met by the edge and its associated neighborhood, repeat the evaluating for each edge associated with the node in the data graph, determine that conditions for a first collection are met, and generate an indication in the data graph that the node is a member of the first collection.

Abstract: A system for automatically generating entity collections comprises a data graph including entities connected by edges and instructions that cause the computer system to determine a set of entities from the data graph and to determine a set of constraints that has a quantity of constraints. A constraint in the set represents a path in the data graph shared by at least two of the entities in the set of entities. The instructions also cause the computer system to generate candidate collection definitions from combinations of the constraints, where each candidate collection definition identifies at least one constraint and no more than the quantity of constraints. The instructions also cause the computer system to determine an information gain for at least some of the candidate collection definitions, and store at least one candidate collection definition that has an information gain that meets a threshold as a candidate collection.

Abstract: In general, aspects of the present disclosure are directed to techniques for migrating social networking connections in a social network from one profile to another profile. A first incoming connection from a third profile in a social network to a first profile in the social network may be determined. A first outgoing connection to a fourth profile in the social network from the first profile in the social network may be determined. A second incoming connection from the third profile to a second profile may be created based at least in part on the first incoming connection. A second outgoing connection to the fourth profile from the second profile may be created based at least in part on the first outgoing connection.

Abstract: In general, aspects of the present disclosure are directed to techniques for migrating social networking connections in a social network from one profile to another profile. A first incoming connection from a third profile in a social network to a first profile in the social network may be determined. A first outgoing connection to a fourth profile in the social network from the first profile in the social network may be determined. A second incoming connection from the third profile to a second profile may be created based at least in part on the first incoming connection. A second outgoing connection to the fourth profile from the second profile may be created based at least in part on the first outgoing connection.

Abstract: A method for identifying emerging concepts in unstructured text streams comprises: selecting a subset V of documents from a set U of documents; generating at least one Boolean combination of terms that partitions the set U into a plurality of categories that represent a generalized, statistically based model of the selected subset V wherein the categories are disjoint inasmuch as each document of U is included in only one category of the partition; and generating a descriptive label for each of the disjoint categories from the Boolean combination of terms for that category.

Abstract: A system and program product for modeling data as an undirected graph is disclosed. A set of entities and a set of attributes are defined. A set of relationships is defined to represent semantic associations with each association connecting at least two entities. Attributes are associated with entities rather than with relationships. A hierarchical query language with a set of atomic operations on modeled data is employed. The modeled data is displayed on a display unit.

Abstract: In general, aspects of the present disclosure are directed to techniques for migrating social networking connections in a social network from one profile to another profile. A first incoming connection from a third profile in a social network to a first profile in the social network may be determined. A first outgoing connection to a fourth profile in the social network from the first profile in the social network may be determined. A second incoming connection from the third profile to a second profile may be created based at least in part on the first incoming connection. A second outgoing connection to the fourth profile from the second profile may be created based at least in part on the first outgoing connection.