CN103593364A - Method and system for filling keywords in route search - Google Patents
Method and system for filling keywords in route search Download PDFInfo
- Publication number
- CN103593364A CN103593364A CN201210291497.8A CN201210291497A CN103593364A CN 103593364 A CN103593364 A CN 103593364A CN 201210291497 A CN201210291497 A CN 201210291497A CN 103593364 A CN103593364 A CN 103593364A
- Authority
- CN
- China
- Prior art keywords
- starting point
- keyword
- route search
- keywords
- alternative
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Abstract
The invention discloses a method for filling keywords in route search. The method includes collecting starting point relevant information of the route search, selecting one or a plurality of spare starting point keywords from all starting point keywords in the starting point relevant information, filling a spare starting point keyword selected from the one or the plurality of spare starting point keywords into a corresponding area of a starting point of the route search in a WEB map search engine. A system for filling the keywords in the route search is further disclosed. By means of the method and the system, input cost of the route search conducted through the WEB map search engine can be reduced to the minimum.
Description
Technical field
The present invention relates to map route search technical field, refer to especially the method and system of filling keyword in a kind of route search.
Background technology
Route search refers to that user first inputs an origin information and an endpoint information in map search engine, and then, search system finds out corresponding one or more and reaches the route of terminal from starting point.Wherein, route comprise bus routes, drive route or Walking Route etc.
While searching for circuit in existing all map search engines, all need user in starting point frame input origin information and in terminal frame input endpoint information, as shown in Figure 1.Owing to carrying out route search at every turn, all need in starting point frame, input origin information, caused input cost higher.For example, suppose that a user is outdoor trip fan, this user can search for the route from family to tourist attractions with map search engine frequently.So, when this user carries out route search at every turn, all will the starting point frame of map search engine input identical starting point, family positional information.So inputting frequently identical origin information has not only increased input cost, returns user and brings bad experience.
For the problems referred to above, the route search of mobile terminal has provided a solution: in map search engine, the origin information of starting point frame is defaulted as the current location information of mobile terminal, and the endpoint information of terminal frame is still inputted by user.Input cost when this mode greatly reduces route search, why this mode can realize, be because: along with the development of mobile terminal technology, current mobile terminal substantially all possesses positioning function, and mobile terminal is by GPS or positional information that similarly Cellid location technology can Real-time Obtaining mobile terminal; So, when user uses the map search engine search route of mobile terminal, origin information is just filled to the current location information of mobile terminal by acquiescence, without user, fill.If departure place is not current position, user can click starting point frame and modifies so.But this mode can not be applied in WEB map search engine, because most PC does not possess positioning function.
In addition, a kind of scheme, Search Hints of the input cost while alleviating route search have also been proposed in prior art, specific practice is as follows: user is after a small amount of content of input, and system can be according to a small amount of content of input relevant one or more cues of real-time exhibition below search box.User therefrom chooses after certain cue, and this cue can be filled in search box.Like this, user just needn't input complete origin information.But this mode still needs user to input a small amount of information, to compare with the mode of system automatic filling origin information in mobile terminal, input cost is still higher.
Summary of the invention
In view of this, fundamental purpose of the present invention is to provide the method and system of filling keyword in a kind of route search, inputs the problem that cost is high while solving existing use WEB map search engine search route.
For achieving the above object, technical scheme of the present invention is achieved in that
The invention provides a kind of method of filling keyword in route search, the method comprises:
Gather the starting point relevant information of route search;
In all starting point keywords from described starting point relevant information, choose one or more alternative starting point keywords;
An alternative starting point keyword of determining is filled into the respective regions of the starting point of route search in WEB map search engine from one or more alternative starting point keywords.
Described starting point relevant information at least comprises starting point keyword and accumulative total access times.
The starting point relevant information that gathers described route search is: by Cookies, record described starting point relevant information;
In described Cookies, comprise one or more record, every described record is for preserving a starting point keyword and corresponding described accumulative total access times.
Before the relevant information of described collection starting point, the method also comprises: determine described starting point relevant information, for:
Route search client is positioned, determine the geographic position of route search client, the keyword that described geographic position is corresponding is as described starting point keyword;
Or, according to the IP address of route search client and default IP address and the corresponding relation in geographic position, determine the geographic position of route search client, the keyword that described geographic position is corresponding is as described starting point keyword.
According to described starting point relevant information from, in all starting point keywords of record, choose one or more alternative starting point keywords, comprising:
According to the accumulative total access times of starting point keyword, determine the probability of starting point keyword;
According to the probability of starting point keyword, determine the quantity of information of starting point keyword;
According to the quantity of information of all starting point keywords, determine the entropy of the system that all starting point keywords form;
According to the quantity of information of the accumulative total access times of starting point keyword, starting point keyword and described entropy, from all starting point keywords of record, choose one or more alternative starting point keywords.
According to the accumulative total access times of starting point keyword, determine the probability of starting point keyword; For:
The probability of i starting point keyword equals the accumulative total access times of i starting point keyword divided by the summation of the accumulative total access times of each starting point keyword; Described i is positive integer;
The quantity of information of determining starting point keyword according to the probability of starting point keyword is: le (i)=-log
2p (i);
The quantity of information that described le (i) is i starting point keyword; The probability that described p (i) is i starting point keyword;
According to the quantity of information of all starting point keywords, determine the entropy of the system that all starting point keywords form, for:
described H is described entropy; I=1,2 ..n; N is positive integer.
According to the quantity of information of the accumulative total access times of starting point keyword, starting point keyword and described entropy, from all starting point keywords of record, choose one or more alternative starting point keywords, for:
Travel through every record in described Cookies, when the accumulative total access times of the starting point keyword that current record is corresponding are greater than predetermined threshold value and the containing much information when predetermined threshold value and when described entropy is less than predetermined threshold value of starting point keyword corresponding to current record, using starting point keyword corresponding to current record as alternative starting point keyword.
The respective regions that an alternative starting point keyword of determining is filled into the starting point of route search in WEB map search engine from one or more alternative starting point keywords, comprising:
When described alternative starting point keyword is one, directly described alternative starting point keyword is filled into the respective regions of the starting point of route search in WEB map search engine; Or,
When described alternative starting point keyword is a plurality of, by WEB map search engine, show, and an alternative starting point keyword of determining a plurality of alternative starting point keyword from showing is filled into the respective regions of the starting point of route search in described WEB map search engine.
The present invention also provides the system of filling keyword in a kind of route search, and this system comprises: keyword acquisition module, keyword learning module and keyword packing module; Wherein:
Described keyword acquisition module, for gathering the starting point relevant information of route search;
Described keyword learning module, for choosing one or more alternative starting point keywords all starting point keywords from described starting point relevant information;
Described keyword packing module, for being filled into an alternative starting point keyword of determining from one or more alternative starting point keywords the respective regions of the starting point of route search WEB map search engine.
Described starting point relevant information at least comprises starting point keyword and accumulative total access times.
Described keyword acquisition module, also for recording described starting point relevant information by Cookies; In described Cookies, comprise one or more record, every described record is for preserving a starting point keyword and corresponding described accumulative total access times.
Described keyword learning module, also for determining the probability of starting point keyword according to the accumulative total access times of starting point keyword; According to the probability of starting point keyword, determine the quantity of information of starting point keyword; According to the quantity of information of all starting point keywords, determine the entropy of the system that all starting point keywords form; According to the quantity of information of the accumulative total access times of starting point keyword, starting point keyword and described entropy, from all starting point keywords of record, choose one or more alternative starting point keywords.
The probability of i starting point keyword equals the accumulative total access times of i starting point keyword divided by the summation of the accumulative total access times of each starting point keyword; Described i is positive integer;
The quantity of information of described definite starting point keyword is: le (i)=-log
2p (i);
The quantity of information that described le (i) is i starting point keyword; The probability that described p (i) is i starting point keyword;
Described definite entropy is:
described H is described entropy; I=1,2 ..n; N is positive integer.
Described keyword learning module, also for traveling through every record of described Cookies, when the accumulative total access times of the starting point keyword that current record is corresponding are greater than predetermined threshold value and the containing much information when predetermined threshold value and when described entropy is less than predetermined threshold value of starting point keyword corresponding to current record, using starting point keyword corresponding to current record as alternative starting point keyword.
Described keyword packing module, also for when described alternative starting point keyword is one, is directly filled into described alternative starting point keyword the respective regions of the starting point of route search in described WEB map search engine; Or, at described alternative starting point keyword while being a plurality of, by WEB map search engine, show, and an alternative starting point keyword of determining a plurality of alternative starting point keyword from showing is filled into the respective regions of the starting point of route search in described WEB map search engine.
In route search of the present invention, fill the method and system of keyword, by gathering the starting point relevant information of route search; In all starting point keywords from starting point relevant information, choose one or more alternative starting point keywords; An alternative starting point keyword of determining is filled into the respective regions of the starting point of route search in WEB map search engine from one or more alternative starting point keywords.So, when user opens WEB map search engine, system can be shown alternative starting point keyword automatically by WEB map search engine, user can therefrom select required starting point keyword, and after choosing, this starting point keyword be received in the respective regions of the starting point of route search, as starting point frame, as can be seen here, user, without any information of input, just can complete the filling of keyword, and input cost has been dropped to minimum.
Accompanying drawing explanation
Fig. 1 is existing route search schematic diagram;
Fig. 2 is the system architecture schematic diagram of filling keyword in route search of the present invention;
Fig. 3 is the method flow schematic diagram of filling keyword in route search of the present invention.
Embodiment
In the present invention, keyword can be divided into starting point keyword and terminal key word.In actual applications, the identical or close starting point keyword of input that user generally need to repeat, and terminal keyword is changeable.Therefore, the present invention be take and filled starting point keyword and describe as example.Certainly, the solution of the present invention is also applicable to the filling of terminal keyword.
Below by specific embodiment, the solution of the present invention is described.
The system of as shown in Figure 2, filling keyword in route search of the present invention comprises three large modules: keyword acquisition module 20, keyword learning module 21 and keyword packing module 22.Wherein:
Keyword acquisition module 20: the starting point relevant information of being responsible for gathering route search.
For WEB map search engine, the present invention adopts Cookies technology to gather and start of record relevant information.Starting point relevant information at least comprises: the accumulative total access times (Count) of starting point keyword (Word) and starting point keyword, further, this comprises the last time (Time) of using of starting point keyword.
So-called Cookies, is exactly that server is temporarily stored in the data in client (referring to user PC here), is mainly the text of txt form.By Cookies, server can identification client.When user browses WEB webpage by client, Web server can first send sub-fraction data and be temporarily stored in client and form Cookies, after this, and under information or operation note that Cookies can input user on WEB webpage.When user accesses same WEB webpage again, Web server can first confirm whether preserve corresponding Cookies in client, if had, Web server can judge according to the content recording in Cookies, to the specific web page contents of this client push.
When user's first passage WEB map search engine search route, WEB map server can send Cookies to client, and Cookies can record this and starting point relevant information when later each user carries out route search.It is pointed out that when user uses WEB map search engine search route at every turn, the starting point relevant information of Cookies record is can be along with upgrading.
Preferably, Cookies is the text of txt form, wherein the form of the starting point relevant information of record can be as follows, wherein comprises one or more record, and every record is for preserving a starting point keyword and corresponding accumulative total access times and last time of using:
Word1，Count1，Time1；
Word2，Count2，Time2；
......
Word(i)，Count(i)，Time(i)；
......
Word(n)，Count(n)，Time(n)。
Consider user's actual use scenes, preferably, above-mentioned 0≤n≤100, n has also represented the quantity recording in Cookies.Record in Cookies reaches after 100, and system preferentially eliminates that minimum record of Count value, when the count value that has many records minimum and when equal all, now preferentially eliminates wherein Time that record the earliest; Further, if wherein have many Time the earliest and equal record, eliminate this many records so simultaneously.
Before passing through Cookies start of record relevant information, also need to determine starting point relevant information, wherein, starting point keyword can be directly input of user, also can by system, be determined voluntarily without user's input, for example: route search client is positioned, determine that keyword corresponding to the ，Jiang geographic position, geographic position of route search client is as starting point keyword.This kind of mode is applicable to mobile client, and location technology herein adopts existing mobile positioning technique, such as GPS location technology, WIFI location technology etc.
Or, according to the IP address of route search client and default IP address and the corresponding relation in geographic position, determine that keyword corresponding to the ，Jiang geographic position, geographic position of route search client is as described starting point keyword.This kind of mode is applicable to fixed clients.
Preferably, keyword corresponding to above-mentioned geographic position is place name.
Keyword learning module 21: for choosing one or more alternative Word all Word from starting point relevant information.Detailed process is:
According to the accumulative total access times of Word, determine the probability of Word.The formula adopting is as follows:
pi＝Count(i)/Sum(Count?1+Count2+...+Count(i)...+Count(n))。The probability of i Word equals the accumulative total access times of i Word divided by the summation of the accumulative total access times of each Word.
Then, according to the probability of Word, determine the quantity of information of Word; According to the quantity of information of all Word, determine the entropy of the system that all Word form.Wherein, each Word is considered as to an event, according to the probability of each event, determines quantity of information and the entropy of each event.
The entropy here refers to information entropy, expression be probabilistic measuring.Be defined as follows: if had in a system S, there are a plurality of event S={E1 ..., En}, the probability distribution P={p1 of each event ..., pi ... pn}, the quantity of information of each event itself is: le (i)=-log
2p (i) (logarithm is bit (bit) with 2 Wei Di， units), the average information of whole system S is so:
This average information H is exactly information entropy.A system is orderly, more definite, and message entropy is just lower; Otherwise a system is chaotic, more uncertain, message entropy is just higher.So information entropy also can be described as a tolerance of systematic uncertainty degree.
After entropy is determined, according to quantity of information and the entropy of the accumulative total access times of Word, Word, from all Word of record, choose one or more alternative Word.Concrete according to following principle:
Every record in traversal Cookies, if current record (i bar record) meets following three conditions simultaneously: 1, Count (i) is greater than M; 2, le (i) is greater than N; 3, entropy is less than T, and so corresponding Word is alternative Word.
Further, can also carry out sequencing display to starting point frame to alternative Word elected, for example, according to Count (i) order from high to low, sort, or, according to le (i) order from high to low, sort.
Keyword packing module 22: for example, for an alternative Word who determines from one or more alternative Word being filled into the respective regions (starting point frame) of the starting point of route search WEB map search engine.
When above-mentioned user selects required Word from alternative Word, there are following three kinds of situations:
If only have one in 1 alternative Word, keyword packing module 22 is directly filled into this alternative Word in starting point frame so.If this Word does not meet user's request, user can click starting point frame and manually input origin information so.
If had in 2 alternative Word when a plurality of, keyword packing module 22 shows alternative Word by WEB map search engine, for example, these a plurality of alternative Word can be illustrated in to starting point frame near zone with the form of drop-down list, for example starting point frame below.User therefrom selects required Word, clicks, and this Word is filled in starting point frame, and user, without any information of input, just can complete the filling of starting point so.If wherein there is not the Word that meets user's request, user directly clicks starting point frame, manually inputs origin information.
If 3 do not have alternative Word, need so user to click starting point frame, manually input origin information.
As shown in Figure 3, in route search of the present invention, fill the method for keyword, comprising:
Step 301, the starting point relevant information of collection route search; Wherein, starting point relevant information at least comprises: the accumulative total access times of starting point keyword and starting point keyword, further, can also comprise the last time of using of starting point keyword.
In this step, by Cookies start of record relevant information.
In Cookies, comprise one or more record, every record, for preserving a starting point keyword and corresponding accumulative total access times, further, can also record the time of the last use of this starting point keyword.
Step 302, chooses one or more alternative starting point keywords in all starting point keywords from starting point relevant information.
Concrete, according to the accumulative total access times of starting point keyword, determine the probability of starting point keyword: the probability of i starting point keyword equals the accumulative total access times of i starting point keyword divided by the summation of the accumulative total access times of each starting point keyword; I is positive integer.
According to the probability of starting point keyword, determine the quantity of information of starting point keyword: le (i)=-log
2p (i); The quantity of information that le (i) is i starting point keyword; The probability that p (i) is i starting point keyword.
According to the quantity of information of all starting point keywords, determine the entropy of the system that all starting point keywords form: H=-∑ (p (i) log
2p (i)); H is entropy.
According to quantity of information and the entropy of the accumulative total access times of starting point keyword, starting point keyword, from all starting point keywords of record, choose one or more alternative starting point keywords, concrete:
Every record in traversal Cookies, when the accumulative total access times of the starting point keyword that current record is corresponding are greater than predetermined threshold value and the containing much information when predetermined threshold value and when entropy is less than predetermined threshold value of starting point keyword corresponding to current record, using starting point keyword corresponding to current record as alternative starting point keyword.
Step 303, is filled into an alternative starting point keyword of determining from one or more alternative starting point keywords the respective regions of the starting point of route search in WEB map search engine.
When alternative starting point keyword is one, directly alternative starting point keyword is filled into the respective regions of the starting point of route search in WEB map search engine; Or,
When alternative starting point keyword is while being a plurality of, by WEB map search engine, show, and an alternative starting point keyword of determining a plurality of alternative starting point keyword from showing is filled into the respective regions of the starting point of route search in WEB map search engine.
One of ordinary skill in the art will appreciate that all or part of flow process realizing in above-described embodiment method, to come the hardware that instruction is relevant to complete by computer program, described program can be stored in a computer read/write memory medium, this program, when carrying out, can comprise as the flow process of the embodiment of above-mentioned each side method.Wherein, described storage medium can be magnetic disc, CD, read-only store-memory body (Read-Only Memory, ROM) or random store-memory body (Random Access Memory, RAM) etc.
The above, be only preferred embodiment of the present invention, is not intended to limit protection scope of the present invention.
Claims (15)
1. in route search, fill a method for keyword, it is characterized in that, the method comprises:
Gather the starting point relevant information of route search;
In all starting point keywords from described starting point relevant information, choose one or more alternative starting point keywords;
An alternative starting point keyword of determining is filled into the respective regions of the starting point of route search in WEB map search engine from one or more alternative starting point keywords.
2. fill according to claim 1 the method for keyword in route search, it is characterized in that, described starting point relevant information at least comprises starting point keyword and accumulative total access times.
3. fill according to claim 2 the method for keyword in route search, it is characterized in that, the starting point relevant information that gathers described route search is: by Cookies, record described starting point relevant information;
In described Cookies, comprise one or more record, every described record is for preserving a starting point keyword and corresponding described accumulative total access times.
4. fill according to claim 3 the method for keyword in route search, it is characterized in that, before the relevant information of described collection starting point, the method also comprises: determine described starting point relevant information, for:
Route search client is positioned, determine the geographic position of route search client, the keyword that described geographic position is corresponding is as described starting point keyword;
Or, according to the IP address of route search client and default IP address and the corresponding relation in geographic position, determine the geographic position of route search client, the keyword that described geographic position is corresponding is as described starting point keyword.
5. fill according to claim 4 the method for keyword in route search, it is characterized in that, according to described starting point relevant information, from all starting point keywords of record, choose one or more alternative starting point keywords, comprising:
According to the accumulative total access times of starting point keyword, determine the probability of starting point keyword;
According to the probability of starting point keyword, determine the quantity of information of starting point keyword;
According to the quantity of information of all starting point keywords, determine the entropy of the system that all starting point keywords form;
According to the quantity of information of the accumulative total access times of starting point keyword, starting point keyword and described entropy, from all starting point keywords of record, choose one or more alternative starting point keywords.
6. fill according to claim 5 the method for keyword in route search, it is characterized in that, according to the accumulative total access times of starting point keyword, determine the probability of starting point keyword; For:
The probability of i starting point keyword equals the accumulative total access times of i starting point keyword divided by the summation of the accumulative total access times of each starting point keyword; Described i is positive integer;
The quantity of information of determining starting point keyword according to the probability of starting point keyword is: le (i)=-log
2p (i);
The quantity of information that described le (i) is i starting point keyword; The probability that described p (i) is i starting point keyword;
According to the quantity of information of all starting point keywords, determine the entropy of the system that all starting point keywords form, for:
described H is described entropy; I=1,2 ..n; N is positive integer.
7. fill according to claim 6 the method for keyword in route search, it is characterized in that, according to the quantity of information of the accumulative total access times of starting point keyword, starting point keyword and described entropy, from all starting point keywords of record, choose one or more alternative starting point keywords, for:
Travel through every record in described Cookies, when the accumulative total access times of the starting point keyword that current record is corresponding are greater than predetermined threshold value and the containing much information when predetermined threshold value and when described entropy is less than predetermined threshold value of starting point keyword corresponding to current record, using starting point keyword corresponding to current record as alternative starting point keyword.
8. fill according to claim 1 the method for keyword in route search, it is characterized in that, the respective regions that an alternative starting point keyword of determining is filled into the starting point of route search in WEB map search engine from one or more alternative starting point keywords, comprising:
When described alternative starting point keyword is one, directly described alternative starting point keyword is filled into the respective regions of the starting point of route search in WEB map search engine; Or,
When described alternative starting point keyword is a plurality of, by WEB map search engine, show, and an alternative starting point keyword of determining a plurality of alternative starting point keyword from showing is filled into the respective regions of the starting point of route search in described WEB map search engine.
9. in route search, fill a system for keyword, it is characterized in that, this system comprises: keyword acquisition module, keyword learning module and keyword packing module; Wherein:
Described keyword acquisition module, for gathering the starting point relevant information of route search;
Described keyword learning module, for choosing one or more alternative starting point keywords all starting point keywords from described starting point relevant information;
Described keyword packing module, for being filled into an alternative starting point keyword of determining from one or more alternative starting point keywords the respective regions of the starting point of route search WEB map search engine.
10. fill according to claim 9 the system of keyword in route search, it is characterized in that, described starting point relevant information at least comprises starting point keyword and accumulative total access times.
11. fill the system of keyword according to claim 10 in route search, it is characterized in that, described keyword acquisition module, also for recording described starting point relevant information by Cookies; In described Cookies, comprise one or more record, every described record is for preserving a starting point keyword and corresponding described accumulative total access times.
12. according to the system of filling keyword in route search described in claim 11, it is characterized in that,
Described keyword learning module, also for determining the probability of starting point keyword according to the accumulative total access times of starting point keyword; According to the probability of starting point keyword, determine the quantity of information of starting point keyword; According to the quantity of information of all starting point keywords, determine the entropy of the system that all starting point keywords form; According to the quantity of information of the accumulative total access times of starting point keyword, starting point keyword and described entropy, from all starting point keywords of record, choose one or more alternative starting point keywords.
13. according to the system of filling keyword in route search described in claim 12, it is characterized in that,
The probability of i starting point keyword equals the accumulative total access times of i starting point keyword divided by the summation of the accumulative total access times of each starting point keyword; Described i is positive integer;
The quantity of information of described definite starting point keyword is: le (i)=-log
2p (i);
The quantity of information that described le (i) is i starting point keyword; The probability that described p (i) is i starting point keyword;
Described definite entropy is:
described H is described entropy; I=1,2 ..n; N is positive integer.
14. according to the system of filling keyword in route search described in claim 13, it is characterized in that,
Described keyword learning module, also for traveling through every record of described Cookies, when the accumulative total access times of the starting point keyword that current record is corresponding are greater than predetermined threshold value and the containing much information when predetermined threshold value and when described entropy is less than predetermined threshold value of starting point keyword corresponding to current record, using starting point keyword corresponding to current record as alternative starting point keyword.
15. fill the system of keyword according to claim 9 in route search, it is characterized in that,
Described keyword packing module, also for when described alternative starting point keyword is one, is directly filled into described alternative starting point keyword the respective regions of the starting point of route search in described WEB map search engine; Or, at described alternative starting point keyword while being a plurality of, by WEB map search engine, show, and an alternative starting point keyword of determining a plurality of alternative starting point keyword from showing is filled into the respective regions of the starting point of route search in described WEB map search engine.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210291497.8A CN103593364B (en) | 2012-08-16 | 2012-08-16 | The method and system of keyword is filled in a kind of route search |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210291497.8A CN103593364B (en) | 2012-08-16 | 2012-08-16 | The method and system of keyword is filled in a kind of route search |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103593364A true CN103593364A (en) | 2014-02-19 |
| CN103593364B CN103593364B (en) | 2017-12-12 |
Family
ID=50083513
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210291497.8A Active CN103593364B (en) | 2012-08-16 | 2012-08-16 | The method and system of keyword is filled in a kind of route search |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103593364B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107798022A (en) * | 2016-09-07 | 2018-03-13 | 北京嘀嘀无限科技发展有限公司 | Order reconnaissance method and device under map search |
| US10527446B2 (en) | 2016-03-16 | 2020-01-07 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for determining location |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1801143A (en) * | 2004-12-31 | 2006-07-12 | 张箭 | Electronic map use method |
| CN1808069A (en) * | 2005-01-19 | 2006-07-26 | 乐金电子（惠州）有限公司 | Route search method |
| US20080176583A1 (en) * | 2005-10-28 | 2008-07-24 | Skyhook Wireless, Inc. | Method and system for selecting and providing a relevant subset of wi-fi location information to a mobile client device so the client device may estimate its position with efficient utilization of resources |
| CN101309441A (en) * | 2007-05-16 | 2008-11-19 | 北京邮电大学 | Information searching system based on subscriber location and calling center |
| CN101627384A (en) * | 2007-03-08 | 2010-01-13 | 微软公司 | From search inquiry, detect user's position, local intention and travel intent |
| CN102054362A (en) * | 2009-10-30 | 2011-05-11 | 北京四通智能交通系统集成有限公司 | Navigation information service system |
| CN102185975A (en) * | 2011-05-16 | 2011-09-14 | 中兴通讯股份有限公司 | Mobile-terminal-based bus route query method, device and system |
-
2012
- 2012-08-16 CN CN201210291497.8A patent/CN103593364B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1801143A (en) * | 2004-12-31 | 2006-07-12 | 张箭 | Electronic map use method |
| CN1808069A (en) * | 2005-01-19 | 2006-07-26 | 乐金电子（惠州）有限公司 | Route search method |
| US20080176583A1 (en) * | 2005-10-28 | 2008-07-24 | Skyhook Wireless, Inc. | Method and system for selecting and providing a relevant subset of wi-fi location information to a mobile client device so the client device may estimate its position with efficient utilization of resources |
| CN101627384A (en) * | 2007-03-08 | 2010-01-13 | 微软公司 | From search inquiry, detect user's position, local intention and travel intent |
| CN101309441A (en) * | 2007-05-16 | 2008-11-19 | 北京邮电大学 | Information searching system based on subscriber location and calling center |
| CN102054362A (en) * | 2009-10-30 | 2011-05-11 | 北京四通智能交通系统集成有限公司 | Navigation information service system |
| CN102185975A (en) * | 2011-05-16 | 2011-09-14 | 中兴通讯股份有限公司 | Mobile-terminal-based bus route query method, device and system |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10527446B2 (en) | 2016-03-16 | 2020-01-07 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for determining location |
| US11193786B2 (en) | 2016-03-16 | 2021-12-07 | Beijing Didi Infinity Technology And Development., Ltd. | System and method for determining location |
| CN107798022A (en) * | 2016-09-07 | 2018-03-13 | 北京嘀嘀无限科技发展有限公司 | Order reconnaissance method and device under map search |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103593364B (en) | 2017-12-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10861590B2 (en) | Generating spatial visualizations of a patient medical state | |
| US10101165B2 (en) | Electronic device and method for planning tour route | |
| US9489366B2 (en) | Interactive synchronization of web data and spreadsheets | |
| US20170010123A1 (en) | Hybrid road network and grid based spatial-temporal indexing under missing road links | |
| US7533112B2 (en) | Context hierarchies for address searching | |
| US8977632B2 (en) | Travelogue locating mining for travel suggestion | |
| US20120010996A1 (en) | Recommendations and targeted advertising based upon directions requests activity and data | |
| US20130268626A1 (en) | Providing geocoded targeted web content | |
| US10127245B2 (en) | Systems, methods, and computer-readable media for interpreting geographical search queries | |
| CN103914498A (en) | Search recommending method and device for map searching | |
| US20190034816A1 (en) | Methods and system for associating locations with annotations | |
| CN102841860A (en) | Large data volume information storage and access method | |
| US20150088853A1 (en) | Geospatial search portal, methods of making and using the same, and systems including the same | |
| US9020919B2 (en) | Method and apparatus for performing extended search | |
| CN103808325A (en) | Method and device for generating traffic travel scheme | |
| US20140088861A1 (en) | Historical tours | |
| CN108228593B (en) | Interest point importance measuring method and device | |
| JP2015534099A (en) | Custom labeling of maps based on content | |
| US20140188607A1 (en) | Advertising exposure method based on event occurrence, server for performing the advertising exposure method, and computer-readable recording medium having recorded thereon program for executing the advertising exposure method | |
| US8694512B1 (en) | Query suggestions | |
| Thomas et al. | Design of high performance cluster based map for vehicle tracking of public transport vehicles in smart city | |
| JP4858851B2 (en) | Vehicle information display device | |
| CN103593364A (en) | Method and system for filling keywords in route search | |
| Rogers et al. | Arctic sea ice: Use of observational data and model hindcasts to refine future projections of ice extent | |
| US11039273B1 (en) | Method and system for generating geofences using an iterative process |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230714 Address after: 518057 Tencent Building, No. 1 High-tech Zone, Nanshan District, Shenzhen City, Guangdong Province, 35 floors Patentee after: TENCENT TECHNOLOGY (SHENZHEN) Co.,Ltd. Patentee after: TENCENT CLOUD COMPUTING (BEIJING) Co.,Ltd. Address before: 2, 518044, East 403 room, SEG science and Technology Park, Zhenxing Road, Shenzhen, Guangdong, Futian District Patentee before: TENCENT TECHNOLOGY (SHENZHEN) Co.,Ltd. |
|
| TR01 | Transfer of patent right |