Method And Server For Searching For Nearby User In Social Networking Services

• US 20140258281A1
• Filed: 05/14/2014
• Published: 09/11/2014
• Est. Priority Date: 11/16/2011
• Status: Active Grant

• Current Assignee: Tencent Technology Company Limited (Tencent Holdings Limited)
• Original Assignee: Tencent Technology Company Limited (Tencent Holdings Limited)
• Inventors: HUANG, Tianqing, YE, Wa, CHEN, Junchao, LAI, Zhonghua, CUI, Haochuan, WU, Yu, MA, Cuilong, FENG, Jingqiong, LIN, Xiangyao, LIN, Xueqin, ZHANG, Yuxuan, RONG, Kunfeng, LING, Guo
• Granted Patent: US 9,092,532 B2
• Time in Patent Office: Days
• US Class Current: 707/724
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

When location information and a user Identification (ID) is received from a client terminal device of a user X, a grid Y, to which the location information belongs, is determined. The user ID and the location information of the user X is stored in a list of the grid Y. The grid Y is in a grid array obtained by dividing a surface of the earth into the grids and areas of the grids are the same. Users in the grid Y and other grids are searched. The grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid. The users are ranked in an ascending order of distances between the users and the user X. The ranked user IDs and distances between the users and the user X are sent to the client terminal device of the user X.

Claims

1. A method for searching for nearby users in Social Networking Services (SNS), comprising:

receiving location information and a user Identification (ID) from a client terminal device of a user X;

determining a grid Y, to which the location information belongs;

storing the user ID and the location information of the user X in a list of the grid Y;

wherein the grid Y is one of grids in a grid array obtained by dividing a surface of the earth into the grids and areas of the grids are the same;

searching for users in the grid Y and other girds;

wherein the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N=n*n, n is an odd larger than or equal to 3;

ranking the users in an ascending order of distances between the users the user X; and

sending the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X.

2. The method according to claim 1, wherein sending the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X comprises:

determining whether number of the users is less than or equal to M;

sending the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X if the number of the users is less than or equal to M; and

sending ranked user IDs of users among top M and distances between the users among the top M and the user X to the client terminal device of the user X if the number of the users is larger than M;

wherein M is a positive integer larger than one.

3. The method according to claim 1, wherein before receiving the location information of the user X, the method further comprises:

obtaining, by the client terminal device of the user X, the location information of the user X according to method one to method L;

wherein L is the positive integer larger than one;

reporting, by the client terminal device of the user X, the location information of the user X if the location information of the user X is successfully obtained with a method; and

obtaining, by the client terminal device of the user X, the location information of the user X with a next method if the location information of the user X is not successfully obtained with the method;

wherein the smaller the L is, the higher accuracy of the location information is.

4. A method for searching for nearby users in Social Networking Services (SNS), comprising:

receiving location information and a user Identification (ID) from a client terminal device of a user X;

determining a grid Y, to which the location information belongs;

saving the user ID, the location information and reporting time of the user X in a list of the grid Y;

wherein the grid Y is one of grids in a grid array obtained by dividing a surface of the earth into the grids and areas of the grids are the same;

searching for users in the grid Y and other girds;

wherein the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N=n*n, n is an odd larger than or equal to 3;

ranking the users according to distances between the users and the user X and the reporting time of the user X;

wherein the closer a distance between a user and the user X, the higher rank of the user is, and the shorter time between the reporting time of the user and a current time is, the higher the rank of the user is; and

sending the ranked user IDs of the users and the distances between the users and the user X to the client terminal device of the user X.

5. The method according to claim 4, wherein ranking the users according to the distances between the users and the user X and the reporting time of the user X comprises:

computing a weight A_i=a*D_i+b*T_i of a user i;

wherein a and b are weighting coefficients, D_i is a distance between the user i and the user X, T_i is time between the current time and the reporting time of the user i; and

ranking the users in an ascending order of the weight.

6. The method according to claim 4, wherein sending the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X comprises:

determining whether number of the users is less than or equal to M;

sending the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X if the number of the users is less than or equal to M; and

sending ranked user IDs of users among top M and distances between the users among the top M and the user X to the client terminal device of the user X if the number of the users is larger than M;

wherein M is a positive integer larger than one.

7. The method according to claim 4, wherein before receiving the location information of the user X, the method further comprises:

obtaining, by the client terminal device of the user X, the location information of the user X according to method one to method L;

wherein L is the positive integer larger than one;

reporting, by the client terminal device of the user X, the location information of the user X if the location information of the user X is successfully obtained with a method; and

obtaining, by the client terminal device of the user X, the location information of the user X with a next method if the location information of the user X is not successfully obtained with the method;

wherein the smaller the L is, the higher accuracy of the location information is.

8. A server, comprising:

a first processing module, to divide a surface of the earth into a grid array, in which an area of each grid is the same, and set a list for a grid; and

a second processing module, when location information and a user Identification (ID) from a client terminal device of a user X is received, to determine a grid Y, to which the location information belongs, store the user ID and the location information of the user X in a list of the grid Y, search for users in the grid Y and other girds, in which the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N=n*n and n is an odd larger than or equal to 3, rank the users in an ascending order of distances between the users the user X and send the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X.

9. The server according to claim 8, wherein the second processing module is further to determine whether number of the users is less than or equal to M after the users are ranked, send the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X if the number of the users is less than or equal to M and send ranked user IDs of users among top M and distances between the users among the top M and the user X to the client terminal device of the user X if the number of the users is larger than M;

wherein M is a positive integer larger than one.

10. A server, comprising:

a first processing module, to divide a surface of the earth into a grid array, in which an area of each grid is the same, and set a list for a grid;

a second processing module, when location information and a user Identification (ID) from a client terminal device of a user X is received, to determine a grid Y, to which the location information belongs, store the user ID, the location information and reporting time of the user X in a list of the grid Y, search for users in the grid Y and other girds, in which the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N=n*n and n is an odd larger than or equal to 3, rank the users according to distances between the users and the user X and the reporting time of the user X and send the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X;

wherein the closer a distance between a user and the user X is, the higher rank of the user is, and the shorter time between the reporting time of the user and a current time is, the higher the rank of the user is.

11. The server according to claim 10, wherein the second processing module is further to compute a weight A_i=a*D_i+b*T_i of a user i;

wherein a and b are weighting coefficients, D_i is a distance between the user i and the user X, T_i is time between the current time and the reporting time of the user i and rank the users in an ascending order of the weight.

12. The server according to claim 10, wherein the second processing module is further to determine whether number of the users is less than or equal to M after the users are ranked, send the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X if the number of the users is less than or equal to M and send ranked user IDs of users among top M and distances between the users among the top M and the user X to the client terminal device of the user X if the number of the users is larger than M;

wherein M is a positive integer larger than one.