Periodic update of data in a relationship system
First Claim
Patent Images
1. A computerized method of updating a relationship graph, comprising:
- identifying a set of desired data concerning elements of a relationship graph, the elements of the relationship graph including nodes representing entities and edges representing relationships between the entities, wherein the set of desired data includes data currently unavailable from the relationship graph;
determining which pieces of desired data in the set are important to users;
finding, without user input, one or more information suppliers for each important piece of desired data, wherein at least one information supplier is a user represented by a node in the relationship graph;
communicating, without user input, a request for said important piece of desired data to the one or more information suppliers, the request prompting the one or more information suppliers to input said important piece of desired data; and
updating the relationship graph based on input provided by the one or more information suppliers.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and system for periodically updating data in a relationship system are disclosed. In one embodiment, the method includes identifying a set of desired data concerning elements of a relationship graph. The elements of the relationship graph include nodes representing entities and edges representing relationships between entities. The method further includes determining which pieces of the desired data are important to users and finding one or more information suppliers for each important piece of the desired data.
83 Citations
30 Claims
-
1. A computerized method of updating a relationship graph, comprising:
-
identifying a set of desired data concerning elements of a relationship graph, the elements of the relationship graph including nodes representing entities and edges representing relationships between the entities, wherein the set of desired data includes data currently unavailable from the relationship graph; determining which pieces of desired data in the set are important to users; finding, without user input, one or more information suppliers for each important piece of desired data, wherein at least one information supplier is a user represented by a node in the relationship graph; communicating, without user input, a request for said important piece of desired data to the one or more information suppliers, the request prompting the one or more information suppliers to input said important piece of desired data; and updating the relationship graph based on input provided by the one or more information suppliers. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A machine-readable storage medium having executable instructions to cause a machine to perform a method comprising:
-
identifying a set of desired data concerning elements of a relationship graph, the elements of the relationship graph including nodes representing entities and edges representing relationships between the entities, wherein the set of desired data includes data currently unavailable from the relationship graph; determining which pieces of desired data in the set are important to users; finding, without user input, one or more information suppliers for each important piece of desired data, wherein at least one information supplier is a user represented by a node in the relationship graph; communicating, without user input, a request for said important piece of desired data to the one or more information suppliers the request prompting the one or more information suppliers to input said important piece of desired data; selecting an optimal channel from a plurality of available communication channels to communicate the request, wherein the plurality of available communication channels include at least one of an email message, a popup window, or a web page; and receiving requested data from the one or more information suppliers. - View Dependent Claims (17, 18, 19, 20, 21, 22)
-
-
23. An apparatus comprising:
-
a desired data identifier to identify a set of desired data concerning elements of a relationship graph, the elements of the relationship graph including nodes representing entities and edges representing relationships between the entities, wherein the set of desired data includes data currently unavailable from the relationship graph; a desired data prioritizer to determine which pieces of desired data in the set are important to users; and a desired data requestor to find one or more information suppliers for each important piece of desired data without user input, to communicate a request for said important piece of desired data to the one or more information suppliers without user input, the request prompting the one or more information suppliers to input said important piece of desired data, and to select an optimal channel from a plurality of available communication channels to communicate the request, wherein at least one information supplier is a user represented by a node in the relationship graph, and wherein the plurality of available communication channels include at least one of an email message, a popup window, or a web page. - View Dependent Claims (24, 25, 26)
-
-
27. An apparatus comprising:
-
means for identifying a set of desired data concerning elements of a relationship graph, the elements of the relationship graph including nodes representing entities and edges representing relationships between the entities, wherein the set of desired data includes data currently unavailable from the relationship graph; means for determining which pieces of desired data in the set are important to users; means for finding, without user input, one or more information suppliers for each important piece of desired data, wherein at least one information supplier is a user represented by a node in the relationship graph; means for communicating, without user input, a request for said important piece of desired data to the one or more information suppliers, the request prompting the one or more information suppliers to input said important piece of desired data; means for selecting an optimal channel to communicate the request; and means for receiving requested data from the one or more information suppliers. - View Dependent Claims (28)
-
-
29. A system comprising:
-
a processor coupled to a memory through a bus, and further coupled to an I/O interface through the bus; and an update process executed from the memory by the processor to cause the processor to identify set of desired data concerning elements of a relationship graph, the elements of the relationship graph including nodes representing entities and edges representing relationships between the entities, wherein the set of desired data includes data currently unavailable from the relationship graph, to determine which pieces of desired data in the set are important to users, to find one or more information suppliers for each important piece of desired data without user input, wherein at least one information supplier is a user represented by a node in the relationship graph, and to communicate a request for said important piece of desired data to the one or more information suppliers without user input, the request prompting the one or more information suppliers to input said important piece of desired data. - View Dependent Claims (30)
-
Specification