JPWO2010004655A1 - Information processing apparatus, navigation apparatus, information update method, information search method, information update program, information search program, and recording medium - Google Patents

Abstract

The information processing apparatus (100) records address data composed of hierarchical name data and performs predetermined processing. The information processing apparatus (100) includes a recording unit (110) and a control unit (120). The recording unit (110) includes a name table (111) and a relation table (112). The name table (111) is a table in which name data of each layer is associated with name identification information for uniquely identifying the name data. The relationship table (112) is a table in which, for each name data, the upper layer name identification information and the lower layer name identification information are associated for each layer. The control unit (120) executes a predetermined process using the address data by using the name table (111) and the relation table (112) recorded in the recording unit (110).

Description

  The present invention relates to an information processing device, a navigation device, an information update method, an information search method, an information update program, an information search program, and a recording medium. However, the present invention is not limited to the information processing apparatus, navigation apparatus, information update method, information search method, information update program, information search program, and recording medium described above.

  Conventionally, in information processing devices such as navigation devices, PNDs (Personal Navigation Devices), mobile phones, and PDAs (Personal Digital Assistants), it is possible to display the addresses and facilities of points using address data for each feature stored in advance. A device that performs a predetermined process such as a search is known.

  Address data is generally configured by hierarchically combining prefectures, municipalities, town names, and street addresses. In other words, an information processing apparatus has been proposed in which address data having such a hierarchical structure is stored in advance and various processes are executed (see, for example, Patent Document 1 and FIG. 2 below).

JP 2008-52077 A

  However, in the technique described in Patent Document 1 described above, for example, when a city name is changed due to a merger of cities, etc., the hierarchy data of the hierarchy below the changed city name is included in the hierarchical address data. As an example, there is a problem that it takes a long time to update because it is necessary to rewrite data and update a huge amount of data. Further, for example, when searching for a facility in a certain area, it is necessary to search all the hierarchy of the address data of the facility, and there is a problem that a simple and quick search cannot be performed. That is, with the technique described in Patent Document 1 described above, there is an example of a problem that various processes take time.

  In order to solve the above-described problems and achieve the object, an information processing apparatus according to claim 1 is an information processing apparatus that records address data composed of hierarchical name data and performs predetermined processing. A name table in which name data of each hierarchy is associated with name identification information for uniquely identifying the name data, and for each name data, the name identification information of the upper hierarchy and the name of the lower hierarchy for each hierarchy And a control unit that executes predetermined processing using address data using the name table and the relationship table recorded in the recording unit. It is characterized by providing.

  A navigation device according to an invention of claim 8 includes the information processing device.

  An information updating method according to the invention of claim 9 is a recording unit for recording address data composed of hierarchical name data, and for uniquely identifying the name data of each hierarchy and the name data. The recording unit includes: a name table in which name identification information is associated; and a relationship table in which, for each name data, an upper hierarchy name identification information and a lower hierarchy name identification information are associated for each hierarchy. An information update method for an information processing apparatus, wherein an acquisition step of acquiring name data of one hierarchy including a changed portion and specific information for specifying the hierarchy of the name data, and acquisition at the acquisition step The address data is replaced by replacing the name data of the hierarchy specified by the specific information among the address data recorded in the recording unit using the name data It characterized in that it comprises an updating step of updating the over data, the.

  An information search method according to the invention of claim 10 is a recording unit for recording address data composed of hierarchical name data, for uniquely identifying the name data of each hierarchy and the name data. A name table in which name identification information is associated with each other, and for each name data, a relation table in which name identification information in an upper hierarchy and name identification information in a lower hierarchy are associated for each hierarchy, and the name table is associated with the name data. A parcel table that associates the name identification information attached with the parcel identification information attached to the parcel data for map drawing, the parcel identification information of the parcel where each point is located, and the position information of each point And an information search method for an information processing apparatus including the recording unit having a point table associated with the key, the key including an area name A parcel identification information corresponding to the input area name is determined using the parcel table based on the input step for receiving the input of the mode and the input keyword, and the specified parcel using the point table And a search step for searching for the point by determining a point having position information corresponding to the identification information.

  According to an eleventh aspect of the present invention, an information update program causes a computer to execute the information update method according to the ninth aspect.

  According to a twelfth aspect of the present invention, an information search program causes a computer to execute the information search method according to the tenth aspect.

  A recording medium according to a thirteenth aspect of the invention is characterized in that the program according to the eleventh or twelfth aspect is recorded in a computer-readable manner.

FIG. 1 is a block diagram illustrating an example of a functional configuration of the information processing apparatus according to the present embodiment. FIG. 2 is a flowchart illustrating an example of an information processing procedure of the information processing apparatus using the name table and the relationship table. FIG. 3 is a block diagram illustrating an example of a hardware configuration of the navigation device according to the present embodiment. FIG. 4 is an explanatory diagram showing an outline of address data recorded on the magnetic disk. FIG. 5 is an explanatory diagram showing a name table of prefecture names. FIG. 6 is an explanatory diagram showing a name table of city names. FIG. 7 is an explanatory diagram showing a large name table. FIG. 8 is an explanatory diagram showing a small name table. FIG. 9 is an explanatory diagram showing a relationship table between a name ID of a prefecture name and a name ID of a city name. FIG. 10 is an explanatory diagram showing a relationship table between a name ID of a city name and a name ID of a large name. FIG. 11 is an explanatory diagram showing a relationship table between a name ID of a large name and a name ID of a small name. FIG. 12 is an explanatory diagram showing an outline of the changed address data at the time of merger of municipalities. FIG. 13 is an explanatory diagram showing the name table changed when the address data is updated. FIG. 14 is an explanatory diagram showing a relation table changed when address data is updated. FIG. 15 is an explanatory diagram showing a relation table changed when address data is updated. FIG. 16 is a flowchart showing an example of address data information update processing performed by the navigation device. FIG. 17 is an explanatory diagram showing an example of drawing data. FIG. 18 is an explanatory diagram showing an example of the parcel table. FIG. 19 is an explanatory diagram showing an example of a POI table. FIG. 20 is a flowchart showing an example of information search processing according to a conventional method. FIG. 21 is a flowchart illustrating an example of information search processing performed by the navigation device according to the present embodiment. FIG. 22 is an explanatory diagram showing another example of drawing data. FIG. 23 is an explanatory diagram showing another example of the parcel table. FIG. 24 is an explanatory diagram showing another example of the POI table.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Information processing apparatus 110 Recording part 111 Name table 112 Relation table 113 Parcel table 114 Point table 120 Control part 121 Update part 122 Search part 130 Acquisition part 140 Input part 150 Output part 300 Navigation apparatus

  Exemplary embodiments of an information processing device, a navigation device, an information update method, an information search method, an information update program, an information search program, and a recording medium according to the present invention will be described below in detail with reference to the accompanying drawings. .

(Embodiment)
(Functional configuration of information processing device)
A functional configuration of the information processing apparatus according to the embodiment of the present invention will be described with reference to FIG. FIG. 1 is a block diagram illustrating an example of a functional configuration of the information processing apparatus according to the present embodiment. The information processing apparatus records address data composed of hierarchical name data and can perform predetermined processing. For example, the information processing apparatus is an electronic device such as a navigation device, a PND, a mobile phone, or a PDA. Realized by equipment. The predetermined process is a process of displaying a location address, searching for a facility, updating address data, and the like.

  In FIG. 1, the information processing apparatus 100 includes a recording unit 110, a control unit 120, an acquisition unit 130, an input unit 140, and an output unit 150. The recording unit 110 includes a name table 111, a relationship table 112, a parcel table 113, and a point table 114. The control unit 120 includes an update unit 121 and a search unit 122.

  The name table 111 is a table in which name data of each layer is associated with name identification information for uniquely identifying the name data. The name data of each hierarchy is typically, in order from the upper hierarchy, name data indicating the prefecture name, name data indicating the city name, name data indicating large letters corresponding to the upper town name, and lower It consists of name data indicating small letters corresponding to the town name. Note that the address data may include name data indicating an address, a number, or the like below the name data indicating small letters. The identification information may be a number, a character, a symbol, or the like as long as the name data can be uniquely identified. Typically, latitude and longitude information indicating a representative point of each name data is used. .

  The relationship table 112 is a table in which, for each name data, the upper layer name identification information and the lower layer name identification information are associated for each layer. Specifically, the relationship table 112 includes a table in which name identification information of a prefecture name and name identification information of a city name are associated with each other, name identification information of a city name, and a name identification indicating a capital letter. In addition to a table in which information is associated with each other, a table in which name identification information indicating a large character and name identification information indicating a small character are associated with each other. When the address data includes name data indicating a street address or number, the relationship table 112 also includes a table in which name identification information indicating small letters is associated with name identification information indicating a street address or number. The parcel table 113 and the point table 114 will be described later.

  The control unit 120 uses the name table 111 and the relationship table 112 recorded in the recording unit 110 to execute a predetermined process using address data. When performing processing such as point address display and facility search as the predetermined processing, the control unit 120 specifically reads the name identification information of each layer from the relationship table 112, and further reads the name identification information and Address data is created by reading the name data of each layer using the name table 111 and combining the name data.

  The output unit 150 outputs address data created by executing predetermined processing by the control unit 120. Specifically, the output unit 150 performs output by voice or display.

  The acquisition unit 130 acquires name data of one hierarchy including the changed portion and identification information for identifying the hierarchy of the name data. Specifically, the name data of one layer including the changed part is, for example, name data of a layer indicating a changed city name when there is a city merger. Specifically, the specific information is information for specifying any one of a hierarchy indicating a prefecture name, a hierarchy indicating a city name, a hierarchy indicating a capital letter, and a hierarchy indicating a small letter.

  The update unit 121 uses the name data acquired by the acquisition unit 130 to update the address data by replacing the name data of the hierarchy specified by the specific information among the address data recorded in the recording unit 110. . For example, when there is a merger of municipalities, the update unit 121 updates only the name data of the hierarchy indicating the municipality name.

  Specifically, the update unit 121 changes the name table by setting name identification information in the name data of one layer acquired by the acquisition unit. Furthermore, the update unit 121 changes the relationship table by associating the set name identification information with the name identification information of a higher hierarchy and a lower hierarchy than the hierarchy specified by the specific information. In this way, the update unit 121 updates the address data.

  The parcel table 113 is a table in which name identification information associated with name data by the name table 111 is associated with parcel identification information attached to rectangular parcel data for map drawing. Parcel identification information is parcel-specific information for identifying a parcel. Specifically, for example, when the name of a predetermined area is a prefecture name, the parcel table 113 associates latitude / longitude information of a representative point of each prefecture with parcel identification information.

  The spot table 114 is a table in which the type of facility and the location information of the facility are recorded, and the parcel identification information of the parcel in which each location is positioned is associated with the location information of each location. Specifically, the point table 114 is, for example, a table in which parcel identification information of a parcel in which a certain facility A is positioned is associated with small information as position information of the facility A.

  Input unit 140 receives an input of a keyword including an area name. The keyword is an area name, for example, a genre, an address, a facility name, and the like.

  The search unit 122 determines parcel identification information corresponding to the input area name (name data) using the parcel table 113 based on the keyword including the area name input to the input unit 140. Further, the search unit 122 uses the spot table 114 to determine a spot having position information corresponding to the identified parcel identification information. In this way, the search unit 122 searches for points.

  In addition, when the search unit 122 determines the parcel identification information corresponding to the area name using the parcel table 113, the parcel data corresponding to the parcel identification information is also used for other area names. If it is, the point is searched based on the position information of each point in the point table 114.

  The recording format of each table in the recording unit 110 includes a relational database that can be expressed as a simple table format, but it is also possible to use a conventional file tree structure.

(Information processing procedure of information processing apparatus using name table and relation table)
Next, an information processing procedure of the information processing apparatus 100 using the name table 111 and the relation table 112 will be described with reference to FIG. FIG. 2 is a flowchart illustrating an example of an information processing procedure of the information processing apparatus 100 using the name table 111 and the relationship table 112.

  In the flowchart of FIG. 2, the information processing apparatus 100 determines whether there is an input for starting a predetermined process (step S <b> 201). The predetermined process is, for example, a process of displaying an address of a place, searching for a facility, and the like. Until there is an input to start a predetermined process (step S201: No loop), if there is an input to start a predetermined process (step S201: Yes), the relation table 112 is used. The name identification information of each hierarchy of the target point is read (step S202).

  And the name data of each hierarchy are read using the read name identification information and the name table 111 (step S203). Thereafter, the read name data of each hierarchy is combined (step S204). Then, the address data created by the combination is output (step S205), and the series of processes is terminated.

  As described above, the information processing apparatus 100 according to the present embodiment records address data using the name table 111 and the relationship table 112, so that various processes can be simplified. Rapid processing can be performed.

  In addition, the address data is, in order from the upper hierarchy, name data of prefectures, name data of municipalities, name data of large letters, name data of small letters, and name identification information is representative of each name data. If latitude / longitude information indicating a point is used, it is not necessary to set name identification information separately, and a representative point can be uniquely identified.

  In addition, the name data of one layer including the changed portion and the specific information are acquired, and the acquired name data is used to specify the specific data among the address data recorded in the recording unit 110. If the address data is updated by replacing only the name data of the hierarchy to be updated, the amount of data at the time of updating can be suppressed, and the time required for updating can be shortened.

  In addition, when updating, the name table 111 is changed by setting the name identification information in the name data of one hierarchy including the changed portion, and the higher level than the hierarchy specified by the set name identification information and the specific information. If the address data is updated by changing the relationship table 112 by associating the name identification information of the hierarchy and the lower hierarchy, the address data can be easily updated only by changing the name table 111 and the relationship table 112. Can be done. Therefore, the amount of data at the time of updating can be suppressed, and the time required for updating can be shortened.

  Further, at the time of search, the parcel table 113 is used to determine the parcel identification information corresponding to the area name input to the input unit 140, and the point table 114 is used to have the position information corresponding to the parcel identification information If the point is searched by determining, the area can be narrowed down and the search can be performed. Therefore, it is possible to search quickly and easily.

  Further, when the parcel identification information corresponding to the area name is determined using the parcel table 113 at the time of the search, the parcel data corresponding to the parcel identification information is also used redundantly for other area names. In some cases, if a point search is performed based on the position information of each point in the point table 114, points that do not correspond to the input area name can be excluded from the search result, and an appropriate search result is obtained. Can be output.

  In addition, if a relational database is used as a map data recording method, map data can be expressed in a simple table format and can be searched easily and quickly, and only name data of a specific hierarchy can be displayed. Can be easily updated.

  Further, if the information processing apparatus 100 according to the present embodiment is used for a navigation apparatus, latitude / longitude information included in map data or the like recorded by the navigation apparatus can be diverted to name identification information. It is optimal for recording address data using the table 111 and the relation table 112.

  Examples of the present invention will be described below. In addition, a present Example demonstrates an example at the time of implement | achieving the information processing apparatus of this invention with the navigation apparatus mounted in a vehicle.

(Hardware configuration of navigation device)
The hardware configuration of the navigation device according to the present embodiment will be described with reference to FIG. FIG. 3 is a block diagram illustrating an example of a hardware configuration of the navigation device according to the present embodiment.

  In FIG. 3, a navigation device 300 includes a CPU 301, a ROM 302, a RAM 303, a magnetic disk drive 304, a magnetic disk 305, an optical disk drive 306, an optical disk 307, an audio I / F (interface) 308, and a speaker 309. An input device 310, a video I / F 311, a display 312, a communication I / F 313, a GPS unit 314, and various sensors 315. Each component 301 to 315 is connected by a bus 320.

  The CPU 301 governs overall control of the navigation device 300. The ROM 302 stores various programs such as a current position calculation program, a route search program, a map drawing program, a route guidance program, an information update program, and an information search program. The RAM 303 is used as a work area for the CPU 301.

  The current position calculation program, for example, calculates the current position of the vehicle (current position of the navigation device 300) based on output information from a GPS unit 314 and various sensors 315 described later.

  The route search program uses the map data recorded on the magnetic disk 305 and the like to search for an optimum guidance route from the departure point to the destination. Here, the optimum route is the shortest (or fastest) route to the destination or the route that best meets the conditions specified by the user. Further, not only the destination but also a route to a stop point or a rest point may be searched. Information on the searched route is output to the audio I / F 308 and the video I / F 311 via the CPU 301.

  The route guidance program is based on route information searched by executing the route search program, vehicle current position information calculated by executing the current position calculation program, and map data read from the magnetic disk 305. Real-time route guidance information is generated. The generated route guidance information is output to the audio I / F 308 and the video I / F 311 via the CPU 301.

  The map drawing program uses the map data recorded on the magnetic disk 305 to generate drawing information. The generated drawing information is output to the video I / F 311 via the CPU 301.

  The information update program uses, for example, the name data of one layer including the changed portion as the address data acquired from the optical disk 307 and the like, and the specific information for specifying the layer of the name data, and the magnetic disk Of the address data recorded in 305, the address data is updated by replacing the name data of the hierarchy specified by the specific information. Specifically, the address data is updated by updating the name table and the relationship table recorded on the magnetic disk 305.

  The information retrieval program uses a parcel table recorded on the magnetic disk 305 and a point table (hereinafter referred to as a “POI (Point Of Interests) table”) based on a keyword input to the input device 310, and This program searches. The update unit 121 and the search unit 122 included in the control unit 120 illustrated in FIG. That is, the function of the update unit 121 is realized by the CPU 301 executing the information update program. Moreover, the function of the search part 122 is implement | achieved when CPU301 runs an information search program.

  The magnetic disk drive 304 controls the reading / writing of the data with respect to the magnetic disk 305 according to control of CPU301. The magnetic disk 305 records data written under the control of the magnetic disk drive 304. As the magnetic disk 305, for example, an HD (hard disk) or an FD (flexible disk) can be used.

  The magnetic disk 305 records map data, address data, POI data, and the like. The map data is composed of map drawing parcel data composed of rectangular mesh units, route calculation region data, and the like. Address data consists of hierarchical name data. The POI data includes facility type and location information.

  Although details will be described later with reference to FIG. 4 and subsequent figures, the magnetic disk 305 records a name table, a relation table, a parcel table, and a POI table in a relational database recording format. In the portable navigation device (PND), data recorded on the magnetic disk 305 is recorded in a flash memory or the like. The recording unit 110 according to the embodiment illustrated in FIG. 1 is realized by a magnetic disk 305.

  Further, the magnetic disk drive 304 may be detachable. Thereby, the information can be read by connecting the magnetic disk drive 304 to a personal computer (PC) (not shown) in which the name data of one layer including the changed part and the specific information are recorded. .

  The optical disk drive 306 controls the reading / writing of the data with respect to the optical disk 307 according to control of CPU301. The optical disk 307 is a detachable recording medium from which data is read according to the control of the optical disk drive 306, such as a CD (Compact Disk) and a DVD (Digital Versatile Disk). As the optical disc 307, a writable recording medium can be used. In addition to the optical disk 307, the removable recording medium may be an MO, HD, memory card, USB memory, or the like.

  The optical disk drive 306 reads the name data of one layer including the changed portion and the specific information for specifying the layer of the name data recorded on the optical disk 307. The acquisition unit 130 illustrated in FIG. 1 is realized by the magnetic disk drive 304. It should be noted that the acquisition of the name data of the one layer including the changed portion and the specific information is not limited to reading from the optical disk 307, but may be reading from the MO, HD, memory card, USB memory, or the like. However, it may be based on reception from an external server via the communication I / F 313.

  When the data is received from an external server, the format is not limited to the format directly received by the navigation device 300. For example, HD, DVD, CD, memory via a map data receiving device such as a PC installed at home or the like. The information may be output to a removable recording medium such as a card, and the information may be recorded on the navigation device 300 via these recording media.

  The audio I / F 308 is connected to a speaker 309 for audio output. The speaker 309 outputs sound. Examples of the input device 310 include a remote controller having a plurality of keys for inputting characters, numerical values, and various instructions, a keyboard, a mouse, and a touch panel. From the input device 310, a keyword at the time of search is input from the user.

  The video I / F 311 is connected to the display 312. Specifically, the video I / F 311 includes, for example, a graphic controller that controls the entire display 312, a buffer memory such as a VRAM (Video RAM) that temporarily records image information that can be displayed immediately, and a graphic controller. Based on the output image data, the display 312 is configured by a control IC or the like. The output unit 150 illustrated in FIG. 1 according to the embodiment is realized by the display 312.

  The communication I / F 313 is connected to a network via wireless and functions as an interface between the navigation device 300 and the CPU 301. The GPS unit 314 receives radio waves from GPS satellites and outputs information indicating the current position of the vehicle. The output information of the GPS unit 314 is used when the current position of the vehicle is calculated by the CPU 301 together with output values of various sensors 315 described later. The information indicating the current position is information for specifying one point on the map data, such as latitude / longitude and altitude.

  The various sensors 315 output information that can determine the position and behavior of the vehicle, such as a vehicle speed sensor, an acceleration sensor, and an angular velocity sensor. The output values of the various sensors 315 are used for the calculation of the current position of the vehicle by the CPU 301 and the measurement of the change in speed and direction.

(Address data recorded on magnetic disk)
Next, the outline of the address data recorded on the magnetic disk 305 will be described with reference to FIG. FIG. 4 is an explanatory diagram showing an outline of address data recorded on the magnetic disk 305.

  In FIG. 4, the address data 400 has a structure in which name data such as prefecture names, city names, large letters, and small letters are layered. Specifically, in order from the upper hierarchy, the prefecture name, city name, large letter, and small letter. As a specific example, the address indicated by reference numeral 401 is “Shinjuku 1-chome, Kawagoe-shi, Saitama”, and in order from the upper hierarchy, “Saitama-ken”, “Kawagoe-shi”, “Shinjuku”, “1-chome”. It consists of name data. Note that the address data 400 may include name data indicating an address or an issue number in a lower hierarchy of small letters.

(Name table of each hierarchy)
Next, the name table of each hierarchy will be described with reference to FIGS. FIG. 5 is an explanatory diagram showing a name table of prefecture names. In FIG. 5, the name table 500 associates name IDs as name identification information with name data as prefecture names. The name ID corresponds to the latitude and longitude information of the representative point of each prefecture. The representative point is specifically the prefectural office location. For example, in the name data of “Saitama Prefecture” indicated by reference numeral 501, the name ID is the latitude and longitude “1287035513, 33043046” of the prefectural office location. The name ID is not limited to the latitude / longitude information of the representative point, but may be information such as other characters, numbers, symbols, etc. that can be uniquely specified.

  FIG. 6 is an explanatory diagram showing a name table of city names. In FIG. 6, the name table 600 associates a name ID as name identification information with name data as a city name. The name ID corresponds to the latitude and longitude information of the representative point of the city. Specifically, the representative point is a location such as a city hall, a ward office, a town hall, or a village hall. For example, in the name data of “Kawagoe City” indicated by reference numeral 601, the name ID is the latitude and longitude “1285553062, 33105664” of the location of the city hall.

  FIG. 7 is an explanatory diagram showing a large name table. In FIG. 7, a name table 700 associates a name ID as name identification information with name data as a capital letter name. The name ID corresponds to latitude and longitude information of a representative point in large letters. Specifically, the representative point is, for example, a point that becomes the center of a large letter. For example, the name data of “Nishi-Kosenba-cho” indicated by reference numeral 701 has a latitude / longitude “128549843, 33091322” of the representative point as the name ID.

  FIG. 8 is an explanatory diagram showing a small name table. In FIG. 8, a name table 800 associates a name ID as name identification information with name data as a small character name. The name ID corresponds to latitude / longitude information of a representative point in small letters. Specifically, the representative point is, for example, a point that becomes the center of a small character. For example, the name data of “1 chome” corresponding to “Nishi-Kosenba-cho” indicated by reference numeral 801 has the latitude and longitude “128549845, 33091325” of the representative point as the name ID. In addition, when the address data includes name data indicating the address or number, a table in which name data corresponding to the representative point of the address or number is associated with the name data indicating the address or number is provided. do it.

(Relationship table between each hierarchy)
Next, a relationship table between the hierarchies will be described with reference to FIGS. FIG. 9 is an explanatory diagram showing a relationship table between a name ID of a prefecture name and a name ID of a city name. In FIG. 9, the relationship table 900 associates name IDs of prefectures with name IDs of city names. The name ID of the prefecture name corresponds to the latitude and longitude information of the prefectural office location, as shown in FIG. As shown in FIG. 6, the name ID of the city / town / village name corresponds to the latitude / longitude information of the location of the city hall or the like.

  The relationship table 900 associates these name IDs with each other. For example, the name ID “1287035513, 33043046” of “Saitama Prefecture” indicated by reference numeral 901 has a relationship corresponding to the name ID “128553062, 33105664” of “Kawagoe City”. In addition, in the relationship tables in FIGS. 9 to 11, names such as prefecture names are written in parentheses, but actually, they are not recorded in the relationship table as data.

  FIG. 10 is an explanatory diagram showing a relationship table between a name ID of a city name and a name ID of a large name. In FIG. 10, the relationship table 1000 associates a name ID of a city name with a name ID of a large name. As shown in FIG. 7, the name ID of the capital letter name corresponds to, for example, latitude and longitude information of a point that is the center of the capital letter. The relationship table 1000 associates these name IDs with each other. For example, the name ID “128553062, 33105664” of “Kawagoe City” indicated by reference numeral 1001 has a relationship corresponding to the name ID “1285499843, 33091322” of “Nishi-Kosenba-cho”.

  FIG. 11 is an explanatory diagram showing a relationship table between a name ID of a large name and a name ID of a small name. In FIG. 11, a relation table 1100 associates a name ID of a large letter name with a name ID of a small letter name. As shown in FIG. 8, the name ID of the small character name corresponds to, for example, latitude and longitude information of a point that is the center of the small character. The relationship table 1100 associates these name IDs with each other. For example, the name ID “128549843, 33091322” of “Nishi-Kosenba-cho” indicated by reference numeral 1101 has a relationship corresponding to the name ID “128549845, 33091325” of “1 chome”.

(Changed address data at the time of municipal merger)
Next, the outline of the changed address data at the time of merger of municipalities will be described with reference to FIG. FIG. 12 is an explanatory diagram showing an outline of the changed address data at the time of merger of municipalities. In FIG. 12, the address data 1200 has a structure in which name data such as prefecture names, city names, large letters, and small letters are hierarchized in the same manner as the address data 400 shown in FIG. Specifically, the address data 1200 indicates that “Kawagoe City” and “Fujimino City” were merged into “Kawagoe City” and “Fujimino City” by the merger of municipalities. The data when the name data is rewritten to the name data of “Kawagoe Fujimino City” is shown. Details of changes in various tables when data is rewritten will be described with reference to FIGS.

(Changes in various tables when updating address data)
Next, changes in various tables when updating address data will be described with reference to FIGS. FIG. 13 is an explanatory diagram showing the name table changed when the address data is updated. In FIG. 13, in the name table 1300, as indicated by reference numeral 1301, new name data of “Kawagoe Fujimino City” is registered, and a name ID is set in this name data. The name ID of “Kawagoe Fujimino City” is the same name ID as that of the former Kawagoe City, that is, it corresponds to latitude and longitude information similar to the representative point of the former Kawagoe City. This is because, for example, it is assumed that the city hall of “Kawagoe Fujimino City” is in the same location as the city hall of the former Kawagoe City. In addition, you may set a new name ID separately, without using the old Kawagoe city name ID as it is.

  Further, as indicated by reference numeral 1302, the name data and name ID of the old Fujimino city are deleted. Therefore, the name data of “Kawagoe City” before update shown in FIG. 6 is replaced with “Kawagoe Fujimino City”, and the name data and name ID of the old Fujimino City are simply deleted, and the change shown in the name table 1300 is completed. It is supposed to be.

  FIG. 14 and FIG. 15 are explanatory diagrams showing the relationship table changed when the address data is updated. In FIG. 14, the relationship table 1400 associates name IDs of prefectures with name IDs of city names. In FIG. 14, in the relation table 1400, as indicated by reference numeral 1401, a name ID of “Saitama Prefecture” and a name ID of “Kawagoe Fujimino City” are associated. This is the same as the correspondence relationship between the name ID of “Saitama Prefecture” and the name ID of “Kawagoe City” in the relationship table 900 before update shown in FIG. That is, as described in FIG. 13, the name “Saitama Prefecture” in the relationship table 1400 is used because the name ID of “Kawagoe Fujimino City” is not newly set and the same name ID as that of the former Kawagoe City is used. There is no change in the correspondence between the ID and the name ID of “Kawagoe Fujimino City” (former Kawagoe City name ID).

  On the other hand, as indicated by reference numeral 1402, the data in which the name ID of “Saitama Prefecture” and the name ID of the old Fujimino City are associated is deleted. Therefore, the change shown in the relationship table 1400 is completed only by deleting the data associated with the name ID of the old Fujimino city.

  In FIG. 15, the relationship table 1500 associates a name ID of a municipality name with a name ID of a large name. In FIG. 15, for example, as indicated by reference numeral 1501, the relationship table 1500 associates the name ID of “Kawagoe Fujimino City” with the name ID of “Nishikosenba Town”. This is the same as the correspondence relationship between the name ID of “Kawagoe City” and the name ID of “Nishikosenba” in the relationship table 1000 before update shown in FIG. That is, as described in FIG. 13, since the name ID of “Kawagoe Fujimino City” is not newly set and the same name ID as that of the former Kawagoe City is used, “Kawagoe Fujimino City” in the relation table 1500 is used. There is no change in the correspondence between the name ID (former Kawagoe city name ID) and the name ID of “Nishikosenba”.

  In addition, in the reference numeral 1502, the name ID of “Uenodai” associated with the name ID of the old Fujimino City is associated with the name ID of “Kawagoe Fujimino City”. In other words, in the relationship table 1500, everything corresponding to the name ID of the old Fujimino city has been replaced with “Kawagoe Fujimino City”. Therefore, the change shown in the relationship table 1500 is completed simply by replacing the name ID associated with the name of the old Fujimino city with the name ID of “Kawagoe Fujimino City”.

  In addition, although the municipal merger has been described here as an example, the address data can be updated in the same way for mergers of prefectures, mergers of large letters and small letters. In addition, the address data can be updated in the same manner when there are other changes such as division of prefectures and division of municipalities, not limited to mergers.

(An example of address data information update processing performed by the navigation device)
Next, an example of address data information update processing performed by the navigation device 300 will be described with reference to FIG. FIG. 16 is a flowchart illustrating an example of address data information update processing performed by the navigation device 300.

  In the flowchart of FIG. 16, the CPU 301 of the navigation device 300 identifies the name data of the city / town / village name including the changed location and the hierarchy by, for example, inserting the optical disc 307 or the like from the user into the navigation device 300 main body. It is determined whether or not specific information for acquisition has been acquired (step S1601).

  It is in a standby state until the name data of the city / town / village name including the changed part and the specific information are acquired (step S1601: No loop), and when these pieces of information are acquired (step S1601: Yes), the specific information is used. The hierarchy of name data to be changed is specified (step S1602). Note that in this flowchart, the hierarchy of the name data to be specified is the hierarchy of the municipality name.

  Then, the name table recorded on the magnetic disk 305 is updated (step S1604) by setting the name ID in the name data of the changed city name (step S1603). Thereafter, using the relationship table recorded on the magnetic disk 305, the name IDs of the upper hierarchy (prefecture) and the lower hierarchy (large letters) are extracted from the hierarchy indicating the city name (step S1605).

  Then, the relationship table recorded on the magnetic disk 305 is updated (step S1607) by associating the set city name ID with the extracted upper layer and lower layer name IDs (step S1606). Then, the address data information update process is terminated.

  According to the above-described processing, the name data of the hierarchy indicating the city name including the changed part and the specific information are acquired, and the address recorded in the magnetic disk 305 using the acquired name data. In the data, the name data of the hierarchy indicating the city name specified by the specific information is replaced and the address data is updated, so there is no change in the large and small name data in the merger of municipalities In addition, it is possible to update the address data by changing only the city name, thereby reducing the amount of data at the time of updating and shortening the time required for updating.

  Further, since the relational database is used as the map data recording method, the map data can be represented in a simple table format, and only the name data of a specific hierarchy can be easily updated.

(Example of drawing data)
Next, an example of drawing data recorded on the magnetic disk 305 will be described with reference to FIG. FIG. 17 is an explanatory diagram showing an example of drawing data.

  In FIG. 17, the drawing data 1700 is composed of a plurality of parcel data 1701 obtained by dividing the whole country by a certain rectangle. Parcel data 1701 has a parcel ID (parcel identification information) for identifying each of them. The parcel data is, for example, large enough to divide each prefecture into dozens of rectangles.

  Here, the parcel ID for identifying the parcel data is a number from 1 to 77 from the upper left to the lower right in the figure. For example, “Saitama Prefecture” falls within the area indicated by reference numeral 1710, that is, is drawn by the parcel data 1701 of the parcel ID “16, 17, 26 to 29, 36 to 40, 49 to 51”. It has become. The parcel ID numbers and the order in which the numbers are assigned are not limited to this, and it is possible to use characters, symbols, and the like other than numbers.

(Example of parcel table)
Next, an example of the parcel table recorded on the magnetic disk 305 will be described with reference to FIG. FIG. 18 is an explanatory diagram showing an example of the parcel table. In FIG. 18, a parcel table 1800 associates a name ID of a prefecture name with a parcel ID. The name ID of the prefecture name is associated with the name data by the name table 500 shown in FIG. 5 and corresponds to the latitude / longitude information of the representative point. In FIG. 18, the prefecture name associated with the name ID is shown in parentheses for convenience, but is not actually recorded in the table.

  Reference numeral 1801 indicates a parcel ID used when “Saitama Prefecture” is drawn, that is, a correspondence between the name ID of “Saitama Prefecture” and the parcel ID “50”. Note that the name ID of “Saitama Prefecture” is associated with all of the parcel IDs “16, 17, 26 to 29, 36 to 40, 49 to 51” (see FIG. 17) used when drawing “Saitama Prefecture”. It has been.

  When a plurality of prefectures are included in the parcel data 1701 indicated by one parcel ID, such as a prefectural border, as shown by reference numeral 1802, “Saitama Prefecture” is assigned to the parcel ID “51”. And the name ID of “Tokyo” are associated with each other. That is, for example, when the parcel data 1701 indicated by a certain parcel ID includes four prefectures, name IDs are associated with the four prefectures, respectively.

(Example of POI table)
Next, an example of a POI (Point Of Interests) table recorded on the magnetic disk 305 will be described with reference to FIG. FIG. 19 is an explanatory diagram showing an example of a POI table. In the POI table 1900, in addition to the facility type and the like, the location information in the lower hierarchy of the facility address corresponding to the name ID of the small name and the parcel ID are recorded in association with the location information.

  In the POI table 1900, a point indicated by reference numeral 1901 indicates a facility (for example, a convenience store) located in the parcel ID “50” corresponding to “Saitama Prefecture” or “Tokyo”, and the parcel ID “50” It is associated with the location information of the convenience store. The position information is latitude / longitude information, and corresponds to the name ID of the small name associated with the name table 800 shown in FIG.

  Note that the position information (ID) is not limited to the name ID of the small character name, and has, for example, a lower-level name table and a relation table such as an address and a number associated with the small character name. In this case, the latitude / longitude information can be used as an ID.

  By using such a POI table 1900 in which parcel IDs and facility location information are associated with each other, facilities can be narrowed down by parcel ID at the time of facility search so that the search cost can be reduced. It has become. Specific processing at the time of search will be described below.

(An example of information retrieval processing by a conventional method)
First, an example of information search processing according to a conventional method will be described with reference to FIG. FIG. 20 is a flowchart showing an example of information search processing according to a conventional method. The data structure is the same as the data structure according to the above-described embodiment.

  In the flowchart of FIG. 20, the CPU of the conventional navigation apparatus determines whether or not a search keyword has been input and an input to start search has been received (step S2001). Here, it is assumed that a convenience store in Saitama prefecture (hereinafter referred to as “convenience store”) is searched, and a keyword “Saitama convenience store” is input from the user to the input device 310.

  It is in a standby state until an input for search start is accepted (step S2001: No loop). When an input for search start is accepted (step S2001: Yes), a city belonging to “Saitama Prefecture” is searched (step S2002). . Then, a large character belonging to the municipality is searched (step S2003). Thereafter, a small character belonging to the large character is searched (step S2004).

  Then, small latitude / longitude information is extracted from the search result, and the “small latitude / longitude list” is stored in the RAM (step S2005). Further, the POI of the facility type “convenience store” is searched (step S2006). Thereafter, the search result is stored in the RAM as a “POI list” (step S2007). Then, by using the “small latitude / longitude list” and “POI list” stored in the RAM, it is determined whether or not the “POI list” matches the latitude / longitude information in the “small latitude / longitude list”. (Step S2008).

  If it is determined that there is an item in the “POI list” that matches the latitude / longitude information in the “small latitude / longitude list” (step S2008: Yes), the matching “POI list” is output as a search result (step S2009). A series of processing ends. On the other hand, if it is determined in step S2008 that there is no match in the “POI list” with the latitude / longitude information in the “small latitude / longitude list” (step S2008: No), the fact that there is no corresponding facility is output as a search result. Then (step S2010), a series of processing is terminated.

  As described above, in the information search processing in the conventional format using the data structure according to the present embodiment, a huge amount of processing is necessary, and it is difficult to realize a realistic search speed. The information search process according to this embodiment of the present invention will be described below.

(An example of information retrieval processing performed by the navigation device according to the present embodiment)
Next, an example of information search processing performed by the navigation device 300 according to the present embodiment will be described with reference to FIG. FIG. 21 is a flowchart illustrating an example of information search processing performed by the navigation device 300 according to the present embodiment.

  In the flowchart of FIG. 21, the CPU 301 of the navigation device 300 determines whether or not a search keyword has been input and an input to start search has been received (step S2101). In this case, it is assumed that a convenience store in Saitama prefecture is searched, and the keyword “Saitama convenience store” is input from the user to the input device 310.

  It remains in a standby state until an input for search start is accepted (step S2101: No loop). When an input for search start is accepted (step S2101: Yes), a parcel ID belonging to “Saitama Prefecture” is searched (step S2102). Then, the search result is stored in the RAM 303 as a “parcel ID list” (step S2103). Further, the POI of the facility type “convenience store” is searched (step S2104), and the search result is stored in the RAM 303 as the “POI list” (step S2105).

  Thereafter, it is determined whether or not there is an item in the “POI list” that matches the parcel ID of the “parcel ID list” (step S2106). When it is determined that there is an item in the “POI list” that matches the parcel ID in the “Parcel ID list” (step S2106: Yes), the matching parcel ID is used in a prefecture other than “Saitama”. It is determined whether there is a parcel ID that is present (step S2107). That is, it is determined whether or not a parcel having a parcel ID that matches the parcel ID in the “parcel ID list” straddles a plurality of prefectures.

  Of the matching parcel IDs, if it is determined that there is no parcel ID used in any prefecture other than “Saitama Prefecture” (step S2107: No), that is, the parcel ID that matches the parcel ID in the “parcel ID list” When it is determined that a parcel having a name does not straddle multiple prefectures, a “POI list” having a parcel ID that matches the parcel ID of the “parcel ID list” is output as a search result (step S2108). Terminate the process.

  On the other hand, if it is determined in step S2107 that there is a parcel ID used in a prefecture other than “Saitama” among the matching parcel IDs (step S2107: Yes), that is, the parcels in the “parcel ID list” If it is determined that a parcel having a parcel ID that matches the ID straddles a plurality of prefectures, it is determined whether or not the parcel belongs to “Saitama Prefecture” based on the information on the small characters of the POI (step S2109). Note that the determination in step S2109 is specifically performed by tracing the large character, the municipality, and the prefecture, which are the upper layers of the small character, using the small character information.

  Thereafter, it is determined whether or not there is any item other than “Saitama Prefecture” in the “POI list” (step S2110). When it is determined that there is something other than “Saitama Prefecture” in the “POI list” (step S2110: Yes), from the “POI list” having the parcel ID that matches the parcel ID of the “parcel ID list”, Items other than “Saitama Prefecture” are deleted and output as search results (step S2111).

  If it is determined that there is nothing other than “Saitama Prefecture” (step S2110: No), a “POI list” having a parcel ID that matches the parcel ID of the “parcel ID list” is searched in step S2108. Output as a result.

  If it is determined in step S2106 that there is no match in the “POI list” with the parcel ID in the “parcel ID list” (step S2106: No), the fact that there is no corresponding facility is output as a search result (step S2112). ), A series of processing ends.

  According to the above-described processing, by using the parcel table 1800, the parcel ID corresponding to the input area name is determined, and by using the POI table 1900, the facility having the position information corresponding to the parcel ID is determined. Since the facility is searched, the area can be narrowed down when searching. Therefore, it is possible to search quickly and easily.

  In other words, the parcel data 1701 has a size that allows each prefecture to be divided into several tens of rectangles, so that the latitude and longitude information of several hundred small characters can be searched as compared with the conventional case. , Search costs can be reduced.

  In addition to the method using the parcel table 1800 in which the rectangular parcel data 1701 and the parcel ID are associated with each other, it is possible to use a method using an ID representing each prefecture. Then, the shape of the prefecture may change. In such a case, it is necessary to change the parcel ID near the prefectural border, and also to the POI table 1900 that records the parcel ID.

  However, if rectangular parcel data 1701 is used as in this embodiment, the parcel ID does not change even if the shape of the prefecture changes due to mergers of municipalities, etc., so the POI table 1900 There is no need to change. That is, as described in the information update process of FIG. 16, the update can be completed only by rewriting the name table and the relationship table.

  Further, since a relational database is used as a map data recording method, map data can be represented in a simple table format, and a search can be performed easily and quickly.

  When a relational database is used, the latitude / longitude information may be treated as a special data type for spatial search by using the latitude / longitude information as a name ID. In the above-described processing, the name ID is represented by an integer. Since the search is performed using the parcel ID, it is not handled as a special data type and can be handled as a normal data type, so that the search speed can be improved.

(Another example of drawing data)
Next, an example of drawing data when the parcel data rectangle is further subdivided will be described with reference to FIG. FIG. 22 is an explanatory diagram showing another example of drawing data.

  In FIG. 22, the drawing data 2200 includes a plurality of parcel data 2201 obtained by dividing the whole country by a certain rectangle. A parcel ID for identifying each is attached to the parcel data 2201. The parcel data includes L parcel data 2202 having a size for dividing each prefecture into several tens of rectangles, and S parcel data 2201 having a size for dividing each municipality into several rectangles. The L parcel data 2202 has the same size as the parcel data 1701 shown in FIG. The L parcel data 2202 corresponds to the size of four of the S parcel data 2201.

  Here, the L parcel ID and the S parcel ID for identifying the L parcel data 2202 and the S parcel data 2201 are sequentially numbered from the upper left to the lower right in the figure. For example, the L parcel data 2202 of the L parcel ID “1” is configured by the S parcel data 2201 of the S parcel ID “101, 102, 123, 124”. The L parcel ID number is indicated by a balloon in the figure.

  “Kawagoe City” is within the area indicated by reference numeral 2210, that is, drawn by the S parcel data 2201 of the S parcel ID “243, 264 to 266, 287” and the L parcel data 2202 of the L parcel ID “39”. It has come to be. Note that the numbers of the L parcel ID and the S parcel ID and the order in which the numbers are assigned are not limited to this, and it is possible to use characters, symbols, and the like other than numbers.

(Another example of the parcel table)
Next, an example of the parcel table when the drawing data 2200 shown in FIG. 22 is used will be described with reference to FIG. FIG. 23 is an explanatory diagram showing another example of the parcel table. In FIG. 23, a parcel table 2300 associates a name ID of a city name with an S parcel ID. The name ID of the municipality name is associated with the name data by the name table 600 shown in FIG. 6, and corresponds to the latitude and longitude information of the representative point. In FIG. 23, the municipality name associated with the name ID is shown in parenthesis for convenience, but is not actually recorded in the table.

  Reference numeral 2301 indicates an S parcel ID used when “Kawagoe City” is drawn, that is, the association between the name ID of “Kawagoe City” and the S parcel ID “265”. Note that the name ID of “Kawagoe City” is associated with all of the S parcel IDs “243, 264 to 266, 287” (see FIG. 22) used when drawing “Kawagoe City”.

  Further, when a plurality of municipalities are included in the S parcel data 2201 (see FIG. 22) indicated by one S parcel ID, such as a city boundary, the “Kawagoe City” is assigned to the S parcel ID. The name IDs of the municipalities other than "are associated with each other. That is, for example, when the S parcel data 2201 indicated by a certain S parcel ID includes four municipalities, the name ID is associated with each of the four municipalities.

(Another example of POI table)
Next, an example of the POI table when the parcel table 2300 shown in FIG. 23 is used will be described with reference to FIG. FIG. 24 is an explanatory diagram showing another example of the POI table. In the POI table 2400, in addition to the facility type and the like, position information of a lower hierarchy of the facility address corresponding to the name ID of the small name is recorded. In the POI table 2400, the L parcel ID and the S parcel ID are recorded in the POI table 2400 in association with the position information of each point.

  In the POI table, a point indicated by reference numeral 2401 indicates a facility (for example, a convenience store) located at the S parcel ID “265” and the L parcel ID “39” corresponding to “Kawagoe City”. It is associated with the location information of the convenience store. The position information is latitude / longitude information, and corresponds to the name ID of the small name associated with the name table 800 shown in FIG.

  In this way, when the POI table 2400 in which the S parcel ID, the L parcel ID and the facility location information are associated with each other is used, when searching for a keyword such as “Kawagoe City Convenience Store”, the facility is identified by the S parcel ID. It is possible to narrow down. Also, when searching for a keyword such as “Saitama convenience store”, facilities can be narrowed down by L parcel ID. Therefore, even when the parcel table 2300 and the POI table 2400 are used, the search cost can be reduced and a quick search can be performed.

  Further, if the S parcel data 2201 shown in FIG. 22 is divided at a fixed ratio such as four divisions or eight divisions of the L parcel data 2202, the L parcel data 2202 can be obtained from the S parcel data 2201. Specifically, for example, it can be determined that the S parcel ID “120 to 124” corresponds to the L parcel ID “140”. In this way, it is not necessary to record the L parcel ID in the POI table 2400, and the data amount can be further reduced.

  As described above, according to the information processing apparatus, navigation apparatus, information update method, information search method, information update program, information search program, and recording medium of the present invention, rewriting of address data can be facilitated. At the same time, a simple and quick search can be performed.

  The information update method and information search method described in the present embodiment can be realized by executing a program prepared in advance 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 by being read from the recording medium by the computer. The program may be a transmission medium that can be distributed via a network such as the Internet.

[0002]
There was a problem as an example.
Means for Solving the Problems [0006]
In order to solve the above-described problems and achieve the object, an information processing apparatus according to the present invention is an information processing apparatus that records address data composed of hierarchical name data and performs predetermined processing. A name table in which name data in each hierarchy is associated with name identification information for uniquely identifying the name data, and for each name data, name identification information in an upper hierarchy and name identification information in a lower hierarchy for each hierarchy. A control unit that executes a predetermined process using address data using the name table and the relationship table recorded in the recording unit, and an area name. Input means for receiving an input of a keyword including a name identifier associated with name data by the name table. A point in which the parcel table that associates the information with the parcel identification information attached to the parcel data for map drawing, the parcel identification information of the parcel where each point is located, and the position information of each point The control means determines the parcel identification information corresponding to the input area name using the parcel table based on the keyword input to the input means, and It has a search means for searching for the point by determining a point having position information corresponding to the specified parcel identification information.
[0007]
Moreover, the navigation apparatus concerning this invention is provided with the said information processing apparatus, It is characterized by the above-mentioned.
[0008]
[0009]
The information search method according to the present invention is a recording unit for recording address data composed of hierarchical name data, and name identification information for uniquely identifying the name data of each hierarchy and the name data Are associated with name data by each name data, a relation table in which upper layer name identification information and lower layer name identification information are associated for each layer, and the name table. The parcel table that associates the name identification information with the parcel identification information attached to the parcel data for map drawing, the parcel identification information of the parcel where each point is located, and the position information of each point An information search method for an information processing apparatus including the recording unit having a point table attached to a keyword table including an area name Based on the input step of receiving force and the input keyword, the parcel identification information corresponding to the input area name is determined using the parcel table, and the specified parcel identification information is determined using the point table. And a search step for searching for the point by determining a point having corresponding position information.

[0003]
[0010]
[0011]
An information search program according to the present invention causes a computer to execute the information search method.
[0012]
The recording medium according to the present invention is characterized in that the program is recorded in a computer readable manner.
BRIEF DESCRIPTION OF THE DRAWINGS [0013]
FIG. 1 is a block diagram showing an example of a functional configuration of an information processing apparatus according to the present embodiment.
FIG. 2 is a flowchart showing an example of an information processing procedure of the information processing apparatus using a name table and a relation table.
FIG. 3 is a block diagram of an example of a hardware configuration of the navigation device according to the present embodiment.
FIG. 4 is an explanatory diagram showing an outline of address data recorded on a magnetic disk.
FIG. 5 is an explanatory view showing a name table of prefecture names.
FIG. 6 is an explanatory view showing a name table of city names.
[FIG. 7] FIG. 7 is an explanatory view showing a name table of capital letters.
FIG. 8 is an explanatory diagram showing a small name table.
[FIG. 9] FIG. 9 shows a relationship table between name IDs of prefectures and city names.

  In order to solve the above-described problems and achieve the object, an information processing apparatus according to claim 1 is an information processing apparatus that records address data composed of hierarchical name data and performs predetermined processing. A name table in which name data of each hierarchy is associated with name identification information for uniquely identifying the name data, and for each name data, the name identification information of the upper hierarchy and the name of the lower hierarchy for each hierarchy And a control unit that executes predetermined processing using address data using the name table and the relationship table recorded in the recording unit. And an input means for receiving an input of a keyword including an area name, and the recording means is associated with name data of a predetermined hierarchy by the name table. A plurality of parcel tables in which each name is associated with the name identification information being stored and the parcel identification information attached to the parcel data for map drawing having a size corresponding to the predetermined hierarchy. And a point table in which parcel identification information of parcels for each hierarchy and position information of each point are associated with each other, and the control means, based on the keyword input to the input means, the plurality of parcels A parcel identification information for each layer corresponding to the input area name is determined using a table, and a point having position information corresponding to the determined parcel identification information for each layer is specified using the point table. Thus, it has a search means for searching for the point.

  According to a seventh aspect of the present invention, a navigation apparatus includes the information processing apparatus.

  An information search method according to the invention of claim 8 is a recording unit for recording address data composed of hierarchical name data, for uniquely identifying the name data of each hierarchy and the name data. A name table in which name identification information is associated, a relation table in which name identification information in an upper hierarchy and name identification information in a lower hierarchy are associated for each hierarchy for each name data, and the name table A plurality of parcel tables in which name identification information associated with name data and parcel identification information attached to parcel data for map drawing having a size corresponding to the predetermined hierarchy are associated with each hierarchy; The recording unit comprising: a parcel identification information of a parcel for each hierarchy in which each point is located, and a point table in which position information of each point is associated with each other. An information search method for an information processing apparatus, an input process for receiving an input of a keyword including an area name, and a hierarchy corresponding to the input area name using the plurality of parcel tables based on the input keyword A search step of determining the parcel identification information for each and performing a search for the location by specifying a location having position information corresponding to the determined parcel identification information for each hierarchy using the location table. It is characterized by including.

  An information search program according to a ninth aspect of the invention causes a computer to execute the information search method according to the eighth aspect.

  According to a tenth aspect of the present invention, there is provided a recording medium in which the information retrieval program according to the ninth aspect is recorded in a computer-readable state.

Claims (13)

An information processing apparatus that records address data composed of hierarchical name data and performs predetermined processing,
A name table in which name data of each hierarchy is associated with name identification information for uniquely identifying the name data;
For each name data, a relationship table in which upper layer name identification information and lower layer name identification information are associated for each layer;
Recording means having
Control means for executing predetermined processing using address data using the name table and the relation table recorded in the recording means;
An information processing apparatus comprising: The address data includes, in order from the name data of the upper hierarchy, the name data of the hierarchy indicating the prefecture name, the name data of the hierarchy indicating the city name, the name data of the hierarchy indicating the capital letters, and the hierarchy data indicating the small letters. It consists of name data,
The information processing apparatus according to claim 1, wherein the name identification information includes latitude / longitude information indicating a representative point of each name data. It further comprises an acquisition means for acquiring name data of one hierarchy including the changed portion and identification information for identifying the hierarchy of the name data,
The control means uses the name data acquired by the acquisition means to replace the address data by replacing the name data of the hierarchy specified by the specific information among the address data recorded in the recording means. The information processing apparatus according to claim 1, further comprising update means for updating the information. The updating means includes
Changing the name table by setting name identification information in the name data of one hierarchy acquired by the acquisition means;
The address data is updated by changing the relation table by associating the set name identification information with name identification information of a higher hierarchy and a lower hierarchy than the hierarchy specified by the identification information. The information processing apparatus according to any one of claims 1 to 3. An input means for receiving an input of a keyword including an area name;
The recording means includes
A parcel table in which name identification information associated with name data by the name table is associated with parcel identification information attached to parcel data for map drawing;
A point table that associates the parcel identification information of the parcel where each point is located and the position information of each point;
Have
The control means determines the parcel identification information corresponding to the input area name using the parcel table based on the keyword input to the input means, and the specified parcel identification using the point table. 5. The information processing apparatus according to claim 1, further comprising: a search unit configured to search for the point by determining a point having position information corresponding to the information.   When the search means determines the parcel identification information corresponding to the area name using the parcel table, the parcel data corresponding to the parcel identification information is also used for other area names. In this case, the information processing apparatus according to claim 5, wherein the point is searched based on position information of each point in the point table.   The information processing apparatus according to claim 1, wherein the recording unit records each table using a relational database.   A navigation apparatus comprising the information processing apparatus according to claim 1. A recording unit that records address data composed of hierarchical name data,
A name table in which name data of each hierarchy is associated with name identification information for uniquely identifying the name data;
For each name data, a relationship table in which upper layer name identification information and lower layer name identification information are associated for each layer;
An information update method for an information processing apparatus comprising the recording unit having:
An acquisition step of acquiring name data of one hierarchy including the changed portion and specific information for specifying the hierarchy of the name data;
Update that updates the address data by replacing the name data of the hierarchy specified by the specific information among the address data recorded in the recording unit, using the name data acquired in the acquisition step. Process,
An information updating method for an information processing apparatus, comprising: A recording unit that records address data composed of hierarchical name data,
A name table in which name data of each hierarchy is associated with name identification information for uniquely identifying the name data;
For each name data, a relationship table in which upper layer name identification information and lower layer name identification information are associated for each layer;
A parcel table in which name identification information associated with name data by the name table is associated with parcel identification information attached to parcel data for map drawing;
A point table that associates the parcel identification information of the parcel where each point is located and the position information of each point;
An information search method for an information processing apparatus comprising the recording unit having
An input process for receiving an input of a keyword including an area name;
Based on the input keyword, the parcel identification information corresponding to the input area name is determined using the parcel table, and the point having position information corresponding to the specified parcel identification information using the point table A search step for searching for the point by determining
An information search method for an information processing apparatus, comprising:   An information update program for causing a computer to execute the information update method according to claim 9.   An information search program for causing a computer to execute the information search method according to claim 10.   13. A computer-readable recording medium in which the program according to claim 11 or 12 is recorded.

Images