PEER TO PEER SOCIAL NETWORKING

• US 20090313102A1
• Filed: 06/13/2008
• Published: 12/17/2009
• Est. Priority Date: 06/13/2008
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Calvert, Simon, Le Roy, Bertrand C., Sanabria, Andres
• Application Number:
  US12/139,342
• Publication Number:
  US 20090313102A1
• Time in Patent Office: Days
• US Class Current: 705/14.250
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0224 based on user history

Abstract

Accessing data through a social network. User input may be received at a node in a social network requesting access to data or requesting a search for data. The node includes data for an entity. In some embodiments, the entity controls the data at the node exclusive of centralized control of the social network. The node further comprises one or more references defining relationships to other nodes. The relationships are defined on an informational basis such that information in data at one node is related through a relationship to information in data at another node. Each of the other nodes includes other data about other entities. Embodiments may further include receiving data at the node from one or more of the other nodes based on one or more of the relationships. At the node, the data from the other nodes may be published.

Claims

1. A method of accessing data through a social network, the method comprising:

receiving user input at a node in a social network requesting access to data, wherein the node comprises data for an entity, and wherein the entity controls the data at the node exclusive of centralized control of the social network, wherein the node further comprises one or more references defining relationships to other nodes, wherein the relationships are defined on an informational basis such that information in data at one node is related through a relationship to information in data at another node, wherein each of the other nodes includes other data about other entities, wherein the data at one or more of the other nodes is controlled by each their respective entity exclusive of centralized control of the social network;

receiving data at the node from one or more of the other nodes based on one or more of the relationships; and

at the node, publishing the data from the other nodes.

2. The method of claim 1, wherein the node comprises rating information associated with one or more of the relationships.

3. The method of claim 1, wherein receiving data at the node from one or more of the other nodes is performed as a result of user interaction with node.

4. The method of claim 1, wherein receiving data at the node from one or more of the other nodes is performed automatically without user interaction.

5. The method of claim 4, wherein receiving data at the node from one or more of the other nodes automatically is performed as a result of preference settings at the node.

6. The method of claim 4, wherein receiving data at the node from one or more of the other nodes automatically is performed based on rating of relationships between nodes.

7. The method of claim 4, wherein receiving data at the node from one or more of the other nodes automatically is performed based on ratings of tags of the relationships.

8. The method of claim 1, further comprising;

receiving user input at the node including search parameters;

performing a search based on one or more of the relationships; and

returning search results based on relevance, wherein the relevance is determined based on the relationships.

9. The method of claim 8, wherein performing a search based on one or more of the relationships comprises using automatic metrics on the social network to channel crawling in the context of a search.

10. The method of claim 8, wherein the relevance is further determined based on relationships at the other nodes to still other nodes.

11. The method of claim 1, wherein receiving data at the node from one or more of the other nodes based on one or more of the relationships comprises receiving advertisement data, the method further comprising:

sending information about the node, such that the information about the node is provided to such that nodes that displayed or relayed the advertisement data are provided with a share of ad revenue

12. A method of search for data through a social network, the method comprising:

receiving user input at a node in a social network requesting a search for data on the social network, wherein the node comprises data for an entity, wherein the node further comprises one or more references defining relationships to one or more other nodes, wherein the relationships are defined on an informational basis such that information in data at one node is related through the relationship to information in data at another node, wherein each of the other nodes includes other data about other entities; and

searching for the data based on the relationships.

13. The method of claim 12, further comprising:

receiving results from other nodes, the results being classified based on degrees of relationships; and

presenting the results to a user in a format based on the degrees of relationships.

14. The method of claim 12, further comprising:

receiving results from other nodes, the results being classified based on ratings of nodes in the social network; and

presenting the results to a user in a format based on the ratings.

15. The method of claim 12, further comprising:

receiving results from other nodes, the results being classified based on metrics; and

presenting the results to a user in a format based on the metrics.

16. The method of claim 15, wherein the metrics comprises, for a given results, the result being sourced from a given node, an indication of a number of nodes where the corresponding entities have a relationship with the given node.

17. The method of claim 12, wherein at least some of the nodes comprises data controlled by the entities for the nodes exclusive of centralized control of the data for the nodes.

18. The method of claim 17, wherein at least some of the nodes are implemented on each their own separate server.

19. In a computing environment, a method of implementing a social network, the method comprising:

at a first node in a social network establishing first degree relationships with one or more other nodes, wherein the first node comprises data for an entity, and wherein the entity controls the data at the first node exclusive of centralized control of the social network, wherein the relationships are defined on an informational basis such that information in data at one node is related through a relationship to information in data at another node, wherein each of the other nodes includes other data about other entities, wherein the data at one or more of the other nodes is controlled by each their respective entity exclusive of centralized control of the social network;

at the first node, establishing rating information for each of the first degree relationships, wherein the rating information defines a degree of trust for a given first degree relationship;

searching for data based on the first degree relationships by sending a query to at least some of the other nodes with a first degree relationship to the first node;

receiving data at the node from the at least some of the other nodes based on the query and based on the first degree relationship to the first node;

at the first node, publishing the data received from the at least some of the other nodes.

20. The method of claim 19, further comprising receiving data at the node from still other nodes based on relationships other than a first degree relationship as a result of one or more of the other nodes with a first degree relationship to the node sending the query to the still other nodes.