CN108920462B - Point of interest (POI) retrieval method and device based on map - Google Patents

Point of interest (POI) retrieval method and device based on map Download PDF

Info

Publication number
CN108920462B
CN108920462B CN201810712391.8A CN201810712391A CN108920462B CN 108920462 B CN108920462 B CN 108920462B CN 201810712391 A CN201810712391 A CN 201810712391A CN 108920462 B CN108920462 B CN 108920462B
Authority
CN
China
Prior art keywords
grid
retrieval
poi
grid index
index
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810712391.8A
Other languages
Chinese (zh)
Other versions
CN108920462A (en
Inventor
韩康
唐旺
张绍瑞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Qihoo Technology Co Ltd
Original Assignee
Beijing Qihoo Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Qihoo Technology Co Ltd filed Critical Beijing Qihoo Technology Co Ltd
Priority to CN201810712391.8A priority Critical patent/CN108920462B/en
Publication of CN108920462A publication Critical patent/CN108920462A/en
Application granted granted Critical
Publication of CN108920462B publication Critical patent/CN108920462B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/20Natural language analysis
    • G06F40/279Recognition of textual entities
    • G06F40/289Phrasal analysis, e.g. finite state techniques or chunking

Abstract

The invention discloses a method and a device for searching a point of interest (POI) based on a map. The method comprises the following steps: carrying out grid division on the geographic space containing the POI to obtain a plurality of grids; setting a plurality of grid index levels, and respectively establishing grid indexes for the grids under different grid index levels; and selecting a matched grid index level according to the retrieval conditions, and utilizing the grid index under the grid index level to perform POI retrieval to obtain a retrieval result and returning the retrieval result. According to the technical scheme, by setting the multi-grid index levels, the data volume needing to participate in operation can be effectively reduced during retrieval, the retrieval efficiency is greatly improved, the resource consumption is reduced, and the response time for returning the retrieval result is shortened.

Description

Point of interest (POI) retrieval method and device based on map
Technical Field
The invention relates to the technical field of electronic maps, in particular to a method and a device for searching a point of interest (POI) based on a map.
Background
POI is usually an abbreviation of point of interest, and may also refer to point of information. Points of interest and information points may be identified in the map as banks, sights, companies, hospitals, government agencies, restaurants, malls, and the like. The "point of interest" and "POI" in the present invention both refer to the above meanings.
The user may search for POIs in the map, such as locating a museum in a certain area. How to improve the retrieval efficiency is a problem to be solved.
Disclosure of Invention
In view of the above, the present invention has been made to provide a map-based point of interest (POI) retrieval method and apparatus that overcomes or at least partially solves the above problems.
According to one aspect of the invention, a map-based POI (point of interest) retrieval method is provided, which comprises the following steps: carrying out grid division on a geographic space containing POI to obtain a plurality of grids; setting a plurality of grid index levels, and respectively establishing grid indexes for the grids under different grid index levels; and selecting a matched grid index level according to the retrieval conditions, and utilizing the grid index under the grid index level to perform POI retrieval to obtain a retrieval result and returning the retrieval result.
Optionally, the grid division of the geographic space containing the point of interest POI to obtain multiple grids includes: establishing a grid coordinate system for the geographic space by a preset scale, and dividing the geographic space into a plurality of rectangular grids with the same size; and determining the grid number of each grid according to a preset grid number rule.
Optionally, the respectively establishing the grid indexes for the multiple grids under different grid index levels includes: calculating the row number and the column number of the grid to which each POI belongs in the grid coordinate system according to the geographical position information of each POI; calculating the grid number of the corresponding grid according to the calculated row number and column number and the grid number rule; and generating the corresponding relation between each POI and the corresponding grid number.
Optionally, the respectively establishing the grid indexes for the multiple grids under different grid index levels includes: and establishing an inverted index table corresponding to each grid index level by taking the grid number as a main key and taking the index numbers of all POI (point of interest) contained in the corresponding grid as field contents.
Optionally, the plurality of grid index levels respectively correspond to different geospatial scales.
Optionally, the search condition includes a search geographic area and a search keyword; selecting a matched grid index level according to the retrieval condition, and utilizing a grid index under the grid index level to perform POI retrieval to obtain a retrieval result and return the retrieval result, wherein the POI retrieval result comprises the following steps: selecting a matched grid index level according to the retrieval geographic area, determining a grid to be retrieved, and determining a first POI set corresponding to the grid to be retrieved according to a grid index under the grid index level; determining a second POI set according to the retrieval key words; and solving an intersection of the first POI set and the second POI set, and taking each POI in the intersection as a retrieval result and returning.
Optionally, the selecting a matching grid index level according to the retrieval geographic area and determining a grid to be retrieved includes: determining a minimum outsourcing rectangle for the retrieved geographic area; traversing each grid index level from large to small according to the geographic space scale, and selecting the grid index level with the highest matching degree with the minimum outsourcing rectangle; calculating one or more corresponding grids according to the minimum outsourcing rectangle, and generating a first retrieval mark corresponding to the one or more grids; and according to the first retrieval mark, carrying out POI retrieval in the grid index under the selected grid index level to obtain a first POI set containing a plurality of POIs.
Optionally, the determining the second POI set according to the search keyword includes: performing natural language processing on the retrieval key words, and generating second retrieval marks corresponding to the retrieval key words according to analysis results; and performing POI retrieval according to the second retrieval mark to obtain a second POI set comprising a plurality of POIs.
Optionally, the taking each POI in the intersection as a retrieval result and returning includes: and filtering and sequencing each POI in the intersection to obtain a final retrieval result and returning the final retrieval result.
Optionally, the filtering and sorting the search results includes: acquiring geographical position information of each POI in the intersection, comparing the geographical position information with the retrieval geographical area, and removing POIs outside the retrieval geographical area from the intersection; and scoring all remaining POIs in the intersection according to the retrieval keywords, and sequencing according to the scoring result.
According to another aspect of the present invention, there is provided a map-based POI retrieval apparatus, including: the grid indexing unit is suitable for carrying out grid division on the geographic space containing the POI to obtain a plurality of grids; setting a plurality of grid index levels, and respectively establishing grid indexes for the grids under different grid index levels; and the POI retrieval unit is suitable for selecting a matched grid index level according to the retrieval conditions, utilizing the grid index under the grid index level to perform POI retrieval, obtaining a retrieval result and returning the retrieval result.
Optionally, the grid indexing unit is adapted to establish a grid coordinate system for the geographic space with a preset scale, and divide the geographic space into a plurality of rectangular grids with the same size; and determining the grid number of each grid according to a preset grid number rule.
Optionally, the grid indexing unit is adapted to calculate, according to the geographical location information of each POI, a row number and a column number of a grid to which each POI belongs in the grid coordinate system; calculating the grid number of the corresponding grid according to the calculated row number and column number and the grid number rule; and generating the corresponding relation between each POI and the corresponding grid number.
Optionally, the grid index unit is adapted to establish an inverted index table corresponding to each grid index level by using the grid number as a main key and using the index numbers of all POIs included in the corresponding grid as field contents.
Optionally, the plurality of grid index levels respectively correspond to different geospatial scales.
Optionally, the search condition includes a search geographic area and a search keyword; the POI retrieval unit is suitable for selecting a matched grid index level according to the retrieval geographic area, determining a grid to be retrieved, and determining a first POI set corresponding to the grid to be retrieved according to a grid index under the grid index level; determining a second POI set according to the retrieval key words; and solving an intersection of the first POI set and the second POI set, and taking each POI in the intersection as a retrieval result and returning.
Optionally, the POI retrieval unit is adapted to determine a minimum outsourcing rectangle for the retrieved geographic area; traversing each grid index level from large to small according to the geographic space scale, and selecting the grid index level with the highest matching degree with the minimum outsourcing rectangle; calculating one or more corresponding grids according to the minimum outsourcing rectangle, and generating a first retrieval mark corresponding to the one or more grids; and according to the first retrieval mark, carrying out POI retrieval in the grid index under the selected grid index level to obtain a first POI set containing a plurality of POIs.
Optionally, the POI retrieval unit is adapted to perform natural language processing on the retrieval keyword, and generate a second retrieval tag corresponding to the retrieval keyword according to an analysis result; and searching POI according to the second searching mark to obtain a second POI set containing a plurality of POI.
Optionally, the POI retrieving unit is adapted to filter and sort each POI in the intersection to obtain a final retrieval result, and return the final retrieval result.
Optionally, the POI retrieving unit is adapted to obtain geographic location information of each POI in the intersection, compare the geographic location information with the retrieved geographic area, and remove POIs outside the retrieved geographic area from the intersection; and scoring all remaining POIs in the intersection according to the retrieval keywords, and sequencing according to the scoring result.
According to still another aspect of the present invention, there is provided an intelligent terminal including: a processor; and a memory arranged to store computer executable instructions that, when executed, cause the processor to perform a method as any one of the above.
According to a further aspect of the invention, there is provided a computer readable storage medium, wherein the computer readable storage medium stores one or more programs which, when executed by a processor, implement a method as any one of the above.
According to the technical scheme, the grid division is carried out on the geographic space containing the POI to obtain the multiple grids, the grid indexes are respectively established for the multiple grids under different set grid index levels, so that the matched grid index levels are selected according to the retrieval conditions during retrieval, the grid indexes under the grid index levels are utilized to carry out POI retrieval, and the retrieval result is obtained and returned. According to the technical scheme, by setting the multi-grid index levels, the data volume needing to participate in operation can be effectively reduced during retrieval, the retrieval efficiency is greatly improved, the resource consumption is reduced, and the response time for returning the retrieval result is shortened.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 is a schematic flowchart of a map-based POI retrieval method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a map-based POI retrieval apparatus according to an embodiment of the present invention;
FIG. 3 shows a schematic structural diagram of an intelligent terminal according to one embodiment of the invention;
fig. 4 shows a schematic structural diagram of a computer-readable storage medium according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
When searching in an electronic map containing a plurality of POIs, generally, a user gives a search key word, such as 'food', 'movie theatre', and selects a geographic area as a search range, such as 'nearby 3 km', in this case, the current geographic position information of the user needs to be acquired, and the corresponding POI is searched in a circular area with the radius of 3 km.
In the prior art, at least two times of searches are usually required for the above situations, and one time of searches is performed by using a search keyword to obtain a search result set; firstly, searching in a geographic area to obtain a search result set; the two sets are then intersected. In practice, in order to improve the efficiency of searching in a geographic area, longitude and latitude may be used, that is, searching in a longitude interval and searching in a latitude interval, so that three sets are actually obtained, and the intersection of the three sets is required.
Obviously, the geographic area (which may also be referred to as a recall area) corresponding to the longitude interval search and the latitude interval search is extremely large, and the number of POIs in the obtained set is large, so that the time consumption of intersection solving operation is further large.
Setting the index is an effective way to improve the retrieval efficiency, for example, a combination of setting the longitude index and the latitude index. In order to further improve the performance, the design idea of the scheme of the invention is as follows in consideration of the application scene in the field of electronic maps: carrying out grid division on the geographic space, and setting a grid index to reduce a recall area; and further considering that the geographical area selected by the user can be any, a multi-level grid index is set, different requirements of the user are met, time is changed by space, and the response speed is further improved. It was verified that the average response time could be reduced by 20 ms.
Fig. 1 is a flowchart illustrating a map-based POI (point of interest) retrieval method according to an embodiment of the present invention. As shown in fig. 1, the method includes:
step S110, grid division is carried out on the geographic space containing the POI, and a plurality of grids are obtained.
This step may refer to various ways of dividing the mesh in the field of electronic maps, which is not limited in this embodiment.
Step S120, setting a plurality of grid index levels, and respectively establishing grid indexes for the grids under different grid index levels.
And step S130, selecting a matched grid index level according to the retrieval conditions, and utilizing the grid index under the grid index level to perform POI retrieval to obtain a retrieval result and returning the retrieval result.
As can be seen, in the method shown in fig. 1, a plurality of grids are obtained by performing grid division on a geographic space including a POI, and grid indexes are respectively established for the plurality of grids under different set grid index levels, so that a matched grid index level is selected according to a retrieval condition during retrieval, and the POI retrieval is performed by using the grid index under the grid index level, so as to obtain a retrieval result and return the retrieval result. According to the technical scheme, by setting the multi-grid index levels, the data volume needing to participate in operation can be effectively reduced during retrieval, the retrieval efficiency is greatly improved, the resource consumption is reduced, and the response time for returning the retrieval result is shortened.
In an embodiment of the present invention, the grid division of the geographic space including the POI to obtain a plurality of grids includes: establishing a grid coordinate system for a geographic space by a preset scale, and dividing the geographic space into a plurality of rectangular grids with the same size; and determining the grid number of each grid according to a preset grid number rule.
For example, the width and height of a grid correspond to 1.25km in geographic space, an example of a grid numbering rule is as follows: when numbering is carried out, the lower left corner of the geographic space is set as the origin of the grid coordinate system, and numbering is carried out from number 0 in the sequence from bottom to top and from left to right.
In an embodiment of the present invention, the establishing the grid indexes for the grids respectively at different grid index levels in the method includes: calculating the row number and the column number of the grid to which each POI belongs in a grid coordinate system according to the geographical position information of each POI; calculating the grid number of the corresponding grid according to the calculated row number and column number and the grid number rule; and generating the corresponding relation between each POI and the corresponding grid number.
Taking the grid numbering rule shown in the above embodiment as an example, the geographic coordinate of the grid coordinate system origin is (x)0,y0) The geographic coordinates of the POI are (x)i,yi) Then, thenThe row number m and the column number n of the grid where the POI is located can be calculated by the formula (1):
m=int(xi-x0)/Δh+1;n=int(yi-y0)/Δh+1 (1)
wherein int represents the rounding operation, x0、y0Respectively, Δ h represents the side length of the grid (in this example, the width and height of the grid are equal, i.e., the grid is square). Then, calculating grid number grid according to formula (2):
grid=(n-1)*M+m-1 (2)
where M is the maximum number of grid lines.
For example, for a 3 × 3 grid, M is 3, the grid numbers of the three grids in the first column from bottom to top are 0,1, and 2, the grid numbers of the three grids in the second column from bottom to top are 3, 4, and 5, and the grid numbers of the three grids in the third column from bottom to top are 6, 7, and 8. After the row number is 2 and the column number is 3, grid 2 + 3+2-1 7 can be quickly calculated according to the formula.
The grid index is actually an index of POIs in the grid, i.e. an inverted index. For example, in an embodiment of the present invention, the establishing the grid indexes for the grids respectively at different grid index levels in the method includes: and establishing an inverted index table corresponding to each grid index level by taking the grid number as a main key and taking the index numbers of all POI (point of interest) contained in the corresponding grid as field contents.
Taking the grid with the grid number 10000 as an example, the grid may include 4 POIs, and the index numbers are 40001, 40002, 40003, and 40004, respectively, and then it is recorded as the primary key 10000, the field contents 40001, 40002, 40003, and 40004 in the inverted index table of a certain level. Thus, when the POI is searched, if the grid with the grid number 10000 is obtained, the POI with the index numbers 40001, 40002, 40003 and 40004 can be directly determined to be put into the corresponding POI set. Since there are a plurality of mesh index hierarchies, it can be seen that one POI is recorded in a plurality of inverted index tables.
In one embodiment of the present invention, in the method, the plurality of grid index levels respectively correspond to different geospatial scales.
For example, 4 grid index levels are set, and the corresponding geospatial scales are 5km, 10km, 25km and 50km respectively. It can be seen that, due to the difference of the geospatial dimensions, the geospatial corresponding to the grid is fixed, and taking 1.25km in the geospatial corresponding to the width and height of the grid as an example, when the grid index is set, a geospatial dimension of 5km may correspond to 4 grids, and a geographic dimension of 10km corresponds to 8 grids.
The benefits of such an arrangement are explained below in connection with the retrieval of POIs by a user. In an embodiment of the present invention, in the above method, the search condition includes a search geographic area and a search keyword; selecting a matched grid index level according to the retrieval condition, and utilizing the grid index under the grid index level to carry out POI retrieval to obtain a retrieval result and return the retrieval result to the system, wherein the retrieval result comprises the following steps: selecting a matched grid index level according to the retrieval geographic area, determining a grid to be retrieved, and determining a first POI set corresponding to the grid to be retrieved according to a grid index under the grid index level; determining a second POI set according to the retrieval key words; and solving an intersection of the first POI set and the second POI set, and taking each POI in the intersection as a retrieval result and returning.
The search key may correspond to a POI name, such as "bank of industrial and commercial china"; it may also correspond to a POI type, such as "dining". The search geographical area may be a geographical area near the user, or may be a geographical area manually input by the user, and after two independent POI searches are performed, the final POI search result may be obtained by solving the intersection of the search results.
In an embodiment of the present invention, the selecting a matching grid index level according to the search geographic area and determining the grid to be searched includes: determining a minimum outsourcing rectangle of the retrieval geographical area; traversing each grid index level from large to small according to the geographic spatial scale, and selecting the grid index level with the highest matching degree with the minimum outsourcing rectangle; calculating one or more corresponding grids according to the minimum outsourcing rectangle, and generating a first retrieval mark corresponding to the one or more grids; and according to the first retrieval mark, carrying out POI retrieval in the grid index under the selected grid index hierarchy to obtain a first POI set containing a plurality of POIs.
The user-selected search geographical area is generally a circle or rectangle, and may be an irregular area. In this embodiment, a minimum bounding rectangle is used so as to correspond to a grid of rectangles. According to the size of the minimum outsourcing rectangle, a proper grid index level can be selected, for example, if the geographic space distance corresponding to the minimum outsourcing rectangle is 3km x 5km, a grid index level of 5km can be selected; and if the geographic space distance corresponding to the minimum outer-wrapping rectangle is 30km by 50km, selecting a grid index level of 50 km.
When the matched grid index hierarchy is selected, traversal can be performed from large to small according to the geographic spatial scale, for example, the minimum outsourcing rectangle is matched with 50km, and then, matching is performed on the minimum outsourcing rectangle with 20km, 10km and 5km in sequence. The resulting value of the first retrieval tag (token) is actually a number of grid numbers. Therefore, the index number of the POI can be directly obtained by searching in the inverted index table.
In an embodiment of the present invention, the determining the second POI set according to the search key includes: performing natural language processing on the retrieval key words, and generating second retrieval marks corresponding to the retrieval key words according to analysis results; and searching POI according to the second searching mark to obtain a second POI set containing a plurality of POI.
The natural language processing may include segmenting the search keyword to obtain a plurality of segmented objects (term), and combining the segmented objects into a second search token (token) according to the term.
In the above embodiment, the search key and the search geographic area are selected to obtain two POI sets, and actually, other restrictions may be added in the application, for example, to limit POI search in a certain city.
In an embodiment of the present invention, the above method, using each POI in the intersection as a search result and returning includes: and filtering and sequencing each POI in the intersection to obtain a final retrieval result and returning the final retrieval result.
In order to further ensure the accuracy of the retrieval result and improve the user experience, the POIs may be filtered and ranked. Wherein the filtering has a great influence on the result accuracy, especially in the case of region retrieval. For example, as shown in the above embodiments, a minimum bounding rectangle needs to be found for the search geographic area, and it is easy to imagine that the resulting POI is likely to be actually in the minimum bounding rectangle but not in the search geographic area (taking the search geographic area as a circle, the POIs near the four corners of the minimum bounding rectangle are not in the search geographic area).
Therefore, in an embodiment of the present invention, in the above method, the filtering and sorting the search results includes: acquiring the geographical position information of each POI in the intersection, comparing the geographical position information with the retrieval geographical area, and removing the POI outside the retrieval geographical area from the intersection; and scoring all the remaining POIs in the intersection according to the retrieval keywords, and sequencing according to scoring results.
In this embodiment, by acquiring geographic position information (such as longitude and latitude information) of each POI and performing geometric calculation with the retrieved geographic area, it can be determined whether the POI falls into the retrieved geographic area, and further, POIs not in the retrieved geographic area are screened out. POI ranking can be implemented according to rank scores in the prior art, and is not described herein.
The following is an example of a POI search using "near food" input by the user in beijing as a search key:
first, three tokens are generated, as shown in the following table:
Figure BDA0001716897570000101
here, "food" corresponds to the second retrieval flag in the above embodiment, and the mesh token corresponds to the first retrieval flag in the above embodiment. Word is only a value corresponding to the first two searches, and the generation process of the grid token is mainly introduced without excessive description.
The longitude and latitude of the current position of the user are (116.49101, 39.98303), the default distance range of nearby searching is 5km, a circular area is obtained according to the central point and the radius, the maximum external rectangle is mbr [4] ═ 31469013,31480020,17148906,17159913], the first two are longitude ranges (in the form of mercator coordinates), and the last two are latitude ranges (in the form of mercator coordinates).
And screening the index area closest to the area according to the latitude and longitude range. Traversing the four levels of grid indices, it is easy to find the region found with the lowest level of grid index (5km grid index) that is closest to the region the user is looking for. After finding the 5km area, taking out the grid number of the area to form a grid number set: [16197858,16197865,16246949,16246956]. The 4 grid numbers in the set are corresponding to 4, which is 5km (the geospatial scale corresponding to the grid index level)/1.25 km (the geospatial corresponding to the grid) shown above.
The format of the mesh token in this example is: "grid _ model _" + grid number set, and thus the last generated grid token is grid _ model _16197858_16197865_16246949_ 16246956.
Further, according to an inverted index table established under the grid index level, the inverted index tables of the three tokens are pulled to obtain an intersection, then according to the position where the user really is located, the screening is carried out according to the range of the radius of 5km to obtain a final poi set, and finally, according to rank grading, the poi results are output in the sequence from high to low.
Fig. 2 is a schematic structural diagram of a map-based POI retrieval apparatus according to an embodiment of the present invention. As shown in fig. 2, the map-based POI retrieval apparatus 200 includes:
the grid indexing unit 210 is adapted to perform grid division on a geographic space containing the POI to obtain a plurality of grids; setting a plurality of grid index levels, and respectively establishing grid indexes for the grids under different grid index levels.
Various modes for dividing grids in the field of electronic maps can be referred to, and the method is not limited in the embodiment.
And the POI retrieving unit 220 is adapted to select a matching grid index level according to the retrieving condition, and retrieve the POI by using the grid index under the grid index level to obtain and return the retrieving result.
As can be seen, the apparatus shown in fig. 2 performs mesh division on a geographic space including POIs through mutual cooperation of the units to obtain a plurality of meshes, and establishes mesh indexes for the plurality of meshes respectively under different set mesh index levels, so that a matched mesh index level is selected according to a retrieval condition during retrieval, and the mesh indexes under the mesh index level are used for performing POI retrieval to obtain a retrieval result and return the retrieval result. According to the technical scheme, by setting the multi-grid index levels, the data volume needing to participate in operation can be effectively reduced during retrieval, the retrieval efficiency is greatly improved, the resource consumption is reduced, and the response time for returning the retrieval result is shortened.
In an embodiment of the present invention, in the above apparatus, the grid indexing unit 210 is adapted to establish a grid coordinate system for a geographic space with a preset scale, and divide the geographic space into a plurality of rectangular grids with the same size; and determining the grid number of each grid according to a preset grid number rule.
For example, the width and height of a grid correspond to 1.25km in geographic space, an example of a grid numbering rule is as follows: when numbering is carried out, the lower left corner of the geographic space is set as the origin of the grid coordinate system, and numbering is carried out from number 0 in the sequence from bottom to top and from left to right.
In an embodiment of the present invention, in the above apparatus, the grid indexing unit 210 is adapted to calculate, according to the geographical location information of each POI, a row number and a column number of a grid to which each POI belongs in a grid coordinate system; calculating the grid number of the corresponding grid according to the calculated row number and column number and the grid number rule; and generating the corresponding relation between each POI and the corresponding grid number.
Taking the grid numbering rule shown in the above embodiment as an example, the geographic coordinate of the grid coordinate system origin is (x)0,y0) The geographic coordinates of the POI are (x)i,yi) Then, the row number m and the column number n of the grid where the POI is located can be calculated by formula (1):
m=int(xi-x0)/Δh+1;n=int(yi-y0)/Δh+1 (1)
wherein int represents the rounding operation, x0、y0Respectively, Δ h represents the side length of the grid (in this example, the width and height of the grid are equal, i.e., the grid is square). Then, calculating grid number grid according to formula (2):
grid=(n-1)*M+m-1 (2)
where M is the maximum number of grid lines.
For example, for a 3 × 3 grid, M is 3, the grid numbers of the three grids in the first column from bottom to top are 0,1, and 2, the grid numbers of the three grids in the second column from bottom to top are 3, 4, and 5, and the grid numbers of the three grids in the third column from bottom to top are 6, 7, and 8. After the row number is 2 and the column number is 3, grid 2 + 3+2-1 7 can be quickly calculated according to the formula.
The grid index is actually an index of POIs in the grid, i.e. an inverted index. For example, in an embodiment of the present invention, in the above apparatus, the grid indexing unit 210 is adapted to establish an inverted index table corresponding to each grid index level by using the grid number as a primary key and using the index numbers of all POIs included in the corresponding grid as field contents.
Taking the grid with the grid number 10000 as an example, the grid may include 4 POIs, and the index numbers are 40001, 40002, 40003, and 40004, respectively, and then it is recorded as the primary key 10000, the field contents 40001, 40002, 40003, and 40004 in the inverted index table of a certain level. Thus, when the POI is searched, if the grid with the grid number 10000 is obtained, the POI with the index numbers 40001, 40002, 40003 and 40004 can be directly determined to be put into the corresponding POI set. Since there are a plurality of mesh index hierarchies, it can be seen that one POI is recorded in a plurality of inverted index tables.
In an embodiment of the present invention, in the above apparatus, the plurality of grid index levels respectively correspond to different geospatial scales.
For example, 4 grid index levels are set, and the corresponding geospatial scales are 5km, 10km, 25km and 50km respectively. It can be seen that, due to the difference of the geospatial dimensions, the geospatial corresponding to the grid is fixed, and taking 1.25km in the geospatial corresponding to the width and height of the grid as an example, when the grid index is set, a geospatial dimension of 5km may correspond to 4 grids, and a geographic dimension of 10km corresponds to 8 grids.
The benefits of such an arrangement are explained below in connection with the retrieval of POIs by a user. In an embodiment of the present invention, in the above apparatus, the search condition includes a search geographic area and a search keyword; the POI retrieval unit 220 is adapted to select a matched grid index level according to a retrieved geographic area, determine a grid to be retrieved, and determine a first POI set corresponding to the grid to be retrieved according to a grid index under the grid index level; determining a second POI set according to the retrieval key words; and solving an intersection of the first POI set and the second POI set, and taking each POI in the intersection as a retrieval result and returning.
The search key may correspond to a POI name, such as "bank of industrial and commercial china"; it may also correspond to a POI type, such as "dining". The search geographical area may be a geographical area near the user, or may be a geographical area manually input by the user, and after two independent POI searches are performed, the final POI search result may be obtained by solving the intersection of the search results.
In an embodiment of the present invention, in the above apparatus, the POI retrieving unit 220 is adapted to determine a minimum outsourcing rectangle for retrieving the geographic area; traversing each grid index level from large to small according to the geographic spatial scale, and selecting the grid index level with the highest matching degree with the minimum outsourcing rectangle; calculating one or more corresponding grids according to the minimum outsourcing rectangle, and generating a first retrieval mark corresponding to the one or more grids; and according to the first retrieval mark, carrying out POI retrieval in the grid index under the selected grid index hierarchy to obtain a first POI set containing a plurality of POIs.
The user-selected search geographical area is typically a circle or rectangle, and may be an irregular area. In this embodiment, a minimum bounding rectangle is used so as to correspond to a grid of rectangles. According to the size of the minimum outsourcing rectangle, a proper grid index level can be selected, for example, if the geographic space distance corresponding to the minimum outsourcing rectangle is 3km x 5km, a grid index level of 5km can be selected; and if the geographic space distance corresponding to the minimum outer-wrapping rectangle is 30km by 50km, selecting a grid index level of 50 km.
When the matched grid index hierarchy is selected, traversal can be performed from large to small according to the geographic spatial scale, for example, the minimum outsourcing rectangle is matched with 50km, and then, matching is performed on the minimum outsourcing rectangle with 20km, 10km and 5km in sequence. The resulting value of the first retrieval tag (token) is actually a number of grid numbers. Therefore, the index number of the POI can be directly obtained by searching in the inverted index table.
In an embodiment of the present invention, in the above apparatus, the POI retrieval unit 220 is adapted to perform natural language processing on the retrieval key word, and generate a second retrieval tag corresponding to the retrieval key word according to the analysis result; and searching POI according to the second searching mark to obtain a second POI set containing a plurality of POI.
The natural language processing may include segmenting the search keyword to obtain a plurality of segmented objects (term), and combining the segmented objects into a second search token (token) according to the term.
In the above embodiment, the search key and the search geographic area are selected to obtain two POI sets, and actually, other restrictions may be added in the application, for example, to limit POI search in a certain city.
In an embodiment of the present invention, in the above apparatus, the POI retrieving unit 220 is adapted to filter and sort the POIs in the intersection to obtain a final retrieval result, and return the final retrieval result.
In order to further ensure the accuracy of the retrieval result and improve the user experience, the POIs may be filtered and ranked. Wherein the filtering has a great influence on the result accuracy, especially in the case of region retrieval. For example, as shown in the above embodiments, a minimum bounding rectangle needs to be found for the search geographic area, and it is easy to imagine that the resulting POI is likely to be actually in the minimum bounding rectangle but not in the search geographic area (taking the search geographic area as a circle, the POIs near the four corners of the minimum bounding rectangle are not in the search geographic area).
Therefore, in an embodiment of the present invention, in the above apparatus, the POI retrieving unit 220 is adapted to obtain geographic location information of each POI in the intersection, compare the geographic location information with the retrieved geographic area, and remove POIs outside the retrieved geographic area from the intersection; and scoring all the remaining POIs in the intersection according to the retrieval keywords, and sequencing according to scoring results.
In this embodiment, by acquiring geographic position information (such as longitude and latitude information) of each POI and performing geometric calculation with the retrieved geographic area, it can be determined whether the POI falls into the retrieved geographic area, and further, POIs not in the retrieved geographic area are screened out. POI ranking can be implemented according to rank scores in the prior art, and is not described herein.
Similarly, the above-mentioned "nearby gourmet food" may be referred to as a search key to perform the search, and will not be described again here.
In summary, according to the technical solution of the present invention, a plurality of grids are obtained by performing grid division on a geographic space including a POI, and grid indexes are respectively established for the plurality of grids under different set grid index levels, so that a matched grid index level is selected according to a search condition during searching, and the grid indexes under the grid index level are used to perform POI searching, so as to obtain a search result and return the search result. According to the technical scheme, the multi-grid index levels are arranged, so that the data volume needing to participate in operation can be effectively reduced during retrieval, the retrieval efficiency is greatly improved, the resource consumption is reduced, and the response time of returning the retrieval result is shortened.
It should be noted that:
the algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose devices may be used with the teachings herein. The required structure for constructing an arrangement of this type will be apparent from the description above. Moreover, the present invention is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.
The various component embodiments of the invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. It will be appreciated by those skilled in the art that a microprocessor or Digital Signal Processor (DSP) may be used in practice to implement some or all of the functions of some or all of the components of the map-based point of interest POI retrieval apparatus according to embodiments of the present invention. The present invention may also be embodied as apparatus or device programs (e.g., computer programs and computer program products) for performing a portion or all of the methods described herein. Such programs implementing the present invention may be stored on computer-readable media or may be in the form of one or more signals. Such a signal may be downloaded from an internet website or provided on a carrier signal or in any other form.
For example, fig. 3 shows a schematic structural diagram of an intelligent terminal according to an embodiment of the present invention. The intelligent terminal comprises a processor 310 and a memory 320 arranged to store computer executable instructions (computer readable program code). The memory 320 may be an electronic memory such as a flash memory, an EEPROM (electrically erasable programmable read only memory), an EPROM, a hard disk, or a ROM. The memory 320 has a storage space 330 storing computer readable program code 331 for performing any of the method steps described above. For example, the storage space 330 for storing the computer readable program code may comprise respective computer readable program codes 331 for respectively implementing various steps in the above method. The computer readable program code 331 can be read from or written to one or more computer program products. These computer program products comprise a program code carrier such as a hard disk, a Compact Disc (CD), a memory card or a floppy disk. Such a computer program product is typically a computer readable storage medium such as described in fig. 4. Fig. 4 shows a schematic structural diagram of a computer-readable storage medium according to an embodiment of the present invention. The computer readable storage medium 400 stores computer readable program code 331 for performing the steps of the method according to the present invention, which is readable by the processor 310 of the smart terminal 300 and when the computer readable program code 331 is executed by the smart terminal 300, causes the smart terminal 300 to perform the steps of the method described above, and in particular, the computer readable program code 331 stored by the computer readable storage medium may perform the method shown in any of the embodiments described above. The computer readable program code 331 may be compressed in a suitable form.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names.

Claims (16)

1. A map-based point of interest (POI) retrieval method comprises the following steps:
carrying out grid division on a geographic space containing POI to obtain a plurality of grids;
setting a plurality of grid index levels, and respectively establishing grid indexes for the grids under different grid index levels;
selecting a matched grid index level according to a retrieval condition, and utilizing a grid index under the matched grid index level to perform POI retrieval to obtain a retrieval result and return the retrieval result;
wherein the plurality of grid index levels respectively correspond to different geospatial scales;
the retrieval condition comprises a retrieval geographic area and a retrieval keyword; selecting a matched grid index level according to the retrieval condition, and utilizing a grid index under the matched grid index level to perform POI retrieval to obtain a retrieval result and return the retrieval result, wherein the POI retrieval comprises the following steps:
selecting a matched grid index level according to the retrieval geographic area, determining a grid to be retrieved, and determining a first POI set corresponding to the grid to be retrieved according to a grid index under the matched grid index level;
determining a second POI set according to the retrieval key words;
solving an intersection of the first POI set and the second POI set, and taking each POI in the intersection as a retrieval result and returning the retrieval result;
wherein, the selecting the matched grid index level according to the search geographic area and determining the grid to be searched comprises:
determining a minimum outsourcing rectangle for the retrieved geographic area;
traversing each grid index level from large to small according to the geographic space scale, and selecting the grid index level with the highest matching degree with the minimum outsourcing rectangle;
calculating one or more corresponding grids according to the minimum outsourcing rectangle, and generating a first retrieval mark corresponding to the one or more grids;
and according to the first retrieval mark, carrying out POI retrieval in the grid index under the selected grid index level to obtain a first POI set containing a plurality of POIs.
2. The method of claim 1, wherein the grid partitioning the geographic space containing the POI to obtain a plurality of grids comprises:
establishing a grid coordinate system for the geographic space by a preset scale, and dividing the geographic space into a plurality of rectangular grids with the same size;
and determining the grid number of each grid according to a preset grid number rule.
3. The method of claim 2, wherein said separately establishing a grid index for the plurality of grids at different grid index levels comprises:
calculating the row number and the column number of the grid to which each POI belongs in the grid coordinate system according to the geographical position information of each POI;
calculating the grid number of the corresponding grid according to the calculated row number and column number and the grid number rule;
and generating the corresponding relation between each POI and the corresponding grid number.
4. The method of claim 1, wherein said separately establishing a grid index for the plurality of grids at different grid index levels comprises:
and establishing an inverted index table corresponding to each grid index level by taking the grid number as a main key and taking the index numbers of all POI (point of interest) contained in the corresponding grid as field contents.
5. The method of any one of claims 1-4, wherein said determining a second set of POIs from the search key comprises:
performing natural language processing on the retrieval key words, and generating second retrieval marks corresponding to the retrieval key words according to analysis results;
and searching POI according to the second searching mark to obtain a second POI set containing a plurality of POI.
6. The method of any one of claims 1-4, wherein the taking each POI in the intersection as a search result and returning comprises:
and filtering and sequencing each POI in the intersection to obtain a final retrieval result and returning the final retrieval result.
7. The method of claim 6, wherein said filtering and ranking POIs in said intersection comprises:
acquiring geographical position information of each POI in the intersection, comparing the geographical position information with the retrieval geographical area, and removing POIs outside the retrieval geographical area from the intersection;
and scoring all remaining POIs in the intersection according to the retrieval keywords, and sequencing according to the scoring result.
8. A map-based point of interest (POI) retrieval apparatus, comprising:
the grid indexing unit is suitable for carrying out grid division on the geographic space containing the POI to obtain a plurality of grids; setting a plurality of grid index levels, and respectively establishing grid indexes for the grids under different grid index levels;
the POI retrieval unit is suitable for selecting a matched grid index level according to retrieval conditions, and utilizing a grid index under the matched grid index level to perform POI retrieval to obtain a retrieval result and return the retrieval result;
wherein the plurality of grid index levels respectively correspond to different geospatial scales;
the retrieval condition comprises a retrieval geographic area and a retrieval keyword; the POI retrieval unit is adapted to: selecting a matched grid index level according to the retrieval geographic area, determining a grid to be retrieved, and determining a first POI set corresponding to the grid to be retrieved according to a grid index under the matched grid index level; determining a second POI set according to the retrieval key words; solving an intersection of the first POI set and the second POI set, and taking each POI in the intersection as a retrieval result and returning the retrieval result;
wherein the POI retrieval unit is adapted to determine a smallest outsourcing rectangle of the retrieved geographical area; traversing each grid index level from large to small according to the geographic space scale, and selecting the grid index level with the highest matching degree with the minimum outsourcing rectangle; calculating one or more corresponding grids according to the minimum outsourcing rectangle, and generating a first retrieval mark corresponding to the one or more grids; and according to the first retrieval mark, carrying out POI retrieval in the grid index under the selected grid index level to obtain a first POI set containing a plurality of POIs.
9. The apparatus of claim 8, wherein,
the grid index unit is suitable for establishing a grid coordinate system for the geographic space by a preset scale and dividing the geographic space into a plurality of rectangular grids with the same size; and determining the grid number of each grid according to a preset grid number rule.
10. The apparatus of claim 9, wherein,
the grid index unit is suitable for calculating the row number and the column number of the grid to which each POI belongs in the grid coordinate system according to the geographical position information of each POI; calculating the grid number of the corresponding grid according to the calculated row number and column number and the grid number rule; and generating the corresponding relation between each POI and the corresponding grid number.
11. The apparatus of claim 8, wherein,
the grid index unit is suitable for establishing an inverted index table corresponding to each grid index level by taking the grid number as a main key and taking the index numbers of all POI contained in the corresponding grid as field contents.
12. The apparatus of any one of claims 8-11,
the POI retrieval unit is suitable for performing natural language processing on the retrieval key words and generating second retrieval marks corresponding to the retrieval key words according to analysis results; and performing POI retrieval according to the second retrieval mark to obtain a second POI set comprising a plurality of POIs.
13. The apparatus of any one of claims 8-11,
and the POI retrieval unit is suitable for filtering and sequencing each POI in the intersection to obtain a final retrieval result and returning the final retrieval result.
14. The apparatus according to claim 13, wherein the POI retrieving unit is adapted to obtain geographic location information of each POI in the intersection, compare the geographic location information with the retrieved geographic area, and remove POIs outside the retrieved geographic area from the intersection; and scoring all remaining POIs in the intersection according to the retrieval keywords, and sequencing according to the scoring result.
15. An intelligent terminal, wherein the intelligent terminal comprises: a processor; and a memory arranged to store computer-executable instructions that, when executed, cause the processor to perform the method of any one of claims 1-7.
16. A computer readable storage medium, wherein the computer readable storage medium stores one or more programs which, when executed by a processor, implement the method of any of claims 1-7.
CN201810712391.8A 2018-06-29 2018-06-29 Point of interest (POI) retrieval method and device based on map Active CN108920462B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810712391.8A CN108920462B (en) 2018-06-29 2018-06-29 Point of interest (POI) retrieval method and device based on map

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810712391.8A CN108920462B (en) 2018-06-29 2018-06-29 Point of interest (POI) retrieval method and device based on map

Publications (2)

Publication Number Publication Date
CN108920462A CN108920462A (en) 2018-11-30
CN108920462B true CN108920462B (en) 2022-07-01

Family

ID=64424535

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810712391.8A Active CN108920462B (en) 2018-06-29 2018-06-29 Point of interest (POI) retrieval method and device based on map

Country Status (1)

Country Link
CN (1) CN108920462B (en)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110633883A (en) * 2018-12-29 2019-12-31 北京奇虎科技有限公司 Point of interest (POI) load calculation method and device
CN111412925B (en) * 2019-01-08 2023-07-18 阿里巴巴集团控股有限公司 POI position error correction method and device
CN109994038B (en) * 2019-02-20 2020-08-28 北京三快在线科技有限公司 Method and device for determining interest points in irregular area and electronic equipment
CN110796725B (en) * 2019-08-28 2022-09-23 腾讯科技(深圳)有限公司 Data rendering method, device, terminal and storage medium
CN110986996B (en) * 2019-11-29 2021-09-10 秒针信息技术有限公司 Data processing method and device, electronic equipment and storage medium
CN110990512B (en) * 2019-11-29 2021-06-29 农业农村部规划设计研究院 Method and device for checking vector elements and administrative regions in full coverage mode
CN111274346A (en) * 2020-01-21 2020-06-12 青梧桐有限责任公司 Method, system, electronic device and readable storage medium for obtaining point of interest data
CN111831765A (en) * 2020-03-10 2020-10-27 北京嘀嘀无限科技发展有限公司 Data processing method and device, electronic equipment and readable storage medium
CN111859187B (en) * 2020-06-30 2024-02-20 杭州欧若数网科技有限公司 POI query method, device, equipment and medium based on distributed graph database
CN113076321B (en) * 2021-04-20 2022-07-29 中移智行网络科技有限公司 Data processing method, device, terminal and readable storage medium
CN113052642B (en) * 2021-04-22 2022-08-19 支付宝(杭州)信息技术有限公司 Method and device for offline operation
CN113360586A (en) * 2021-06-03 2021-09-07 深圳前海微众银行股份有限公司 Address aggregation degree query method, device and equipment and computer readable storage medium
CN113609364A (en) * 2021-07-08 2021-11-05 广州致讯信息科技有限责任公司 POI point information retrieval method based on power grid big data
CN114153851A (en) * 2021-12-06 2022-03-08 智慧足迹数据科技有限公司 GEOHASH indexing method, GEOHASH indexing device, computer equipment and storage medium
CN114493383B (en) * 2022-04-18 2022-08-23 深圳市城市交通规划设计研究中心股份有限公司 Interest point searching method and device and computer readable storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102004793A (en) * 2010-12-08 2011-04-06 厦门雅迅网络股份有限公司 POI (Point Of Interest) position inquiry index file based on grid space and information inquiry method
CN102147795A (en) * 2010-02-05 2011-08-10 北京四维图新科技股份有限公司 Method and device for searching points of interest as well as navigation system
CN105786822A (en) * 2014-12-18 2016-07-20 高德软件有限公司 Method and device for inquiring spatial object and establishing spatial index in electronic map

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102128320B1 (en) * 2013-07-31 2020-06-30 팅크웨어(주) System and method for providing circumference search result

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102147795A (en) * 2010-02-05 2011-08-10 北京四维图新科技股份有限公司 Method and device for searching points of interest as well as navigation system
CN102004793A (en) * 2010-12-08 2011-04-06 厦门雅迅网络股份有限公司 POI (Point Of Interest) position inquiry index file based on grid space and information inquiry method
CN105786822A (en) * 2014-12-18 2016-07-20 高德软件有限公司 Method and device for inquiring spatial object and establishing spatial index in electronic map

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种改进的自适应层次网格空间索引查询算法;周勇等;《计算机工程与应用》;20060301(第07期);第159-161、165页 *
一种语义增强的空间关键词搜索方法;韩军等;《计算机研究与发展》;20150915(第09期);第1954-1964页 *

Also Published As

Publication number Publication date
CN108920462A (en) 2018-11-30

Similar Documents

Publication Publication Date Title
CN108920462B (en) Point of interest (POI) retrieval method and device based on map
US20070253642A1 (en) Method and apparatus for indexing, storing and retrieving raster (GRID) data in a combined raster vector system
EP2783307B1 (en) Location based full text search
AU696058B2 (en) Method of clustering multi-dimensional related data
CN109478184B (en) Identifying, processing, and displaying clusters of data points
US11307049B2 (en) Methods, apparatuses, systems, and storage media for storing and loading visual localization maps
CN106681996B (en) The method and apparatus for determining interest region in geographic range, point of interest
CN109101474B (en) Address aggregation method, package aggregation method and equipment
EP2836928B1 (en) Full text search using r-trees
US10838988B2 (en) System and method for efficient geospatial indexing
CN102147795A (en) Method and device for searching points of interest as well as navigation system
CN106708837B (en) Interest point searching method and device
CN111221813B (en) Database index and processing method, device and equipment for database query
JP6001310B2 (en) Method for generating database, navigation device, and method for determining height information
CN109033219B (en) Point of interest (POI) classification method and device
JP2004503838A (en) Spatial target data index engine
CN103823854A (en) Method for reducing data volumes of electronic maps of navigation terminals on basis of land boundary line indexes
CN111522892A (en) Geographic element retrieval method and device
CN111382220A (en) POI data dividing method and device
CN104021120B (en) A kind of navigation data search method, device and navigation terminal
CN104156475A (en) Geographic information reading method and device
CN114513550A (en) Method and device for processing geographical position information and electronic equipment
CN113722415A (en) Point cloud data processing method and device, electronic equipment and storage medium
CN111353011A (en) Location data set, building method and device thereof, and data processing method and device
CN113449052A (en) Method for establishing spatial index, method and device for querying spatial region

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant