JPS59752A - Data base retrieval system - Google Patents

Abstract

PURPOSE:To retrieve easily from many data, by providing a table managing the same kind of data base to a data base storing many different data, and storing data representing the name of types of data and their locations. CONSTITUTION:A same kind data base managing table DBM is provided in a system consisting of a large capacity storage device comprising a CPU connected to a BUS, a control program memory PM and plural magnetic disc devices F0-F2, and of a main memory MM. Data are classified at each kind of data bases together with addresses and stored with codes representing storage addresses in the table DBM such as classification ILB number, ILB0, ILB1.... Thus, the bases of increasing data are stored easily and the ease of retrieval is attained.

Description

DETAILED DESCRIPTION OF THE INVENTION Technical Field of the Invention The present invention relates to a database search method that allows desired data to be searched from a plurality of databases of the same type.

Conventional technology and problems In databases that integrate large amounts of data and can handle a variety of tasks, it is common practice (1) to reserve the database area assuming the maximum amount of data. When the amount of data increases, it is necessary to expand the area, so first temporarily store the existing data, secure an area for the amount of data that includes the increased data, and then move the temporarily stored existing data to the new area. This method has the drawback that the work becomes complicated when the amount of data exceeds the expected amount. Also, as mentioned above, when the amount of data increases and the reserved space becomes insufficient, there is a method to manage the increased data as a new database. , the program must be managed as two databases, and if the requested data does not exist in one database, the program will issue a command to the other database, making the program complicated. There were drawbacks.

Purpose of the Invention The present invention creates a new database for a data volume that is larger than the expected data volume, and even when the same type of database is distributed over multiple databases, it is possible to search for desired data as an IN(2) database group. The overall objective is to facilitate expansion of the database area. Examples will be described in detail below.

Embodiment of the Invention FIG. 1 is a block diagram of the main part of an embodiment of the invention.
U is a processor, MM is a main memory, PM is a control program memory, FO to F2 are files consisting of a large capacity storage device such as a magnetic disk device, and BUS is a bus. Further, a homogeneous database management table DBM is prepared for management when the same type of database is distributed over a plurality of locations. Although this table DBM is shown as being configured in the main memory MM, it is of course possible to configure it as an independent table.

FIG. 2 is a functional block diagram of an embodiment of the present invention, and the following explanation will be given by taking as an example a case where various data of an integrated circuit (IC) are managed. In order to manage multiple distributed homogeneous databases as a group, the homogeneous database management table DBM contains data (3): base type name, database name, and data indicating the location of the database corresponding to the database name. Registered. For example, if the same type of database is distributed into two, the database type name is ILB, the database names are ILBO, ILBI, and data ADO indicating the location of the database corresponds to each database name.
ADIs are registered in the order in which they are input from the card. This homogeneous database management table DBM is created by inputting from the database definition data input section DBI, and input is made to the database definition data input section DBI using a database type designation card and a database definition card. . That is, when the database is distributed to multiple locations due to the addition of data, the contents of the table are updated based on the information on the distribution. Note that in the case of a single database, it goes without saying that the database type name and the database name can be the same.

Further, the ILBO database stores IC data such as I and C pin data, which are identified by IC codes IC01 and ICO2 indicating (4) sets of IC data.

The iz and Bt databases store IC data such as IC pin data, which are identified by IC codes IC03 and 1cO4 indicating a collection of IC data, as described above.

When reading the IC bin data ICPD of IC code ICO3, according to the search request information, the database type name ILB is sent from the program PG as code search instruction information.
and the processing IC code ICO3 are input to the code search section CDS. This code search unit CDS refers to the same type database management table DBM and searches for the database type name IL.
From B, first, based on the data ADO indicating the location of the database name ILBO, the IC of the ILBO database is determined.
Read out the codes one after another and check if there is one that matches the requested IC code. In Figure 2, the ILBO database has IC codes for IC0I and ICO2, but there is no IC code for ICO3, so
Homogeneous database (5) Based on the data ADI indicating the location of the next database name ILBI in the database type name of the database management table DBM, the IC codes of the ILBI database are sequentially read, and the ICO3 of the requested IC code is read out. When the code search unit CDS finds a match with the request IC code IC03, the code search unit CDS searches the program PG for the database name ILBI where the requested IC code IC03 exists and the code data IC03 for the ICO3.
Notify D.

After that, a data manipulation command to read the IC pin data of IC code ICO3 from the program PG and the above-mentioned IC.
The ILBI of the database name obtained by the code search and the ICP of the processing data instruction are sent to the database operation unit DCP. This database operation unit DCP executes the specified database name I based on the data operation command.
The specified IC pin data is read from the LBI database and set in the data table DTB, and the program PG is notified that the reading of the IC pin data ICPD is completed. Program (6) PG performs the next requested process.

In the IC code search, if the requested processing IC code does not exist in any database, the program PG is notified of this fact. Also, when updating or writing new IC data in the database, desired data can be updated or written by searching the IC code using the above-described operations.

FIG. 3 is a flowchart for explaining the above-mentioned operation. After the homogeneous database management table is created, data indicating the location of the database is retrieved from the homogeneous database management table in response to a code search instruction, and the data The code is read from the database based on the code and checked to see if it matches the requested processing code. If they match, the data based on the request is read out using a database operation command.

In creating the homogeneous database management table DBM, the database definition is input using a card, but other input methods can also be adopted, and the database is also distributed into two (7) Even if more databases are distributed, they can be managed as one group using the homogeneous database management table DBM. Also, in the above embodiment, the program PG
This example shows a case where code search instructions and data manipulation instructions using database manipulation commands are issued separately.
It is also possible to issue both as one database operation instruction. Furthermore, any known means can be used as the means for storing data in the database, and similarly, any means such as reading and searching in parallel can be used as the retrieval means. It is.

As described in detail, the present invention provides a homogeneous database management table DBM, stores data indicating the location of a database corresponding to each of a plurality of database names of the same type, and stores desired data. When searching, similar databases are sequentially searched to find the database that contains the desired data, and if it becomes necessary to expand the database area (8), the existing database can be left as is. By creating a new database of the same type and managing it using a database management table of the same type, there is an advantage that operations when expanding the database area can be performed easily and in a non-intrusive manner. Therefore, the present invention can be used for various data searches other than the IC data search in the above-described embodiment.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a main part of an embodiment of the present invention, FIG. 2 is a diagram for explaining the operation of the embodiment of the present invention, and FIG. 3 is a flowchart for explaining the operation of the embodiment of the present invention. DBM is a homogeneous database management table, PG is a program, CDS is a code search section, DOP is a database operation section, ILB is a database type name, ILBO, ILB
I is the database name, ADQ and ADI are data indicating the location of the database, and IC0I to ICO4 are IC codes. (9)

Claims (1)

[Claims] In a method of searching for desired data in a database storing various data, a homogeneous database management table is provided, and data indicating the location of the database is stored in the homogeneous database management table in correspondence with the homogeneous database name. , a database search method characterized by sequentially searching a plurality of databases of the same type based on the data to search for desired data.