KR20150102464A - Search method of navigation and apparatus thereof - Google Patents

Abstract

The present invention relates to a searching method for a navigation, capable of quickly deducting a search result by determining a database (DB) to be searched while reflecting approaching time to a plurality of DBs and an access number to each database. The searching method for a navigation comprises: a step of inputting a keyword to a control part through an input part; a step of dividing the inputted keyword into word units through a word extraction part; a step of extracting a number of matching data on each divided word; a step of extracting first intersection matching data by comparing matching data on two words from which less matching data are extracted; a step of determining words to be additionally compared; a step of comparing a first time consumed to search second intersection matching data formed by comparing the matching data on the words to be additionally compared with first intersection matching data from a matching data DB if the words to be additionally compared exist according to the determination result with a second time consumed to search detail information on the first intersection matching data from a detail information DB; a step of extracting a search result including all the divided words based on the result of comparing the first time and the second time; and a step of outputting the search result outputted through an output part.

Description

[0001] SEARCH METHOD OF NAVIGATION AND APPARATUS THEREOF [0002]

The present invention relates to a navigation search method and apparatus, and more particularly, to a navigation search method and apparatus for quickly deriving a search result for a search term including a plurality of words input by a user.

Generally, the navigation device recognizes the current position of the vehicle based on the position information of the vehicle received through GPS (Global Positioning System) satellite, reads the current position data from the built-in or received road database, So that it is possible to identify the location of the road on which the user is presently driving or to easily find the destination when driving on the oncoming road.

Recently, in order to meet the user's needs, advanced technology such as guiding the expected arrival time from the departure place to the destination or suggesting a detour route according to the road situation to the destination is provided to the navigation device or smart phone And provides more specific route information to the user.

In the technology for guiding the route to the destination as described above, the technology for meeting the needs of the user is advanced.

Prior art relating to the present invention is disclosed in Korean Patent Laid-Open Publication No. 2012-0031972 (published on April 4, 2012, entitled Path search device terminal and path information guidance method using the same).

Conventional navigation guides a user to a destination by inputting a search word for a destination from a user and searching for a route based on the search word to guide the user to the destination.

However, the search term entered by the user includes various words. However, when searching the database for a name including all the words included in the search term, the search time takes too long.

In order to solve this problem, a technique has been developed in which a search word is searched by forming an index for each word and simply checking an index of all words included in the search air.

However, such a technique has not shown a great effect when too many indexes exist for a specific word, and the index itself includes specific information about the word, thereby requiring a long search time.

SUMMARY OF THE INVENTION The present invention has been made in view of the above problems, and it is an object of the present invention to quickly derive a search result by reflecting not only an access time for a plurality of DBs constituting a database but also an access frequency for each DB, And to provide a navigation apparatus and a navigation apparatus.

According to an aspect of the present invention, there is provided a navigation search method including: receiving a search word through a control unit; Separating the inputted search word into words by a word extracting unit; Extracting a number of matching data for each of the separated words; Extracting first crossing matching data by comparing matching data for two words from which matching data is extracted less; Determining whether there is a word to be further compared; If there is a word to be compared as a result of the determination, a first time required for searching for second cross-matching data obtained by comparing the first cross-matching data with the matching data for the word to be further compared from the matching data DB, Comparing the second time required to retrieve detailed information on the first cross-matching data from the second time; Extracting a search result including all of the separated words based on a result of comparing the first time and the second time; And outputting the extracted search result through an output unit.

In the step of extracting the number of matching data of the present invention, the control unit extracts the number of matching data for each word from the index DB of the database.

The controller may output the first cross-matching data as a search result if it is determined that there is no further word to be compared.

If the first time is less than or equal to the second time, the control unit searches the matching data DB to extract matching data for the word to be further compared and the first cross-matching data And extracts the compared second cross-matching data as a search result.

In the step of extracting the search result of the present invention, when the first time exceeds the second time, the controller searches the detailed information DB to extract the additional comparison word from the detailed information on the first cross- And the search result including the matching data is extracted.

The method may further include extracting an access time for the matching data DB and an access time for the detailed information DB before comparing the first time and the second time.

In the step of comparing the first time with the second time, the controller calculates the first time by multiplying the access time of the matching data DB by the number of matching data of the word to be further compared And the second time is calculated by multiplying the access time of the detailed information DB by the number of first cross-matching data.

According to another aspect of the present invention, there is provided a navigation apparatus for navigation, comprising: an input unit for inputting a search word from a user; A word extracting unit for separating the input search word into words; A database including an index DB for storing the number of matching data for each word, a matching data DB for storing matching data for each word, and a detailed information DB for storing detailed information on the matching data. And extracting the number of matching data for each of the separated words from the index DB and searching for a word included in the inputted search word based on the searching time for the matching data DB and the searching time for the detailed information DB And a control unit for performing an integrated search on the search results.

In the present invention, the controller may compare the matching data of two words from which the matching data is extracted to extract first cross-matching data, and if there is a word to be further compared, A first time required for retrieving the second cross-matching data obtained by comparing the matching data with the first cross-matching data, a second time required for searching the detailed information DB for the detailed information about the first cross- And performs an integrated search based on the comparison result.

The controller searches the matching data DB if the first time is less than or equal to the second time and extracts second cross matching data obtained by comparing the matching data for the word to be further compared with the first cross matching data .

The control unit may search the detailed information DB if the first time exceeds the second time, to search the detailed information DB for the search result including the matching data for the word to be further compared among the detailed information about the first cross- Is extracted.

The control unit calculates the first time by multiplying the access time of the matching data DB by the number of matching data of the word to be further compared, and calculates an access time to the detailed information DB and the first cross- And the second time is calculated as a value obtained by multiplying the number of data.

According to the present invention, not only the access time for a plurality of DBs constituting a database but also the access frequency for each DB is further reflected to determine a DB to be a search target, whereby a search term including a plurality of words ≪ / RTI >

1 is a functional block diagram of a navigation apparatus of a navigation apparatus according to an embodiment of the present invention.
FIG. 2 is a flow chart illustrating a method of searching for navigation according to an exemplary embodiment of the present invention. Referring to FIG.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, a navigation method and an apparatus for navigation according to an embodiment of the present invention will be described in detail with reference to the accompanying drawings. In this process, the thicknesses of the lines and the sizes of the components shown in the drawings may be exaggerated for clarity and convenience of explanation. In addition, the terms described below are defined in consideration of the functions of the present invention, which may vary depending on the intention or custom of the user, the operator. Therefore, definitions of these terms should be made based on the contents throughout this specification.

1 is a functional block diagram of a navigation apparatus of a navigation apparatus according to an embodiment of the present invention.

Referring to FIG. 1, a navigation apparatus for navigation according to an embodiment of the present invention includes an input unit 10, a word extraction unit 30, a control unit 50, a database 70, and an output unit 90.

The input unit 10 is configured to receive a search word from a user. The user can input a search word such as a name of a destination, a road name, and a city name in order to search for a route to a destination.

That is, the user can freely input a search word including a plurality of words related to a desired destination to the input unit 10.

The word extracting unit 30 separates the search word input from the user into words and transmits the word to the control unit 50, which will be described later.

Specifically, the word extracting unit 30 can separate a word based on a space between a word and a word when the inputted search word is Latin, and compare the input word with a pre-constructed word dictionary when the inputted search word is Korean It can also be divided into units that can be judged to be probabilistic words.

However, since the above-described example is merely an example of separating a search word into words, the word extracting unit 30 can separate the search words in various other known or unknown ways.

The control unit 50 extracts matching data for each of the separated words and searches for a matching keyword for the input query based on the searching time for the matching data DB 74 and the searching time for the detailed information DB 76. [ Perform an integrated search. At this time, the matching data means data for all the complex words including a specific word.

Specifically, in this embodiment, the database 70 on which the control unit 50 performs word-based searching includes an index DB 72, a matching data DB 74, and a detailed information DB 76.

The index DB 72 stores the location where each word is stored in the database 70 and the number of matching data for the word.

Accordingly, the control unit 50 can confirm the position where the specific word is stored and the number of matching data, which is a set of compound words including the word, through the access to the index DB 72. [

The matching data DB 74 stores actual matching data for each word and a detailed information ID (Identification) required for identifying detailed information about each matching data. The detailed information DB 76 stores detailed information about each matching data Information is stored.

Specifically, the matching data is a collection of all the composite words including a specific word, as described above. The matching data DB 74 does not include specific information about the compound word, The telephone number of the destination corresponding to the compound word, the address, and detailed information such as the compound word are stored.

The detailed information described above is only one example, and the detailed information DB 76 can store any specific information about a specific destination.

The database 70 has a plurality of hierarchical structures according to the information included in the database 70. The database 70 includes a plurality of hierarchical DBs 72 corresponding to the characteristics of the index DB 72, the matching data DB 74, and the detailed information DB 76, (72, 74, 76) are different from each other.

Specifically, the access time to the index DB 72 is relatively short, and the detailed information DB 76 has a relatively long access time because the amount of information contained therein is large.

At this time, the control unit 50 can also know the specific time required to read one piece of data from each of the DBs 72, 74, and 76 based on the characteristics of the database 70. [ As described above, in this embodiment, the control unit 50 derives the search result at the optimum time based on the difference in the access time to each of the DBs 72, 74, and 76.

For this, the controller 50 extracts the number of matching data for each of the separated words through the word extracting unit 30. That is, the control unit 50 searches the index DB 72 and extracts the number of matching data for each word.

Then, the controller 50 compares the matching data of the two words, from which the matching data is extracted, and extracts the cross matching data. In this case, the cross-matching data refers to matching data commonly included among matching data for each word.

In the present embodiment, for convenience of description, the matching data for the two words from which the matching data is less extracted is referred to as the first cross matching data.

Since the information on each word can not be obtained only by accessing the index DB 72 as described above, the controller 50 accesses the matching data DB 74 to extract the matching data for the two words, And compares each matching data to extract first crossing matching data.

If the inputted search word is composed of two words, the first cross-matching data will be the final search result for the search term, and therefore the controller 50 outputs the first cross-matching data to the user as a search result.

On the other hand, if there is a word to be further compared, the control unit 50 may further include a first time required to search for second cross-matching data, which is obtained by comparing the first cross- And a second time required for searching for detailed information on each of the search results.

In the present embodiment, when there is a word to be compared for convenience of explanation, the matching data for the word is compared with the previously extracted cross matching data, and the extracted cross matching data is referred to as second cross matching data.

As described above, the one access time for the matching data DB 74 is shorter than the one access time for the detailed information DB 76. However, as the number of accesses to the matching data DB 74 increases, The entire time for searching the DB 74 may take longer than the time for searching the detailed information DB 76. [

Therefore, in this embodiment, the control unit 50 reflects not only the access time for each of the DBs 74 and 76 but also the access times for the corresponding DBs 74 and 76, .

Specifically, the first time may be calculated by multiplying the access time to the matching data DB 74 by the number of matching data of the word to be further compared, and the second time may be calculated by multiplying the access time to the detailed information DB 76 Can be calculated by multiplying the number of first cross-matching data.

If the first time is less than the second time as a result of the comparison of the first time and the second time, the control unit 50 compares the matching data for the word to be further compared with the first crossing matching data, .

That is, when the first time is less than the second time, it means that it takes less time to access and search the matching data DB 74 than the detailed information DB 76. Therefore, And extracts a search result including a plurality of words.

On the other hand, if the first time exceeds the second time, it means that it takes a long time to access and search the detailed information DB 76. Therefore, The detailed information is searched to extract a search result including a plurality of words.

If there is no additional word to be compared, the data retrieved up to now is output to the user as a search result. If additional words remain to be compared, the time required to retrieve the matching data and the detailed information of the cross matching data are retrieved And the process of determining which DB 72, 74, or 76 to search is continuously repeated.

Hereinafter, a process of determining the DB 72, 74, or 76 to be searched by the control unit 50 will be described with reference to a simple example. The number of matching data for each word and the access time for each of the DBs 74 and 76 are shown in Tables 1 and 2, respectively, assuming that the driver inputs a search word "Hyundai MNS soft".

Modern Mn soft Number of matching data 50000 3000 20000

Matching data DB Detailed information DB Access time 0.1ms 1ms

As described above, the word extracting unit 30 separates the search word into "Hyundai," "MMB," and "Soft" when the search word Hyundai Mngsoft is input.

Then, the control unit 50 can easily extract the number of matching data for each word by searching the index DB 72, and compare the matching data for "M" and "soft" And extracts first cross-matching data.

In the present embodiment, it is assumed that the first cross-matching data for "M" and "soft" As a result, it can be seen that 2000 compound words including both "M-EN" and "SOFT" were searched.

Since the control unit 50 further has the word "modern" to be compared, the DB to be searched among the matching data DB 74 and the detailed information DB 76 is determined as described above.

Specifically, the control unit 50 calculates the first time by multiplying the access time for the matching data DB 74 by the number of matching data of "modern" to be further compared, so that the first time is 5 sec .

The controller 50 calculates the second time by multiplying the access time of the detailed information DB 76 by the number of first cross-matching data, and the second time is calculated as 2 seconds multiplied by 1 ms and 2000.

As a result of the calculation, since the second time is less than the first time, the controller 50 searches the detailed information DB 76 for the first cross-matching data for data including the word "contemporary "

In the above example, three words are included in the search word. However, it is natural that DBs 74 and 76 to be searched can be determined in the same manner as described above even when four or more words are included.

In particular, when there are a plurality of additional words to be compared, it is reasonable to minimize the search time by reducing the number of matching data to be searched by adding the matching words one by one in descending order of the extracted matching words.

As a result, by reflecting only that the access time to the matching data DB 74 is relatively shorter than the access time to the detailed information DB 76, in the above-described situation, conventionally, All the search terms were searched in the matching data DB 74. [

However, in the present embodiment, it is additionally reflected on the number of accesses to the respective DBs 74 and 76 having different access speeds to determine which data should be used to perform an integrated search for a plurality of words, The search result of the search word including the word " of " can be obtained.

The output unit 90 outputs the final search result to the user under the control of the control unit 50.

FIG. 2 is a flow chart illustrating a method of searching for navigation according to an exemplary embodiment of the present invention. Referring to FIG.

Referring to FIG. 2, a search method of navigation according to an embodiment of the present invention will be described. First, the control unit 50 receives a search word through the input unit 10 (S100) (S200).

Specifically, the word extracting unit 30 can separate a word based on a space between a word and a word when the inputted search word is Latin, and compare the input word with a pre-constructed word dictionary when the inputted search word is Korean It can also be divided into units that can be judged to be probabilistic words.

However, since the above-described example is merely an example of separating a search word into words, the word extracting unit 30 can separate the search words in various other known or unknown ways.

The controller 50 searches the index DB 72, extracts the number of matching data for each of the separated words (S300), and extracts the first cross-matching data (S400).

Specifically, the controller 50 compares matching data for two words from which less matching data is extracted, and extracts the first cross matching data.

In step S500, the control unit 50 determines whether there is a word to be compared. If there is no word to be compared, the controller 50 extracts the first cross-matching data as a search result in step S520.

On the other hand, if there is a word to be further compared, the controller 50 calculates a first time required for searching for second cross-matching data, which is a comparison of the first cross- A second time required for searching for detailed information on the data, and compares the first time and the second time (S600).

Specifically, the first time may be calculated by multiplying the access time to the matching data DB 74 by the number of matching data of the word to be compared, and the second time may be calculated by multiplying the access time to the detailed information DB 76 by 1 cross-matching data.

If the first time is less than or equal to the second time, the control unit 50 compares the matching data for the word to be compared with the first crossing matching data to obtain new second crossing matching data as a search result (S620).

That is, when the first time is less than the second time, it means that it takes less time to access and search the matching data DB 74 than the detailed information DB 76. Therefore, And extracts a search result including a plurality of words.

On the other hand, if the first time of the comparison result (S600) exceeds the second time, the control unit 50 extracts the search result including the matching data for the word to be further to be compared among the detailed information on the first cross-matching data (S640).

That is, when the first time exceeds the time, it means that it takes a long time to access and search the detailed information DB 76. Therefore, the control unit 50 stores in the detailed information DB 76, The detailed information is searched to extract a search result including a plurality of words.

Next, the control unit 50 outputs the search results extracted in the above-described steps S520, 620, and 640 through the output unit 90. [

According to the present embodiment, not only the access time for a plurality of DBs constituting a database but also the access frequency for each DB are further reflected to determine a DB to be retrieved, Search results for the search term can be derived.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is clearly understood that the same is by way of illustration and example only and is not to be taken by way of limitation, I will understand. Accordingly, the true scope of the present invention should be determined by the following claims.

10: Input unit
30: word extracting unit
50:
70: Database
72: Index DB
74: matching data DB
76: Detailed information DB
90: Output section

Claims (12)

A control unit receiving a search word through an input unit;
Separating the inputted search word into words by a word extracting unit;
Extracting a number of matching data for each of the separated words;
Extracting first crossing matching data by comparing matching data for two words from which matching data is extracted less;
Determining whether there is a word to be further compared;
If there is a word to be compared as a result of the determination, a first time required for searching for second cross-matching data obtained by comparing the first cross-matching data with the matching data for the word to be further compared from the matching data DB, Comparing the second time required to retrieve detailed information on the first cross-matching data from the second time;
Extracting a search result including all of the separated words based on a result of comparing the first time and the second time; And
Outputting the extracted search result through an output unit
And searching for the navigation.
The method according to claim 1,
Wherein in the step of extracting the number of matching data, the controller extracts the number of matching data for each word from the index DB of the database.
The method according to claim 1,
Wherein the control unit outputs the first cross-matching data as a search result if it is determined that there is no word to be further compared.
The method according to claim 1,
In the step of extracting the search result, the controller searches the matching data DB if the first time is less than or equal to the second time, and compares the matching data for the word to be further compared with the first cross- 2 intersection matching data is extracted as a search result.
5. The method of claim 4,
In the step of extracting the search result, the controller searches the detailed information DB if the first time exceeds the second time, and searches the detailed information DB for the matching of the further comparison words among the detailed information about the first cross- And extracting a search result including the data.
6. The method of claim 5,
Further comprising the step of extracting an access time for the matching data DB and an access time for the detailed information DB before comparing the first time and the second time.
The method according to claim 6,
Wherein the controller calculates the first time by multiplying the access time of the matching data DB by the number of matching data of the word to be further compared and comparing the first time with the second time, Wherein the second time is calculated by multiplying the access time to the information DB by the first cross-matching data number.
An input unit for receiving a search word from a user;
A word extracting unit for separating the input search word into words;
A database including an index DB for storing the number of matching data for each word, a matching data DB for storing matching data for each word, and a detailed information DB for storing detailed information on the matching data. And
Extracting the number of matching data for each of the separated words from the index DB, calculating a matching time for the words included in the inputted search word based on the searching time for the matching data DB and the searching time for the detailed information DB, A control unit
And a search unit for searching the navigation apparatus.
9. The method of claim 8,
The control unit compares the matching data for the two words from which the matching data is extracted to extract the first crossing matching data, and if there is a word to be further compared, the matching data for the further compared word from the matching data DB Comparing a first time required for retrieving the second cross-matching data comparing the first cross-matching data with a second time required for retrieving the detailed information about the first cross-matching data from the detailed information DB And performs an integrated search based on the result.
10. The method of claim 9,
The control unit searches the matching data DB if the first time is less than or equal to the second time and extracts second cross matching data obtained by comparing the matching data for the word to be further compared with the first cross matching data Of the navigation device.
10. The method of claim 9,
If the first time exceeds the second time, the control unit searches the detailed information DB to extract a search result including matching data for the word to be further compared, from the detailed information on the first cross-matching data Wherein the navigation device is a navigation device.
10. The method of claim 9,
Wherein the control unit calculates the first time by multiplying the access time of the matching data DB by the number of matching data of the word to be further compared and sets the access time to the detailed information DB and the first cross- And calculates the second time with a value obtained by multiplying the second time.

Images