WO2007037030A1

WO2007037030A1 - Information processing device, information processing method, and information storage medium used in the same

Info

Publication number: WO2007037030A1
Application number: PCT/JP2006/308334
Authority: WO
Inventors: Makoto Mikuriya; Masaharu Umezu; Tomoya Ikeuchi; Tomohiro Nakae
Original assignee: Mitsubishi Denki Kabushiki Kaisha
Priority date: 2005-09-27
Filing date: 2006-04-20
Publication date: 2007-04-05
Also published as: JP2007094539A

Abstract

An information processing device includes: search information storage means (4) for storing search information which is a set of search records having record identifiers made of a unique, unchangeable, continuous numbers; update information acquisition means (3) for acquiring update information including modification/discarding information for instructing a search record to be modified or discarded among search records constituting the stored search information, by using a code identifier; and modification/discarding means (5) for modifying or discarding the search record instructed by the record identifier among the modification/discarding information contained in the update information acquired by the update information acquisition means among the search records constituting the search information stored in the search information storage means.

Description

Specification

Information processing apparatus, information processing method, and information storage medium used therefor

[0001] The present invention relates to an information processing apparatus, an information processing method, and a storage medium for information used therein, and more particularly to a technique for updating search information used for search.

Background art

[0002] In a conventional car navigation apparatus, in order to realize various search functions, for example, search information having a tree structure is used to perform a 50-sound search as shown in Non-Patent Document 1. Yes. This search information is made up of a set of search records representing nodes constituting the tree structure, and each search record has a pointer to a search record corresponding to a child node of the search record. As the pointer, the physical storage location of the search record is used. In a search using such search information, a search is started from the root node which is the highest node, and information corresponding to a desired name is obtained by sequentially selecting child nodes having a desired character. can get.

[0003] Patent Document 1 discloses a data search apparatus that enables relatively easily and appropriately using search information reflecting the latest information without updating the entire search information. In this data search apparatus, search information 1 that is an array of search records storing various information related to the facility using the facility name as a search key is searched, a search record having a desired search key is acquired, and a new one is provided. Search for new information consisting of the specified search records, obtain search records with the desired search key, add the new information records to the search records obtained from search information 1, and display their contents Do

[0004] Also, for the search information 2 that is a sequence of search records having a telephone number as an identification number, the update information is a newly established search record that indicates the identification number to be deleted. It is a change information that indicates the identification number that changes the contents of the contents and the contents of the change. In the search processing for search information 2, both search information 2 and its update information are searched, a search record having a desired identification number is extracted, and these pieces of information are output. Extracted In the search record, the search record of the search information 削除 is deleted or changed by the deletion information or change information.

[0005] Search information 3 for searching for information using a tree structure is a collection of search records representing each node constituting the tree structure, and each search record is a child node of the search record. And a physical storage location of the search record is used as a pointer. Starting from the topmost root node of search information 3, the selection of child nodes is repeated sequentially, and the desired information is obtained when the leaf node that is the terminal node is reached.

[0006] Update information for updating the search information 3 is provided with records corresponding to the nodes of the search information 3, and the records are associated with each other by pointers so as to have the same parent-child relationship as the search information 3. This pointer also uses the physical storage position of the record. Each record of update information includes information for deleting the search record of the corresponding search information 3 or determining whether the search record is newly established. During the search process, both the search information 3 and the update information records are passed to the lower nodes, and the search record of the search information 3 is sequentially updated with the corresponding update information record.

[0007] Non-Patent Document 1: "KIWI Format Ver. 1. 10 11. 11. Chapter 3 50-sound Search" KIWI Review Committee

Patent Document 1: Japanese Unexamined Patent Publication No. 2005-43966

However, in the search information used in the data search device shown in Non-Patent Document 1 described above, the physical storage location of the search record is used as a pointer. If a search record in the list is updated and its data size changes, the storage location of all subsequent search records will change, and it will be necessary to change all pointers pointing to them, increasing the amount of information to be updated. There is a problem of doing.

[0009] In addition, the order of arrangement based only on the storage position of the search record also changes due to the abolition of the search record. Therefore, the storage position and the order of the search records are different depending on the version of the search information even for the same search record. In the search information disclosed in Non-Patent Document 1, it is possible to use the storage position and the order of the search records as a method for specifying the search records. There is a problem that the update information in which the search record is represented by the storage position, the order of arrangement, and the storage position cannot be used in common for the search information of each version.

[0010] In addition, in the data search device disclosed in Patent Document 1, in the search process of search information 1, each of search information 1 and new information is searched independently, so that two search processes are performed. Reason is required. In addition, when displaying the facility names in the order of the Japanese syllabary, it is necessary to add a search record that has also acquired the new information power to the search record acquired from the search information 1 and sort it further in the order of the 50 sounds. In addition, since the update information of search information 2 is composed of independent new information, deletion information, and change information, each of the new information, deletion information, and change information can be searched for the desired search key. 3 search operations are required.

[0011] Further, in order to facilitate the search of the search record of the search information 2 of the desired identification number, when the correspondence information between the identification number and the storage position of the search record is created! If they are continuous, a table can be created in which the storage locations are arranged in the order of the identification numbers. However, since the telephone numbers are used as the identification numbers, the identification numbers become discontinuous and the above table cannot be created. In other words, placing a special storage location indicating that a search record corresponding to an identification number that does not exist does not exist will unnecessarily increase the size of the table.

[0012] In addition, since update information with different data structures is used to update search information with different data structures, such as search information 2 and search information 3, update processing varies depending on the type of search information. There is a problem that is necessary.

[0013] The present invention has been made to solve the above-described problems, facilitates acquisition of a search record included in search information, and prevents an increase in update information for updating the search information. In addition, an information processing apparatus, an information processing method, and an information processing apparatus that can update correctly regardless of the version of the search information, and that can update the search information using one processing program regardless of the type of the search information. The purpose is to provide a storage medium for the information used.

Disclosure of the invention

[0014] An information processing apparatus according to the present invention provides a search information storage that stores search information that is an aggregate of search records to which record identifiers having unique and invariant continuous number powers are assigned. Update information that includes change abolition information that uses the record identifier to indicate the search record to be changed or abolished among the search records that constitute the search information stored in the storage means and the search information storage means Update information acquisition means for acquiring search information, search information acquisition means for acquiring search records constituting the search information stored in the search information storage means, and update among the search records acquired by the search information acquisition means There is provided a change abolition means for changing or abolishing the search record indicated by the record identifier in the change abolition information included in the update information acquired by the information acquisition means.

[0015] An information processing method according to the present invention includes a step of storing search information that is an aggregate of search records to which record identifiers having unique and invariant continuous number powers are assigned, and stored search information. A step of obtaining update information including change abolition information that designates a search record to be changed or abolished by using a record identifier among search records to be configured, and a search that constitutes stored search information A step of changing or abolishing the search record indicated by the record identifier in the change abolition information included in the acquired update information in the record.

[0016] A storage medium according to the present invention includes search information including a set of search records to which record identifiers having unique and invariant continuous number powers are assigned, and search records constituting the record identifier and the search information. It stores storage location information that associates storage locations with each other.

[0017] The storage medium according to the present invention is a newly provided search record having a unique and invariant number, and a record identifier consisting of a continuous number following the number used for the record identifier of the search information. The new storage location information that associates the new information that is an aggregate of the record, the record identifier and the storage location of the search record included in the new information, and the target record identifier that is the record identifier of the search record Operation information indicating whether it is abolished or changed in order is included, and if the operation information indicates a change, the change information for changing the search record indicated by the target record identifier is included in the change information. If the record identifier of the search record pointed to is used as a pointer to another search record, and the operation information indicates a change of order Before the record identifier of the search record corresponding to the front of the search record indicated by the target record identifier And the change abolition information including the next record identifier that is the record identifier of the search record corresponding to the next of the search record indicated by the record identifier.

[0018] According to the present invention, since the record identifiers having consecutive numbers are assigned to the search records, the search records can be easily acquired. In addition, a unique and invariant record identifier is assigned to the search record, and the search record to be changed or abolished is indicated using the record identifier, so it does not depend on the storage location of the search record. Change abolition information is obtained. As a result, it is possible to prevent an increase in update information, and to correctly change or abolish search records for any version of search information. In addition, since the search record to be updated is specified using a record identifier that does not depend on the data structure of the search information, any type of search information can be updated using a single processing program.

[0019] According to the present invention, the search information of any version can be updated using the common update information, so that the processing speed can be improved. In addition, any kind of search information can be updated using a single processing program.

[0020] According to the present invention, common update information can be applied to all versions of search information, and an information processing apparatus capable of improving the processing speed can be realized. In addition, a single processing program can be used to update any type of search information.

Brief Description of Drawings

FIG. 1 is a block diagram showing a configuration of an information processing apparatus according to Embodiment 1 of the present invention.

FIG. 2 is a diagram showing an example of a search cluster stored in the information storage device of the information processing device according to Embodiment 1 of the present invention.

FIG. 3 shows an example of a search tree used in the information processing apparatus according to Embodiment 1 of the present invention.

FIG. 4 is a diagram showing an example of assigning record identifiers to search information of the first version used in the information processing apparatus according to Embodiment 1 of the present invention.

FIG. 5 is a diagram showing an example of assigning record identifiers to search information for the next version used in the information processing apparatus according to Embodiment 1 of the present invention. FIG. 6 is a diagram showing an example of storage location information corresponding to first-version search information used in the information processing apparatus according to Embodiment 1 of the present invention.

FIG. 7 is a diagram showing an example of storage location information corresponding to search information for the next version used in the information processing apparatus according to Embodiment 1 of the present invention.

[8] FIG. 8 is a diagram showing an example of a data structure of a list type search record used in the information processing apparatus according to Embodiment 1 of the present invention.

[9] FIG. 9 is a diagram showing an example of a data structure of a search tree-type search record used in the information processing apparatus according to Embodiment 1 of the present invention.

FIG. 10 is a diagram showing an example of an update cluster stored in the information storage device of the information processing device according to Embodiment 1 of the present invention.

FIG. 11 is a diagram showing details of update information shown in FIG.

FIG. 12 is a diagram showing an example of change abolition information shown in FIG. 11.

[13] FIG. 13 is a diagram showing an example of a change abolition data fixed part stored in the change abolition information fixing part shown in FIG.

FIG. 14 is a diagram showing an example of a change abolition data “variable part stored in a change abolition information variable part shown in FIG. 12.

[15] FIG. 15 is a diagram showing an example of the change information shown in FIG.

[16] FIG. 16 is a diagram showing an example of the change abolition information fixing unit when the search information shown in FIG. 4 is updated to the search information shown in FIG.

[17] FIG. 17 is a diagram showing an example of the change abolition information variable unit when the search information shown in FIG. 4 is updated to the search information shown in FIG.

FIG. 18 is a diagram showing an example of attribute information constituting a list-type search record in the information processing apparatus according to Embodiment 1 of the present invention.

FIG. 19 is a diagram showing a search record in which attribute X shown in FIG. 18 is changed to attribute x.

20 is a diagram showing an example of a change record for changing the search record shown in FIG. 18 to the search record shown in FIG.

FIG. 21 is a diagram showing an example of a search tree type search record in the information processing apparatus according to Embodiment 1 of the present invention; FIG. 22 is a diagram showing an example of a search tree type search record in which one child node is newly added to the search record shown in FIG.

FIG. 23 is a diagram showing an example of a change record for changing the search record shown in FIG. 21 to the search record shown in FIG.

FIG. 24 is a diagram showing an example of new information for updating the search information shown in FIG. 4 to the search information shown in FIG.

FIG. 25 is a diagram showing an example of new storage location information for the new information shown in FIG. 24.

FIG. 26 is a flowchart showing an update operation of the information processing apparatus according to Embodiment 1 of the present invention.

FIG. 27 is a diagram for explaining an operation of adding new information to search information in the information processing apparatus according to Embodiment 1 of the present invention.

FIG. 28 is a diagram for explaining an operation of adding new storage position information to storage position information in the information processing apparatus according to Embodiment 1 of the present invention.

FIG. 29 is a diagram showing an example of change abolition presence / absence information generated in the information processing apparatus according to Embodiment 1 of the present invention.

FIG. 30 is a diagram showing an example of updated management information and updated information used in the information processing apparatus according to Embodiment 1 of the present invention;

FIG. 31 is a flowchart showing details of update processing performed in steps ST 18 and ST 19 of FIG. 26.

FIG. 32: Update DVD-R used in the information processing apparatus according to Embodiment 2 of the present invention

It is a figure which shows the example of the data structure of the update cluster stored in OM.

FIG. 33 is a flowchart showing an operation of the information processing apparatus according to the second embodiment of the present invention.

BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, in order to explain the present invention in more detail, the best mode for carrying out the present invention will be described with reference to the accompanying drawings.

Embodiment 1.

FIG. 1 is a block diagram showing the configuration of the information processing apparatus according to Embodiment 1 of the present invention. The The information processing apparatus includes an input device 1, a position detection device 2, an update information acquisition device 3, an information storage device 4, a processor 5, and an output device 6.

The input device 1 generates an instruction signal according to the user operation or instruction and sends it to the processor 5. Specifically, the input device 1 is a voice recognition device that recognizes a user's voice and outputs an instruction signal based on the voice, a button that outputs an instruction signal by a user's manual operation, or other Appropriate input devices (all not shown) can be constructed. The position detection device 2 detects the current position of the vehicle equipped with the information processing device using, for example, a GPS (Global Positioning System) receiver, a vehicle speed sensor, and an angular velocity sensor, and uses the detected current position as position information. Send to processor 5.

The update information acquisition device 3 is configured, for example, as a DVD (Digital Versatile Disk) drive power, and reads update information stored in an update DVD-ROM (Read Only Memory) and sends it to the processor 5 . The information storage device 4 is constituted by, for example, a node disk drive using a hard disk as a storage medium, and stores search information, storage position information of this search information, map information, and the like. Further, the information storage device 4 stores the update information acquired from the update information acquisition device 3. This information storage device 4 constitutes the search information storage means and the storage position information storage means of this invention.

The processor 5 uses the instruction signal sent from the input device 1, the position information sent from the position detection device 2, and the search information and map information read out from the information storage device 4. Execute information processing. The information processing executed by this processor 5 includes a search process for facilities, addresses, telephone numbers, etc. using search information, and a map matching process for estimating the current vehicle position based on location information and map information! A route calculation (route search) process for calculating a route from the departure point to the destination obtained by the above search process, and a suitable route candidate obtained by the route calculation process together with a road map are displayed on the screen of the output device 6. Route display processing to be displayed on the route, route guidance processing to guide from the starting point to the destination according to a suitable route, and map display processing to display a map around the current position. The processor 5 includes an internal memory 5a for storing various information.

[0026] The processor 5 also reads the DVD-ROM power attached to the update information acquisition device 3. The updated information is stored in the information storage device 4. Then, when information processing is executed, search information, map information, update information, and the like are read from the information storage device 4, and processing for updating the search information and map information is executed using the read update information. The output device 6 presents the result of information processing of the processor 5 to the user. Specifically, the output device 6 includes a display device that displays a search result, a map, a current position, a route, or guidance information, and a Z or a voice generation device that gives a voice instruction or guidance to the user (all of them). (The illustration is omitted).

Next, search information used in the information processing apparatus configured as described above will be described. FIG. 2 is a diagram illustrating an example of a search cluster stored in the information storage device 4. The search cluster is a collection of information necessary for various searches, and includes search cluster management information, search information, and storage location information. The search cluster management information is information for managing the search information and the storage location information, and includes version information indicating the creation time of the search information. The search information includes a plurality of search information 1 to S, and the storage location information includes a plurality of storage location information 1 to s corresponding to the plurality of search information 1 to S, respectively.

[0028] The search information includes a list type that is a collection of information representing various attributes of the search target property, and a search tree type having a data structure of a tree structure to narrow down the search target property.

[0029] The list-type search information includes a sequence of search records provided corresponding to the search target property, and is sorted and arranged by the search key of the search target property. Each search record stores various attributes of the property to be searched. For example, if the search target is a facility, the search key is the name of the facility, search records corresponding to each facility are arranged in the order of the facility name, and each search record has the facility attribute as the facility attribute. The name, telephone number, postal code, address, latitude / longitude indicating the location of the facility, etc. are stored.

[0030] When there are multiple list-type search information having a common attribute, only one list-type search information having a common attribute is created in order to avoid holding duplicate information. And create as many list-type search information with unique attributes as necessary. There is a list-type search information having the above-mentioned attributes with a pointer pointing to a search record included in the list-type search information having a common attribute. For example, as a list-type search information for a search by phone number, a search record consisting of a pointer to a search record included in a list-type search information with a search target property corresponding to a telephone number as a facility is called There are those that are arranged by sorting numbers as search keys. Such list-type search information with a pointer to other list-type search information is called an indirect list type, and list-type search information without a pointer to other list-type search information is the basic list. Called a type.

[0031] The search records constituting the list-type search information are ordered in the order sorted by the search key, and in the search information, each search record is sorted and arranged by the search key. The order and order of search records match. Therefore, for the search record X in the search information, the search record placed before search record X is the search record in front of search record X, and the search record placed after search record X is search record X. This is the next (backward) search record.

On the other hand, search tree-type search information is information representing a search tree constituting a tree structure for specifying a search target property by performing hierarchical narrowing down. The search tree has a child node for the node located at the highest level (referred to as a “root node”), and for this child node, the necessary number of child nodes are provided as the next hierarchy, and so on. It is configured by providing child nodes up to the hierarchy. Nodes that have no child nodes in the search tree are called leaf nodes.

[0033] FIG. 3 is a diagram showing an example of a search tree when the name of the facility is expressed by alphabets A to Z. Each node is provided at each level so as to correspond to the letters A to Z necessary for expressing the name of the facility. For example, when selecting a facility with the name "DEF", first the nodes A to Z that are children of the root node are narrowed down to the first character "D", then " The second character "E" node is narrowed down from the A to Z nodes that are the child nodes of the "D" node, and finally the A to Z nodes that are the child nodes of the "E" node To the third character "F" node. This selects the facility with the name “DEF”. Note that the third character "F" node has no child nodes, so it becomes a leaf node. The

[0034] Search tree-type search information is composed of a list of search records representing nodes constituting the search tree, and each search record has a pointer pointing to the search record of the child node.

[0035] Search tree-type search information in which information representing various attributes of a search target property corresponding to a search record of a leaf node is provided and information search is completed only by the search information is referred to as a single search tree type. For example, in the search information of the single search tree type, in the search information of the search tree type shown in FIG. 3, the search record of the node “F” of the third character that is the leaf node includes the name of the facility having the name “DEF”. Stores information representing attributes.

[0036] In addition, the search record of the leaf node is provided with a pointer to the search record of the other list type search information so that the search record of the search target property existing in the list type search information is pointed out. Search tree-type search information in which various attributes of a property are obtained from other list-type search information is called a composite search tree type. For example, in the search information of the single search tree type, the search record of the node “F” in the third letter “F” in the search tree type search information shown in FIG. This refers to a search record of list-type search information, and the specified search record stores information representing various attributes of the facility whose name is “DEF”.

[0037] The search information of the complex search tree type may be configured such that the search record of each node has a pointer pointing to the search record of the list type search information. For example, the search tree-type search information shown in FIG. 3 is provided with a pointer pointing to the search record of the list-type search information having the search target property as the facility in the search record of the node other than the leaf node. The search record for the node “E” as the second character is provided with a pointer that points to the search record located at the top of the search records for facilities whose first two characters are “DE” in the list-type search information. By obtaining the search records sequentially from the search record pointed to by the pointer according to the order of the search information of the list type, it is possible to display a list of various attributes of the facility whose first two characters are “DE”.

[0038] Both the search information of the list type and the search tree type configured as described above can be handled as an array of search records of fixed length or variable length. To identify search records, each search record has a record that is a unique and unchanging identifier in the search information. A mode identifier is assigned. A consecutive number is used as this record identifier.

[0039] N + 1 search records in the search information of the first created version (first edition) include 0, 1, 2, 3, ..., N— in the order of the search records from the first search record. Numbers consecutive with 1 and N are assigned as record identifiers. Each search record of the search information of the next version is given the same record identifier to the same search record as the previous version, and the newly created search record contains the search information of the previous version. Numbers next to the largest number of used record identifiers are also assigned as record identifiers as consecutive numbers N + 1, N + 2, N + 3,. Record identifiers are assigned in the same way in the following versions. Fig. 4 is a diagram showing an example of assigning record identifiers to the search information of the first edition, and consecutive numbers are assigned in the order in which search records are arranged.

FIG. 5 is a diagram showing an example of assigning record identifiers to search information for the next version. In this example, search record 1 in the first version of search information is abolished, newly created search record N + 1 and search record N + 2 are added, and search record N + 1 and search record N + 2 The record identifiers N + 1 and N + 2 are assigned respectively. For the record identifiers of search records 0 to N, the same number as the search information of the first edition is used as it is. Note that the record identifier number of the abandoned search record 1 is a missing number. This number can be reassigned to a newly created search record.

[0041] The identity of the search records in the search information of the previous version and the current version is determined, for example, by the identity of the search key in the list type search information. In the search tree-type search information, the determination is based on the identity of the route from the root node to the predetermined node. In the search tree type search information shown in Fig. 3, the path to the third character "F" node is the first character "D" node and the second character "E" node. If these nodes "D" and "E" exist in both the previous version and the current version, the path to the third character "F" node will be the same in the previous version and the current version. The third letter "F" node in the current version is considered the same.

[0042] As described above, by assigning a unique and invariant record identifier to a search record, if the search record is specified using the record identifier, the same search record is specified for all versions of search information. be able to. Therefore, search records that appear in the update information. By using the record identifier as a pointer to the mode, update information that can be applied to any version of search information can be obtained.

Next, the storage location information will be described. The storage location information is information that associates the record identifier assigned to the search record of the corresponding search information with the storage location of the search record, and is a sequence of fixed-length storage location records arranged in ascending order of record identifier. is there. In the storage position record, for example, the head address of the corresponding search record based on the head of the search information is stored.

[0044] FIG. 6 shows an example of storage location information corresponding to the search information of the first version shown in FIG. 4, and the storage locations of corresponding search records arranged in the order of record identifiers 0, a, a, a,. · · · A

1 2 3 N-l

, A is composed of information indicating a. Figure 7 corresponds to the next version of search information shown in Figure 5.

N

An example of storage location information is shown. The storage locations of the corresponding search records arranged in the order of record identifiers are 0, invalid value, b, b, b, ...,! ), B, b, and b

2 N + 1 3 N-l N N + 1 N + 2

It is. In the storage location information shown in this example, search record 1 is abolished and the record identifier is missing, so an “invalid value” indicating that the storage location is invalid is stored.

[0045] As described above, the storage position records have a fixed length and are continuously arranged in ascending order of record identifiers. Therefore, the storage position records can be obtained immediately from the desired record identifier numbers. In addition, since the search information of the storage position indicated by the storage position record can be acquired, the search record of the desired record identifier can be acquired immediately. In addition, since consecutive numbers are used as record identifiers for each search record in the search information, storage position records can be arranged without waste, and the data size of the storage position information can be reduced.

The search information includes, for example, a single list type search information, a single search tree type search information, a basic search type search information used together with a composite search tree type search information and a composite search tree type search information. Information, search information of complex search tree type and search information of complex search tree type, indirect list type search information and basic list type search information, etc., search for facilities, telephone numbers, postal codes, addresses, etc. It is provided corresponding to the type of target property.

FIG. 8 shows a search record (list search information) that constitutes the list type search information stored in the information storage device 4. FIG. 5 is a diagram showing an example of a data structure of “list type search record”. A list-type search record consists of a search record header, search record identifier, forward record pointer, next record pointer, other search information record pointer, and attribute information fields.

The “search record header” includes information indicating the data size of the search record, the presence / absence of another search information record pointer, and the data size of attribute information. The presence or absence of other search information record pointers and attribute information is determined by the contents of the search record header. “Search record identifier” represents the record identifier of the search record. “Forward record pointer” consists of a pointer type and a record pointer. The pointer type indicates whether the record pointer is a storage position or a record identifier. The record pointer is a storage position or a record according to the pointer type. The search record corresponding to the front of the search record is indicated using one of the identifiers.

[0049] The "next record pointer" consists of a pointer type and a record pointer. The pointer type indicates whether the record pointer is a storage position or a record identifier. The record pointer is stored according to the pointer type. Or, use either the record identifier to indicate the search record corresponding to the next of the search record.

[0050] “Other search information record pointer” includes search information designation information, pointer type, and record pointer power. Search information designation information designates other search information in which the search record indicated by the record pointer exists, and the pointer type. Indicates whether the record pointer is a storage location or a record identifier, and the record pointer depends on the pointer type.

The search record in the search information indicated by the search information designation information is indicated using either the storage location or the record identifier. The other search information record pointer is not provided in the basic list type search record, but is provided in the indirect list type search record. “Attribute information” is information indicating various attributes of the search target property indicated by the search record.

FIG. 9 shows a search record constituting search tree-shaped search information stored in the information storage device 4.

6 is a diagram illustrating an example of a data structure (hereinafter referred to as “search tree-type search record”). FIG. This search tree type search record also includes a search record header, a search record identifier, another search information record pointer, a child node pointer table, a selection key list, and attribute information. It is.

[0052] "Search record header" includes the data size of the search record, the presence or absence of other search information record pointers, the number of child node pointers stored in the child node pointer table, the data size of the selection key list, and attribute information It contains information indicating the data size. The presence or absence of other search information record pointers, child node pointer tables, selection key lists, and attribute information is determined by the contents of the search record header.

“Search record identifier” represents a record identifier of the search record. “Other search information record pointer” consists of search information designation information, pointer type and record pointer. Search information designation information designates other list type search information where the search record indicated by the record pointer exists. The pointer type indicates whether the record pointer is a storage location or a record identifier, and the record pointer follows the pointer type.

The search record in the search information indicated by the search information designation information is indicated using either the storage location or the record identifier.

The “child node pointer table” is an array of child node pointers as many as the number of child nodes of the search record. The child node pointer is composed of a pointer type and a record pointer, and the pointer type is a record pointer. Indicates the storage position or record identifier, and the record pointer points to the search record of the child node of the search record using either the storage position or the record identifier according to the pointer type.

[0055] The "selection key list" is a list of selection key information as many as the number of child nodes of the search record. The selection key information includes information for selecting child nodes of the search record. ing. The arrangement order of the selection key information is the same as the arrangement order in the child node pointer table of the child node pointer indicating the child node selected by the selection key information. “Attribute information” is information representing various attributes of the search target property indicated by the search record.

It should be noted that the other search information record pointer is provided only for the search record of the complex search tree type. Also, the child node pointer table and the selection key list are not provided in the leaf node search record. In addition, in the search information of the single search tree type, the leaf node search record The attribute information is provided in the search information of the complex search tree type, and the attribute information is not provided in the search record of the leaf node.

Next, update information used in the information processing apparatus according to the first embodiment will be described. FIG. 10 is a diagram showing an example of an update cluster stored in the update DVD-ROM. The update cluster is composed of update information corresponding to the search information for updating the search information shown in FIG. 2, and update cluster management information for managing the update information. The update cluster management information includes information for managing update information, and update version number information indicating the version number of search information to be updated and the version number obtained by updating.

FIG. 11 is a diagram showing details of the update information shown in FIG. The update information consists of change abolition information, new information and new storage location information, and update management information for managing them.

First, update abolition information constituting update information will be described. Fig. 12 shows an example of change abolition information. The change abolition information consists of a change abolition information fixed part and a change abolition information variable part. Change abolition data is provided corresponding to search records subject to abolition, content change, and order change, divided into fixed part and variable part, and stored in change abolishment information fixed part and change abolition information variable part respectively. Has been.

FIG. 13 is a diagram showing an example of a change abolition data fixed section stored in a change abolition information fixing section. Change obsolete data · The fixed part consists of the target record identifier, operation information, and the change obsolete data variable part storage location. “Target record identifier” is information that represents the record identifier of the search record that is the target of abolition, content change, or order change.

[0061] "Operation information" also includes an abolition flag, a forward change flag, a next change flag, and an internal change flagger. “Abolition flag” indicates whether or not the search record indicated by the target record identifier is abolished. The “forward change flag” indicates whether or not there is a change in ordering in front of the search record indicated by the target record identifier. The “next change flag” indicates whether or not the next ordering change of the search record indicated by the target record identifier. The forward ordering change and the next ordering change are collectively referred to as order change. The “internal change flag” indicates whether or not the content of the search record indicated by the target record identifier has been changed. The “change abolition data variable part storage position” indicates the storage position in the change abolition information variable part of the variable part of the change abolition data. In the change abolition information fixed part, in order to facilitate the search by the record identifier, the change abolition data 'fixed part is arranged in ascending order of the target record identifier.

FIG. 14 is a diagram showing an example of a change abolition data 'variable part stored in the change abolition information variable part. Change obsolete data · The variable part consists of change obsolete data variable part size, forward record identifier, next record identifier, and change information. “Change abolition data variable part size” indicates the data size of the change abolition data 'variable part. “Forward record identifier” represents the record identifier of the search record corresponding to the front of the search record indicated by the target record identifier of the change abolition data. This forward record identifier is provided when the forward change flag indicates that the forward ordering is to be changed.

“Next record identifier” represents a record identifier of a search record corresponding to the next of the search record indicated by the target record identifier of the change abolition data. This next record identifier is set when the next change flag indicates that the next ordering will be changed. “Change information” is information for changing the contents of the search record indicated by the target record identifier of the change abolition data. It is provided when the change information flag indicates that the inside of the search record is to be changed.

FIG. 15 is a diagram showing an example of change information. The change information is composed of change records instructing change operations to be performed on search records. The change record includes change operation information, change position, change source size, change size, and change data.

[0066] "Change operation information" indicates whether deletion, replacement, or insertion is shifted. The “change position” indicates a storage position of data to be changed in the search record. The “change source size” indicates the data size of the data to be changed in the search record, and is provided when the change operation information is deleted or replaced. “Change size” indicates the data size of the change data, and is provided when the change operation information is replaced or inserted. “Change data” indicates data used for replacement or insertion, and is provided when the change operation information is replaced or inserted.

[0067] The change record is changed from the change position of the search record when the change operation information is deleted. Instructs to delete only the original size data. In addition, when the change operation information is replaced, the change record instructs to change the data of the change source size to the change data from the change position of the search record. Further, when the change operation information is inserted, the change record instructs insertion of the change data at the change position of the search record. Note that a record identifier is always used for a pointer that points to another search record that appears in the change data.

FIG. 16 is a diagram showing an example of the information abolition information fixing unit when the search information shown in FIG. 4 is updated to the search information shown in FIG. 5. FIG. 17 shows the search information shown in FIG. FIG. 6 is a diagram showing an example of a change abolition information variable unit when updated to the search information shown in FIG. However, the contents of search record 3 shown in FIG. 4 are changed to become search record 3 shown in FIG.

[0069] In the change abolition data fixed part shown in Fig. 16, the operation information FO, Fl, F2 and F3 represent the abolition flag, forward change flag, next change flag and internal change flag, respectively, and the change abolition data variable part storage location aul to au4 are change abolition data 1 'variable part-change abolition data 4 · Indicates the storage location of the variable part!

The change abolition data fixed part 0 · fixed part of the change abolition data fixed part shown in FIG. 16 represents that the search record 1 shown in FIG. 4 whose record identifier is “1” is abolished. Since the change abolition data 0 · variable part is unnecessary, an invalid value indicating invalidity is stored in the change abolition data variable part storage location auO.

[0071] Change abolition data 1 of the abolition change data fixed part shown in Fig. 16 · Fixed part and change abolition data 1 of the change abolition data variable part shown in Fig. 1 · Variable part has a record identifier "2" This indicates that the search record corresponding to the next of the search record 2 shown in FIG. 4 is changed to the search record N + 1 shown in FIG. 5 whose record identifier is “N + 1”.

[0072] Change abolished data in the change abolished data fixed part shown in Fig. 16 2. Fixed part and change abolished data in the changed abolished data variable part shown in Fig. 2 · The variable part has a record identifier "3" The search record corresponding to the front of search record 3 shown in Fig. 4 is changed to search record N + 1 shown in Fig. 5 with the record identifier "N + l", and search record 3 shown in Fig. 4 is changed with change information upd3. Represents what to do.

[0073] Change abolition data fixed part shown in Fig. 16 Change abolition data 3 · Shown in fixed part and Fig. 17 Change obsolete data variable part change obsolete data 3 · The variable part has a record identifier whose search identifier corresponds to the next record of search record N— 1 shown in Fig. 4 whose record identifier is “N—1”. This means that the search record N + 2 shown in FIG. 5 is changed to “N + 2”.

[0074] Change obsolete data in the change obsolete data fixed part shown in Fig. 16 · Change obsolete data in the fixed part and change obsolete data variable part shown in Fig. 4 · Variable part has a record identifier "N" This represents that the search record corresponding to the front of the search record N shown in 4 is changed to the search record N + 2 shown in FIG. 5 whose record identifier is “N + 2J”.

FIG. 18 is a diagram showing an example of attribute information constituting a list type search record. In this example, the attribute information consists of attribute 0 to attribute M. The storage location of attribute X in this search record is acl, and the data size of attribute X is dsl. FIG. 19 shows a search record in which the attribute X shown in FIG. 18 is changed to the attribute x, and the data size of the attribute x ′ is dsl ′.

FIG. 20 is a diagram showing an example of a change record for changing the search record shown in FIG. 18 to the search record shown in FIG. The change record cl indicates that the data of the size dsl to dsl in the search record shown in FIG. 18, that is, the attribute X is replaced with the attribute x, which is the change data having the data size dsl ′.

FIG. 21 shows an example of a search tree type search record having three child nodes. The data size of the search record header h is ds21. The storage position of the child node pointer 2 in this search record is ac21, and the storage position of the selection key information 2 is ac22.

[0078] FIG. 22 shows a new child node added to the search record shown in FIG. 21. A child node pointer 3 indicating a new child node record is inserted before the child node pointer 2, and a new child node is inserted. The selection key information 3 for selecting a child node is inserted before the selection key information 2, the data size of the child node pointer 3 is ds22, and the data size of the selection key information 3 is ds23. As a result of the above change, the data size of the search record in search record header h is increased by the data size of child node pointer 3 and selection key information 3, and the number of child node pointers is increased by “1” to increase search record header h. , And.

FIG. 23 is a diagram showing an example of a change record for changing the search record shown in FIG. 21 to the search record shown in FIG. The change record c21 is the search record shown in Figure 21. It is instructed to replace the data with the size of ds21 from the beginning, that is, the search record header h, with the search record header h, which is the changed data with the data size ds21. The change record c22 instructs to insert the child node pointer 3 which is the change data having the data size ds 22 ′ into the storage position ac22 in the search record shown in FIG. The pointer type of child node pointer 3 is the record identifier, and the record pointer is the record identifier of the child node.

[0080] As described above, a pointer that points to another search record appearing in the change data uses a record identifier. The change record c23 indicates that selection key information 3 (= “G”), which is change data having a data size of ds23 ′, is inserted into the storage position ac23 in the search record shown in FIG.

[0081] As described above, the change abolition information specifies a search record to be updated using a unique and immutable record identifier, and is a unique and immutable record as a pointer to the search record appearing in the update information. Because identifiers are used, change abolition information can be applied to any version of search information. In addition, as described above, the information for internal change, abolition, and order change is expressed as change abolition information in a unified manner, facilitating updating. In addition, the change in ordering occurs when a new search record is created, but the new search record is inserted into the search information by pointing to the new search record with the forward and next record pointers. The ordering can be changed without doing so.

Next, new information and new storage location information constituting update information will be described. The new information shown in Fig. 11 is a list of new search records arranged in the order of record identifiers. In the new information, pointers pointing to other search records shall be represented using record identifiers.

[0083] FIG. 24 is a diagram showing an example of new information for updating the search information shown in FIG. 4 to the search information shown in FIG. 5, and is newly provided for the search information shown in FIG. The search records shown in FIG. 5 are arranged in the order of search record N + 1 and search record N + 2. cl is the storage location based on the beginning of the new information of search record N + 2. As described above, the new information can be applied to any version of search information by using a unique and immutable record identifier as a pointer to other search records in the new information. wear.

The newly-stored storage position information shown in FIG. 11 is obtained by arranging the storage positions of newly set search records in the order of record identifiers. FIG. 25 is a diagram showing an example of the new storage location information for the new information shown in FIG. 24. The storage location record indicating the storage location of the search record N + 1 and the search record N + 2 is the search record in the order of the record identifier. Arranged

[0085] In the update information described above, it is understood that the search record is abolished by referring to the change abolition information, the search record is internally changed according to the change abolition information, and the result is used. Since it is possible to change the order without inserting a new search record in the search information, update processing can be performed without rewriting the search information, and the storage position of the search record does not change. Update information is not required to change the position.

Next, the update operation of the information processing apparatus configured as described above according to Embodiment 1 of the present invention will be described with reference to the flowchart shown in FIG. In the following, the update DVD-ROM update information is acquired, and the case of searching by the name of the facility using the search information of the complex search tree type and the search information of the basic list type will be described as an example. Further, the processing of each step below is executed by the processor 5.

[0087] First, update information is acquired (step ST10). That is, the processor 5 reads the update cluster (see FIG. 10) stored in the update DVD-ROM from the update information acquisition device 3 and stores it in the information storage device 4. The processing by the update information acquisition device 3, the information storage device 4, and the processor 5 constitutes update information acquisition means. Next, new information is added (step ST11). That is, the new information included in the update information stored in the information storage device 4 is added to the end of each search information stored in the information storage device 4 in step ST10. FIG. 27 shows an example of search information obtained by adding the new information shown in FIG. 24 to the end of the search information shown in FIG.

[0088] Next, new storage location information is added (step ST12). That is, the new storage location information included in the update information stored in the information storage device 4 is added to the end of each storage location information stored in the information storage device 4 in step ST10. At this time, newly established In step ST11, the data size of the search information before the new information is added is added to the storage position of each new storage position record of the storage position information, and the storage position is corrected. With this modification, the storage location of each newly created search record when new information is added to the end of the search information is obtained. FIG. 28 is a diagram showing an example of storage location information obtained by adding the new storage location information shown in FIG. 25 to the end of the storage location information shown in FIG. However, the storage location record N + 1 and the storage location record N + 2 are stored in the storage location (0 + S) and the data size S of the search information before the new information is added in step ST11. (C 1 + S).

[0089] As described above, the record identifiers including the newly established search records are set to consecutive numbers, so that the storage location information after the above-described processing is performed, the existing search record and the newly established search record are stored. For a record, the storage position can be easily obtained from a record identifier.

[0090] Next, change abolition information is generated (step ST13). That is, for each search information stored in the information storage device 4, the change abolition information fixing part of the change abolition information included in the update information stored in the information storage device 4 is referred to in step ST10, and each search information Change abolition information, which is a set of 1-bit change abolition flags provided corresponding to the search record identifier, is generated as follows and stored in the information storage device 4. FIG. 29 is a diagram showing an example of change abolition information.

[0091] When generating change abolition information, first, each change abolition flag in the change abolition information is set to "0", that is, no change abolition, and then the abolition change of the change abolition information fixed part Data 'fixed part is sequentially referenced from the beginning to the end, and each abolition change data • The change abolition presence / absence flags corresponding to the target record identifier of the fixed part are all set to “1”, that is, there is a change abolition.

[0092] Next, the changed management information is initialized by (Step ST14). That is, changed management information is provided for each update information stored in the information storage device 4, and the initialized version of the changed management information is stored in the information storage device 4. Changed management information is information for managing changed information that is a collection of search records (hereinafter referred to as “changed search records”) obtained by updating with change abolition data. The arrangement power of changed management records provided corresponding to the data is also configured. The changed management record indicates the storage position of the search record obtained by updating the search record targeted by the change abolition data. In this initialization process, an invalid value is set to indicate that there is no corresponding search record in all changed management records. FIG. 30 is a diagram illustrating an example of changed management information and updated information.

Next, search input is performed (step ST15). That is, information for specifying a search target property such as a search by facility name and a search by telephone number, a facility name, and a telephone number is input from the input device 1. In the following, it is assumed that the name of the facility has been entered in order to perform a search based on the facility name.

[0094] Next, the search pointer is initialized (step ST16). That is, the search pointer provided in the internal memory 5a of the processor 5 is set to point to the root node of the search tree. The search pointer consists of search information specification information, pointer type, and record pointer. The search specification information indicates which search information is the search type. The pointer type indicates whether the record pointer is a deviation of the storage position or the record identifier. The record pointer points to the search record using either the storage location or the record identifier according to the pointer type. The search information specification information indicates the search tree-type search information used for facility search, and the search record of the root node is provided at the beginning of the search information. Therefore, the pointer type of the search pointer is the storage location, and the record pointer is Set to “0” respectively.

Next, a search tree-shaped search record is acquired (step ST17). Search record indicated by the search pointer provided in the internal memory 5a of the processor 5 from the search tree-shaped search information (hereinafter referred to as “target search information”) for performing the search input in step ST15 Is acquired. In this case, when the pointer type of the search pointer is the storage position, the search record at the storage position indicated by the record pointer of the search pointer is acquired. On the other hand, when the pointer type of the search pointer is a record identifier, the storage location information to which the new storage location is added is referred to in step ST12, and the storage location record corresponding to the record identifier indicated by the record pointer of the search pointer is referred to. The search record at the indicated storage location is retrieved. In this step ST17, when the step executed immediately before is step ST16, the search record of the root node is acquired, When the step executed immediately before is step ST22, the search record of the child node of the previously acquired search record is acquired.

Next, update processing is performed (step ST18). In other words, for the search record acquired in step ST17 (hereinafter referred to as “update target search record”), update processing is performed using the update information stored in the information storage device 4 corresponding to the target search information. It is. This update process will be described in more detail later. Next, as a result of the update process in step ST18, it is checked whether or not the update target search record is abolishable (step ST19). Here, if it is determined that it is abolished, the sequence proceeds to step ST20, and if it is determined that it is not abolished, the sequence proceeds to step ST21.

[0097] In step ST20, an abolition message is output. That is, the processor 5 sends display data for outputting a message indicating that the facility with the name input at step ST15 has been abolished to the output device 6. As a result, a message indicating that the facility of the name input in the output device 6 has been abolished is output. Thereafter, the sequence returns to step ST15 and a new search process is performed.

[0098] In step ST21, it is checked whether or not the search tree has been searched. More specifically, it is checked whether or not a search record for a node corresponding to the last character of the name input in step ST16 has been acquired in step ST17. If it is determined in step ST21 that the search tree search is not finished, a child node is selected (step ST22). That is, the child node corresponding to the first character of the name input in step ST15 is selected from the child nodes of the search record acquired in step ST17, and the selected child in the search record of the search tree type is selected. The child node pointer of the node is set to the search pointer provided in the internal memory 5a of the processor 5. After that, the sequence returns to step ST17, and the above processing is repeated for the second and subsequent characters of the name.

[0099] In the course of repeated execution of steps ST17 to ST22, when it is determined in step ST21 that the search tree has been searched, that is, the processing for the last character has been completed, the output pointer is then set. (Step ST23). That is, the search information record pointer other than the search record acquired in step ST 17 is stored in the internal memory of the processor 5. It is stored as it is in the output pointer provided in the memory 5a. The other search information record pointer indicates the search record in the basic list type search information storing various attribute information of the facility, and the specified search record indicates the name of the facility input in step ST15. Located at the beginning of the search record that contains it. By the processing in steps ST15 to ST23 described above, the pointer of the search record including the name of the facility input in step ST16 is obtained.

[0100] Next, a list-type search record is acquired (step ST24). That is, a search record in the basic list type search information storing various attribute information of the facility indicated by the output pointer provided in the internal memory 5 a of the processor 5 is obtained from the information storage device 4. In this case, when the pointer type of the search pointer is the storage position, the search record at the storage position indicated by the record pointer of the search pointer is acquired. On the other hand, when the pointer type of the output pointer is a record identifier, the storage location information to which the new storage location is added is referenced in step ST12, and the storage location record corresponding to the record identifier indicated by the record pointer of the search pointer is found. The search record at the indicated storage location is obtained.

Next, update processing is performed (step ST25). That is, the update process is performed on the search record acquired in step ST24, that is, the update target search record, using the update information stored in the information storage device 4 corresponding to the target search information. This update process will be described in more detail later.

[0102] Next, as a result of the update process in step ST25, it is checked whether the update target search record is abolished (step ST26). If it is determined in step ST26 that the facility is abolished, a message indicating that the facility with the name input in step ST15 has been abolished is output from the output device 6 (step ST27). Thereafter, the sequence proceeds to step ST29.

[0103] If it is determined in step ST26 that it is not abolished, then information on the search object is output (step ST28). That is, the facility name, telephone number, postal code, address, and the like stored as attribute information of the search record acquired in step ST24 are output from the output device 6. Thereafter, the sequence proceeds to step ST29. [0104] In step ST29, scroll input by the operator is performed. In other words, the operator uses the input device 1 to determine whether the search record currently output is the power to output the previous search record, the power to output the next search record, or the termination. Instruct. If the end is instructed in step ST29, the sequence returns to step ST15 to prepare for a new search.

[0105] If output of the forward search record is instructed in step ST29, the forward record pointer of the search record obtained by the update process in step ST25 is the output pointer provided in the internal memory 5a of the processor 5 Set to After that, the sequence returns to step ST24. If output of the next search record is instructed in step ST29, the next record pointer of the search record obtained by the update process in step ST25 is an output pointer provided in the internal memory 5a of the processor 5. Set to Thereafter, the sequence returns to step ST24.

[0106] By repeating the processes of steps ST24 to ST31 described above, the attributes of the respective facilities are sequentially output in the order of search records in the order of search records in the forward or backward direction according to the operator's scroll instruction.

[0107] As shown in steps ST17 and ST24 above, search information with new information added to determine whether it is an existing search record or a new search record can also acquire the search record, so the processing is faster. Can be done. Also, by adding the new storage location information to the information storage location, and by making the record identifier a consecutive number, the storage location of the required record identifier without determining whether it is an existing search record or a new search record Since the records are immediately divided, the required search records can be obtained more quickly. Further, as described above, the search process can be performed using the update target search record changed in the update process without rewriting the search information.

Next, details of the update processing performed in steps ST18 and ST19 in FIG. 26 will be described with reference to the flowchart shown in FIG. In this update process, the update target search record acquired in step ST17 and step ST24 in FIG. 26 is updated. Note that the processing of steps ST15 to ST31 in this update processing corresponds to the change abolition means of the present invention. [0109] In the update process, first, the search record identifier of the update target search record is acquired (step ST100). Next, it is examined whether there is any change abolition (step ST101). That is, the information on whether or not the change is abolished is checked by referring to the information on whether or not the change is abolished in the information storage device 4 and the change abolition existence flag of the search record identifier acquired in step ST100. If it is determined in step ST101 that the change is not abolished, the update process is terminated without updating the update target search record. As described above, since the search record that does not need to be changed or abolished by referring to the information about whether or not the change is abolished is configured not to perform the processes after step ST102, the search process can be speeded up.

[0110] On the other hand, if it is determined in step ST101 that there is a change abolition, change abolition information is searched (step ST102). That is, the change abolition information fixed part is searched, and the change abolition data 'fixed part at the head of the change abolition data' fixed part with the search record identifier acquired in step ST100 as the target record identifier is acquired. At this time, the obtained change abolition data 'fixed part record number is stored in the change abolition data acquisition number provided in the internal memory 5a of the plug processor 5. This record number indicates the order of arrangement of the abolition data 'fixed part. In this way, it is possible to obtain information necessary for updating by searching for change abolition information that unifies information of internal changes, abolitions, and order changes into one, so that faster processing is possible.

[0111] Next, whether or not the change abolition information indicates the abolition! / Is checked (step ST103). This is done by checking the abolition flag in the operation information of the change abolition data “fixed part” acquired in step ST102 or ST114. If it is determined in this step ST103 that it is abolished, a message that the update target search record is abolished is output (step ST104). Thereafter, the update process ends.

[0112] If it is determined in step ST103 that the search record is not abolished, it is then checked whether there is a changed search record (step ST105). That is, a changed management record corresponding to the change abolition data 'fixed part acquired in step ST102 or ST114 is acquired from the changed management information, and it is checked whether or not the acquired changed management record is an invalid value. It is done. In this case, if it is not an invalid value, the modified search It is determined that there is a record.

[0113] If it is determined in step ST105 that there is a changed search record, the changed search record is acquired (step ST106). That is, a changed search record at the storage location indicated by the changed management record acquired in step ST105 is acquired from the changed information. Next, the search record is replaced (step ST107). In other words, the update target search record is replaced with the changed search record acquired in step ST106. Thereafter, the update process ends.

[0114] If it is determined in step ST105 that there is no changed search record, that is, the changed management record is an invalid value, it is recognized that there is no changed search record.

Then, it is checked whether there is a forward change (step ST108). That is, the forward change flag of the operation information of the change abolition data “fixed part” acquired in step ST102 or ST114 is examined.

[0115] If it is determined in step ST108 that there is a forward change, the forward change is performed (step ST109). In other words, the change abolition data obtained in step ST102 or ST114 from the change abolition information variable part 'change abolition data variable part of the fixed part change abolition data at the storage position indicated by the storage position . Then, the pointer type of the forward record pointer of the search record to be updated is set as the record identifier, and the record pointer is set as the forward record identifier of the change abolition data “variable part acquired as described above”. If it is determined in step ST108 that there is no forward change, the process of step ST109 is skipped.

[0116] Next, it is checked whether there is a next change (step ST110). That is, the next change flag in the operation information of the change abolition data “fixed part” acquired in step ST102 or ST114 is checked. If it is determined in step ST110 that there is a next change, then the next change is performed (step ST111). That is, from the change abolition information variable part, the change abolition data acquired in step ST102 or ST114 'change abolition data' variable part at the storage position indicated by the change abolition data variable part storage position of the fixed part is acquired. Then, the pointer type of the next record pointer of the search record to be updated is set as a record identifier, and the record pointer is obtained as described above. Change abolished data 'is the forward record identifier of the variable part. If it is determined in step ST110 that there is no next change, the processing in step ST111 is skipped.

[0117] Next, it is checked whether there is an internal change (step ST112). That is, the internal change flag of the operation information of the change abolition data “fixed part” acquired in step ST102 or ST114 is checked. If it is determined in step ST112 that there is an internal change, then the internal change is performed (step ST113). That is, the change abolition data / variable part at the storage position indicated by the change abolition data acquired in step ST102 or ST114 is stored from the change abolition information variable part. Then, the update target search record is updated according to the instruction of the change abolition data-change data change record acquired as described above. If it is determined in step ST112 that there is no internal change, the process of step ST113 is skipped.

[0118] Next, the next change abolition data is acquired (step ST114). In other words, the change abolition data acquisition number provided in the internal memory 5a of processor 5 is increased by `` 1 '', and the change abolition data indicated by the change abolition data acquisition number Obtained from obsolete information.

[0119] Next, it is examined whether or not the target record identifier has changed force (step ST115).

That is, it is checked whether or not the update record identifier of the change abolition data acquired in step ST114 matches the search record identifier acquired in step ST100. If it is determined in this step ST115 that the target record identifier has changed, the search record is registered (step ST116). In other words, the update target search record power changed by the processing of steps ST108 to ST113 is added to the end of the changed information, and corresponds to the change abolition data 'fixed portion obtained in step ST102 or ST114 of the changed management information The storage location of the update target search record is stored in the changed management record. Thereafter, the update process is terminated.

[0120] If it is determined in step ST115 that the target record identifier does not change, the sequence returns to step ST103, and the above-described processing is repeated. By the processing of these steps ST114 and ST115, a plurality of the same search records are processed. Can be changed or abolished by change abolition data

[0121] Note that the processing of steps ST17 and ST24 by the information storage device 4 and the processor 5 corresponds to search information acquisition means. The processing of steps ST102 to ST104 and the processing of steps ST108 to ST115 shown in FIG. 31 of the information storage device 4 and the processor 5 correspond to search information updating means. The processing of step ST11 by the information storage device 4 and the processor 5 corresponds to the newly added information adding means. The processing of steps ST108 to ST111 by the information storage device 4 and the processor 5 corresponds to the order changing means. The processing of step ST12 by the information storage device 4 and the processor 5 corresponds to storage position correction means and storage position information addition means. The processing of step ST13 by the information storage device 4 and the processor 5 corresponds to the change abolition information generation means. The processing of steps ST100 and ST101 by the processor 5 corresponds to the means for determining whether or not to abolish the change. The processing in step ST116 by the processor 5 corresponds to the changed information storage means. The processing of steps ST105 to ST107 by the processor 5 corresponds to the changed search record acquisition means.

[0122] As shown in steps ST108 to ST111, the search record ordering can be changed without changing the physical storage order of the search records in the search information to which the new information is added. Also, as shown in steps ST24 to ST31, since the ordering has been changed in step ST25, including the new information, the search information before addition and the new information search records are sorted for scrolling. There is no need to fix it.

Further, as described above, the update processing shown in FIG. 31 can also be applied to the update of the shift of the search tree type search information and the list type search information, and the update processing is related to the type of the search information. It is possible to unify update processing and improve software development efficiency.

[0124] Embodiment 2.

The second embodiment of the present invention is such that a plurality of versions of update clusters are stored in the update DVD-ROM of the first embodiment. The configuration of the information processing apparatus according to the second embodiment is the same as the configuration of the information processing apparatus according to the first embodiment shown in FIG.

FIG. 32 is a diagram showing an example of the data structure of the update cluster stored in the update medium (update DVD-ROM) used in the information processing apparatus according to the second embodiment. This update medium contains multiple update clusters and update volume management information for managing them. Stored. More specifically, the update media includes an update cluster 1 that updates the search information of the first edition to the search information of the first edition, an update cluster 2 that updates the search information of the first edition to the search information of the second edition, · · · Update cluster to update to all versions, such as update cluster (YO + X) that updates the search information of the (YO + X—1) version to the latest (YO + X) version of search information Is stored. YO is the version number of the search information stored in the information storage device 4 of the information processing apparatus. The search information of the information processing apparatus includes update cluster (YO + 1), update cluster (Y0 + 2). ),..., And the update cluster (YO + X) is updated sequentially to obtain the latest version of search information.

Next, the operation of the information processing apparatus according to Embodiment 2 of the present invention configured as described above will be described. The operation of this information processing apparatus is configured by replacing steps ST10 to ST14 of the information processing apparatus according to Embodiment 1 shown in the flowchart of FIG. 26 with the processing shown in the flowchart of FIG. Hereinafter, only the parts different from the first embodiment will be described with reference to the flowchart of FIG.

[0127] First, the acquisition update cluster version number is initialized (step ST200). Specifically, the acquisition update cluster version number provided in the internal memory 5a of the processor 5 is added to the search information version YO stored in the information storage device 4 of the information processing device by adding “1”. It is initialized to the value (YO + 1). Next, update information is acquired (step ST201). That is, an update cluster for updating to the version indicated by the acquired update cluster version stored in the internal memory 5a of the processor 5 is read from the update DVD ROM attached to the update information acquisition device 3. It is stored in the information storage device 4.

[0128] Next, new information is added (step ST202). That is, new information stored in the information storage device 4 as update information is added to the end of each search information stored in the information storage device 4 in step ST201. As a result of the processing in step ST202, new information corresponding to the update clusters (YO + 1) to (YO + X) is cumulatively added to the end of the original search information.

[0129] Next, the new storage location information is added (step ST203). That is, the new storage location information stored in the information storage device 4 as update information in step ST201 is added to the end of the corresponding storage location information stored in the information storage device 4. This At this time, the storage position is corrected in the same manner as in step ST12 of FIG. As a result of the processing of step ST203, the new storage location information corresponding to the update clusters (YO + 1) to (YO + X) is cumulatively added to the end of the original storage location information.

[0130] Next, integration change abolition information is generated (step ST204). In other words, when the acquired update cluster version number stored in the internal memory 5a of the processor 5 is (YO + 1), for each change abolition information of the update cluster (YO + 1), the copy is information as the integrated change abolition information. Stored in storage device 4. In addition, when the acquired update cluster version number stored in the internal memory 5a of the processor 5 is other than (YO + 1), the update indicated by the acquired update cluster version number stored in the internal memory 5a of the processor 5 Each change abolition information (integration source change abolition information) of the cluster is integrated with the integration change abolition information stored in the corresponding information storage device 4. The process of step ST204 by the information storage device 4 and the processor 5 corresponds to the integrated update information generation means.

[0131] In the above integration process, the change abolition data fixing part of the integration source change abolition information is inserted into the integration change abolition information fixing part in ascending order of the target record identifiers. If the target record identifier is the same, a new version revision abolition data fixed part is inserted later. Also, the integration source change abolition information variable part is added to the end of the integration change abolition information variable part. In addition, the change abolition data of the integration source change abolition information inserted in the integration change abolition information fixed part The change abolition data variable part storage location in the fixed part is stored in the integration source change abolition information variable part. It is changed to the storage position after being added to the end of the copy.

[0132] Through the processing of step ST204, the change abolition information of each version can be integrated into one integrated update change information sorted by the target record identifier. By referring to this integrated update change information, Therefore, it is possible to efficiently obtain the desired record identification abolition data and improve the processing speed.

[0133] Next, whether or not it is the latest version is checked (step ST205). That is, the acquired update cluster version number stored in the internal memory 5a of the processor 5 is checked. If it is determined in this step ST205 that it is not the latest version, that is, it is not (YO + X), the acquired update cluster version number is updated (step ST206). That is, the acquired update cluster version number stored in the internal memory 5a of the processor 5 is increased by “1”, and the next version is updated. A new cluster is specified. Thereafter, the sequence returns to step ST201, and the above-described processing is repeated.

[0134] If it is determined in step ST205 that it is the latest version, that is, (YO + X), it is recognized that the update cluster processing for the latest version has been completed, and then the change is abolished. Is generated (step ST207). That is, for each search information stored in the information storage device 4 to which the new information of the update cluster of each version is added, the integrated change abolition information of the information storage device 4 obtained by the above processing is referred to. Change abolition presence / absence information, which is a set of 1-bit change abolition presence / absence flags provided corresponding to each search record identifier of the search information, is generated in the same manner as the process of step ST13 in FIG. Stored in 4.

[0135] Next, the changed management information is initialized (step ST208). That is, for the integrated change abolition information stored in the information storage device 4, changed management information is provided in the same manner as in step ST14 of FIG. 26, and the changed management information is initialized as the information storage device. Stored in 4.

Then, the process proceeds to step ST15 in the flowchart shown in FIG. 26, and the same processing as in the first embodiment is performed. However, integrated change abolition information is used instead of the change abolition information in the first embodiment.

[0137] In the first and second embodiments described above, as a means for obtaining the update information, another memory such as a memory card that can obtain the update information stored in the DVD-ROM is used. It can also be configured to acquire the medium force, or can be configured to acquire from other devices using the communication means.

[0138] Further, although the storage position of the search record is used as a pointer pointing to another search record of the search information, the record identifier of the search record may be used. In addition, the changed search record is stored in the information storage device 4 and, if there is a changed search record, the changed search record is referred to. However, the changed search record is referred to as the information storage device 4. The search record can be changed every time the search record is acquired without being stored in.

[0139] Also, the new information added to the search information is configured to be deleted from the information storage device 4. You can also. The new storage location information added to the storage location information is stored in the information storage device.

It can also be configured to be removed from 4. Further, the change abolition information integrated with the integrated change abolition information can be configured to be deleted from the information storage device 4. Further, the new information can be added to the search information of the information storage device 4 without being stored in the information storage device 4. In addition, the new information can be added to the search additional information of the information storage device 4 without being stored in the information storage device 4. In addition, the change abolition information is not stored in the information storage device 4 but can be integrated into the integrated change abolition information of the information storage device 4.

[0140] The effects of the invention ascertained by the first embodiment and the second embodiment described above will be described below in correspondence with the claims.

[0141] According to the invention described in claim 1, since the record identifiers having consecutive numbers are assigned to the search records, the search records can be easily acquired. In addition, by assigning a unique and unchanging record identifier to the search record and instructing the search record to be changed or abolished using the record identifier, the change is abolished regardless of the storage location of the search record. Information can be obtained. As a result, an increase in update information can be prevented, and search records can be correctly changed and abolished for any version of search information. In addition, since the search record to be updated is specified using the record identifier that does not depend on the data structure of the search information, any type of search information can be updated using a single processing program. .

[0142] According to the invention of claim 2, a record identifier that does not depend on the version of the search information or the storage position of the search record is used as a pointer that points to another search record included in the change information. Therefore, change abolition information can be obtained without depending on the storage location of the search record. As a result, it is possible to prevent an increase in update information, and to correctly change or abolish search records for any version of search information. In addition, since a record identifier that does not depend on the data structure of the search information is used as a pointer to the other search records included in the change information, a single processing program can be used for any type of search information. Can be updated. In addition, because information indicating the abolition and internal change of search records is stored in a single abolition information, multiple information must not be referenced separately. Thus, the search information can be updated, and the processing speed can be increased.

[0143] According to the invention described in claim 3, the record identifier can be used as a pointer pointing to another search record included in the newly provided search record without depending on the version of the search information or the storage location of the search record. Because it was used, new information can be attached to any version of search information consistently. In addition, since consecutive numbers are used as record identifiers, it is easy to obtain a search record for a desired record identifier. In addition, since the new information is added to the end of the search information without acquiring (reading) the search information, the processing time for acquiring the search information can be reduced. In addition, since new search information to which new information is added can be obtained, it is not necessary to search for two types of information such as search information and new information in the search process, and the search process can be speeded up.

[0144] According to the invention described in claim 4, since the search information version and the record identifier independent of the storage position of the search record are used to specify the forward search record and the next search record, which version It is possible to correctly change the order of the search information. In addition, since the order relationship of search records can be changed without changing the storage order of search records for new search information obtained by adding new information to the search information, the search process can be speeded up. In addition, since the search information after the change is made by adding the new information to the original search information, the required search record included in the original search information and the required search record included in the new information are acquired. Later, since it is not necessary to sort these search records, the search process can be performed at high speed.

[0145] According to the invention described in claim 5, when a search record having a desired record identifier is acquired, the storage position of the search record can be obtained from the storage position information. Can retrieve search records. According to the invention described in claim 6 and claim 7, when a new search record having a desired record identifier is acquired, the storage position of the search record can be obtained from the new storage position information. The desired search record can be acquired in a shorter time.

[0146] According to the invention described in claim 8, for example, a file containing storage location information and a file containing new storage location information can be integrated into one file. The same file regardless of whether it is a new search record Since the force storage position can be acquired, the processing speed can be improved. According to the invention described in claim 9, when obtaining a desired search record, the presence / absence of change abolition information related to the search record can be immediately identified by referring to the change abolition information. It is possible to save the trouble of searching for update abolition information and confirming that there is no corresponding change abolition information for search records that do not exist, and improve the processing speed.

[0147] According to the invention of claim 10, a single integration sorted by record identifier is performed in comparison with the case of searching for change abolition information for each version and acquiring information for updating a desired record identification. Since the information for updating the desired record identification can be acquired from the update change information, the processing speed can be improved. According to the invention described in claim 11, since the pointer is the storage position of the search record to be pointed, compared to the case where the pointer is a record identifier, the time and effort for referring to the storage position information can be saved and the processing speed can be improved. Is possible.

[0148] According to the invention described in claim 12, by referring to the search record of changed information, it is not necessary to update the search record every time, so that the processing speed can be improved. According to the invention described in claim 13, since it is possible to update the search information of any version using the common update information, the processing speed can be improved. Also, any type of search information can be updated using a single processing program.

[0149] According to the invention described in claim 14, common update information can be applied to any version of search information, and an information processing apparatus capable of improving the processing speed can be realized. In addition, any kind of search information can be updated using a single processing program. According to the invention described in claim 15, the common update information can be applied to any version of the search information, and an information processing apparatus capable of improving the processing speed can be realized. In addition, any kind of search information can be updated using a single processing program.

Industrial applicability

[0150] As described above, the present invention can be widely applied to information processing apparatuses having an information search function such as a navigation system.

Claims

The scope of the claims

[1] Search information storage means for storing search information that is a collection of search records to which record identifiers that are unique and invariant consecutive number powers are assigned;

Update information including change abolition information that indicates, using a record identifier, a search record to be changed or abolished among search records constituting the search information stored in the search information storage means is acquired. Update information acquisition means;

Search information acquisition means for acquiring search records constituting search information stored in the search information storage means;

Change to change or abolish the search record indicated by the record identifier in the change abolition information included in the update information acquired by the update information acquisition means in the search record acquired by the search information acquisition means Deprecation means

An information processing apparatus comprising:

[2] The change abolition information includes the target record identifier that is the record identifier of the search record whose content is to be changed or abolished, the operation information that instructs the content change or abolition, and the content change is instructed by the operation information. In addition, it includes change information for changing the contents of the search record, and a record identifier is used as a pointer to point to another search record included in the change information.

The change abolition means outputs information indicating that the target search record has been abolished when the abolition is instructed by the operation information included in the abolition information, and the internal change is instructed by the operation information. Output the search record after the content of the search record indicated by the target record identifier has been changed according to the change information.

The information processing apparatus according to claim 1.

[3] The update information is also a unique and invariant number, and a newly set search record with a record identifier consisting of consecutive numbers following the number used for the record identifier of the search information. A record identifier is used as a pointer that includes new information that is an aggregate and points to other search records included in the search records that constitute the new information.

Search for new information included in update information acquired by update information acquisition means 2. The information processing apparatus according to claim 1, further comprising new information addition means for adding to the search information stored in the storage means.

[4] The operation information indicates whether the abolition, content change or order change is! /, Or any deviation, and the target information included in the change abolition information used when the order change is instructed by the operation information. It includes a forward record identifier that is the record identifier of the search record that corresponds to the front of the search record indicated by the code identifier, and a next record identifier that is the record identifier of the search record that corresponds to the next of the search record indicated by the target record identifier. ,

According to the operation information indicating the order change, the forward record identifier is output as the record identifier of the search record corresponding to the front of the search record indicated by the target record identifier, and the search record corresponding to the next of the search record indicated by the target record identifier To change the order in which the next record identifier is output as the record identifier

The information processing apparatus according to claim 2, further comprising:

[5] Storage position information storage means for storing storage position information for associating the record identifier with the storage position of the search record included in the search information

The information processing apparatus according to claim 1, further comprising:

[6] The update information acquisition means acquires new storage location information that associates the record identifier with the storage location of the search record included in the new information.

The information processing apparatus according to claim 3.

[7] The update information acquisition means acquires the new storage location information that associates the record identifier with the storage location of the search record included in the new information.

The information processing apparatus according to claim 4, wherein:

[8] The update information acquisition means acquires new storage location information that associates the record identifier with the storage location of the search record included in the new information.

6. The information processing apparatus according to claim 5, wherein

[9] Storage position correction means for correcting the storage position of the newly established search record indicated by the new storage position information acquired by the update information acquisition means to the storage position when the new information is added to the search information; ,

The new storage position information corrected by the storage position correction means is stored at the end of the storage position information. Storage position information adding means to be added to the tail

The information processing apparatus according to claim 6, further comprising:

[10] Storage position correction means for correcting the storage position of the newly established search record indicated by the new storage position information acquired by the update information acquisition means to the storage position when the new information is added to the search information; ,

Storage position information adding means for adding the new storage position information corrected by the storage position correcting means to the end of the storage position information

The information processing apparatus according to claim 7, further comprising:

[11] Storage position correction means for correcting the storage position of the newly established search record indicated by the new storage position information acquired by the update information acquisition means to the storage position when the new information is added to the search information; ,

The information processing apparatus according to claim 8, further comprising:

[12] Change abolition information that uses the update information acquired by the update information acquisition means to generate change abolition information that indicates whether or not search records have been abolished, changed, or ordered. Generating means;

A change abolition necessity determination means for determining whether to refer to the change abolition information by referring to the change abolition information generated by the change abolition information generation means. 1. The information processing apparatus according to 1.

[13] Integrated update information generation means that integrates multiple versions of change abolition information acquired by the update information acquisition means into one, and generates integrated update information in which the change abolition information is sorted by the record identifier to be updated

The information processing apparatus according to claim 1, further comprising:

[14] The pointer pointing to another search record in the search information is the storage location of the search record pointed to

The information processing apparatus according to claim 1.

[15] Search records of search information based on the change abolition information acquired by the update information acquisition means Changed information storage means for storing changed information as a result of the change, and changed search record acquisition means for acquiring a desired search record from the changed information stored by the changed information storage means

The information processing apparatus according to claim 1, further comprising:

[16] storing search information that is a collection of search records to which record identifiers having unique and invariant sequential number powers are assigned;

Obtaining update information including change abolition information indicating a search record to be changed or abolished using a record identifier among search records constituting the stored search information;

The step of changing or abolishing the search record indicated by the record identifier in the change abolition information included in the acquired update information in the search records constituting the stored search information

An information processing method comprising:

[17] Search information consisting of a collection of search records with unique and invariant sequential number identifiers, and

Storage location information that associates the record identifier with the storage location of the search record that constitutes the search information

The storage medium which memorized.

[18] New information that is a set of newly created search records, each of which is a unique and invariant number, and is given a record identifier consisting of a consecutive number following the number used for the record identifier of the search information. When,

New storage location information that associates the record identifier with the storage location of the search record included in the new information,

Corresponds to the target record identifier that is the record identifier of the search record, and includes operation information that indicates either change, abolition, or order change. If the operation information indicates a change, the search record indicated by the target record identifier is further changed. If the record identifier of the search record indicated as a pointer indicating other search records included in the change information is used and the operation information indicates a change in order, A forward record identifier that is a record identifier of a search record corresponding to the front of the search record indicated by the target record identifier, and a next record identifier that is a record identifier of the search record corresponding to the next of the search record indicated by the record identifier A storage medium that stores change abolition information including