US7069308B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
System, method and apparatus for connecting users in an online computer system based on their relationships within social networks
Assignee: Meta Platforms Inc
•
Filing: 2003-06-16
•
Granted: 2006-06-27
•
Expires: 2023-06-16
Abstract
Abstract A method and apparatus for calculating, displaying and acting upon relationships in a social network is described. A computer system collects descriptive data about various individuals and allows those individuals to indicate other individuals with whom they have a personal relationship. The descriptive data and the relationship data are integrated and processed to reveal the series of social relationships connecting any two individuals within a social network. The pathways connecting any two individuals can be displayed. Further, the social network itself can be displayed to any number of degrees of separation. A user of the system can determine the optimal relationship path (i.e., contact pathway) to reach desired individuals. A communications tool allows individuals in the system to be introduced (or introduce themselves) and initiate direct communication.
Inventors
- 👤 Jonathan H. Abrams
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 17:06
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/10; G06Q10/40; G06Q10/42; G06Q10/48; H; H04; H04L; H04L51/00; H04L51/52; H04L67/00; H04L67/01; H04L67/02; H04L67/2866; H04L67/30; H04L67/306; H04L67/50; H04L67/535; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99935
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
333 words
In a computer system including a server computer and a database of registered users that stores for each registered user, a user ID of the registered user and a set of user IDs of registered users who are directly connected to the registered user, a method for connecting a first registered user to a second registered user through one or more other registered users, the method comprising the steps of: setting a maximum degree of separation (Nmax) of at least two that is allowed for connecting any two registered users, wherein two registered users who are directly connected are deemed to be separated by one degree of separation and two registered users who are connected through no less than one other registered user are deemed to be separated by two degrees of separation and two registered users who are connected through no less than N other registered users are deemed to be separated by N+1 degrees of separation; searching for the user ID of the second registered user in the sets of user IDs that are stored for registered users who are less than Nmax degrees of separation away from the first registered user, and not in the sets of user IDs that are stored for registered users who are greater than or equal to Nmax degrees of separation away from the first registered user, until the user ID of the second registered user is found in one of the searched sets; and connecting the first registered user to the second registered user if the user ID of the second registered user is found in one of the searched sets, wherein the method limits the searching of the second registered user in the sets of user IDs that are stored for registered users who are less than Nmax degrees of separation away from the first registered user, such that the first registered user and the second registered user who are separated by more than Nmax degrees of separation are not found and connected.
Claim 2
Dependent Claim
333 words
In a computer system including a server computer and a database of registered users that stores for each registered user, a user ID of the registered user and a set of user IDs of registered users who are directly connected to the registered user, a method for connecting a first registered user to a second registered user through one or more other registered users, the method comprising the steps of: setting a maximum degree of separation (Nmax) of at least two that is allowed for connecting any two registered users, wherein two registered users who are directly connected are deemed to be separated by one degree of separation and two registered users who are connected through no less than one other registered user are deemed to be separated by two degrees of separation and two registered users who are connected through no less than N other registered users are deemed to be separated by N+1 degrees of separation; searching for the user ID of the second registered user in the sets of user IDs that are stored for registered users who are less than Nmax degrees of separation away from the first registered user, and not in the sets of user IDs that are stored for registered users who are greater than or equal to Nmax degrees of separation away from the first registered user, until the user ID of the second registered user is found in one of the searched sets; and connecting the first registered user to the second registered user if the user ID of the second registered user is found in one of the searched sets, wherein the method limits the searching of the second registered user in the sets of user IDs that are stored for registered users who are less than Nmax degrees of separation away from the first registered user, such that the first registered user and the second registered user who are separated by more than Nmax degrees of separation are not found and connected.
Claim 3
Dependent Claim
37 words
The method according to claim 1 , wherein the step of searching is first carried out in the sets of user IDs that are stored for registered users who are directly connected to the first registered user.
Claim 4
Dependent Claim
27 words
The method according to claim 1 , further comprising the step of transmitting a profile of the second registered user to the first registered user for display.
Claim 5
Dependent Claim
75 words
The method according to claim 3 , further comprising the steps of: storing a connection path between the first registered user and the second registered user, the connection path indicating the one or more other registered users through whom the connection between the first registered user and the second registered user is made; and transmitting the connection path between the first registered user and the second registered user to the first registered user for display.
Claim 6
Dependent Claim
43 words
The method according to claim 4 , wherein the connection path transmitted for display includes a hyperlink for each of the one or more other registered users through whom the connection between the first registered user and the second registered user is made.
Claim 7
Dependent Claim
22 words
The method according to claim 1 , wherein the maximum degree of separation is set by an operator of the computer system.
Claim 8
Dependent Claim
17 words
The method according to claim 6 , wherein the maximum degree of separation is set as four.
Claim 9
Dependent Claim
33 words
The method according to claim 1 , wherein the database further stores for each registered user, e-mail addresses of individuals who are not registered users and identified by the registered user as friends.
Claim 10
Dependent Claim
89 words
The method according to claim 8 , further comprising the steps of: sending out an invitation to become a registered user to friends of a registered user; receiving an acceptance from a friend to whom said invitation was sent; and adding said friend to the database and storing for said friend, a user ID and a set of user IDs of registered users who are directly connected to said friend, the set of user IDs stored for said friend including at least the user ID of said registered user.
Claim 11
Dependent Claim
16 words
The method according to claim 9 , wherein said invitation is sent out by electronic mail.
Claim 12
Dependent Claim
22 words
The method according to claim 9 , wherein said invitation is resent a number of times prior to the step of receiving.
Claim 13
Dependent Claim
30 words
The method according to claim 9 , further comprising the step of notifying said registered user that said invitation to said friend has been accepted when said acceptance is received.
Claim 14
Dependent Claim
33 words
The method according to claim 9 , further comprising the steps of receiving inputs from said friend and storing said inputs in the database, wherein said inputs include descriptive data about said friend.
Claim 15
Dependent Claim
95 words
The method according to claim 1 , further comprising the steps of: prior to the step of connecting, transmitting brief profiles of registered users, including a brief profile of the second registered user, to the first registered user for display, each of the brief profiles including a hyperlink to a corresponding full profile; and receiving a hyperlink selection from the first registered user, wherein, upon receiving the hyperlink selection for the full profile of the second registered user, the full profile of the second registered user is transmitted to the first registered user for display.
Claim 16
Dependent Claim
38 words
The method according to claim 14 , wherein brief profiles of those registered users who are more than Nmax degrees of separation away from the first registered user are not transmitted to the first registered user for display.
References Cited (Backward Citations)
US6175831B1
Cited
US5950200A
Cited
US5978768A
Cited
US6370510B1
Cited
US6052122A
Cited
US6073105A
Cited
US6249282B1
Cited
US5963951A
Cited
US6061681A
Cited
US6269369B1
Cited
US6324541B1
Cited
US6073138A
Cited
US6363427B1
Cited
US6366962B1
Cited
US6408309B1
Cited
US20020086676A1
Cited
US6542748B2
Cited
US6735568B1
Cited
US20030154194A1
Cited
US20040034601A1
Cited
US20040144301A1
Cited
US20040148275A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2009-06-26 | 2009-12-26 | 2010-06-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2013-06-26 | 2013-12-26 | 2014-06-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2017-06-26 | 2017-12-26 | 2018-06-27 | $7700.00 | Window Closed / Lapsed |