CN105468631A - Point-of-interest query method and apparatus - Google Patents
Point-of-interest query method and apparatus Download PDFInfo
- Publication number
- CN105468631A CN105468631A CN201410449621.8A CN201410449621A CN105468631A CN 105468631 A CN105468631 A CN 105468631A CN 201410449621 A CN201410449621 A CN 201410449621A CN 105468631 A CN105468631 A CN 105468631A
- Authority
- CN
- China
- Prior art keywords
- poi
- point
- path
- query
- information
- 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.)
- Pending
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to a point-of-interest query method and apparatus. The method comprises: receiving a point-of-interest POI query request, wherein the POI query request comprises a query point; acquiring longitude and latitude information of the query point in the POI query request; by using the longitude and latitude information of the query point, calculating distances between the query point and N reference points respectively, so as to obtain N-tuple data of the query point; and according N-tuple data of a reference POI in a POI database, searching the POI database for a first reference POI that meets a requirement, wherein absolute values of differences between data at same positions in the N-tuple data of the first reference POI and the N-tuple data of the query point are each less than or equal to a preset distance threshold. The point-of-interest query method and apparatus provided by the present invention can improve the query efficiency.
Description
Technical field
The embodiment of the present application relates to search technique field, geographic position, particularly relates to a kind of point of interest querying method and device.
Background technology
In Geographic Information System, point of interest (PointOfInterest, POI) can be a house, retail shop, mailbox, a bus station etc.Each POI comprises the aspect information such as title, classification, longitude and latitude, is the indispensable information of the geographic information services such as navigation map.
Point of interest inquiry (or being called retrieval) is at present based on the service (LocationBasedService in geographic position, LBS) a important component part, user can be helped accurately to understand target location or peripheral facility etc., the branch of energy reminding user road conditions and the detailed information of neighboring buildings, also find each place required for user in conveniently navigating, select road the most convenient and unobstructed to carry out path planning.
In the address server of LBS, usually preserve the POI data of magnanimity.When needing to inquire about the POI near certain point, generally all needing the longitude and latitude distance between all POI in calculated address server in certain limit and this query point, therefrom choosing the POI meeting required distance.If there be M point in address server, then need to calculate (M – 1) secondary distance; In theory, if all points will be traveled through, then need to calculate (M* (M-1)/2) secondary distance, great pressure can be brought to server like this, and search efficiency is not high.
Summary of the invention
The object of the application is, provides a kind of point of interest querying method and device, can improve search efficiency, alleviate the pressure of server.
The embodiment of the present application provides a kind of point of interest querying method, and described method comprises:
Receive point of interest POI inquiry request, described POI inquiry request comprises query point and inquiry distance;
Obtain the latitude and longitude information of query point described in described POI inquiry request;
Utilize the latitude and longitude information of described query point, calculate the distance of described query point and N number of reference point respectively, obtain the N tuple data of described query point, wherein, N be more than or equal to 3 positive integer;
According to the N tuple data with reference to POI in POI data storehouse, from described POI data storehouse, find out the first reference POI met the demands, the absolute value of the difference of the described first reference N tuple data of POI and the data of N tuple data in same position of described query point is less than or equal to described inquiry distance respectively.
Another aspect, the embodiment of the present application additionally provides a kind of point of interest inquiry unit, and described device comprises:
Receiving element, for receiving point of interest POI inquiry request, described POI inquiry request comprises query point and inquiry distance;
Acquiring unit, for obtaining the latitude and longitude information of query point described in described POI inquiry request that described receiving element receives;
Computing unit, the latitude and longitude information of the described query point obtained for utilizing described acquiring unit, calculates the distance of described query point and N number of reference point respectively, obtains the N tuple data of described query point, wherein, N be more than or equal to 3 positive integer;
Query unit, for the N tuple data according to reference POI in POI data storehouse, from described POI data storehouse, find out the first reference POI met the demands, the absolute value of the difference of the data of N tuple data in same position of the described first described query point calculated with reference to N tuple data and the described computing unit of POI is less than or equal to described inquiry distance respectively.
The point of interest querying method that the embodiment of the present application provides and device, POI is located by least 3 reference points, thus avoid the longitude and latitude distance of carrying out repetition in query script to calculate, effectively can reduce calculation times, required interest point data can be found rapidly, improve search efficiency, alleviate the pressure of server, realize efficiently inquiring about.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present application, below the accompanying drawing used required in describing embodiment is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the application, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
The point of interest querying method process flow diagram that Fig. 1 provides for the embodiment of the present application;
A kind of relation schematic diagram of the query point that Fig. 2 a provides for the embodiment of the present application, the distance between reference point and point of interest;
Another relation schematic diagram of the query point that Fig. 2 b provides for the embodiment of the present application, the distance between reference point and point of interest;
The Establishing process figure in the POI data storehouse that Fig. 3 provides for the embodiment of the present application;
Another point of interest querying method process flow diagram that Fig. 4 provides for the embodiment of the present application;
A kind of share-car method flow diagram that Fig. 5 provides for the embodiment of the present application;
The point of interest inquiry unit schematic diagram that Fig. 6 provides for the embodiment of the present application;
A kind of share-car device schematic diagram that Fig. 7 provides for the embodiment of the present application.
Embodiment
For making the goal of the invention of the application, feature, advantage can be more obvious and understandable, below in conjunction with the accompanying drawing in the embodiment of the present application, technical scheme in the embodiment of the present application is described, obviously, described embodiment is only some embodiments of the present application, and not all embodiments.Based on the embodiment in the application, those of ordinary skill in the art are not making the every other embodiment obtained under creative work prerequisite, all belong to the scope of the application's protection.
The point of interest querying method that the embodiment of the present application provides and device, in the inquiry that may be used for LBS or searching system, such as, the recommendation of digital map navigation, path planning, point of interest, share-car line matching etc.
Fig. 1 is the point of interest querying method process flow diagram that the embodiment of the present application provides, and as shown in Figure 1, the point of interest querying method of the embodiment of the present application comprises:
S101, reception point of interest POI inquiry request.
Described POI inquiry request comprises the information such as query point.
Wherein, query point can be a point or multiple point, or, also can be by the point on starting point, terminal and/or path, transit point place.
Optionally, inquiry distance can also be comprised in described POI inquiry request, now, using this inquiry distance as predeterminable range threshold value.It is the scope of this inquiry distance that inquiry distance represents that the scope of POI inquiry comprises radius around described query point.Such as, the POI within neighbouring 12 kilometers of inquiry " point 1 ", then wherein " point 1 " is a query point, and inquiry distance is 12 kilometers.
The POI inquiry request that server receives can be the POI inquiry request that user inputs, and also can be the POI inquiry request of system according to the input Automatic generation of information of user.User be have input to the situation of the information such as query point and inquiry distance, this step S101 can be the POI inquiry request receiving user's input.For user's input inquiry point, and do not have the situation of input inquiry distance, system can adopt the inquiry distance of acquiescence, namely presets the distance threshold of acquiescence, and the query point according to user's input generates corresponding POI inquiry request.Now, this step S101 then receiving system generate POI inquiry request.
S102, obtain the latitude and longitude information of query point described in described POI inquiry request.
Server can by locating in real time, look into database or the mode such as directly to obtain from POI inquiry request obtains the latitude and longitude information of described query point.
S103, utilize the latitude and longitude information of described query point, calculate the distance of described query point and N number of reference point respectively, obtain the N tuple data of described query point.
Wherein, N be more than or equal to 3 positive integer.
Described N number of reference point is the N number of point identical with N number of reference point in the POI data storehouse used in query script.When setting up POI data storehouse, this N number of reference point is the N number of point chosen arbitrarily, once determine reference point, when follow-up usage data storehouse, then can adopt identical reference point.
Utilize the latitude and longitude information of the latitude and longitude information of query point and N number of reference point, calculate the longitude and latitude distance of described query point and reference point respectively, what namely adopt existing longitude and latitude distance calculates N number of distance value, forms the N tuple data of described query point.
Such as, as shown in figures 2 a and 2b, query point is point " 1 ", 3 reference points are respectively an a, some b and some c, and can obtain point " 1 " with the longitude and latitude distance of some a by calculating is Ra1, and the longitude and latitude distance of point " 1 " and some b is Rb1, point " 1 " is Rc1 with the longitude and latitude distance of some c, then 3 tuple data of this point " 1 " are (Ra1, Rb1, Rc1).
Optionally, after the N tuple data calculating described query point, also using described query point as new reference POI, can be stored in the lump in described POI data storehouse with the N tuple data of described query point.
S104, according in POI data storehouse with reference to the N tuple data of POI, from described POI data storehouse, find out the first reference POI met the demands, the absolute value of the difference of the described first reference N tuple data of POI and the data of N tuple data in same position of described query point is less than or equal to predeterminable range threshold value respectively.
Described POI data storehouse comprises described with reference to POI and the described N tuple data with reference to POI, and the described N tuple data with reference to POI is the described N tuple data formed with the distance of described N number of reference point respectively with reference to POI.
In the embodiment of the present application, described POI data storehouse can be utilize the POI geographical location information of certain scale and N number of reference point to set up in advance.The title and latitude and longitude information etc. of a large amount of terrestrial references can be had in the POI geographical location information of certain scale, include but not limited to: mansion, bus stop, company, market, street, number, convenience store etc.Fig. 3 is the Establishing process figure in the POI data storehouse that the embodiment of the present application provides, and as shown in Figure 3, this process comprises:
S201, specify N number of reference point.
N number of reference point is the N number of point chosen arbitrarily, records the latitude and longitude information of described N number of reference point.Because namely 3 points can determine concrete position, therefore, N needs to be more than or equal to 3.
The latitude and longitude information of S202, acquisition reference POI.
Using existing POI (POI as in existing map) or the new POI gathered etc. as with reference to POI, obtain the latitude and longitude information of those POI.
S203, calculate the described distance with reference to POI and described N number of reference point respectively, obtain the N tuple data of described reference POI.
The computing method of this step and the identical of S103, repeat no more in this.
S204, store described with reference to POI and the described N tuple data with reference to POI, form described POI data storehouse.
The N tuple data of a large amount of reference POI and correspondence thereof is utilized to form described POI data storehouse, so that subsequent query uses.
Fig. 2 a and 2b is query point, the distance relation schematic diagram between reference point and point of interest that the embodiment of the present application provides, wherein, " point 1 " is query point, and inquiry distance is R1, point a, some b and some c are 3 reference points (N=3), " point 2 " and " point 3 " is the reference POI in POI data storehouse, stores this 3 tuple data of 2, be respectively (Ra2 in POI data storehouse, Rb2, and (Ra3, Rb3, Rc3) Rc2).Utilize the latitude and longitude information of " point 1 " and the latitude and longitude information of 3 reference points, can calculate " point 1 " 3 tuple data is (Ra1, Rb1, Rc1).
(a), the reference point in Fig. 2 b and the distance of query point are all greater than described inquiry distance to point to include the reference point being less than described inquiry distance with the distance of query point in Fig. 2 a.
As can be seen from Fig. 2 a and Fig. 2 b, no matter that the distance of reference point and query point is greater than the described situation of inquiring about distance or being less than described inquiry distance, the POI searched can drop on " point 1 " that, for the center of circle, R1 is on the circle of radius, all needs to meet the following conditions simultaneously:
| RaX – Ra1|<=R1 inequality 1
| RbX – Rb1|<=R1 inequality 2
| RcX – Rc1|<=R1 inequality 3
Wherein, RaX represents the longitude and latitude distance between reference POI " some X " and reference point " some a ", Ra1 represents the longitude and latitude distance between query point " point 1 " and reference point " some a ", R1 represents inquiry distance, RbX represents the longitude and latitude distance between reference POI " some X " and reference point " some b ", Rb1 represents the longitude and latitude distance between query point " point 1 " and reference point " some b ", RcX represents the longitude and latitude distance between reference POI " some X " and reference point " some c ", and Rc1 represents the longitude and latitude distance between query point " point 1 " and reference point " some c ".
That is, the absolute value of the difference of the N tuple data of the reference POI satisfied condition and the data of N tuple data in same position of described query point is less than or equal to described inquiry distance respectively.
Particularly, can also solve above-mentioned inequality 1-3, for inequality 1, can be equivalent to:
Ra1-R1<=RaX<=Ra1+R1 inequality 4
Because RaX is a distance, be nonnegative number, therefore can be equivalent to again:
As Ra1>R1, Ra1-R1<=RaX<=Ra1+R1 inequality 5
Or, work as Ra1<=R1,0<=RaX<=Ra1+R1 inequality 6
In like manner, inequality 2 and 3 also can carry out identical solving, and obtains 3 tuple data (RaX, the RbX of reference point " some X ", RcX) span of each element in, can carry out filtering query to the reference POI in POI data storehouse according to this span.
As can be seen from Fig. 2 a and Fig. 2 b, " point 2 " this reference POI is the POI meeting above-mentioned inequality 1-3, and thus, " point 2 " is the POI that will look for.And POI is not owing to meeting in " point 3 " this reference | the situation of Rc3 – Rc1|<=R1, so " point 3 " is not the POI that will look for.
Like this, N tuple data by comparison query point and the N tuple data with reference to POI can find out qualified POI, without the need to carrying out the calculation of longitude & latitude between query point and reference POI again, the reference POI of magnanimity in POI data storehouse, effectively can avoid the calculation of longitude & latitude of repetition, realize inquiry rapidly and efficiently.
Give an example, such as, need nearby or appointed place inquiry point of interest.Now, server is after reception POI inquiry request, obtain the latitude and longitude information of query point, and calculate the distance with N number of reference point respectively, obtain the N tuple data of described query point, according to the N tuple data with reference to POI in POI data storehouse, from POI data storehouse, find out N tuple data be less than or equal to first of described inquiry distance respectively with reference to POI with the absolute value of the difference of the data of N tuple data in same position of described query point.Particularly, in the process of searching, first can determine the span of each element in the N tuple data met the demands.Utilize this span to carry out filtration to the N tuple data with reference to POI to choose, be met the reference POI of requirement.
Optionally, in actual application, user only may need the POI searching a certain type, such as cuisines, leisure etc.Now, can also comprise one or more points of interest attribute information in the described POI inquiry request received in step S101, described points of interest attribute information can comprise: administrative information region belonging to classified information, interest point name information, point of interest index information, point of interest etc. belonging to point of interest.Classification belonging to point of interest comprises the first-level class and secondary classification etc. of POI, and first-level class can comprise shopping, trip, lodging, food and drink, financial service etc., and the secondary classification of shopping can have market, supermarket, the market of farm produce, building materials household etc.Interest point name information can comprise the Chinese full name of point of interest, Chinese abbreviation, English full name, code name etc.Point of interest index information can make interest point name or abbreviation or phonetic etc.Administrative information region belonging to point of interest comprises the information such as province/city/district.
Like this, after step S104 finds out the first reference POI met the demands from described POI data storehouse, can also comprise: judge whether described first mate with the described points of interest attribute information in described POI inquiry request with reference to the points of interest attribute information of POI, if coupling, then using described first with reference to POI as Query Result, otherwise, filter out described first with reference to POI.If that look for is the POI of cuisines class, then the POI being cuisines by classified information belonging to point of interest is retained as Query Result, and other POI filters out, and last Query Result is returned to user.
Fig. 4 is another point of interest querying method process flow diagram that the embodiment of the present application provides, and as described in Figure 4, the method comprises:
The querying condition of S301, reception user input, described querying condition comprises inquiring position information.
Wherein, described inquiring position information comprise in starting point, terminal, approach point one of or combination.
S302, carry out path planning according to described inquiring position information, obtain the first path.
This step can adopt existing paths planning method to plan.
S303, point on described first path is utilized to generate POI inquiry request as query point and described inquiry distance.
S304, obtain the latitude and longitude information of query point described in described POI inquiry request.
S305, utilize the latitude and longitude information of described query point, calculate the distance of described query point and N number of reference point respectively, obtain the N tuple data of described query point.
Wherein, N be more than or equal to 3 positive integer.
S306, according in POI data storehouse with reference to the N tuple data of POI, from described POI data storehouse, find out the first reference POI met the demands, the absolute value of the difference of the described first reference N tuple data of POI and the data of N tuple data in same position of described query point is less than or equal to predeterminable range threshold value respectively.
S102 ~ S104 in above-mentioned S304 ~ S306 and Fig. 1 embodiment is identical, repeats no more in this.
Such as, query demand is: need in road, inquire about a certain type point of interest, such as, from A mansion to the road of B mansion, and the C bank near finding 500 meters.Then user input querying condition in inquiring position information comprise starting point A mansion, terminal B mansion.First carry out path planning according to this starting point and terminal, obtain the first path.Choosing point on described first path as query point, can be multiple queries point here, utilizes query point and described inquiry distance (500 meters) to generate POI inquiry request.Calculate multiple queries point respectively with the distance of N number of reference point, obtain the N tuple data of multiple queries point.Utilize the N tuple data of multiple queries point, judge in POI data storehouse, whether to there is the POI (C bank) met the demands, thus required POI.
In addition, the point of interest querying method that the embodiment of the present application provides, can also be used for the application scenarios of route matching.
Optionally, also comprise: reference path in described POI data storehouse, described reference path is the path that the existing inquiring position information planning inputted according to other users obtains.
After find out the first reference POI met the demands from described POI data storehouse, also comprise:
Utilize the multiple queries point on described first path corresponding first, with reference to POI, determines the scope of activities in described first path; The first reference path matched with the scope of activities in described first path is found out from described POI data storehouse.
Above route matching can be applied to the coupling of share-car route, such as, wants the share-car route providing whole city, needs the situation etc. of the upper and lower passenger in coupling midway.
Fig. 5 is a kind of share-car method flow diagram that the embodiment of the present application provides, and as shown in Figure 5, the method comprises:
The share-car querying condition that S401, reception first user send.
Wherein, described share-car querying condition can comprise positional information, user type, age information, described positional information can comprise in starting point, terminal, approach point one of or combination.
S402, carry out path planning according to described positional information, obtain the first path.
S403, point on described first path is utilized to generate POI inquiry request as query point and predeterminable range threshold value.
S404, obtain the latitude and longitude information of query point described in described POI inquiry request.
S405, utilize the latitude and longitude information of described query point, calculate the distance of described query point and N number of reference point respectively, obtain the N tuple data of described query point.
S406, according in POI data storehouse with reference to the N tuple data of POI, find out from described POI data storehouse meet the demands first with reference to POI.
The absolute value of the difference of the described first reference N tuple data of POI and the data of N tuple data in same position of described query point is less than or equal to predeterminable range threshold value respectively.
S407, the first reference POI utilizing the multiple queries point on described first path corresponding, determine the scope of activities in described first path.
S408, from described POI data storehouse, find out the first reference path matched with the scope of activities in described first path, thus obtain user profile corresponding to described first reference path and age information.
S409, described user profile and age information are met first reference path of requirement of described share-car querying condition as the path candidate of share-car.
Give an example, such as, query demand is: passenger D needs the share-car path of match query, and the departure time is point in morning 8 on working day, and destination is E mansion.
Also comprise user profile in described POI inquiry request, described user profile comprises user's name and user type.Such as, in this example, the user type of passenger D is passenger, and this passenger needs the user type of looking for be driver.
Now, also comprise: reference path in described POI data storehouse, described reference path is that existing starting point, terminal or the transit point inputted according to other users plans the path obtained.
Such as, the user F as driver can input oneself starting point, terminal, transit point etc., and system can carry out path planning for this user F according to the starting point, terminal, transit point etc. of input, obtains at least one reference path, is saved in described POI data storehouse.Can also the age information of this reference path of recording user F in system, as only work hours 7 .-8 are on weekdays effective, and, the residue room information of recording user F.
When receiving the share-car querying condition of passenger D, then carry out path planning according to the departure place of passenger D, destination, obtain the first path, utilize point on this first path as query point, obtain corresponding latitude and longitude information, and calculate the distance with N number of reference point respectively, multiple N tuple data can be obtained.From POI data storehouse, find out corresponding reference POI, thus determine the scope of activities in the first path.According to this scope of activities, the first reference path matched is found out from described POI data storehouse, this process is exactly confirm that whether the reference path of user F is through the first path, if the reference path of user F is through the scope of activities in the first path, then the reference path of explanation user F is the first reference path matched, determine whether the age information of user F and residue room information meet the requirement of share-car querying condition, if so, then as the path candidate of passenger D share-car again.
The point of interest querying method that the embodiment of the present application provides, the N tuple data in filtering POI (Point of Interest) database is carried out according to the N tuple data of query point, thus be met the POI of requirement, like this, locate POI by least 3 reference points, thus avoid the longitude and latitude distance of carrying out repetition in query script to calculate, effectively can reduce calculation times, required interest point data can be found rapidly, improve search efficiency, realize efficiently inquiring about.And in the method that the embodiment of the present application provides, the calculating of longitude and latitude distance can run on the client, effectively can alleviate the pressure of server.
In the prior art, if there be M POI in POI data storehouse, want to realize fast query, need so in theory to store the longitude and latitude distance between every two POI in a database, namely need to calculate (M* (M-1)/2) secondary distance, need to store (M* (M-1)/2) bar range data.And if the method that provides of the application is provided, then only need to calculate 3M time (N=3), and, owing to not needing to store the longitude and latitude distance between every two points of interest in POI data storehouse, store M bar data, as can be seen here, the time complexity of algorithm and space complexity all can be down to M by the method that the application provides, performance is greatly improved, and can realize efficient inquiry.
Be more than the detailed description that the point of interest querying method provided the embodiment of the present application carries out, below the point of interest inquiry unit that the embodiment of the present application provides be described in detail.
The above-mentioned point of interest querying method described in detail with Fig. 1 ~ Fig. 4 accordingly, a kind of point of interest inquiry unit that the embodiment of the present application also provides, as shown in Figure 6, the device of the embodiment of the present application comprises: receiving element 501, acquiring unit 502, computing unit 503 and query unit 504, wherein:
Receiving element 501, for receiving point of interest POI inquiry request, described POI inquiry request comprises query point;
Acquiring unit 502, for obtaining the latitude and longitude information of query point described in described POI inquiry request that receiving element 501 receives;
Computing unit 503, the latitude and longitude information of the described query point obtained for utilizing acquiring unit 502, calculates the distance of described query point and N number of reference point respectively, obtains the N tuple data of described query point;
Query unit 504, for the N tuple data according to reference POI in POI data storehouse, from described POI data storehouse, find out the first reference POI met the demands, the absolute value of the difference of the data of N tuple data in same position of the described first described query point calculated with reference to N tuple data and the computing unit 503 of POI is less than or equal to predeterminable range threshold value respectively.
Wherein, described POI data storehouse comprises described with reference to POI and the described N tuple data with reference to POI, and the described N tuple data with reference to POI is the described N tuple data formed with the distance of described N number of reference point respectively with reference to POI.
Optionally, also comprise inquiry distance in the described POI inquiry request that receiving element 501 receives, then described inquiry distance is described predeterminable range threshold value.
Optionally, described device also comprises: storage unit, after calculating the N tuple data of described query point calculating list 503 yuan, using described query point as with reference to POI, is stored in the lump in described POI data storehouse with the N tuple data of described query point.
Optionally, also comprise one or more points of interest attribute information in the described POI inquiry request that receiving element 501 receives, described points of interest attribute information comprises: administrative information region belonging to classified information, interest point name information, point of interest index information, point of interest belonging to point of interest.
Described device also comprises: judging unit, for judging whether the described points of interest attribute information in the described POI inquiry request that the points of interest attribute information of the described first reference POI that query unit 504 obtains and receiving element 501 receive mates, if coupling, then using described first with reference to POI as Query Result, otherwise, filter out described first with reference to POI.
Optionally, described device also comprises: interactive unit, path planning unit and request generation unit, wherein:
Described interactive unit, for receive user input querying condition, described querying condition comprises inquiring position information, wherein, described inquiring position information comprise in starting point, terminal, approach point one of or combination;
Described path planning unit, carries out path planning for the described inquiring position information in the described POI inquiry request that receives according to described interactive unit, obtains the first path;
Described request generation unit, the point on described first path obtained for utilizing described path planning unit generates described POI inquiry request as query point and described predeterminable range threshold value.Receiving element 501 receives the described POI inquiry request that described request generation unit generates, then carries out subsequent treatment.
Optionally, also comprise: reference path in described POI data storehouse, described reference path is that existing starting point, terminal or the transit point inputted according to other users plans the path obtained, wherein:
Described device also comprises: scope determining unit and matching unit;
Described scope determining unit, the first reference POI that the multiple queries point on described first path obtained for utilizing query unit 504 is corresponding, determines the scope of activities in described first path;
Described matching unit, for finding out the first reference path matched with the scope of activities in described first path from described POI data storehouse.
The function of above-mentioned each unit may correspond to the treatment step of the above-mentioned point of interest querying method described in detail in Fig. 1 ~ Fig. 4, repeats no more in this.
In addition, the above-mentioned share-car method described in detail with Fig. 5 accordingly, a kind of share-car device that the embodiment of the present application also provides, as shown in Figure 7, the device of the embodiment of the present application comprises: receiving element 601, path planning unit 602, request generation unit 603, acquiring unit 604, computing unit 605, query unit 606, scope determining unit 607, matching unit 608 and result determining unit 609, wherein:
Receiving element 601, for receiving the share-car querying condition that first user sends;
Wherein, described share-car querying condition comprises positional information, user type, age information, and described positional information comprises starting point, terminal and/or approach point;
Path planning unit 602, carries out path planning for the described positional information in the described share-car querying condition that receives according to receiving element 601, obtains the first path;
Request generation unit 603, the point on described first path obtained for utilizing path planning unit 602 generates POI inquiry request as query point and predeterminable range threshold value;
Acquiring unit 604, for obtaining the latitude and longitude information of query point described in described POI inquiry request;
Computing unit 605, the latitude and longitude information of the described query point obtained for utilizing acquiring unit 604, calculates the distance of described query point and N number of reference point respectively, obtains the N tuple data of described query point;
Query unit 606, for the N tuple data according to reference POI in POI data storehouse, from described POI data storehouse, find out the first reference POI met the demands, the absolute value of the difference of the described first reference N tuple data of POI and the data of N tuple data in same position of described query point is less than or equal to predeterminable range threshold value respectively;
Scope determining unit 607, the first reference POI that the multiple queries point on described first path obtained for utilizing query unit 606 is corresponding, determines the scope of activities in described first path;
Matching unit 608, for finding out the first reference path matched with the scope of activities in described first path from described POI data storehouse, thus obtains user profile corresponding to described first reference path and age information;
Result determining unit 609, for meeting the path candidate of the first reference path as share-car of the requirement of described share-car querying condition using described user profile and age information.
The function of above-mentioned each unit may correspond to the treatment step of the above-mentioned share-car method described in detail in Fig. 5, repeats no more in this.
The point of interest querying method that the embodiment of the present application provides and device, the N tuple data in filtering POI (Point of Interest) database is carried out according to the N tuple data of query point, thus be met the POI of requirement, like this, locate POI by least 3 reference points, thus avoid the longitude and latitude distance of carrying out repetition in query script to calculate, effectively can reduce calculation times, required interest point data can be found rapidly, improve search efficiency, alleviate the pressure of server, realize efficiently inquiring about.
Professional should recognize further, in conjunction with unit and the algorithm steps of each example of embodiment disclosed herein description, can realize with electronic hardware, computer software or the combination of the two, in order to the interchangeability of hardware and software is clearly described, generally describe composition and the step of each example in the above description according to function.These functions perform with hardware or software mode actually, depend on application-specific and the design constraint of technical scheme.Professional and technical personnel can use distinct methods to realize described function to each specifically should being used for, but this realization should not think the scope exceeding the application.
The software module that the method described in conjunction with embodiment disclosed herein or the step of algorithm can use hardware, processor to perform, or the combination of the two is implemented.Software module can be placed in the storage medium of other form any known in random access memory (RAM), internal memory, ROM (read-only memory) (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technical field.
Above-described embodiment; the object of the application, technical scheme and beneficial effect are further described; be understood that; the foregoing is only the embodiment of the application; and be not used in the protection domain limiting the application; within all spirit in the application and principle, any amendment made, equivalent replacement, improvement etc., within the protection domain that all should be included in the application.
Claims (16)
1. a point of interest querying method, is characterized in that, described method comprises:
Receive point of interest POI inquiry request, described POI inquiry request comprises query point;
Obtain the latitude and longitude information of query point described in described POI inquiry request;
Utilize the latitude and longitude information of described query point, calculate the distance of described query point and N number of reference point respectively, obtain the N tuple data of described query point, wherein, N be more than or equal to 3 positive integer;
According to the N tuple data with reference to POI in POI data storehouse, from described POI data storehouse, find out first of the described query point met the demands with reference to POI, the absolute value of the difference of the described first reference N tuple data of POI and the data of N tuple data in same position of described query point is less than or equal to predeterminable range threshold value respectively.
2. method according to claim 1, it is characterized in that, described POI data storehouse comprises described with reference to POI and the described N tuple data with reference to POI, and the described N tuple data with reference to POI is the described N tuple data formed with the distance of described N number of reference point respectively with reference to POI.
3. method according to claim 1, is characterized in that, in the described distance calculating described query point and N number of reference point respectively, after obtaining the N tuple data of described query point, also comprises:
Using described query point as with reference to POI, be stored in the lump in described POI data storehouse with the N tuple data of described query point.
4. method according to claim 1, is characterized in that, also comprises one or more points of interest attribute information in described POI inquiry request, and described points of interest attribute information comprises one of following content or combination:
Administrative information region belonging to classified information, interest point name information, point of interest index information, point of interest belonging to point of interest;
After find out the first reference POI met the demands from described POI data storehouse, also comprise:
Judge whether described first mate with the described points of interest attribute information in described POI inquiry request with reference to the points of interest attribute information of POI, if coupling, then will described first reference POI as Query Result, otherwise, filter out described first reference POI.
5. method according to claim 1, is characterized in that, before described reception POI inquiry request, also comprises:
Receive user input querying condition, described querying condition comprises inquiring position information, wherein, described inquiring position information comprise in starting point, terminal, approach point one of or combination;
Carry out path planning according to described inquiring position information, obtain the first path;
The point on described first path is utilized to generate described POI inquiry request as query point and described predeterminable range threshold value.
6. method according to claim 5, is characterized in that, also comprises: reference path in described POI data storehouse, and described reference path is the path that the existing inquiring position information planning inputted according to other users obtains;
After find out the first reference POI met the demands from described POI data storehouse, also comprise:
Utilize the multiple queries point on described first path corresponding first, with reference to POI, determines the scope of activities in described first path;
The first reference path matched with the scope of activities in described first path is found out from described POI data storehouse.
7. method according to claim 1 or 5, is characterized in that, also comprise inquiry distance in described POI inquiry request, then described inquiry distance is described predeterminable range threshold value.
8. a share-car method, is characterized in that, described method comprises:
Receive first user send share-car querying condition, described share-car querying condition comprises positional information, user type, age information, described positional information comprise in starting point, terminal, approach point one of or combination;
Carry out path planning according to described positional information, obtain the first path;
The point on described first path is utilized to generate POI inquiry request as query point and predeterminable range threshold value;
Obtain the latitude and longitude information of query point described in described POI inquiry request;
Utilize the latitude and longitude information of described query point, calculate the distance of described query point and N number of reference point respectively, obtain the N tuple data of described query point, wherein, N be more than or equal to 3 positive integer;
According to the N tuple data with reference to POI in POI data storehouse, from described POI data storehouse, find out the first reference POI met the demands, the absolute value of the difference of the described first reference N tuple data of POI and the data of N tuple data in same position of described query point is less than or equal to predeterminable range threshold value respectively;
Utilize the multiple queries point on described first path corresponding first, with reference to POI, determines the scope of activities in described first path;
From described POI data storehouse, find out the first reference path matched with the scope of activities in described first path, thus obtain user profile corresponding to described first reference path and age information;
Described user profile and age information are met the path candidate of the first reference path as share-car of the requirement of described share-car querying condition.
9. a point of interest inquiry unit, is characterized in that, described device comprises:
Receiving element, for receiving POI inquiry request, described POI inquiry request comprises query point;
Acquiring unit, for obtaining the latitude and longitude information of query point described in described POI inquiry request that described receiving element receives;
Computing unit, the latitude and longitude information of the described query point obtained for utilizing described acquiring unit, calculates the distance of described query point and N number of reference point respectively, obtains the N tuple data of described query point, wherein, N be more than or equal to 3 positive integer;
Query unit, for the N tuple data according to reference POI in POI data storehouse, from described POI data storehouse, find out the first reference POI met the demands, the absolute value of the difference of the data of N tuple data in same position of the described first described query point calculated with reference to N tuple data and the described computing unit of POI is less than or equal to predeterminable range threshold value respectively.
10. device according to claim 9, it is characterized in that, described POI data storehouse comprises described with reference to POI and the described N tuple data with reference to POI, and the described N tuple data with reference to POI is the described N tuple data formed with the distance of described N number of reference point respectively with reference to POI.
11. devices according to claim 9, is characterized in that, described device also comprises:
Storage unit, for calculate described query point at described computing unit N tuple data after, using described query point as with reference to POI, be stored in the lump in described POI data storehouse with the N tuple data of described query point.
12. devices according to claim 9, is characterized in that, also comprise one or more points of interest attribute information in the described POI inquiry request that described receiving element receives, and described points of interest attribute information comprises one of following content or combination:
Administrative information region belonging to classified information, interest point name information, point of interest index information, point of interest belonging to point of interest;
Described device also comprises:
Judging unit, for judging whether the described points of interest attribute information in the described POI inquiry request that the points of interest attribute information of the described first reference POI that described query unit obtains and described receiving element receive mates, if coupling, then using described first with reference to POI as Query Result, otherwise, filter out described first with reference to POI.
13. devices according to claim 9, is characterized in that, described device also comprises:
Interactive unit, for receive user input querying condition, described querying condition comprises inquiring position information, wherein, described inquiring position information comprise in starting point, terminal, approach point one of or combination;
Path planning unit, carries out path planning for described starting point, terminal and/or the approach point in the described POI inquiry request that receives according to described interactive unit, obtains the first path;
Request generation unit, the point on described first path obtained for utilizing described path planning unit generates described POI inquiry request as query point and described predeterminable range threshold value.
14. devices according to claim 13, is characterized in that, also comprise: reference path in described POI data storehouse, and described reference path is that existing starting point, terminal or the transit point inputted according to other users plans the path obtained;
Described device also comprises:
Scope determining unit, the first reference POI that the multiple queries point on described first path obtained for utilizing described query unit is corresponding, determines the scope of activities in described first path;
Matching unit, for finding out the first reference path matched with the scope of activities in described first path from described POI data storehouse.
15. devices according to claim 9 or 13, is characterized in that, also comprise inquiry distance in the described POI inquiry request that described receiving element receives, then described inquiry is apart from being described predeterminable range threshold value.
16. 1 kinds of share-car devices, is characterized in that, described device comprises:
Receiving element, for receive first user send share-car querying condition, described share-car querying condition comprises positional information, user type, age information, described positional information comprise in starting point, terminal, approach point one of or combination;
Path planning unit, carries out path planning for the described positional information in the described share-car querying condition that receives according to described receiving element, obtains the first path;
Request generation unit, the point on described first path obtained for utilizing described path planning unit generates POI inquiry request as query point and predeterminable range threshold value;
Acquiring unit, for obtaining the latitude and longitude information of query point described in described POI inquiry request;
Computing unit, the latitude and longitude information of the described query point obtained for utilizing described acquiring unit, calculates the distance of described query point and N number of reference point respectively, obtains the N tuple data of described query point, wherein, N be more than or equal to 3 positive integer;
Query unit, for the N tuple data according to reference POI in POI data storehouse, from described POI data storehouse, find out the first reference POI met the demands, the absolute value of the difference of the described first reference N tuple data of POI and the data of N tuple data in same position of described query point is less than or equal to predeterminable range threshold value respectively;
Scope determining unit, the first reference POI that the multiple queries point on described first path obtained for utilizing described query unit is corresponding, determines the scope of activities in described first path;
Matching unit, for finding out the first reference path matched with the scope of activities in described first path from described POI data storehouse, thus obtains user profile corresponding to described first reference path and age information;
Result determining unit, for meeting the path candidate of the first reference path as share-car of the requirement of described share-car querying condition using described user profile and age information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410449621.8A CN105468631A (en) | 2014-09-04 | 2014-09-04 | Point-of-interest query method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410449621.8A CN105468631A (en) | 2014-09-04 | 2014-09-04 | Point-of-interest query method and apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105468631A true CN105468631A (en) | 2016-04-06 |
Family
ID=55606336
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410449621.8A Pending CN105468631A (en) | 2014-09-04 | 2014-09-04 | Point-of-interest query method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105468631A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017177916A1 (en) * | 2016-04-12 | 2017-10-19 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for determining point of interest |
| CN108229748A (en) * | 2018-01-16 | 2018-06-29 | 北京三快在线科技有限公司 | For the matching process, device and electronic equipment of rideshare service |
| CN108241630A (en) * | 2016-12-23 | 2018-07-03 | 武汉四维图新科技有限公司 | Recommend method and device in a kind of driving destination |
| CN108733747A (en) * | 2018-03-30 | 2018-11-02 | 斑马网络技术有限公司 | Map retrieval method based on cloud computing and its system |
| WO2019134469A1 (en) * | 2018-01-05 | 2019-07-11 | 深圳阿凡达智控有限公司 | Physical store query method and electronic device |
| CN110363191A (en) * | 2018-08-24 | 2019-10-22 | 北京建筑大学 | A kind of description of streetscape image space-time, search method and device based on POI object |
| WO2019242356A1 (en) * | 2018-06-22 | 2019-12-26 | 阿里巴巴集团控股有限公司 | Method and device for detecting accuracy of shop locations |
| CN110782055A (en) * | 2019-10-22 | 2020-02-11 | 上海钧正网络科技有限公司 | Information processing method, device, terminal and readable storage medium |
| CN111026821A (en) * | 2019-11-11 | 2020-04-17 | 视联动力信息技术股份有限公司 | Point location information query method and device, electronic equipment and readable storage medium |
| CN112381162A (en) * | 2020-11-19 | 2021-02-19 | 北京百度网讯科技有限公司 | Information point identification method and device and electronic equipment |
| CN112991013A (en) * | 2021-03-12 | 2021-06-18 | 广东来个碗网络科技有限公司 | Tableware leasing control method and device based on intelligent leasing cabinet |
| WO2021135106A1 (en) * | 2020-01-02 | 2021-07-08 | 平安科技（深圳）有限公司 | Geographic position data matching method, apparatus, electronic device and storage medium |
| CN114861062A (en) * | 2022-05-26 | 2022-08-05 | 北京百度网讯科技有限公司 | Information filtering method and device |
| CN117272391A (en) * | 2023-11-20 | 2023-12-22 | 哈尔滨工业大学(深圳)(哈尔滨工业大学深圳科技创新研究院) | Interest point query method and equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6697730B2 (en) * | 2000-04-04 | 2004-02-24 | Georgia Tech Research Corp. | Communications and computing based urban transit system |
| CN101231175A (en) * | 2007-01-25 | 2008-07-30 | 环达电脑(上海)有限公司 | Method for labeling interest points on global positioning system electronic map |
| CN101784005A (en) * | 2009-12-17 | 2010-07-21 | 华为终端有限公司 | Method for retrieving point of interest and terminal thereof |
| CN103218769A (en) * | 2013-03-19 | 2013-07-24 | 王兴健 | Taxi order allocation method |
-
2014
- 2014-09-04 CN CN201410449621.8A patent/CN105468631A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6697730B2 (en) * | 2000-04-04 | 2004-02-24 | Georgia Tech Research Corp. | Communications and computing based urban transit system |
| CN101231175A (en) * | 2007-01-25 | 2008-07-30 | 环达电脑(上海)有限公司 | Method for labeling interest points on global positioning system electronic map |
| CN101784005A (en) * | 2009-12-17 | 2010-07-21 | 华为终端有限公司 | Method for retrieving point of interest and terminal thereof |
| CN103218769A (en) * | 2013-03-19 | 2013-07-24 | 王兴健 | Taxi order allocation method |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017177916A1 (en) * | 2016-04-12 | 2017-10-19 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for determining point of interest |
| GB2553735A (en) * | 2016-04-12 | 2018-03-14 | Beijing Didi Infinity Technology & Dev Co Ltd | Systems and methods for determining point of interest |
| US10969239B2 (en) | 2016-04-12 | 2021-04-06 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for determining a point of interest |
| US10712170B2 (en) | 2016-04-12 | 2020-07-14 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for determining a point of interest |
| CN108241630A (en) * | 2016-12-23 | 2018-07-03 | 武汉四维图新科技有限公司 | Recommend method and device in a kind of driving destination |
| WO2019134469A1 (en) * | 2018-01-05 | 2019-07-11 | 深圳阿凡达智控有限公司 | Physical store query method and electronic device |
| CN108229748B (en) * | 2018-01-16 | 2022-06-10 | 北京三快在线科技有限公司 | Matching method and device for carpooling service and electronic equipment |
| CN108229748A (en) * | 2018-01-16 | 2018-06-29 | 北京三快在线科技有限公司 | For the matching process, device and electronic equipment of rideshare service |
| CN108733747A (en) * | 2018-03-30 | 2018-11-02 | 斑马网络技术有限公司 | Map retrieval method based on cloud computing and its system |
| WO2019242356A1 (en) * | 2018-06-22 | 2019-12-26 | 阿里巴巴集团控股有限公司 | Method and device for detecting accuracy of shop locations |
| CN110363191A (en) * | 2018-08-24 | 2019-10-22 | 北京建筑大学 | A kind of description of streetscape image space-time, search method and device based on POI object |
| CN110782055A (en) * | 2019-10-22 | 2020-02-11 | 上海钧正网络科技有限公司 | Information processing method, device, terminal and readable storage medium |
| CN111026821A (en) * | 2019-11-11 | 2020-04-17 | 视联动力信息技术股份有限公司 | Point location information query method and device, electronic equipment and readable storage medium |
| WO2021135106A1 (en) * | 2020-01-02 | 2021-07-08 | 平安科技（深圳）有限公司 | Geographic position data matching method, apparatus, electronic device and storage medium |
| CN112381162A (en) * | 2020-11-19 | 2021-02-19 | 北京百度网讯科技有限公司 | Information point identification method and device and electronic equipment |
| CN112381162B (en) * | 2020-11-19 | 2024-05-07 | 北京百度网讯科技有限公司 | Information point identification method and device and electronic equipment |
| CN112991013A (en) * | 2021-03-12 | 2021-06-18 | 广东来个碗网络科技有限公司 | Tableware leasing control method and device based on intelligent leasing cabinet |
| CN112991013B (en) * | 2021-03-12 | 2024-04-16 | 广东来个碗网络科技有限公司 | Tableware leasing control method and device based on intelligent leasing cabinet |
| CN114861062A (en) * | 2022-05-26 | 2022-08-05 | 北京百度网讯科技有限公司 | Information filtering method and device |
| CN117272391A (en) * | 2023-11-20 | 2023-12-22 | 哈尔滨工业大学(深圳)(哈尔滨工业大学深圳科技创新研究院) | Interest point query method and equipment |
| CN117272391B (en) * | 2023-11-20 | 2024-02-27 | 哈尔滨工业大学(深圳)(哈尔滨工业大学深圳科技创新研究院) | Interest point query method and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105468631A (en) | Point-of-interest query method and apparatus | |
| US10473475B2 (en) | Method and apparatus for determining a location of a point of interest | |
| WO2017107800A1 (en) | Method of acquiring route hotspot of traffic road and device | |
| CN103884345B (en) | Interest point information collecting method, interest point information displaying method, interest point information collecting device, interest point information displaying device, and interest point retrieval system | |
| CN105466435B (en) | Route planning method and device of navigation system | |
| CN102867004B (en) | A kind of method and apparatus of address coupling | |
| US9730028B2 (en) | Systems and methods to identify home addresses of mobile devices | |
| CN105302916A (en) | Information recommendation method and device | |
| US20140047372A1 (en) | Interface for Clustered Utility Nodes | |
| JP2016512620A (en) | Method and server for specifying geographical location of IP using location data of portable terminal | |
| CN105592120A (en) | Method and apparatus for providing geographic position information | |
| CN104848869A (en) | Map navigation method, map navigation device and map navigation system | |
| CN112653748B (en) | Information pushing method and device, electronic equipment and readable storage medium | |
| CN103808325A (en) | Method and device for generating traffic travel scheme | |
| CN104598506A (en) | Address generation method and device and address inquiry method and device for geographic position point | |
| CN103631888A (en) | Multi-data source data searching method and device based on positions | |
| CN103039036B (en) | Method and system for calculating number of users | |
| CN106855878B (en) | Historical driving track display method and device based on electronic map | |
| CN111209487B (en) | User data analysis method, server, and computer-readable storage medium | |
| CN103476003A (en) | Geographic information storage method for mobile equipment and mobile equipment | |
| CN103686588A (en) | Content information obtaining and processing method and system as well as information publishing server | |
| US9547843B2 (en) | Method and apparatus for locating a mobile terminal using received messages | |
| CN108121725A (en) | A kind of searching method and device | |
| CN103501359A (en) | Position positioning system | |
| CN111597278B (en) | Point-of-interest data processing and outputting method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20180418 Address after: Four story 847 mailbox of the capital mansion of Cayman Islands, Cayman Islands, Cayman Applicant after: CAINIAO SMART LOGISTICS HOLDING Ltd. Address before: Cayman Islands Grand Cayman capital building a four storey No. 847 mailbox Applicant before: ALIBABA GROUP HOLDING Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160406 |