Patent Grant
9092532
The present disclosure relates to Method and Server for Searching For Nearby User in Social Networking Services.
This section provides background information related to the present disclosure which is not necessarily prior art.
In SNS, a user may search for nearby users and contact with a user to make friends with the user or seek the user's help, etc.
This section provides a general summary of the disclosure, and is not a comprehensive disclosure of its full scope or all of its features.
The present disclosure provides methods and servers for searching for nearby users in Social Networking Services (SNS), to enhance accuracy of a searching result.
A method for searching for nearby users in Social Networking Services (SNS) includes the following:
A method for searching for nearby users in Social Networking Services (SNS) includes the following:
A server includes the following:
A server includes the following:
With the technical scheme of the present disclosure, the searching is performed in the grid, at which the user X is located and nearby grids of the grid. The users which are searched out are ranked according to an ascending order of the distances between the users and the user X. Even a user is not located in the above grid, if the distance between the user the user X is short, the user may be searched out and sent to the user X, which may enhance the accuracy of the result of the searching. In addition, in the scheme of the present disclosure, the ranking may be further performed according to the reporting time in addition to the location information and the user ID of the user X. The shorter time between the reporting time of the user and a current time is, the more likely the user X may get in touch with the user and the higher the rank of the user is, which may enhance the accuracy of the searching result.
Further areas of applicability will become apparent from the description provided herein. The description and specific examples in this summary are intended for purposes of illustration only and are not intended to limit the scope of the present disclosure.
The drawings described herein are for illustrative purposes only of selected embodiments and not all possible implementations, and are not intended to limit the scope of the present disclosure.
Corresponding reference numerals indicate corresponding parts throughout the several views of the drawings.
Example embodiments will now be described more fully with reference to the accompanying drawings.
For simplicity and illustrative purposes, the present disclosure is described by referring mainly to non-limiting examples. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. It will be readily apparent, however, that the present disclosure may be practiced without limitation to these specific details. In other instances, some methods and structures have not been described in detail so as not to unnecessarily obscure the present disclosure. As used throughout the present disclosure, the term “includes” means includes but not limited to, the term “including” means including but not limited to. The term “based on” means based at least in part on. In addition, the terms “a” and “an” are intended to denote at least one of a particular element.
Nearby users may be searched via following methods. According to longitude and latitude information, a server may divide a surface of the earth in to a grid array, in which the area of each grid is the same. As for any user X, when the user X needs to search for nearby users, the user X may send his/her location information and a user Identification (ID) to a server via a client terminal device used by the user X. The client terminal device may be a mobile terminal device. The location information may be the longitude and latitude information. After the server receives the location information from the user X, the server first may determine a grid, to which the location information belongs. Then, the server may search for other users in this grid, search for user IDs of the other users and distances between the other users and the user X and send the user IDs and the distances to the client terminal device of the user X.
However, there are some drawbacks in the above method. The user X may be close to a boundary of two adjacent grids.
In order to enhance the accuracy of the searching result, the present disclosure provides a scheme for searching for nearby users.
In block 21, a surface of the earth may be divided into a grid array, in which an area of each grid may be the same. A list may be set for a grid. According to various embodiments, a list may be set for each grid.
According to an example of the present disclosure, the surface of the earth may be divided into the grid array. Areas of grids in the grid array may be different or may be the same.
According to longitude and latitude information, the surface of the earth may be divided into the grid array, in which the area of each grid may be the same. The area of the grid may be configured as needed, such as one square kilometers.
The list may be empty at an initial stage.
In block 22, when location information and a user ID is received from a client terminal device of a user X, a grid Y, to which the location information belongs may be determined. As for the user X, the user ID and location information of the user X may be stored in list of the grid Y.
The location information may be the longitude and latitude information. Since the grids are divided according to the longitude and latitude information, the grid, to which the received location information belongs, may be determined.
For the convenience of description, in various example of the present disclosure, any user may be denoted by the user X and the grid, to which the user X is located is denoted by the grid Y.
After determining the grid Y, the received user ID and location information may be stored in the list of the grid Y. Therefore, if another user searches for nearby users in the grid Y, the user X may be found.
It should be noted that the user X may search for nearby users repeatedly. The user ID and the location information may be reported many times. In this example, the user ID and the location information of the user X may be stored in the list of the grid Y to ensure the uniqueness of the user information.
For example, assume that the user X is in a grid A and reports his/her user ID and location information. The user ID and location information of the user X may be stored in a list of the grid A. Then, if the gird, at which the user X is located, is changed to a grid B, the user X may report his/her user ID and location information again. Therefore, the user ID and location information of the user X stored in the list of the grid A may be deleted and the user ID and the location information of the user X may be stored in the list of the grid B.
In block 23, users in the grid Y and other grids may be searched out. The grid Y and the other grids may form an N-grid and the grid Y may be the center of the N-grid. Wherein, N=n*n and n is an odd larger than or equal to 3.
The structure of the N-grid may ensure that users on each direction around the user X may be found.
The value of n may be determined according to actual requirements. For example, compared with sparsely populated cities, such as Qinghai and Neimenggu, in densely populated cities, such as Guangzhou, Beijing and Shanghai, the value of N may be 5 or 7, etc.
If the N-grid in this block is the 9-grid shown in
In block 24, users which are searched out may be ranked in an ascending order of distances between the user X and the users and the ranked user IDs of the users. Distances between the user X and the user may be sent to the client terminal device of the user X.
Since the location information of the users which are searched out may be known, the location information of the user X may be known. Therefore, the distances between the user X and the users which are searched out may be computed and the ranking of the user may be performed.
The searching scope in examples of the present disclosure may be enlarged. Therefore, the number of the users which are searched out is increased. For the user X, users ranked lower are usually not included. Therefore, the information of these users needs not to be sent to the user X, which may reduce the amount of transmitted data and save bandwidth resources, etc.
After the ranking is finished, whether the number of users which are searched out is less than or equal to M may be determined. If the number of the users which are searched out is less than or equal to M, the user IDs of the users and the distances between the user X and the users may be sent to the client terminal device of the user X. If the number of the users which are searched out is larger than M, the user IDs of users among top M and the distances between the user X and the users among the top M may be sent to the client terminal device of the user X. M may be a positive integer larger than one. The value of M may be determined according to actual requirements.
Other information besides the user IDs of the users and the distances between the user X and the users, such as avatars of the users, may be sent to the client terminal device of the user X.
In block 41, a surface of the earth may be divided into a grid array, in which an area of each grid may be the same. A list may be set for a grid.
According to an example of the present disclosure, the surface of the earth may be divided into the grid array. Areas of grids in the grid array may be different or may be the same.
In block 42, when location information and a user ID is received from a client terminal device of a user X, a grid Y, to which the location information belongs may be determined. As for the user X, the user ID, location information, and reporting time of the user X may be stored in list of the grid Y.
In block 43, users in the grid Y and other grids may be searched out. The grid Y and the grid may form an N-grid and the grid Y may be the center of the N-grid. Wherein, N=n*n and n may be an odd larger than or equal to 3.
In block 44, users which are searched out may be ranked according to the distances between the users and the user X and the reporting time and ranked user IDs of the users and distances between the user X and the users may be sent to the client terminal device of the user X. The closer the distance between the user X and a user is, the higher the rank of the user is. The shorter the time between the reporting time of the user and the current time is, the higher the rank of the user is.
Compared with the example shown in
In block 44, a weight of a user i Ai=a*Di+b*Ti may be computed, a and b are weighting coefficients and values of a and b may be determined as needed. Di denotes the distance between the user i and the user X. Ti denotes the time between the current time and the reporting time of the user i. The users are ranked in an ascending order of weight.
After the ranking is finished, whether the number of users which are searched out is less than or equal to M may be determined. If the number of the users which are searched out is less than or equal to M, the user IDs of the users and the distances between the user X and the users may be sent to the client terminal device of the user X. If the number of the users which are searched out is larger than M, the user IDs of the users among top M and the distances between the user X and the users among the top M may be sent to the client terminal device of the user X. M may be a positive integer larger than one.
In the above two examples, the client terminal device of the user X may obtain the location information of the user X with the following methods. That is, the client terminal device of the user X may obtain the location information of the user X via method one to method L. After the location information of the user X is obtained, the client terminal device may report the location information. If the location information of the user X is not obtained with a method, the client terminal device of the user X may obtain the location information with a next method. L may be a positive integer larger than one. As for different methods, the smaller the number is, the higher the accuracy of the location information is.
The value of L may be three. Method one may obtain the location information via a Global Positioning System (GPS) function. Method two may obtain the location information via a Cell ID of an eNode B. Method three may obtain the location information via a Media Access Control (MAC) address of a connected Wireless Fidelity (WiFi) access point.
The description of the methods in examples of the present disclosure is finished.
On the basis of the above description,
The second processing module 502 may further determine whether the 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 may be a positive integer larger than one.
According to another example of the present disclosure, the server may include the following:
According to an example of the present disclosure, the first processing module 501 may divide the surface of the earth into the grid array. Areas of grids in the grid array may be different or may be the same.
The second processing module 502 may further compute a weight Ai=a*Di+b*Ti of a user i; wherein a and b are weighting coefficients, Di is a distance between the user i and the user X, Ti 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.
The second processing module 502 may further determine whether the 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 may be a positive integer larger than one.
The server 600 may include a memory 601 and a processor 602.
The memory 601 may store a first processing instruction and a second processing instruction.
The processor 602 may communicate with the memory 601 to execute the first processing instruction, to divide a surface of the earth into a grid array, in which an area of each grid may be the same and set a list for a grid;
execute the second processing instruction to, 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, 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.
According to an example of the present disclosure, the surface of the earth may be divided into the grid array. Areas of grids in the grid array may be different or may be the same.
According to an example, the processor 602 may further execute the second processing instruction, to determine whether number of the users is less than or equal to M after the user 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.
The server 700 may include a memory 701 and a processor 702.
The memory 701 may store a first processing instruction and a second processing instruction.
The processor 702 may communicate with the memory 701 and execute
The processor 702 may further execute the second processing instruction to compute a weight Ai=a*Di+b*Ti of a user i; wherein a and b are weighting coefficients, Di is a distance between the user I and the user X, Ti 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.
The processor 702 may further execute the second processing module 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.
With the technical scheme of the present disclosure, the searching is performed in the grid, at which the user X is located, and in nearby grids of the grid. The users which are searched out are ranked according to an ascending order of the distances between the users and the user X. Even when a user is not located in the above grid, if the distance between the user the user X is short, the user may be searched out and sent to the user X, which may enhance the accuracy of the result of the searching. In addition, in the scheme of the present disclosure, the ranking may be further performed according to the reporting time in addition to the location information and the user ID of the user X. The shorter the time between the reporting time of the user and the current time, the more likely the user X may get in touch with the user and the higher the rank of the user is, which may enhance the accuracy of the searching result.
In various embodiments, a hardware module may be implemented mechanically or electronically. For example, a hardware module may comprise dedicated circuitry or logic that is permanently configured (e.g., as a special-purpose processor, such as a field programmable gate array (FPGA) or an application-specific integrated circuit (ASIC)) to perform certain operations. A hardware module may also comprise programmable logic or circuitry (e.g., as encompassed within a general-purpose processor or other programmable processor) that is temporarily configured by software to perform certain operations. It will be appreciated that the decision to implement a hardware module mechanically, in dedicated and permanently configured circuitry, or in temporarily configured circuitry (e.g., configured by software) may be driven by cost and time considerations.
The foregoing only describes preferred embodiments of the present invention. The protection scope of the present invention, however, is not limited to the above description. Any change or substitution, easily occurring to those skilled in the art, should be covered by the protection scope of the present invention. The foregoing description of the embodiments has been provided for purposes of illustration and description. It is not intended to be exhaustive or to limit the disclosure. Individual elements or features of a particular embodiment are generally not limited to that particular embodiment, but, where applicable, are interchangeable and can be used in a selected embodiment, even if not specifically shown or described. The same may also be varied in many ways. Such variations are not to be regarded as a departure from the disclosure, and all such modifications are intended to be included within the scope of the disclosure.
Reference throughout this specification to “one embodiment,” “an embodiment,” “specific embodiment,” or the like in the singular or plural means that one or more particular features, structures, or characteristics described in connection with an embodiment is included in at least one embodiment of the present disclosure. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment,” “in a specific embodiment,” or the like in the singular or plural in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
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.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2011 1 0363120 | Nov 2011 | CN | national |
This application is a continuation of PCT/CN2012/079561, filed on Aug. 2, 2012, which claims the benefit of priority from Chinese Patent Application, No. 201110363120.4, entitled “Method and Server for Searching for Nearby User in Social Networking Services (SNS)” and filed on Nov. 16, 2011, the entire contents of which are hereby incorporated by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 20090106778 | Pomeroy et al. | Apr 2009 | A1 |
| 20100205242 | Marchioro et al. | Aug 2010 | A1 |
| 20110055264 | Sundelin et al. | Mar 2011 | A1 |
| 20130054698 | Lee et al. | Feb 2013 | A1 |
| Number | Date | Country |
|---|---|---|
| 1908588 | Feb 2007 | CN |
| 101203041 | Jun 2008 | CN |
| 101783080 | Jul 2010 | CN |
| 102004793 | Apr 2011 | CN |
| 102088419 | Jun 2011 | CN |
| 102098388 | Jun 2011 | CN |
| 102147261 | Aug 2011 | CN |
| 102162854 | Aug 2011 | CN |
| 102571910 | Jul 2012 | CN |
| 2011003232 | Jan 2011 | WO |
| Entry |
|---|
| International Search Report for Application No. PCT/CN2012/079561 dated Dec. 6, 2012, and its English translation thereof. |
| Written Opinion of the International Searching Authority for PCT/CN2012/079561 mailed Dec. 6, 2012, and its English translation thereof. |
| Extended European Search Report for Application No. 12849877.1 dated Nov. 5, 2014. |
| Mexican Office Action for Application No. MX/a/2014/005906 dated Feb. 26, 2015, and its English translation thereof. |
| Number | Date | Country | |
|---|---|---|---|
| 20140258281 A1 | Sep 2014 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | PCT/CN2012/079561 | Aug 2012 | US |
| Child | 14277319 | US |
