Method for searching nearby users in social network, and server

Abstract

The invention discloses a method for searching nearby users in a social network, and a server. The method comprises the following steps of: dividing the earth surface into a series of grid arrays with equal area in advance, and respectively setting a list for each grid; when receiving position information and a user identifier which are reported by a client side of any user X, determining a gird Y where the received position information is located, and storing the user identifier and latest position information of the user X in the list corresponding to the grid Y; searching users in other grids which are positioned in the grid Y, forms an N-grid structure together with the grid Y and takes the grid Y as a center; and searching and sequencing all the users according to a sequence of distances between the users and the user X from nearby to far, and returning user identifiers of all the sequenced users and the distances between the sequenced users and the user X to the client side of the user X, wherein in the sequencing process, a reporting time factor can be further considered. Due to application of the method and device disclosed by the invention, the result searching accuracy can be improved.

Description

technical field [0001] The invention relates to Internet technology, in particular to a method and server for searching nearby users in a social network. Background technique [0002] In a social network, in some cases, a user may need to find out nearby users, and then contact them, so as to make friends or ask for help. [0003] In the prior art, the following search methods can be used: the server pre-divides the earth’s surface into a series of equal-area grid arrays according to the latitude and longitude information; for any user, suppose it is user X, when it needs to find nearby users, it will pass The client (such as a mobile terminal) used by itself reports its location information (latitude and longitude information) and user identification to the server; after the server receives the location information reported by user X, it first determines the grid where the location information is located, and then, Find out other users who are also in the grid, and return ...

AI Technical Summary

Problems solved by technology

[0004] However, the above method has certain problems in practical applications, that is, user X may be near the boundary of two adjacent grids, figure 1 is a schematic diagram of the location of user X, such as figure 1 As shown, the two adjacent grids are grid A and grid B respectively. Both user X and user Z are in grid A, and user Y is in grid B. For user X, the distance between user X and user Y is The distance between users will be closer than the distance to user Z. If you want to ask for help, user Y is obviously more suitable than user Z, but according to the existing method, user X will only be able to find user Z, but not user Z. User Y, i.e. the search result is not accurate enough

Images