| 摘要 |
<p>PROBLEM TO BE SOLVED: To shorten the searching time of a map in the search of an optimum route by describing the head memory address of a record group to be read next which has the same starting place name to each of plural sets of records. SOLUTION: The head memory address of a record group to be read next which has the same starting place name is described in each of plural sets of records. When an information processing device searches the place name to be connected next on the basis of the end point name of the present record on a map, the place name search is started from the record of the head memory address described in the present record. For example, the route from Tokyo to Utsunomiya is searched, a computer reads the head address of the map and the record from Tokyo to Akabane to gain a distance AAA. Then, to read the record having the terminal point code '2' of Akabane, the search is started from a memory address 0100 on the basis of the index 0100 of the present red record.</p> |
