JPH08305715A - Data retrieving system - Google Patents

Abstract

PURPOSE: To attain a unitary management of solid data by storing plural key codes for extracting common solid data correspondingly to each other. CONSTITUTION: A 1st area 31a and a 2nd area 31b are formed in a key code storing area 31. A key code KEY1 directly corresponding to solid data is written in the 1st area 31a. When a slave key code KEY2 is included in 1st solid data, the key code KEY2 is written in the 1st area 32a of a key code storing area 32 other than the area 31 and the master key code KEY1 is written in the 2nd area 32b. When a 2nd slave key code KEY3 exits, the key code KEY3 is written in the 1st area 33a of a key code storing area 33 and the master key code KEY1 is written in the 2nd area 33b. Thereby, all the slave key codes can correspond to the solid data through the common master key code.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data search system.

[0002]

2. Description of the Related Art Conventionally, a data retrieval system called an electronic filing system which stores a large amount of materials electronically has been widely used. In this data retrieval system, a material using paper as a medium is input by an image scanner or the like, and the input substantive data and a key code indicating a storage location of the substantive data are combined and registered in a database. It is normal. Since this key code has a one-to-one correspondence with the substantive data in the database, it is possible to retrieve the desired substantive data from the database by searching for this key code.

Here, the key code may be composed of one code, but may be a combination of a plurality of codes that are hierarchically combined. In constructing this database, key codes viewed from each of a plurality of classification systems, for example, in the case of a database related to equipment, by combining the key code viewed from the equipment function side and the key code viewed from the control function side with the actual data, respectively. If registered in the database, desired substantive data can be searched from both the facility function side and the control function side.

[0004]

However, in such a data search system, when there are a plurality of key codes for one entity data, it is necessary to input a material each time those key codes are registered. There is. Therefore, the following various problems occur. (1) Since the same material must be repeatedly input as many times as the number of key codes, the work load of material input is large.

(2) Since there are a plurality of the same substantive data in the database, it is difficult to centrally manage the data, and there is a risk that the data may not be revised or omitted. (3) In terms of hardware, storage devices and other system resources are wasted. In view of the above circumstances, the present invention provides a data search system in which even if a plurality of key codes exist in one entity data, only one entity data corresponding to the plurality of key codes needs to be stored. With the goal.

[0006]

A data retrieval system of the present invention that achieves the above object stores substantive data and a key code associated with the substantive data, and uses the key code as an index to obtain a desired entity. A data retrieval system for retrieving data is characterized in that a plurality of key codes for retrieving common entity data are associated with each other.

[0007]

Since the data retrieval system of the present invention is configured as described above, even when there are a plurality of key codes for extracting one substantive data, the plurality of key codes are associated with each other. Therefore, it is possible to extract the entity data common to all the key codes from any of the key codes. Therefore, in the database of the data search system of the present invention, it is only necessary to store one entity data for a plurality of key codes, and it is not necessary to store as many entity data as the number of key codes as in the conventional case. .

[0008]

Embodiments of the present invention will be described below. FIG. 1 is a block diagram of a data search / registration device used in an embodiment of the data search system of the present invention. As shown in FIG. 1, the data search / registration device 1 includes a data input unit 40 including an image scanner for reading data as raster data, and a data storage unit 30 including a database for storing the read data. , A search / registration unit 20 for registering the read data in the database and searching the registered data, and a keyboard, a mouse for operating each of these units and displaying the contents of the operation,
And display unit 1 including a CRT (image display device) and the like
0 and are provided.

FIG. 2 is a flowchart showing a process of registering a material in a database using the data search / registration device 1 of FIG. In the flowchart shown in FIG.
First, in step S1, the target material is input from the material input unit 40 of FIG. Next, in step S2, as shown in FIG.
A key code is added to the input material and input using the operation / display unit 10.

In step S3, it is determined whether or not the input end key has been pressed. That is, it waits until the input end key is pressed, and when the input end key is pressed, the process proceeds to step S4. Next, in step S4, the substance data of the material previously input in step 1 and the key code input in step 2 are associated with each other. In this way, a plurality of materials and the key code assigned to the materials are associated and input.

By the way, the number of key codes assigned to one entity data differs depending on the individual material and the classification system of the data search system. When only one key code is attached to one entity data, it is not necessary to associate the key codes with each other. However, when multiple key codes are attached to one entity data, As explained, it is necessary to associate a plurality of key codes with each other.

3A to 3D are schematic diagrams of the key code storage area in the database in which a plurality of key codes are associated with each other in this embodiment. A plurality of key codes KEY that should be associated with certain entity data
, KEY2, KEY3, ..., KEYn exist, these plural key codes KEY1, KEY2, K
How EY3, ..., KEYn are associated with each other will be described below.

The key code storage area 31 shown in FIG. 3A is provided with a first area 31a and a second area 31b. A key code KEY1 directly corresponding to the substance data is written in the first area 31a. The second area 31b is left blank. When there is only one key code in the substantive data, only one key code storage area is provided for the substantive data, and the key code storage area after FIG. 3B does not exist.

When there are a plurality of key codes in this entity data, it is necessary to associate these key codes with each other. However, when associating them, the concept of parent-child relationship is used to facilitate the association. It can be carried out. The parent-child relationship is that when multiple key codes exist in one entity data, the key code that directly corresponds to the first entity data is called the parent key code, and the second and subsequent key codes are used as the parent key code. It is called subordinate child key code and means to associate parent and child key code. By doing so, it becomes possible to refer to entity data from child key code through parent key code.

When expressed by the concept of this parent-child relationship, if a child key code exists in the entity data, that is, if a second key code exists, it is stored in a region other than the key code storage area 31 of FIG. 3A. , The child key code KEY2 is written in the first area 32a of the key code storage area 32 of FIG. 3B, and the parent key code KE is written in the second area 32b.
Y1 is written.

The key code of the next child in the entity data, that is, 3
If the second key code is present, the key code shown in FIG.
The second child key code KEY3 is written in the first area 33a of the key code storage area 33 of
The parent key code KEY1 is written in b. Less than,
If there is a child key code in the substantive data, as shown in FIG.
5, ..., N first regions 34a, 35a ,.
na is the child key code KEY4, KEY5, ..., K
EYn3 is written, and the second areas 34b, 35b, ...
.., nb is written with the parent key code KEY1.

As described above, the n-th key code KEYn is written in the first area of the second and subsequent n-th key code storage areas, and the parent key code KEY1 is entirely written in the second area. Is written. Therefore, since all the child key codes are associated with the entity data via the common parent key code, even if there are a plurality of key codes in one entity data, they correspond to the plurality of key codes. In order to perform such an operation for associating a key code with which only one entity data needs to be stored, the following parent-child relationship registration screen is used in this embodiment.

FIG. 4 is a schematic diagram of a parent-child relationship registration screen used in this embodiment. As shown in FIG. 4, the parent-child relationship registration screen 50 displays all key code display areas 51 in which parent key codes and other material attributes of a plurality of materials are displayed and all key code display areas 51. A scroll bar 56 for scrolling the parent key code up and down, a parent registration button 52 for designating the parent key code from the all key code display area 51, and a child for designating the child key code. A registration button 55, a designated parent key code display area 53 in which the designated parent key code is displayed, and a designated child key code display area 54 in which the designated child key code is displayed are provided.

Next, an operation method for associating the parent-child relationship of the key code using this parent-child relationship registration screen 50 will be described. Prior to this operation, a data search is performed in advance for a key code that is related to a plurality of parent key codes input by the key code input process shown in FIG. 2, that is, a key code that is a candidate for a child key code. Fill in the system. This input processing may be input from the keyboard, but data created in advance using a general-purpose spreadsheet or the like may be input via a floppy disk or the like.

First, a desired parent key code is designated from the key codes displayed in the list form in the all key code display area 51 of the parent-child relationship registration screen 50 by using the scroll bar 56 and the mouse. Then, the parent registration button 52 is pressed. By this operation, the designated parent key code display area 53 displays the designated parent key code. Similarly,
A desired child key code is designated from the key codes displayed in the list form in the all key code display area 51 by using the scroll bar 56 and the mouse, and the child registration button 55 is pressed. By this operation, the designated child key code is displayed in the designated child key code display area 54.

By the above operation, a set of parent-child relationships consisting of a parent key code and its child key codes are associated with each other, and the key code storage areas 31, 32, 3 shown in FIG.
The respective key codes are stored in 3, ..., N.
When the association of all parent key codes with their child key codes is completed in this way, the database registration work of the target material is completed.

[0022]

As described above, according to the data retrieval system of the present invention, even if a plurality of key codes exist in one entity data, one entity data corresponding to the plurality of key codes is stored. The input load can be reduced because all that is required is Further, since the data is unified, it is possible to prevent the drawings from being omitted.

Further, the storage device and other system resources can be saved.

[Brief description of drawings]

FIG. 1 is a configuration diagram of a data search / registration device used in an embodiment of a data search system of the present invention.

FIG. 2 is a flowchart showing a process of registering a material in a database using the data search / registration device 1 of FIG.

FIG. 3 is a schematic diagram of a key code storage area in which a plurality of key codes are associated with each other in the present embodiment.

FIG. 4 is a schematic diagram of a parent-child relationship registration screen used in this embodiment.

[Explanation of symbols]

 1 data retrieval / registration device 10 operation / display unit 20 retrieval / registration unit 30 data storage unit 31, 32, 33, ..., n key code storage region 31a, 32a, 33a, ..., na first region 31b, 32b, 33b, ..., nb Second area 40 Material input section 50 Parent-child relationship registration screen 51 All key code display area 52 Parent registration button 53 Designated parent key code display area 54 Specified child key code display area 55 Child Registration button 56 Scroll bar

Claims (1)

[Claims] 1. A data search system for storing substantive data and a key code associated with the substantive data, and for extracting desired substantive data using the key code as an index A data retrieval system characterized in that key codes are associated with each other.