WO2007018070A1

WO2007018070A1 - Search device, search method, search program, and recording medium

Info

Publication number: WO2007018070A1
Application number: PCT/JP2006/315182
Authority: WO
Inventors: Keigo Nakada
Original assignee: Pioneer Corporation
Priority date: 2005-08-08
Filing date: 2006-08-01
Publication date: 2007-02-15

Abstract

A search device (100) includes a search database (104) containing search information for searching target information by input information expressing a character or a number. The search device (100) stores registration information in a registration database (101). A conversion unit (102) reads out registration information from the registration database (101) and converts it into a data structure of substantially same structure as the search information. A registration search database (103) stores the registration information converted by the conversion unit (102) in a state searchable by the input information inputted from an input unit (105). According to the input information, a search unit (106) references search information in the search database (104) and registration information in the registration search database (103) and searches for the target information. An output unit (107) outputs a search result searched by the search unit (106).

Description

Specification

SEARCH DEVICE, SEARCH METHOD, SEARCH PROGRAM, AND RECORDING MEDIUM

Technical field

[0001] The present invention relates to a search device, a search method, a search program, and a recording medium capable of searching for a registered point by name search. However, use of the present invention is not limited to the above-described search device, search method, search program, and recording medium.

Background art

[0002] In recent years, for example, a point that represents a place (point) included in the map information that is provided when searching for a name that represents a point of departure or destination in a search device installed in a navigation device. A name search is performed using information, or a name search is performed using point information representing a registered point registered by a user.

[0003] Here, the registration of points by such a user can be performed a predetermined number of times, for example, in a navigation device, and when a plurality of points are registered, the name of the registered registration point is displayed. By displaying the list on the screen, it is possible to perform a name search by selecting an arbitrary registered spot from the displayed registered spot names. In addition, in such name search, for example, when a telephone number is registered (added) to the point information representing the registered point, a technique for searching for the name of the registered point using this registered telephone number is also known. ing. Further, when “reading” of the name of the registered spot is registered in the registered spot, the name of the registered spot can be searched by voice recognition, for example.

[0004] Such a search device is configured as follows, for example. That is, the traffic information is received wirelessly and the received traffic information is stored. Then, traffic information related to search information such as characters, figures or symbols entered by the user is extracted from the stored traffic information, and the extracted traffic information is displayed to improve the traffic information acquisition efficiency. (For example, refer to Patent Document 1.) o

In addition, such a search device displays a condition input screen on a display unit, for example, In addition to the starting point and the arrival point (destination), at least the time required for the starting point and the arrival point according to the purpose of the practice is included. Based on the input conditions, search the map information ability stored in the map database based on the input conditions, and display the practice course obtained as a search result on the display unit. Thus, a practice course suitable for the user can be automatically generated (for example, see Patent Document 2).

[0006] Patent Document 1: Japanese Unexamined Patent Publication No. 2000-90394

Patent Document 2: Japanese Patent Laid-Open No. 2003-114608

Disclosure of the invention

Problems to be solved by the invention

[0007] However, for example, in the above-described prior art, the internal structure is different from a search database that stores various types of information used for name search, which usually stores various types of information about registered points. Name search ability One example is the problem of not being able to search a registered location!

[0008] In addition, when searching for a registered location by the above-described conventional technology, the registered location must be searched by referring to the registered location database having a different internal structure in addition to the search database. For this reason, an example is the problem that the search efficiency decreases significantly as the number of registered points increases.

[0009] Here, for example, when performing a name search for a registered point by telephone number, the telephone number must be registered in advance in the point information indicating the registered point, and the user is also registered as the telephone number. One example is the problem that if you do not memorize (recognize) correctly, you cannot search for it!

[0010] In addition, when displaying a list of registered location names, etc., all registered locations are displayed, so if the number of registered locations increases, the name of the desired registered location is searched from the list. An example is the problem that it takes a long time and the search efficiency drops significantly.

Means for solving the problem [0011] In order to solve the above-described problems and achieve the object, the search device according to the invention of claim 1 provides the input information representing the target information (hereinafter referred to as "object information"), such as letters or numbers. A search device having a search database in which search information for searching is stored, a registration database for storing information registered by a user (hereinafter referred to as “registration information”), and the registration database. Reading the registration information, converting the registration information into a data structure substantially the same as the search information stored in the search database; and converting the registration information converted by the conversion means into the input information A registered search database to be stored in a searchable state, based on the input information, the search information in the search database, A search means for searching for the target information by referring to the registration information in the registered search database, and an output means for outputting the search result searched by the search means. .

[0012] Further, the search method according to the invention of claim 7 stores search information for searching for target information (hereinafter referred to as "target information") using input information representing characters or numbers. A search method using a search database that reads out the registration information from a registration database that stores information registered by the user (hereinafter referred to as “registration information”), and retrieves the registration information. A conversion step for converting to the data structure substantially the same as the search information stored in the search database, and the registration information converted by the conversion step are stored in the registration search database in a state that can be searched by the input information. And storing the search information in the search database and the registration information in the registration search database based on the input information, respectively. A search step for searching for the target information, and an output step for outputting a search result searched by the search step.

[0013] In addition, a search program according to the invention of claim 8 causes a computer to execute the search method of claim 7.

[0014] Further, a recording medium according to the invention of claim 9 is recorded on the search program computer according to claim 8 in a readable manner.

Brief Description of Drawings [FIG. 1] FIG. 1 is a block diagram showing an example of a functional configuration of a search device that works according to the present embodiment.

[FIG. 2] FIG. 2 is a flow chart showing the contents of processing of a search device that is effective in the present embodiment.

FIG. 3 is a block diagram showing an example of a hardware configuration of a navigation device that works well with the present embodiment.

[FIG. 4] FIG. 4 is an explanatory diagram showing an example of a display screen displayed on the navigation device when searching for names that are useful in this embodiment.

[FIG. 5] FIG. 5 is a table showing a part of names registered in the registration point search DB which is helpful in this embodiment.

[Fig. 6-1] Fig. 6-1 is an explanatory diagram showing an example of the data format of the registration point data that is useful in this embodiment.

[Fig. 6-2] Fig. 6-2 is an explanatory diagram showing an example of the configuration of the header portion of the registration point data that is useful in this embodiment.

[FIG. 6-3] FIG. 6-3 is an explanatory diagram showing an example of the configuration of the registration point data record that is useful in this embodiment.

[FIG. 7-1] FIG. 7-1 is an explanatory diagram showing an example of a data format of intermediate data which is useful in the present embodiment.

[FIG. 7-2] FIG. 7-2 is an explanatory diagram showing an example of the configuration of the header portion of the intermediate data that works on the present embodiment.

[FIG. 7-3] FIG. 7-3 is an explanatory diagram of an example of the configuration of the Nth character search key header of the intermediate data according to the present embodiment.

[FIG. 7-4] FIG. 7-4 is an explanatory diagram showing an example of the structure of the Nth character search key record of the intermediate data that is useful in this embodiment.

[FIG. 8-1] FIG. 8-1 is an explanatory diagram showing an example of the data format of registration point search data which is useful in this embodiment.

[FIG. 8-2] FIG. 8-2 is an explanatory diagram showing an example of the configuration of the header portion of the registration point search data that is useful in this embodiment. [FIG. 8-3] FIG. 8-3 is an explanatory diagram showing an example of the structure of the registration point search data record that is useful in this embodiment.

[FIG. 9] FIG. 9 is an explanatory diagram showing an example of the data structure of registration point search data that is useful in this embodiment.

[FIG. 10] FIG. 10 is a flowchart showing an intermediate data generation processing procedure which is useful in the present embodiment.

[FIG. 11] FIG. 11 is a flowchart showing a registration point search data generation processing procedure that is useful in this embodiment.

[FIG. 12] FIG. 12 is a flowchart showing a data update processing procedure when registration point data which is useful in the present embodiment is edited.

[FIG. 13] FIG. 13 is a flowchart showing a search processing procedure of the navigation apparatus which is useful in the present embodiment. Explanation of symbols

[0016] 100 search device

101 registration database

102 Conversion unit

103 Registration Search Database

104 Search database

105 Input section

106 Search part

107 Output section

BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, preferred embodiments of a search device, a search method, a search program, and a recording medium according to the present invention will be described in detail with reference to the accompanying drawings.

[0018] (Embodiment)

(Functional configuration of search device)

With reference to FIG. 1, a functional configuration of a search device that works on the present embodiment will be described. FIG. 1 is a block diagram showing an example of a functional configuration of a search device that works according to the present embodiment. The

In FIG. 1, a search device 100 according to the present embodiment includes a registration database 101, a conversion unit 102, a registration search database 103, a search database 104, an input unit 105, a search unit 106, And an output unit 107.

The registration database 101 stores information registered by the user (hereinafter referred to as “registration information”). The registration information is, for example, information frequently used by the user, and includes information such as a mark, name, identification code, and the like to be registered.

The conversion unit 102 converts registration information registered in the registration database 101. The conversion of the registration information is a conversion having almost the same format as the search information stored in the search database 104 described later. Almost the same format may contain information such as hiragana or katakana and can be identified as “reading”.

The registration search database 103 stores the registration information converted by the conversion unit 102 as registration search data.

The search database 104 stores search information for searching for names as name search data. Here, the search information includes, for example, hiragana or katakana that can be identified as “reading”. The name search data is data for searching for a name from “read” of the keyword, and has almost the same format as the registration search data described above.

[0024] The input unit 105 receives an input of a search keyword. Further, the input unit 105 may receive information related to the update of the name search data stored in the search database 104. The information related to the update of the name search data is, for example, information for adding, editing, or deleting the name search data. Specifically, the input unit 105 may be configured to accept an input of a search keyword input in a search keyword input field on a display screen (not shown).

[0025] The search unit 106 stores the character string including the search keyword input by the input unit 105 in the registration search data stored in the registration search database 103 and the search database 104. Search by referring to the name search data. A search string that contains a search keyword means that part of the string matches the search keyword (partial match ), Or when the character string exactly matches the search keyword. Partial match means, for example, the case where the character string is “Tokyo” and the search keyword is “Tokyo”. Also, the exact match is when the character string is “Tokyo” and the search keyword is “Tokyo”.

The output unit 107 outputs the search results searched by the search unit 106. For example, the output may be configured to be output on a display unit (not shown) or as a strong sound such as a speaker.

[0027] (Contents of search device processing)

Next, with reference to FIG. 2, the contents of the processing of the search device that works on this embodiment will be described. FIG. 2 is a flowchart showing the contents of the processing of the search device that works according to this embodiment. In FIG. 2, the input unit 105 first determines whether or not an input of input information has been accepted (step S201). The input information may be, for example, a search keyword that represents the target information with letters or numbers. The target information is information that can be searched with letters or numbers, including attribute information such as name, genre, and area such as destination point, departure point, and music.

[0028] In step S201, the input unit 105 waits for the input of input information. If the input unit 105 receives the input information (step S201: Yes), then the conversion unit 102 converts the registration information (step S202). ). The registration information is converted, for example, by converting the registration information registered in the registration database 101 into a format that can be identified as “reading” including hiragana or katakana. In step S201, the input information may not be converted after input, but may be converted according to the user's request.

Next, the search unit 106 searches the target information with reference to the registration search database 103 and the search database 104 (step S203). Note that the registration search data stored in the registration search database 103 and the name search data stored in the search database 104, which also refer to the database power, are data of almost the same format. For example, hiragana or katakana Can be identified as “read”.

[0030] Then, the output unit 107 outputs the search result searched in step S203 (step S204), and ends the series of processes. Search results include, for example, search keywords and parts It is the information that is the power of the character string that matches the character string or the search keyword. Further, the output may be, for example, a display on a display unit (not shown) or output as a sound from a speaker or the like.

[0031] As described above, according to the search device, search method, search program and recording medium according to the present embodiment, registered information frequently used by the user can be used as registered search data for name search. It can be converted and searched with a character string containing the search keyword. Therefore, the user can efficiently obtain a desired search result even if the target information is not accurately stored.

Example

[0032] Examples of the present invention will be described below. In the present embodiment, an example will be described in which the search device 100 of the present invention is implemented by a navigation device mounted on a moving body such as a vehicle (including a four-wheeled vehicle and a two-wheeled vehicle).

[0033] (Hardware configuration of navigation device)

With reference to FIG. 3, the hardware configuration of the navigation apparatus that is useful in this embodiment will be described. FIG. 3 is a block diagram showing an example of a hardware configuration of a navigation apparatus that works on the present embodiment.

In FIG. 3, the navigation device 300 includes a control unit 301, a user operation unit 302, a display unit 303, a generation unit 304, a recording medium 305, a recording medium decoding unit 306, and a guidance sound output. A force unit 307, a name search unit 308, a guidance sound generation unit 309, and a speaker 310 are provided. The recording medium 305 includes a search DB (database) 305a and a registration point search DB 305b. Further, the force navigation device 300 not shown includes a position acquisition unit, a route search unit, a route guidance unit, a communication unit, and the like.

The control unit 301 controls the navigation device 300 as a whole. The control unit 301 includes, for example, a CPU (Central Processing Unit) that executes predetermined arithmetic processing, a ROM (Read Only Memory) that stores various control programs, and a RAM (Random Access Memory) that functions as a work area for the CPU. ) And so on.

In addition, the control unit 301 searches for registered points stored in a registered point search DB 305b described later. When generating the data for use, information regarding the registration point input to the user operation unit 302 is received and output to the recording medium 305 via the recording medium decoding unit 306. The control unit 301 inputs / outputs information on the registration point between the recording medium decoding unit 306 and the generation unit 304. In addition, when searching for a name, the control unit 301 inputs / outputs information related to name search between the recording medium decoding unit 306 and the name search unit 308, and displays information obtained as a result to the display unit 303. Output.

[0037] The user operation unit 302 outputs information input by the user, such as characters, numerical values, and various instructions, to the control unit 301. The configuration of the user operation unit 302 may be configured in various known forms such as a push button switch that detects physical pressing Z non-pressing, a touch panel, a keyboard, and a joystick. The user operation unit 302 may be configured to perform an input operation by sound using a microphone that inputs sound from the outside.

[0038] The user operation unit 302 may be provided integrally with the navigation device 300, or may be configured to be operated separately from the navigation device 300, such as a remote controller. Further, the user operation unit 302 may be configured in any one of the various forms described above, or may be configured in a plurality of forms. The user performs input operation as appropriate according to the form of the user operation unit 302 and inputs information. Examples of information input by the operation of the user operation unit 302 include a destination point, a departure point, or a search keyword of a route to be searched.

[0039] The destination or departure point can be entered by entering the latitude / longitude and address of each point, as well as specifying the telephone number, genre, keyword, etc. of the facility serving as the destination or departure point. The facility is searched and its location can be determined. More specifically, these pieces of information are specified as one point on the map based on background type data included in map information recorded on the recording medium 305 described later. Also, display map information on the display unit 303 described later, and specify a point on the displayed map.

In addition, a touch panel can be adopted as a form of the user operation unit 302. When a touch panel is used, the touch panel is used by being stacked on the display surface side of the display unit 303. Then, the display timing on the display unit 303 and the touch panel (user operation unit 30 The input information is recognized by managing the operation timing and position coordinates for 2). By adopting a touch panel stacked on the display unit 303 as a form of the user operation unit 302, it is possible to input a large amount of information without increasing the size of the form of the user operation unit 302. As the touch panel, various known touch panels such as a resistance film type and a pressure sensitive type can be used.

[0041] Display unit 303 includes, for example, a CRT (Cathode Ray Tube), a TFT liquid crystal display, an organic EL display, a plasma display, and the like. Specifically, the display unit 303 can be configured by, for example, a video IZF or a video display device connected to the video IZF.

[0042] Specifically, the video IZF is, for example, a graphic controller that controls the entire display device, and a VRAM (Video

RAM) and a control IC that controls the display device display based on image information output from the graphic controller. Display section 303 displays icons, cursors, menus, windows, or various information such as characters and images. The display unit 303 displays map information stored in the recording medium 305 and information on route guidance.

The generation unit 304 generates registration point search data for searching for a registered point based on the registered point data regarding the registered point registered in the recording medium 305 by the user. Here, the registered point data refers to data of points that the user arbitrarily registers with the user operation unit 302 or the like.

[0044] The registration point data is a simple list of data, for example, data in which records such as marks, address codes, names, and telephone numbers related to the registration points are listed. From this registered point data, using the name “reading” as a keyword, registration point search data for searching the name is generated. Here, “reading” is a general designation when reading hiragana or katakana! Generating registration point search data directly from registration point data is complicated in terms of algorithms, so the generation unit 304 creates intermediate data from registration point data and stores the created intermediate data in an intermediate DB (not shown) To do. The generation unit 304 also checks the registered data for the intermediate data stored in this intermediate DB. Generate search data. The generation unit 304 may be configured to automatically generate registration point search data in the navigation device 300 when the registration point data is added, deleted, or edited. The registered point data, intermediate data, and registered site inspection data will be described later.

The recording medium 305 records various control programs and various information in a state that can be read by a computer. The recording medium 305 accepts writing of information by the recording medium decoding unit 306 and records the written information in a nonvolatile manner. The recording medium 305 can be realized by, for example, an HD (Hard Disk).

[0046] The recording medium 305 is not limited to HD. Instead of HD or in addition to HD, DVD (Digital Versatile Disk), CD (Compact Disk), etc. can be attached to and detached from the recording medium decoding unit 306. In other words, a portable medium may be used as the recording medium 305. Recording medium 305 is not limited to DVD and CD. It can be attached to and removed from recording medium decoding unit 306 such as CD-ROM (CD-R, CD-RW), MO (Magneto-Optical disk), and memory card. It is also possible to use a portable medium.

In the recording medium 305 in the present embodiment, a name search program for realizing the present invention, registration point data, and the like are recorded. The recording medium 305 includes a search DB 305a and a registration point search DB 305b, each of which has a format in which the registration point can be searched by “reading” the name.

[0048] The registration point search DB 305b stores registration point search data generated by the generation unit 304, and the search DB 305a stores name search data. The registered point search data is data generated in the same format as the name search data based on the registered point data. The name search data is data for searching for a name from a keyword “reading”.

The recording medium decoding unit 306 controls reading of information on the recording medium 305 and Z writing. For example, when HD is used as the recording medium 305, the recording medium decoding unit 306 is an HDD (Hard Disk Drive). Similarly, when DVD or CD (including CD-R, CD-RW) is used as the recording medium 305, the recording medium decoding unit 306 is a DVD drive or a CD drive. Writable and removable When a CD-ROM (CD-R, CD-RW), MO, memory card, or the like is used as the recording medium 305, information is written to the various recording media 305 and stored in the various recording media 305. Is used as the recording medium decoding unit 320 as appropriate.

[0050] The guide sound output unit 307 reproduces the guide sound by controlling the output to the connected speaker 310. One or more speakers 310 may be provided. Specifically, the guide sound output unit 307 can be realized by an audio IZF connected to an audio output speaker 310. More specifically, the audio IZF is, for example, a DZA converter that performs DZA conversion of audio digital information, an amplifier that amplifies an audio analog signal output from the DZA converter, and an AZD conversion of audio analog information. A converter and force can be configured.

[0051] The name search unit 308 searches the search DB 305a and the registration point search DB 305b for names based on the information input by the user. The name search is performed by, for example, the name “read” included in the registration point search data recorded in the search DB 305a and the registration point search DB 305b, and all or part of the keywords entered by the user. Search for. The name search unit 308 searches for names including all or part of the input keyword, and displays the search results. Here, the search result means the number of names corresponding to the search condition or a list of names.

Here, with reference to FIG. 4, an example of an operation method when searching for names that are useful in the present embodiment will be described. FIG. 4 is an explanatory diagram showing an example of a display screen displayed on the navigation device when searching for names that are useful in this embodiment.

In FIG. 4, a search method display field 401 shows the search method set by the user. Specifically, for example, “name” is displayed in the search method display field 401, indicating that the search is performed by name. You can also select search by genre or search by area for registered locations. The keyword display field 402 displays information such as “partial match”, “Tokyo”, and “7 cases”.

Here, “partial match” means that when the input keyword is included in a part of the name, the name is determined as the corresponding name. Specifically, for example, the keyword “To” When “Kyo” is entered, “TOKYO TAJIAMU”, which includes “Tokyo” as part of its name, is judged to be a relevant name. It is also possible to search for a name by selecting “partial match” as “complete match” by user selection. “Complete match” is determined to be applicable when the input keyword and the name “read” completely match. “Tokyo” is a search keyword for searching for a name input by the user.

In addition, “7 cases” indicates the number of names corresponding to the search condition. Here, for example, in FIG. 4, when “name” is displayed in the search method display field 401 and “partial match” is displayed in the keyword display field 402 in FIG. This is registration point search data that includes “Tokyo” in the part.

[0056] The selection of characters, search methods, and the like is configured such that each button displayed in the search method display field 401 can be selected by a cursor (not shown). The movement of the cursor is a configuration in which buttons on the remote control or the navigation device 300 are operated. Further, like the “delete” button 411 and the “e” button 412 in the figure, white buttons indicate selectable characters. A button with a black character or character string such as “A” button 413 indicates a character or character string that cannot be selected. The selectable and impossible characters are described in FIG.

Here, with reference to FIG. 5, the names registered in the registration point search DB, which is useful in the present embodiment, will be described. FIG. 5 is a table showing a part of names registered in the registration point search DB that is useful in this embodiment. Here, for convenience of explanation, a case where only the registration point search DB 305b is a search target will be described as an example.

In FIG. 5, the names described in the table 500 are registered in the registration point search DB 305b and are names to be searched. Here, it is assumed that only the names described in the table 500 are registered. All the names described in the table 500 include “Tokyo” as a part of the name. Therefore, when the keyword “Tokyo” is entered in the keyword display field 402, the number of hits is displayed as “7”.

[0059] In order to further narrow down the number of cases, characters are input after the keyword "Tokyo". At this time, only the characters included in the registered name can be selected, and the next character after the 7 “TOKYO” currently applicable is the selectable character. Specifically, for example, “e”, “ki”, “ko”, “su”, “wa” are selectable characters. Enter these selectable characters to further narrow down the number of matches. For example, in this example, when the user enters “ko”, “keyboard” is displayed in the keyword display field 402, and “Tokyo Kyokan” and “Tokyo Kyomu” are applicable. The number of cases is displayed as “2”.

Returning to FIG. 3, when a keyword is input, the name search unit 308 searches for a name including all or part of the keyword from both the search DB 305a and the registration point search DB 305b. The number of names searched by both DBs is displayed. The user can refer to this number of cases and further narrow down the number of cases by entering a keyword when further narrowing down the number of cases. If you select to display the list, a list of names corresponding to the number of displayed items is displayed. From this list of names, the user can select a destination point or a relay point.

[0061] Guide sound generation section 309 generates tone and voice information corresponding to the pattern. In the name search, the virtual sound source corresponding to the guidance point is not set and the voice guidance information is not generated, and this is output to the guidance sound output unit 307 via the control unit 301.

[0062] It should be noted that the registration database 101, the registration search database 103, and the search database 104, which are functional configurations of the search device 100 according to the embodiment, are converted into the conversion unit 102 by the recording medium 305, the search DB 305a, and the registration point search DB 305b. Each function is realized by the generation unit 304, the input unit 105 by the user operation unit 302, the search unit 106 by the name search unit 308, and the output unit 107 by the guidance sound output unit 307 and the display unit 303.

[0063] Next, the data format of registration point data stored in a registration point DB (not shown) which is useful for the present embodiment will be described with reference to Figs. 6-1, 6-2, and 6-3. Fig. 6-1 is an explanatory diagram showing an example of the data format of the registration point data that is useful in this embodiment.

[0064] In FIG. 6-1, the registration point data stored in the registration point DB (not shown) is composed of a header unit 601 and a plurality of record units 602. The header part 601 describes the size of one record and the number of records currently registered. The number of records is, for example, N because record part 602 includes records # 1 to #N. It is a piece.

Here, the header portion 601 will be described. Fig. 6-2 is an explanatory diagram showing an example of the configuration of the header portion of the registration point data that is useful in this embodiment. In Figure 6-2, the header section structure 620 has two items, and item number 1 is the record size with offsetO bytes and data length of 4 bytes. ₀ ff _se t shows the starting position of each item. In this embodiment, the unit of the offset and the data length may be the number of force characters described as bytes. For example, a 4-character number has a data length of 8 bytes. Item No. 2 is the number of registered records with ffset 4 bytes and data length 4 bytes. The offset can be set from the offset of item number 1 and the data length. Note that the offset and data length in the following description are substantially the same as those in this figure, and thus the description thereof is omitted.

Next, the record will be described. Fig. 6-3 is an explanatory diagram showing an example of the record structure of the registration point data that is useful in this embodiment. In Fig. 6-3, the record structure 63 0 has items in item 7, each of which relates to the mark icon, address code, name, reading, address, telephone number, and location information from item number 1. . For example, the mark icon is information related to the mark number displayed on the map, and can be used to narrow down the genre in the name search. The address code can be used to narrow down the area for name search. As described above, the registration point data is a simple list of data, and is a list of records.

[0067] Next, the data format of the intermediate data stored in the intermediate DB (not shown) that is useful for the present embodiment will be described with reference to FIGS. 7-1, 7-2, 7-3, and 7-4. Will be described. FIG. 7-1 is an explanatory diagram showing an example of the data format of the intermediate data that is useful in this embodiment.

In FIG. 7-1, intermediate data stored in an intermediate DB (not shown) includes a header portion 701 and a plurality of record portions. Each record section stores information on the nth character (n = l to N) of the name as a search key. For example, the record portion 702 that stores information about the Nth character search key is composed of an Nth character search key header 711 and an Nth character search key record portion 712. The Nth character search key record part 712 also has Nth character search key records # 1 to #N.

[0069] Here, the header portion 701 will be described. Figure 7-2 shows the intermediate data according to this example. It is explanatory drawing which shows an example of a structure of the header part. In Figure 7-2, the header part structure 720 has three items, item number 1 is the maximum number of character strings, item number 2 is the size of the search key header, and item number 3 is the search key record. Information on the size of Here, the longest number of character strings is the number of characters of the name with the longest number of characters among the stored names. Specifically, for example, in the case of "Tokyo Eki" and "Tokyo Kikugikan", the maximum number of character strings is "10". For example, the search key header size and search key record size can be set to about 6 bytes.

[0070] Next, the Nth character search key header 711 will be described. FIG. 7-3 is an explanatory diagram showing an example of the structure of the Nth character search key header of the intermediate data used in this embodiment. In Figure 7-3, the Nth character search key header configuration 730 has three items, item 1 is the number of search keys, item 2 is the search key level, and item 3 is the padding area. Information. Specifically, the number of search keys is, for example, when “TOKYO EKI” and “TOKIYOKO KUKIKAN” are stored, the second character is “U”. The number of search keys in the header is “1”. For example, if “Akihabara” and “Toukiyoeki” are stored, the second character is “ki” and “u” respectively, so the number of search keys in the second character search key header is “2”. The search key level indicates that the character is the Nth search key. The padding area is an area that is packed to align the data area when data is exchanged. In this embodiment, the padding area is set when the search key header is an odd number of bytes.

[0071] Next, the Nth character search key record will be described. FIG. 7-4 is an explanatory diagram showing an example of the structure of the Nth character search key record of the intermediate data according to this embodiment. In Figure 7-4, the Nth character search key record configuration 740 has 4 items, item number 1 is the search key of the upper hierarchy, item number 2 is the search key, item number 3 is the number of corresponding registration points, Item 4 is information about the padding area. Specifically, for example, in the case of “Tokyo,” the search key of the second character search key record is “U”. In addition, for example, in the case of “Tokyo Eki”, the upper hierarchy search key is “to” as the upper hierarchy search key of the second character search key record. The number of registered points indicates the number of registered points currently registered. The padding area is a search key record in this embodiment. Set when the number of bytes is odd.

[0072] Next, the data format of the registration point search data stored in the registration point search DB 305b according to the present embodiment will be described with reference to FIG. 8-1, FIG. 8-2, and FIG. 8-3. . Fig. 8-1 is an explanatory diagram showing an example of the data format of registration point search data that is useful in this embodiment.

In FIG. 8A, the registration point search data stored in the registration point search DB 305b is composed of a header portion 801 and a plurality of record portions 802.

Here, the header portion 801 will be described. FIG. 8-2 is an explanatory diagram showing an example of the configuration of the header portion of the registration point search data that is useful in this embodiment. In Figure 8-2, the header configuration 820 has three items, item number 1 is the number of applicable data, item number 2 is the number of options, and item number 3 is information about the padding area. . Here, the number of corresponding data refers to the number of records of the corresponding data when the search key is selected by the user. The number of choices refers to the number of records included in the registration point search DB 305b. In the present embodiment, the padding area is set when the record size is an odd number of bytes.

Next, the record will be described. Fig. 8-3 is an explanatory diagram showing an example of the structure of the registration point search data record that is useful in this embodiment. In Figure 8-3, the record structure 830 has four items, each of which is information on the search key, the offset to the next data, the size of the next data, and the padding area. . Here, the search key is a single character of the reading of the registered location name, and is used as a key when inputting 50 sounds as a code using the keyboard. The offset to the next data represents the displacement from the top of the registration point search DB 305b to the top of the next header part. Specifically, for example, the record # 2 stores the displacement from the top of the registration point search DB 305b to the top of the header of the record # 3. The size of the next-stage data represents the size of the next-stage data (the total of the header part and the record part). If there is no next stage data, describe 0 (16). In the present embodiment, the padding area is set when the record size is an odd number of bytes.

[0076] Next, the data structure of registration point search data that is useful in the present embodiment will be described with reference to FIG. Figure 9 shows the data structure of the registration point search data that is useful in this embodiment. It is explanatory drawing which shows an example.

In FIG. 9, the registration point search data has a hierarchical structure, and is hierarchized according to the order of the characters in the character string of the registration point search data. A character string reading 905 of registration point data is registered for each layer. Each layer is divided into a 0th character layer, a 1st character layer, a 2nd character layer,..., And an arbitrary nth character layer. Here, the 0th character specifically refers to, for example, the character string “Akihara” or “A”. Here, a hierarchy having a smaller number n is called an upper hierarchy. Specifically, for example, in the 0th hierarchy and the 1st hierarchy, the 0th hierarchy is a higher hierarchy. In this example, the reading position of the character string 905 of the registration point data for each hierarchy is not limited to this. The Roman alphabet reading alphabetical order, numerical order, stroke order, etc. are not limited to this. Good.

[0078] Registration point data power As shown in FIG. 9, the generated registration point search data includes a character string in order from the top as the 0th character, 1st character, ..., nth character. Stored for each character. Specifically, for example, “ai” is stored in row 901 where “a” is the 0th character, and “i” is stored in row 902 where the 1st character is. The 0th character line 901 is arranged in the order of all character strengths from “A” to “N”, regardless of whether or not there is a registration point starting with that character.

[0079] Next, the first character line 902 and subsequent lines will be described. Here, a case where registration points “Ai” and “Akihara” are generated will be described as an example. In “Ai” and “Akihara”, the 0th character is “A”, and the 1st character is “I” and “KI”, respectively. And “I” and “K” are generated in the first character line 902. Here, in Fig. 9, the association is made by connecting the characters in the upper layer and the characters in the lower layer with arrows. In addition, when there are a plurality of characters associated with a higher-level character, the characters associated with the higher-level character are stored in parallel. In Fig. 9, one of a plurality of characters is connected by an arrow, and the other characters are connected to the character line by a thick line in parallel.

[0080] Specifically, for example, "A" in the 0th character line 901 and the first character line "I" are connected by an arrow 903, and the "I" and "KI" in the first character column are connected. Are connected by a thick line 904. Also, The registration point “Ai” has no second character, so there is no connection between “I” and the second character, but the registration point “Akihara” has the second character, the third character “ “Ra” is stored, and each character is connected by an arrow. Also, the end is “End”. This “end” indicates that there is no registered point of 0th character power ^ a ”thereafter. Also, for example, when “Akabane” is registered as registration point data, the “Akabane” force is registered between “A” and “Akihabara” in the reading of the character string of registration point data 905. At the same time, “ka” is generated between “i” and “ki” in the first character line, and “i”, “ka”, and “ki” are each connected by a thick line.

[0081] (Processing procedure of the navigation device 300)

Next, the procedure for generating intermediate data stored in the intermediate DB, which is useful in this embodiment, will be described with reference to FIG. FIG. 10 is a flowchart showing the intermediate data generation processing procedure that is relevant to the present embodiment. In FIG. 10, first, an intermediate data buffer for creating intermediate data is cleared (step S 1001). The intermediate data buffer is a storage area for temporarily storing generated intermediate data. Next, the longest reading character count (N) is acquired from all the registration point records of the registration point data stored in the registration point DB (not shown) (step S1002). Specifically, the longest reading character number is, for example, “10” when “Tokiyokogikukan” is the longest reading character number.

[0082] Subsequently, the search key header and the size of the search key record are set (step S1003). In this embodiment, each size is set to the above 6 bytes. Next, the name reading is set to the first character from the beginning (n = 1) (step S 1004), and the number of registered records is set to 0 (R = 0) (step S 1005).

[0083] Then, the nth character is acquired from the registration point data record (step S1006), and it is determined whether the acquired character has been registered as a search key for the nth character (step S1007). If not registered (step S1007: No), the nth character is registered as a search key (step S1008), and the n-1st character is registered as a search key (step S1009).

[0084] Next, the registration point record number corresponding to the character string from the first character to the nth character is registered (step S 1010), and the registration record number is incremented (R = R + 1) (step S 101 D o Then, it is determined whether all records have been processed (step S1012). If all records have been processed (step S 1012: No), the process proceeds to step S 1006, and the same processing is repeated for the other records. On the other hand, if all records have been processed (step S1012: Yes), the number of registered records and the search key level are registered as information of the nth character search key header (step S1013).

[0085] Then, it is determined whether or not it matches the number of longest reading characters (n = N) (step S1014). If they do not match (n ≠ N) (step S1014: No), n is incremented (n = n + 1) (step S1015), the process proceeds to step S1005, and the same processing is repeated for the next character. In step S1006, if the acquired character has already been registered as the search key for the nth character (step S1007: Yes), it is next determined whether the reading of the n-1st character in the record is the same (step S 1016).

[0086] If the readings of the n-lth characters are not the same (step S1016: No), the process proceeds to step S1008. On the other hand, if the reading of the n-th first character is the same (step S1016: Yes), the process proceeds to step S1012. In step S1014, when the number of longest reading characters matches (n = N) (step S1014: Yes), the data in the intermediate data buffer is written to the intermediate DB (step S1017). As a result, the series of processes is completed.

Next, a procedure for generating registration point search data stored in the registration point search DB 305b, which is useful in the present embodiment, will be described with reference to FIG. FIG. 11 is a flowchart showing the registration point search data generation processing procedure according to the present embodiment. In FIG. 11, first, the intermediate DB is read (step S1101), and the intermediate data generated in FIG. 10 is acquired.

[0088] Then, the maximum reading size registered in the intermediate data acquired in step S1101 is acquired (step S1102). The maximum reading size is V, the longest number of character strings registered in the intermediate data! Next, the reading of the name is set to the first character from the beginning (n = 1) (step S1103), and it is determined whether it is the first character (n = l) from the beginning (step S1104). In the case of the first character from the beginning (n = l) (step S1104: Yes), the number of registered points having readings is then registered in the corresponding data number of the header part 801 (step S1105).

Then, the number of options is acquired from the intermediate data acquired in step S 1101 (step S 1106), and the acquired number of options is registered (step S 1107). Next, registration place Point search Records for the nth character are registered in the registration point search data stored in the DB 305b (step S1108), and it is determined whether all options have been processed (step S1109).

) o

In step SI 109, if not all options have been processed (step S1109: No), the process proceeds to step S 1108 and the process is repeated. On the other hand, if all the options are processed (step S1109: Yes), it is determined whether n is the maximum value (step S1110). If n is not the maximum value (step SI 110: No), n is incremented (n = n + 1) (step SI 111), and the process proceeds to step S1104 and the same processing is repeated.

In step S 1104, if the first character is not the first character (n ≠ l) (step S 1 104: No), the intermediate data force also acquires the number of search keys (step S 1112). Then, the search key of the upper hierarchy of the acquired search key is temporarily stored (step S1113), and the number of records having the same key as the upper search key stored in the header part 8001 is registered as the number of options (step S1114). .

Then, with reference to the search key record next to the search key temporarily stored in step S1113 (step S 1115), it is determined whether all search keys have been processed (step S 1116). If all the search keys have been processed (NO in step S1116), the process proceeds to step S1113 and the same process is repeated.

On the other hand, if all search keys have been processed (step S 1116: Yes), the process proceeds to step S 1110. In step S1110, if n is the maximum value (step S1110: Yes), the number of corresponding data set in each nth character header is set (step S1117). Then, the offset and size of the next stage set for each nth character record are set (step S1118). As a result, the series of processes is completed.

Next, with reference to FIG. 12, a data update processing procedure when the registration point data useful for the present embodiment is edited will be described. FIG. 12 is a flowchart showing the data update processing procedure when the registration point data used in this embodiment is edited. In FIG. 12, first, data to be edited is read (step S 1201).

[0095] Next, the data read in step S1201 is stored in a temporary buffer. S1202), and writes the read data to the registration point data file (step S1203). Then, it is determined whether “reading” is different before and after editing (step S 1204). If the “reading” is different (step S 1204: Yes), the registration point search data in the registration point search DB 305 b is updated (step S 1205). As a result, the series of processes is completed. On the other hand, if the “reading” is not different in step S1204 (step S1204: No), the series of processing ends as it is.

Next, a data update processing procedure when a registered point is added will be described.

Here, a description will be given without using a flowchart. If a registered location is added, add the information to be added to the registered location data file. Then, the registration point search data in the registration point search DB 305b is updated. This completes a series of processing.

Next, a data update processing procedure when a registration point that is useful in the present embodiment is deleted will be described. Here, a description will be given without using a flowchart. If the registration point is deleted, the data to be deleted is deleted from the registration point data file. Then, the registration point search data in the registration point search DB 305b is updated. This completes a series of processing.

Next, referring to FIG. 13, the search processing procedure of the navigation apparatus 300 that works in the present embodiment will be described. FIG. 13 is a flowchart showing the search processing procedure of the navigation device that is relevant to the present embodiment. In FIG. 13, first, it is determined whether or not an input of a character for searching is accepted (step S1301). For example, the user may input the characters by operating the user operation unit 302.

In step S1301, the input of characters is waited for, and if received (step S1301: Yes), name search data is read from the search DB 305a (step S1302). Then, registration point search data is read from the registration point search DB 305b (step S1303). Then, as the character search key that has been input, information on the corresponding candidate number and the effective search key is acquired from the registration point DB and the name search DB (step S 1304).

[0100] Next, the number of candidates and the information of the valid search key are merged (step S1305). Here, the number of applicable candidates obtained from the registration point search data and the name search data, Merge the information about the effect search key. Then, the number of applicable candidates and the effective search key are displayed (step S 1306). Next, it is determined whether further character input is accepted (step S1307). Here, the case where a character is input is, for example, a case where the number of corresponding candidates displayed is further narrowed down. In this case, the user can input characters by referring to the displayed effective search key.

[0101] When character input is accepted (step S1307: Yes), the process proceeds to step S1302, and the same process as the above process is repeated to narrow down the number of candidates. On the other hand, when the character input is not accepted (step S1307: No), a list of search results is displayed (step S1308). From the list display screen, candidates can be further narrowed down by area or genre. Then, an input such as a point is accepted (step S1309), and a map is displayed from the display unit 303 (step S1310). This completes a series of processing.

[0102] As described above, according to the search device, search method, search program, and recording medium according to the present embodiment, registered information that is frequently used by the user can be used as registered search data that can be searched for a name. It can be converted and searched with a character string containing the search keyword. Therefore, the user can efficiently obtain a desired search result even if the target information is not accurately stored.

Further, the navigation apparatus 300 according to the present embodiment can generate search data for performing a name search from names such as registration points registered by the user. As a result, the user can search even if the registered location is not accurately stored, and the search efficiency can be improved.

[0104] In addition, since registration point search data can be automatically generated in accordance with the editing of the registration point, the user can always navigate with high convenience without having to be aware of the update of the registration point search data. The use of the gating device ₃₀₀ can be achieved. In addition, since the search is performed using the registration point search data and the search data, the user can actually register, but even when searching for a point, the search data force can obtain the desired search results. .

Further, in the above-described embodiment, the example in which the search device 100 is used for name search in the navigation device 300 has been described. However, information that can be searched by characters or numbers is searched. Any device can be used. For example, it can be used when searching for music data. Specifically, music titles are registered in the search DB as name search data, and favorite music that is frequently played back by the user is registered in the registration data. Then, you can convert your favorite music to a name searchable data format and search for music efficiently.

[0106] Further, when searching for information using a communication device such as a mobile phone, the recording medium 305 can be replaced with a server or a built-in memory. For example, registering favorite store information in the built-in memory and converting it to the same data format as the search data of the server can be used to improve store search efficiency.

[0107] Further, the registration data is not limited to data incorporating user preferences such as favorite data, but may be information in which search history and access history are accumulated. It is also possible to improve search efficiency by registering frequently searched information and using it for information retrieval.

It should be noted that the search method described in the present embodiment can be realized by executing a prepared program on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed when the recording medium force is also read by the computer. In addition, this program may be a transmission medium that can be distributed via a network such as the Internet.

Claims

The scope of the claims

[1] A search device having a search database storing search information for searching for target information (hereinafter referred to as “target information”) using input information representing characters or numbers,

A registration case for storing information registered by the user (hereinafter referred to as “registration information”).

Conversion means for reading the registration information from the registration database and converting the registration information into a data structure substantially the same as the search information stored in the search database;

A registration search database that stores the registration information converted by the conversion means in a searchable state by the input information;

Search means for searching for the target information by referring to the search information of the search database and the registration information of the registration search database based on the input information,

Output means for outputting a search result searched by the search means;

A search device comprising:

[2] The conversion means includes

When a predetermined editing process is performed on the registration information in the registration database, the registration information subjected to the editing process is read out and converted into the registration database,

The registered search database is

2. The search apparatus according to claim 1, wherein the registration information is stored every time conversion is performed by the conversion means.

[3] The search means includes:

The target information including the character string is searched from the search information and the registration information based on a character or numeric string (hereinafter referred to as “character string”) included in the input information. The search device according to claim 1.

[4] The search means includes: The object information including the character string representing the name of the object information or the character string representing the attribute of the object information is retrieved from the search information and the registration information. Search device.

[5] The purpose information is

Information related to the target point (hereinafter referred to as “destination point”) (hereinafter referred to as “destination point information”),

The registration information is:

Information related to points registered by the user (hereinafter referred to as “registered points”) (hereinafter referred to as “registered point information”),

The search means includes

2. The search device according to claim 1, wherein the destination information is searched by referring to the search information and the registered point information, respectively.

[6] The output means includes

6. The search apparatus according to claim 1, wherein the search result is displayed and output by characters or reproduced and output by voice.

[7] A search method that uses a search database storing search information to search for target information (hereinafter referred to as “target information”) using input information that represents characters or numbers. ,

The registration information is read from a registration database that stores information registered by the user (hereinafter referred to as “registration information”), and the registration information is substantially the same data structure as the search information stored in the search database. A conversion process for converting to

A storage step of storing the registration information converted by the conversion step in a registration search database in a state in which the registration information can be searched by the input information;

Based on the input information, referring to the search information of the search database and the registration information of the registration search database, respectively, a search step of searching for the target information;

An output step of outputting a search result searched by the search step;

The search method characterized by including.

[8] A search program that causes a computer to execute the search method according to claim 7.

[9] A computer-readable recording medium in which the search program according to claim 8 is recorded.