JPH02171832A - Data check system - Google Patents

Abstract

PURPOSE:To execute the decision of a data check condition without delivering control to a data base control system by embedding an object to execute a data check in an object outputted by a compiler. CONSTITUTION:A compiler 2 inputs a user program 1 and executes phrase and syntactic analysis. When data operating languages 1a and 1b exist in the user program, operation object information are retrieved from data base definition information 3. According to the operation object information, the compiler 2 generates a data area for input/output and the object of a data base operating language. When the object is generated to add data and there is data check designation in the operation object, the object is embedded to directly check the data area for operation object input. Thus, without delivering the control to the data base control system, the decision of the data check condition can be executed.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a data check method in a database management system.

[Conventional technology]

Conventionally, in order to perform a data check to determine whether the relevant data can be stored in the database, the database 4'! Data check conditions were entered in the bulletin board that defined the construction, and the database management system performed the data check.

In addition, as related to the present invention, Japanese Patent Application No. 1983-16
No. 4136 is mentioned.

[Problem to be solved by the invention]

1- In order to check data in the conventional technology, data to be stored in the database is passed from the user application program to the database management system,
Database management system l-.

Side information about that data! 1 information is found from the definition information day 1 nocturne, and after determining the data position and attribute to be checked, an actual data check is performed.Therefore, unless the above process is performed, it is not known whether the data will be stored or not.

An object of the present invention is to eliminate the above-mentioned process and perform data checking at high speed.

[Means to solve the problem]

The problem in item j- is the compiler and database definition information of the language in which the 8 data manipulation words are written. , by interlocking the data to be recorded, the 3rd party/directory, and embedding the data check object in the object output by the compiler)! will be accomplished.

[Effect]

When a compiler translates a program written in a data manipulation language, the compiler searches the data dictionary for information to be manipulated in the database manipulation language in order to generate a database manipulation language object. After the search, the onvirer generates an input/output data area and a database operation object according to the operation target information.

Database operation for adding data 3-word object 1 - When generating, if data check is specified for the operation target, an object that directly data checks the contents of the operation target input data area is embedded.

1. An object “r” that performs data check by writing.

Because ri1- is embedded within one gram of Nizabu.

Data check conditions can be determined without passing control to the database management system.

[Example] Hereinafter, an example of the present invention will be described with reference to FIGS. 1 and 2.

FIG. 1 is a processing overview, and FIG. 2 is a processing flow in the compiler 2.

In Figure 1, l is a compiler that converts the user program to User Progera 11.2, 3 is a data dictionary that records database definition information (f), and 4 is an object code generated by the compiler ( or object output file), la, l
b is an example of update and addition data manipulation language, and S ”r in 1a
ORE indicates data addition, M in 1b, OD F
Y indicates data update, 5°f3 indicates IE
ISO), (,X3H2-84-48) (Draf
Network Database Language) (~etvork DatabaseL)
This is an example of a definition specification based on the standard (hereinafter abbreviated as NDL).

Here, the database logic 4i ['l is the record type (hereinafter referred to as record), the field group that makes up the record is transferred to the component type (hereinafter referred to as component l-), and the type (hereinafter referred to as Sera 1-
) is defined by Also, the logical structure of the database defined by these is called a logical schema, and a redefined part of the logical schema is called a subschema.
=1 component.

Defined for the set by record view, component 1~view, sera1~bi1-.

5 in FIG. 1 shows an example of a logical schema. 1
c defines the name of the logical schema, 1d defines the record name, and 1e defines the component. 11" is when storing the actual data of Leni 1-D A (1d) in the database: 1 component CAL is 10
This is a data check designation indicating that unless the value is 0 or more, it cannot be stored or updated in the database.

An example of the subschema is shown in FIG. 6.1. j defines which logical schema part was redefined and the name of the subschema, 1 defines record view, and IQ defines 1 component view.

Next, the processing flow shown in FIG. 2 will be explained in correspondence with the processing outline shown in FIG. 1.

When the compiler is executed to translate the user program 1, the compiler 2 inputs the nisabr1gram 1 and performs lexical analysis and spelling analysis (2a).

After analysis, if eight data manipulation words (la, lb) exist in the user program 1, the database definition information to be manipulated is searched from the data dictionary 3, and any discrepancies between the data manipulation language and the database definition information are searched. Perform analysis (2c).

Next, the input/output area of 2d is allocated. This is a communication area between the database management system and the database management system when the data manipulation language adds, updates, or searches data to the database.When adding/updating, data is transferred from the user program to the database management system. It becomes an output area, and during a search, it becomes an output area from the database management system to the user program.

When the input/output area allocation 2d is completed, an object for data manipulation nM is generated (2s), which is information such as the type of data manipulation language, records to be used, components, etc., developed in a table format.

In the object program, an object in the data manipulation language is a command to call the database management system 11, an input/output area, and a command sequence for passing the table format of the data manipulation language to the database management system 11.

In the case of an update/add data manipulation language, if a data check is specified in the first code, a data check object is generated (2r, 2g). For example, after creating a data manipulation language object for the instruction 5TORE A in 1a,
Since record A (ld) has a data check specification of 1f, the format for executing the data check specification (I
FC, 1h), compiler 1 generates object 1-. At runtime, the 1g data check expansion object is evaluated and if true, the data manipulation language is executed. If it is false, the corresponding data cannot be stored in the database and an error code is returned to the user program 1 (lh).

At the stage when all data manipulation language objects have been generated, object 1- of other processing parts of the user program and data manipulation language objects 1~ are merged (12b, 2).
xs 2j), output the object (2k) to the object output file.

〔Effect of the invention〕

According to the present invention, data check conditions can be determined without passing control to a database management system. Furthermore, since the check conditions can be determined without referring to tank construction information such as component attributes to be data checked or positions on records other than during compilation, the processing steps required for one condition evaluation can be reduced to 1/10IS.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing a processing overview of an embodiment of the present invention, and FIG. 2 is a processing flow diagram of a preprocessing compiler in an embodiment of the present invention. 1... User programmer 11, 2... Compiler, 3
...Object code, 4...Data dictionary.

Claims (1)

[Claims] 1. In a compiler that translates a database operation language and a data dictionary/directory that registers database definition information, the compiler outputs data check information that determines whether a record can be registered in the database. A data check method characterized by embedding it in the object to be used. 2. A data check method characterized by expanding a data check condition evaluation expression before and after a data manipulation language that operates storage update records on a compilation source list.