JPH07262212A - Link maintenance management method - Google Patents

Abstract

PURPOSE:To efficiently generate a link for a new map through the use of an old map in a system where the map is associated with DB. CONSTITUTION:A link maintenance preprocessing 100 inputs a link bundle for the old map, which previously associates customer DB with the old map, and moves the position of the link on the map to the center of a closed area to which the position of the link on the map is made to correspond. Then, link bundle DB for the old map is updated by a coordinate on the map in the link after it is moved. In a link maintenance processing 200, link bundle DB for the old map which is updated in the link maintenance pre-processing is inputted, and link bundle DB for the map is newly generated. In a link quality recognition processing 300, link bundle DB for the new map generated in the link maintenance processing, the new map and customer DB are inputted, the contents of customer DB are sequentially displayed on the map of a display screen with an arrow pointing the position on the map in accordance with the link of link bundle DB for the new map on the screen and the recognition input of an operator is received.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of maintaining and managing information in which image information and code information are associated with each other, and particularly, when existing image information associated with the image information is replaced with new image information, the existing relationship is changed. The present invention relates to a link management method that reuses attached information.

[0002]

2. Description of the Related Art Conventionally, there has been a system for associating (making a link with) an image map and code information for searching.
In the following, associating the image map with the code information is expressed as "linking" ,. In the past, there have been many systems that search the contents of files, especially from image maps.

Conventionally, the above-mentioned system is often used for a routine work (for example, a system for knowing the flight route from the airport from the position of the airport on the map). When the information about the map has been changed for a certain period of time, the links have been completely rebuilt.

The association between the code information 600 and the image information 500 will be described with reference to FIG. Hereinafter, a map will be described as a representative example of image information, and a customer DB will be described as a representative example of code information. In FIG. 2, the relationship between each record in the customer DB and the coordinates on the image is expressed by a set of each record number and the coordinates on the map. Hereinafter, such an association is referred to as a "link", and the information for establishing the association is the link information. Some link information is held in the link bundle DB 400 as shown in FIG.

[0005]

When an image map is used in planning work, the link that associates the image map with the DB that stores the code information is often changed. This is natural because in planning work, the perspective of things changes depending on the situation. Also, the maps used are often modified.

In such a case, conventionally, all links have been newly recreated, but this has been a large cost burden. For example, it takes about 10 days to link 100,000 links. Due to such problems, even if the map system itself was used at the beginning of construction, it was often not used.

To solve this problem, Toshiaki Sakaguchi et al .:
"Image Map-Proposal and Effect of Character Cursor Method for DB Link Setting" March 26, 1993, Information Processing Society of Japan, both search (image map to DB, DB to image map) A character cursor function has been proposed for a system that enables search. However, it is an effect of halving the required man-hours,
No drastic improvement.

An object of the present invention is to provide a method for easily maintaining and managing link information that associates image information with code information. Further, another object of the present invention is to provide a method for reducing an error in link information, that is, an error in setting a position on a map corresponding to a record included in a DB.

[0009]

The above object is realized by the following procedure. Hereinafter, a DB that stores a plurality of pieces of link information is called a link bundle DB.

(1) Link maintenance pre-processing-The old map link bundle DB in which the customer DB and the old map are already associated is input. -Move the position of the link on the map to the center of the associated closed area.・ Link bundle DB for old map according to the coordinates on the map corresponding to the link position after moving the link position to the center of the closed area
To update.

(2) Link maintenance processing-The old map link bundle DB updated in the link maintenance preprocessing
, And copy it to create a new map link bundle.

(3) Link quality confirmation processing-New map link bundle DB created by the link maintenance processing,
Input a new map and customer DB. -An arrow pointing to a position on the map corresponding to the contents of the customer DB is sequentially displayed on the map on the display screen according to the link of the new map link bundle DB, and the confirmation input of the operator is accepted each time. If there is a change in the link, the new map link bundle DB is updated based on the operator's instruction, and the new map link bundle DB is updated with the confirmed link.

[0013]

In the link maintenance processing according to the present invention, the position of the link on the map is moved to the center of the closed area on the corresponding map, so that even if the position of the new map to be newly associated is displaced, the position on the map is changed. Errors in the correspondence between the closed area and the coordinates of the points of the link can be reduced. In the link maintenance process,
When a new map link to be newly associated is created, the new map link bundle DB is created based on the previously created old map link bundle DB, so that the creation burden of the new map link can be reduced. In the link quality confirmation process, the links in the new map link bundle DB created in the link maintenance process are
Since it is automatically displayed on the screen whether the new map is supported or not and the confirmation of the operator is accepted, the error of the newly created link can be efficiently corrected.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described in detail below with reference to the drawings. FIG. 1 shows an outline of processing of the present invention. The processing according to the present invention is executed in order to reduce an error in the link correspondence relationship when newly associating the new map 500-2 with the customer DB 600, and the link maintenance preprocessing 100 and the old map link bundle. A screen for confirming and updating the link bundle DB400-2 for new map based on the new map 500-2 and the customer DB600, and the link maintenance process 200 for copying the DB400-1 to generate the link bundle DB400-2 for new map. It comprises the link quality confirmation processing 300 performed above.

In the link maintenance preprocessing 100, the old map 50 is used.
0-1 and the old map link bundle DB 400-1 are input, the link point is moved so that the link point is located at the center of each closed region, and the old map link bundle DB is moved by the moved link point.
Will be updated. Next, in the link maintenance processing 200, the old map link bundle D created in the link maintenance preprocessing 100.
B400-1 is input, and this is copied to create a new map link bundle DB 400-2. Further, the link quality confirmation processing 300 includes the new map link bundle DB 400-2, the new map 500-2, and the customer D created in the link maintenance processing 200.
B600 is input, the contents of the customer DB 600 are sequentially displayed on the map, the operator's confirmation input is received, and if there is a change in the link, a new map link bundle DB based on the operator's instruction
400-2 is updated, and the new map link bundle DB is updated with the confirmed link.

In the present invention, the pre-link maintenance process, the link maintenance process, and the link quality confirmation process are combined, but it is also possible to perform each independently.

1. System Configuration FIG. 3 shows the system configuration of a computer that implements the present invention.
The CPU 1 on which the method of the present invention is executed, code information (customer DB 600) and image information (new and old map 500-1,
2) in which 2) is stored, an input device 4 (hereinafter referred to as a mouse) that accepts an operator's instruction, a memory 4 in which the programs and data of the present invention are stored, and a display device 5 are bus lines 6 Are connected to each other via.

2. Related Tables As related tables, a customer DB 600 that holds code information, a map DB 800 that manages maps, a link bundle DB 400 that is a set of links, and a plurality of link bundles D
There is a link management DB 700 that manages B.

In FIG. 1, the link information is stored in the link bundle DB 40.
However, in the present embodiment, a link management DB 700 is newly provided in order to manage links between a plurality of DBs and a plurality of image maps. Further, in this embodiment, a map DB 800 is provided to manage a plurality of image maps having different reference points. Here, the reference point is the coordinates of the origin of each image map, and the coordinates of the reference point on the earth are relative to each. Hereinafter, each DB will be described.

(1) Customer DB FIG. 4 shows an example of the structure of the customer DB 600. Customer DB60
0 is record number 601, customer number 602, name 60
3, gender 604, address 605, and date of birth 606
5 attribute items.

(2) Map DB FIG. 12 shows an example of the structure of the map DB 800. Map DB
Is composed of a map storage image number 802 and coordinates 801 of a reference point of the image.

(3) Link DB, Link Bundle DB FIG. 5 shows a configuration example of the link DB 700 and the link bundle DB 400. The link DB 700 is a plurality of link bundle DB4.
Information for managing 00, link attribute 701,
Creator name 702, creation date 703, link identifier 70
4, the link bundle DB number 705, and the number of links 706 of each link bundle are included. Link attribute 70
1 is composed of a link definition 711 and a used method 712, and the data identifier 704 is composed of a DB number 741 and an image number 742.

The link bundle DB 400 is composed of map coordinates 402 of links and a record number 401 of code information. The link bundle DB number 705 of the link DB 700 is
The link bundle DB 400 holding the links between the customer DB 600 and the map 500 which are related to each other is shown.

3. Process Flow The process flow of the present invention is shown in FIG. The entire process is performed in the order of link maintenance preprocessing 100, link maintenance processing 200, and link quality confirmation processing 300.

(1) Link maintenance preprocessing 100 The flow of the link maintenance preprocessing 100 is shown in FIG. 7, and a screen display example is shown in FIG. When the position of the link is near the edge (boundary line) of the target area on the old map, when the link is copied between the image maps, the position of the link may change due to positioning error or partial change of the map. There is a case that the map is shifted and a link is set up in an area different from the target area. An example thereof is shown in FIG. In FIG. 8, 71, 74
Is a target area on the map, 72 is a link, and 73 is a target area boundary. As shown in FIG. 8A, the link 72 is the target area 7
Since it is near the boundary 73 between 1 and 74, if the position of the boundary 71 between the old map and the new map deviates even a little, the link 72 that was in the target area 71 on the old map is changed to the one shown in FIG. As shown in b), the user will mistakenly enter the adjacent area 74.

Therefore, in the present invention, as shown in FIG. 9, the old map link 72 is positioned in the center of the target area before changing the link bundle DB 400 so that the old map link 72 does not become the end of the target area. Move (s72).

In an actual map, the line surrounding the target area, which is closed in the original, may be a partially open area due to various causes during the printing process.
In the present invention, a function of detecting this open region and correcting it into a closed region is provided.

The flow of the link maintenance processing 100 will be described below with reference to FIG.
The flowchart will be described. Link maintenance preprocessing 1
00 is "initial setting" (step 1
701, 1702 and 1720), “Correction of relation between closed region and link point” (steps 1703 to 1709, 172).
1, 1723, and 1725) and "moving the link point to the center of the bad area" (steps 1710, 1724, and 1712). First, a map to be maintained and a DB menu are displayed (1701). When the operator inputs the map to be maintained and the designation of the DB from the input device 3 (1720), the designated map is stored in the memory and displayed on the display device 5 (170).
2). At that time, link information including the designated DB name is read from the link bundle DB 400-1 via the link DB 700 (1703), and link points are displayed on the displayed map (1704). An example of the display screen is shown in FIG. In each target area included in the map display screen 81 of FIG. 10, a plurality of link points 72a-i are displayed, and further, a code information display field 83 is displayed.

Next, the contents of the link bundle DB are sequentially read (1705), and the code information linked by the link is read from the customer DB 600 using the record number and displayed in the code information display field 83. (1706). Figure 10
Indicates that the position of the record whose customer name in the code information is "Kazuo Toda" is displayed as "Toda" on the image map and corresponds to the target area including the link point 72a.

Next, from the coordinates of the read link on the map, that is, the coordinate values of the link point 72 on the map, it is determined whether or not the link is included in a closed area having a predetermined area or less (1707). ). In addition, in determining the closed region at this time, B
A filling algorithm such as that used by the ASIC language PAINT command can be used. Step 17
As a result of the determination in 07, when the point connected by the link is included in the closed region having a certain area or less, the process proceeds to step 1710. When the link point 72 is not included in the closed area having a predetermined area or less, the area including the link point 72 is likely to be an open area, and thus the closed area including the link point 72 is colored and presented to the operator. (1708).

Next, the operator inputs the result of determination as to whether or not the relationship between the closed area and the link point 72 is correct via the input device 3 (1725). The judgment result (1721)
Accordingly, if there is an error in the division of the closed area, the old map image map 500-1 is corrected using the input device 3 (1723). Similarly, from the determination result (1721), if the coordinates of the link point 72 are incorrect, the link point 7 in the old map link bundle DB 400-1 is input using the input device 3.
The coordinates on the map corresponding to 2 are corrected (1709). If it is determined that the correction is unnecessary, the process proceeds to step 1710.

Next, it is determined whether the link point 72 is in the center of the closed area (1710). If the link point 72 is in the center of the closed region, the process proceeds to step 1712, and if the above process for all links is completed, the preprocess 100 is performed.
Is completed (1712), and if not completed, the process returns to step 1705 to repeat the above process for the next link.

On the other hand, if the result of determination in step 1710 is that the link point 72 is not in the center of the closed area, the link point 72 is moved to the center of the closed area. That is, the on-map coordinates corresponding to the link point 72 in the old map link bundle DB 400-1 are changed. As the procedure of the movement processing, 1) it is determined whether the closed region is concave or convex, and 2) when the closed region is convex, the center of gravity of the closed region is the link point 72.
3) When the closed region is concave, the inside of the closed region is divided into meshes in both the X and Y axes, and among the intersections of the line segments of the mesh division,
The intersection point having the maximum distance from the boundary of the closed region is set to the link point 72.

In the above description, when the link point 72 is not near the center of the closed area, the process for moving the link point 72 to the center is automatically performed, but the operator performs this process. It is also possible to carry out via.

(2) Link maintenance processing 200 In the link maintenance processing 200, the old map link bundle DB 400-1 processed in the link maintenance preprocessing 100 is copied and corrected, and the new map link bundle DB 400-
Create 2. In the present embodiment, first, in order to create the link bundle DB 400-2 for the new map, the link management DB 7
You need to add a record to 00.

The flow of the link maintenance process 200 will be described below with reference to FIG.
This will be described using 1. First, a new record for managing the new map link bundle DB 400 that associates the new map 500-2 with the DB 600 is newly added to the link management DB 700 (1
031). Next, a record for the new map 500-2 is newly added to the map DB (1032). At this time, FIG.
The reference point coordinates of the new map and the map storage image number are set in the reference point coordinates 801 column of the record of the map DB shown in FIG. Next, all the records in the link bundle DB 400-1 of the old map are sequentially read, and the link bundle DB 400 for the new map is read.
-2 is copied (-1033). Link bundle D for new map
When copying the record to B400-2, if the new map and the old map have different reference point coordinates, the link bundle DB for the new map
Copying is performed while correcting the coordinates on the map. The coordinates on the map of the link bundle DB 400-2 for the new map are (Equation 1)
Is corrected as follows.

Coordinates on map of link DB for new map = Coordinates on map of link bundle DB for old map + Reference coordinates of old map-
Reference coordinates of new map (Equation 1) (3) Link quality confirmation processing 300 The flow of the link quality confirmation processing 300 executed after the link maintenance processing 200 will be described with reference to FIG. A pseudo display function for link creation work is added for quality confirmation.
This function displays a part of the code information extracted from the DB, which corresponds to each link, at a fixed time interval, as if relinking work is being performed on the screen. Links are generated. An example of the display is shown in FIG. In FIG. 14, a part of the code information is displayed in combination with the cursor. The operator can visually confirm that a part (content in the DB) of the displayed code information and the content of the corresponding image map are collated with each other to confirm whether the correct link is created.

First, the contents of the new map link bundle DB 400-2 are sequentially read (1201) and the customer DB is stored using the record numbers corresponding to the code information linked by the links.
It is read from 600 and stored in a cursor memory for displaying code information near the cursor (120
2). Below, the cursor and the code information displayed in the vicinity thereof as shown in the display 85 of FIG. 14 will be referred to as a character cursor.

Next, the coordinates on the map of the read link,
That is, using the coordinates of the link point 72 on the map, the link point 7
A character cursor pointing to 2 is created (1203). The operator inputs the code information determination result, which is the result of the correctness determination of the link determined by collating the character cursor and the map, through the input device 3 (1223). If the determination result is "wrong", the coordinates of the link point 72 on the map are corrected. The corrected map coordinates are the new map link bundle DB40.
Written to 0-2. When correcting the map coordinates, the operator inputs a correct area on the map through the input device 3 (1222) and the coordinates of the link point 72 on the map are rewritten with the input coordinates (1204). Step 12
If the determination result of 23 is “positive”, the process proceeds to step 1205. The above processing is performed until the processing of all links is completed (1205).

In this embodiment, the link maintenance preprocessing 100
Then, the correctness of the link is judged by the area of the region where the link is set as in step 1707.
"Correct link" depending on the number of links in the same area
It is also possible to determine For example, it is possible to determine that there is an error when there are a plurality of links, as in the above embodiment. As a result, when the closed area is determined, it is checked whether or not there are a plurality of links to the same DB in the corresponding closed area, so double links can be prevented.

[0041]

【The invention's effect】

1) Since it is not necessary to newly create all the links every time the map is modified, the cost burden for modifying the links is reduced.

2) Accurate link creation is possible due to the multi-step check function.

3) By automatically correcting the link position, when the link position is near the edge (boundary line) of the target area, when the link is copied between the image maps, the position of the link is misaligned due to the positioning error. Therefore, it is possible to prevent the problem that the area is extended from the target area.

4) When the closed area is determined, it is checked whether there are a plurality of links to the same DB in the closed area, so double links can be prevented.

[Brief description of drawings]

FIG. 1 is a schematic diagram of a link information maintenance management method.

FIG. 2 is an explanatory diagram of links.

FIG. 3 is a configuration diagram of a system.

FIG. 4 is an explanatory diagram of a customer DB.

FIG. 5 is an explanatory diagram of a link DB and a link bundle DB.

FIG. 6 is a diagram showing a flow of link maintenance processing.

FIG. 7 is a diagram showing a flow of pre-link maintenance processing.

FIG. 8 is a diagram showing a shift of links.

FIG. 9 is a diagram showing correction of a link position.

FIG. 10 is a diagram showing a configuration of a display screen.

FIG. 11 is a diagram showing a flow of link maintenance processing.

FIG. 12 is an explanatory diagram of a map DB.

FIG. 13 is a diagram showing a flow of link quality confirmation processing.

FIG. 14 is an example of a link quality confirmation processing screen using a character cursor.

[Explanation of symbols]

1 ... CPU, 2 ... DB, 3 ... Input device, 4 ... Memory, 5
... Output device, 6 ... System bus, 100 ... Link maintenance preprocessing, 200 ... Link maintenance processing, 300 ... Link quality confirmation processing, 400 ... Link bundle DB, 400-1 ... Old map link bundle DB, 400-2 ... New map link bundle DB, 5
00 ... Map, 500-1 ... Old map, 500-2 ... New map, 600 ... Customer DB, 601 ... Record number, 705
... link bundle DB number, 402 ... map coordinates, 71 ... link target area A on map, 72 ... link point, 73 ... area boundary, 74 ... map-like link target area B, 800 ... map D
B, 85 ... Character cursor.

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Shunsuke Akito 1099 Ozenji, Aso-ku, Kawasaki-shi, Kanagawa Incorporated company Hitachi, Ltd. Systems Development Laboratory

Claims (10)

[Claims] 1. An information retrieval method using a processing device having an external storage device, a display device, and an input device, wherein a first image information displayed on the display device is displayed based on an instruction from the input device. Updating the first link information indicating the correspondence between the first image information and the code information stored in the external storage device, based on the result of correcting the position of the link point to the optimum arrangement; The link information of No. 1 is copied to the second link information, and the correspondence between the second image information and the code information is determined based on the second image information, the code information, and the second link information. A link maintenance management method characterized by displaying on a display device and updating the second link information based on an instruction from the input device if the correspondence relationship is changed. 2. The attribute of the link information according to claim 1, when an electronic operation such as copying the link information between images is performed,
A link maintenance management method characterized by ensuring the quality of link information by adding pre-operation processing and post-operation processing for attributes that are easily affected by errors in operations. 3. The link maintenance management method according to claim 2, wherein the coordinate of the link is moved to the center of the corresponding area in the image as the pre-operation processing. 4. The post-operation process according to claim 2, wherein the code information corresponding to the set link position is sequentially displayed on the screen, the confirmation input by the operator is accepted, and the link is corrected accordingly. Link maintenance management method characterized by. 5. As pre-operation processing according to claim 3, code information corresponding to the position of the set link is sequentially displayed on the screen, the confirmation input by the operator is accepted, and the link is corrected accordingly. Link maintenance management method characterized by. 6. In the pre-operation processing or the post-operation processing according to claim 2, the possibility of a link error is determined from the relationship between the position of the link and the corresponding area on the image, and the operator is requested to confirm. A link maintenance management method characterized by the above. 7. The link maintenance management method according to claim 6, wherein when determining the possibility of a link error, the criterion is that the area area is not included in a range of a constant value. 8. The link maintenance management method according to claim 6, wherein, when determining the possibility of a link error, the determination criterion is that the number of links in the area is not within a range of a constant value. 9. The link maintenance management method according to claim 7, wherein when determining the possibility of a link error, whether the operation is larger than a certain value such as an area area is used as a criterion. 10. The link maintenance management method according to claim 8, wherein when determining the possibility of a link error, whether or not the number of links in the area is one is used as a criterion.