Target location search method and apparatus

1. A method, comprising:

determining a location designated by a target search request;

determining, from a gridded location area divided into multiple grids corresponding to respective geographical areas, a first grid of the multiple grids that corresponds to the location designated by the target search request;

determining an optimal search radius of the first grid based on pre-set correspondence relationships between the multiple grids and optimal search radiuses, the pre-set correspondence relationships prepared in advance of receiving the target search request by:

respectively making the center point of each grid of the multiple grids in the gridded location area a center of a circle, and performing a target search using an incrementally increasing radius to obtain a minimum search radius for each grid of the multiple grids when reaching a pre-set returned number threshold; and

using the minimum search radius as the grid's optimal search radius;

after determining the optimal search radius, performing a search corresponding to the target search request within a geographical area defined by a center point corresponding to the location designated by the target search request and the optimal search radius determined for the first grid; and

obtaining search results of the search.

2. The method according to claim 1 , wherein the multiple grids of the gridded location area comprise square grids of equal length and width.

3. The method according to claim 1 , further comprising, after obtaining the search results of the search:

determining whether a number of the search results is less than a pre-set lower limit; and

when the number of the search results is less than the pre-set lower limit, using a gradually expanding search radius to perform the search, until the number of search results reaches the pre-set lower limit.

4. The method according to claim 1 , further comprising:

obtaining the gridded location area by:

within a set area, determining latitude and longitude information associated with all target search requests within a set historical time range; and

mapping the latitude and longitude information to obtain the gridded location area.

5. The method according to claim 4 , wherein mapping the latitude and longitude information to obtain the gridded location area comprises:

based on a Geohash algorithm, mapping the latitude and longitude information to obtain the gridded location area.

6. The method according to claim 5 , wherein mapping the latitude and longitude information to obtain the gridded location area based on the Geohash algorithm comprises:

mapping latitude and longitude information corresponding to popular locations to obtain the gridded location area, the popular locations comprising locations for which a search volume is no less than a pre-set value.

7. The method according to claim 6 , wherein:

the gridded location area excludes grids comprising none of the popular locations.

8. An apparatus, comprising a processor and a non-transitory computer-readable storage medium storing instructions that, when executed by the processor, cause the apparatus to perform operations comprising:

determining a location designated by a target search request;

determining, from a gridded location area divided into multiple grids corresponding to respective geographical areas, a first grid of the multiple grids that corresponds to the location designated by the target search request;

determining an optimal search radius of the first grid based on pre-set correspondence relationships between the multiple grids and optimal search radiuses, the pre-set correspondence relationships prepared in advance of receiving the target search request by:

respectively making the center point of each grid of the multiple grids in the gridded location area a center of a circle, and performing a target search using an incrementally increasing radius to obtain a minimum search radius for each grid of the multiple grids when reaching a pre-set returned number threshold; and

using the minimum search radius as the grid's optimal search radius;

after determining the optimal search radius, performing a search corresponding to the target search request within a geographical area defined by a center point corresponding to the location designated by the target search request and the optimal search radius determined for the first grid; and

obtaining search results of the search.

9. The apparatus according to claim 8 , wherein the multiple grids of the gridded location area comprise square grids of equal length and width.

10. The apparatus according to claim 8 , further comprising, after obtaining the search results:

determining whether a number of the search results is less than a pre-set lower limit; and

when the number of the search results is less than the pre-set lower limit, using a gradually expanding search radius to perform the search, until the number of search results reaches the pre-set lower limit.

11. The apparatus according to claim 8 , wherein the operations further comprise: obtaining the gridded location area by:

within a set area, determining latitude and longitude information associated with all target search requests within a set historical time range; and

mapping the latitude and longitude information to obtain the gridded location area.

12. The apparatus according to claim 11 , wherein mapping the latitude and longitude information to obtain the gridded location area comprises:

based on a Geohash algorithm, mapping the latitude and longitude information to obtain the gridded location area.

13. The apparatus according to claim 12 , wherein mapping the latitude and longitude information to obtain the gridded location area based on the Geohash algorithm comprises:

mapping latitude and longitude information corresponding to popular locations to obtain the gridded location area, the popular locations comprising locations for which a search volume is no less than a pre-set value.

14. The apparatus according to claim 13 , wherein:

the gridded location area excludes grids comprising none of the popular locations.

15. A non-transitory computer-readable storage medium storing instructions that, when executed by a processor, cause the processor to perform operations, comprising:

determining a location designated by a target search request;

determining, from a gridded location area divided into multiple grids corresponding to respective geographical areas, a first grid of the multiple grids that corresponds to the location designated by the target search request

determining an optimal search radius of the first grid based on pre-set correspondence relationships between the multiple grids and optimal search radiuses, the pre-set correspondence relationships prepared in advance of receiving the target search request by:

respectively making the center point of each grid of the multiple grids in the gridded location area a center of a circle, and performing a target search using an incrementally increasing radius to obtain a minimum search radius for each grid of the multiple grids when reaching a pre-set returned number threshold; and

using the minimum search radius as the grid's optimal search radius;

after determining the optimal search radius, performing a search corresponding to the target search request within a geographical area defined by a center point corresponding to the location designated by the target search request and the optimal search radius determined for the first grid; and

obtaining search results of the search.

16. The non-transitory computer-readable storage medium according to claim 15 , further comprising:

within a set area, determining latitude and longitude information associated with all target search requests within a set historical time range; and

based on a Geohash algorithm, mapping the latitude and longitude information to obtain the gridded location area.

17. The non-transitory computer-readable storage medium according to claim 16 , wherein mapping the latitude and longitude information to obtain the gridded location area based on the Geohash algorithm comprises:

mapping latitude and longitude information corresponding to popular locations to obtain the gridded location area, the popular locations comprising locations for which a search volume is no less than a pre-set value.

18. The non-transitory computer-readable storage medium according to claim 17 , wherein:

the gridded location area excludes grids comprising none of the popular locations.