JPH0224745A - File processor - Google Patents

Abstract

PURPOSE:To use only one updating program for respective files by converting a keyword of an input record into a keyword matched with the structure of a keyword of a file and updating the file. CONSTITUTION:A conversion means 3 converts the keyword of the input record into the keyword matched with the keyword structure of the file. The specified file is retrieved by the converted keyword and the specified file is updated by an updating means 4 based on an updating word inputted by an input means 1. Since the keyword of the input record is automatically converted into the keyword structure of the file, respective files can be updated by the same updating means by uniforming the keyword structure of respective files even when the sorts of the files are different from each other.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a data processing device, and more particularly, to a file processing device that updates files by unifying file keywords.

〔overview〕

The present invention updates a file by converting the keyword of an input record into a word that matches the keyword structure of the file.

[Conventional technology]

When processing accounting, salary management, etc. using a computer system, a master file (data file) that stores sales data and employee salary data in code units is created and managed on an external storage device such as a hard disk or floppy disk. There is.

In the aforementioned office processing, in addition to mask files for sales and salary management, there are multiple mask files for slip processing, inventory management, and the like. Each time there is a correction based on daily data or even monthly data, each mask file, that is, the mask file corresponding to the aforementioned accounting, salary, etc., is updated.

A method of updating mask file data in a conventional computer system is shown in FIGS. 9(a) and 9(b).

The same figure (a), (bl is the old mask file 10 respectively)
1. This shows a method for updating the old mask file 102. In order to update the old mask file 101, a transaction file (Transac
tion file) 111, 112.

The update program 121 updates the old mask file 101 and creates a new mask file 201 based on the update information of the records. In addition, in order to update the old mask file 102, the old mask file 102 must be updated in the same way as when updating the old mask file 101.
Create transaction files 211, 212, 213, and 214 consisting of records in which data modification information of each record and addition information of new records are stored.
An update program 122 different from the update program 101 described above updates the old mask file 102 and creates a new mask file 202 while reading each record of the transaction file.

As mentioned above, in the past, an update program was created for each mask file, and each time a record was modified or added, a record containing the modification information and additional information was written to a transaction file, and the update program was executed. The mask file is updated based on the records stored in the transaction file.

[Problem to be solved by the invention]

As described above, conventionally, in order to update data files (mask files, etc.), it was necessary to create a data update program for each individual data file. For this reason, as the number of data files used in the system increases, the number of data update programs to be created also increases in proportion to the number, resulting in a problem in which program productivity deteriorates in systems that use a large number of data files. It had

An object of the present invention is to provide a data processing device that simplifies update processing in a system that uses a plurality of data files, and that allows the update to be performed with a small number of programs (at least one program).

[Means to solve the problem]

The present invention relates to a file processing device that manages a plurality of files in which the number of keywords is unified, and an input means 1 (see 1 in the functional block diagram of FIG. 1 and the same below) inputs records including keywords and update words. . Specifying means 2
specifies the file to be updated. The converting means 3 converts the keyword of the input record into a keyword that matches the keyword structure of the file specified by the specifying means 2.

The updating means 4 searches the designated file using the keyword converted by the converting means 3, and updates the designated file using the input update word.

[For production]

The conversion means 3 converts the keyword of the input record into a keyword that matches the keyword structure of the file. For example, input keywords such as date words and message words are converted into keywords that match the keyword structure of the file. Then, the file specified by this converted keyword is searched, and the specified file is updated by the updating means 4 using the update word manually entered by the input means 1. Since the keyword of the input record is automatically converted into the keyword structure of the file, if the keyword structure of each file is unified, even if the files are of different types, they can be updated by the same updating means.

〔Example〕 A detailed explanation will be given below using FIGS. 2 to 8.

FIG. 2 is a system configuration diagram of the embodiment. The keyboard is operated by an operator, and data generated by the operation is applied to the input processing device 11. An input definition document 12 is connected to the input processing device 11,
The input processing device 11 sorts the data input from the keyboard 10 according to the input definition document 12, and stores the data in the input file 13.

FIG. 3 is a data structure diagram in the input definition document 12 mentioned above. The input definition document 12 consists of a heading part and an item part. The heading part contains key data such as date, propagation, customer code, person in charge code, etc., and the item part contains keys such as product code, quantity, counter, amount, etc. This is the data corresponding to .

Using such definitions, the input processing device 11 stores data coming from the keyboard in the input file 13. The input file 13 stores records consisting of data having the structure shown in FIG. Menre creation device 14 generates Menre 1 from records of various data stored in manual files.
Create file 15. A work memory 16 and a file definition document 17 are connected to the maintenance file creation device 14, and each file specified in the file definition document is used to create a maintenance file in creating the maintenance file.

FIG. 4 shows information on each record created from data input to the keyboard 14 by the input processing device 11. Fourth
Each record in the input file in the figure was created using the input definition document shown in Figure 3, and the first slip has the date January 27, 1963 (630127) and slip number 0001.
, Customer A, Person in charge a, Product xxx, Quantity XX, Unit price XX, Amount XXXX, and similarly, 630127.0001. for the two items on the first slip. Person A, person in charge a, product XX
It is entered as ×, quantity ××, unit price ×××, amount ××××. The third record contains the second slip, 630127, slip number 10002, 0 customers,
Person in charge b, Product ×××, Quantity××, Unit price×××, Amount×
It becomes ×××. There is not one slip per item, but multiple items are created in one slip. 1st
In the case of a slip, two products are entered in one slip, and the second item is one item, and the third item is a plurality of items.

In the embodiment of the present invention, data is not stored and managed through this maintenance record, but is managed corresponding to each item. In other words, it is managed in accordance with keywords. The Menle creation device creates data structure records corresponding to each file such as registration and deletion from these input files.

FIG. 6 is a configuration diagram of the file definition document 17.

The file definition document specifies which items in the input file are to be used as key codes (keywords) and which items are to be used as word labels such as numerical values. For example, in the case of the one defined by the manual definition sheet in Figure 3. If so, the customer in Figure 6 [
In the file, the first key code RKI is the customer code, and the second
Key code RK2 is the product code and four word labels d1゜d2. d3. d4 is defined as quantity, unit price, amount, and blank. In addition, the word label of the definition document in Figure 6 is inputted from the keyboard and specified in the manual definition document, and when stored in the file, the units of data in the file are defined in the file definition document in correspondence. For example, in the case of a customer details file, the quantity for input in the input file is a number, the unit price is a unit price, and the amount is an amount. Similarly, in the case of a sales details file, the first key code RKI is a combination of the two manual words date and propagation, the second key code is the product code, and the first term d1 of the word label is the file for the input quantity. is the number, the file is the unit price for the manpower unit price, and the file is the selling price for the input amount. In the case of a file by person in charge, the person in charge code is the first key code, and the second key code is null. Since the word label at that time is stored as sales for each person in charge, the input amount becomes the amount for each person in charge. The same applies to inventory slip management and the like. A maintenance record is created from the input file according to such a file definition document.

For example, in the case of the data in the input file shown in Figure 4, the maintenance data for the customer Shibata θ Isle is Company A and the product code, which is the keyword for the customer - and the corresponding number. , unit price, and amount are stored in the menu file 15 in code units. Once all the data in the input file is stored in the file definition file in accordance with the file definition document, the update device 18 operates, accesses each file 15, and sequentially accesses files 19, 20, . . . in code units. 21..., and records storing the data to be updated in the Menre file 15 are stored in the corresponding files in addition to the previous data stored in each file. For example, if a maintenance record of the client IM=file exists in the Menref file, the maintenance record is stored in the client's file, for example, file 19.

Through the above operations, the maintenance data entered from the keyboard is converted into an input file using the input definition document, and a maintenance record is created from the data stored in the input file according to the file definition document 17, and the update device 18 The update command stores the contents of the maintenance file in the corresponding file for each person.

FIG. 5 is a processing flowchart of the menle making device 14. The menu creation device 14 creates a corresponding maintenance record when one heading section and one item section defined in the input definition document are respectively input to the input file 13. First, determine whether there is one new record or data in the input file 13 (Sl)
do. Naturally, if there is none (N), the process ends after this determination (Sl). On the other hand, if the file definition exists (Y), an arbitrary file definition among the file definitions specified in advance is specified (S2).

Next, it is determined whether the first key code RKI is set in the specified file definition document (S3).
. If key code RKI is set (Y),
Furthermore, it is determined whether the key code RKI is a composite key that is a combination of two or more input words (S4). If it is not a composite key (N), data corresponding to the word of key code RKI is read from the input record and set in the work memory.

If the file definition document arbitrarily specified in advance is the customer bottle-σ isle shown in
4), the result is (N), and the process (S5) is performed.

In addition, if the first key code RKI is a combination of date + propagation, such as in a sales details file where the file definition document specified arbitrarily in advance is a combination of date + propagation, it is determined in determination S4 that it is a composite key (Y), and the The process (S
6. Perform S7).

On the other hand, if the first key code is not set in the file definition specified in advance, it is determined (N) in the determination (S3), and in this case, a logical empty word (null) corresponding to this key code is stored in the work memory. Processing to cent (
Perform S8). Processing S5. S7. After the end of S8, processing regarding the second key code RK2 is performed. This processing is similar to processing 33 to S8. First, it is determined whether the second key code RK2 is set in the specified file definition document. (S9). In the case of (Y), it is further determined whether the second key code RK2 is a composite key (SIO). If it is not a compound key, the data corresponding to the word name of RK2 is read from the input record and set in the work memory (Sll), and if it is a compound key, it is read so that the data corresponding to each word name can be input. Processing (S12),! Then, a process (S13) is performed to set the data in the work memory.

On the other hand, when the second key code RK2 does not exist (N) in the determination S9, a process (S14) is performed to set a logical empty word (null) in the work memory. When the processing corresponding to these two key codes is completed, it is next determined whether or not there is an unprocessed word label. If an unprocessed word label exists (Y), that is, if it is determined that a word label exists, it is determined whether an input label exists (516). This may occur, for example, if the operator decides that the data corresponding to the input definition form is not necessary and does not enter it, or even if the operator forgets the data.
In the determination (S16), if there is no input label (N), a logical empty word for that word is set in the work memory.

Further, if an input label exists, that is, if an item corresponding to the word label exists, a process (318) is performed in which data corresponding to the word name is read from the input record and set in the work memory. and processing (317,
After step 518), it is determined again whether or not there is an unprocessed word label.By repeating this process, the word labels d1~
d4 is processed sequentially.

On the other hand, if it is determined in the determination (S15) that there is no unprocessed word label, (N), the menu file in the work memory corresponding to one record created in the work memory by the above-mentioned operation. The process of registering (S16) is performed. This is a process for the record code, and in order to process all the records in the input file, it is repeated sequentially from determination S1 again.

By repeating the above-described operations, maintenance records can be created using file definition documents for conversion for all input records.

When the maintenance record is completed from this newly input record, the update processing device 18 starts operating,
Perform update processing.

FIG. 7 is a processing flowchart of the update processing device 18. First, when the update processing device 18 starts operating, a process (S
20), that is, the files are sorted in order by processing (320). Next, the sorted first maintenance record (menle) is read (321), and it is determined whether there is any unprocessed maintenance record (322). This determination is for sequentially reading maintenance records and performing processing. If the processing operations described below are repeated sequentially, it is determined that there is no maintenance record (N) and all files are closed (335).
) and exit.

On the other hand, if a maintenance record exists, for example, immediately after starting the update process, it exists, so next it is determined whether the file specified by the immediately previous maintenance record is the same as the current file (323). In an embodiment of the invention, files are opened and closed with a bias of one. Therefore, if the maintenance file is not the same as the immediately previous maintenance file (N), first the immediately previous file is closed (S24)L, and then a new file, that is, a file corresponding to the file of the read maintenance record is opened (S25). Discrimination (323)
when the maintenance file is the same as the previous maintenance file, or when a new file process is opened (S25
) is followed by the first key code RK in the maintenance record.
It is determined whether data of I exists (326). Then, when data of RKl exists (Y), it is similarly determined whether data of second key code RK2 exists (32
Do 8). If the data of RK2 does not exist in the determination (328), that is, if the first key code RKI does not exist in the determination (S26) and furthermore, the second key code RK2 does not exist, the record cannot be identified by the key. Perform error processing (S29)
.

On the other hand, if RK2 data does not exist in the determination (327), furthermore, if it exists in the determination (S27) (Y), or if RK2 data exists in the determination (328), the corresponding processing is performed. I do.

That is, when RKI data and RK2 data exist at the same time, a record with matching RKI and RK2 is searched from within the file (S30). Also, if RKl data exists but RK2 data does not exist, R
Focusing only on the KI data, the file is searched for a key data record that matches this RKl data (S31). Conversely, if the RK2 data exists but the RKI data does not exist, only the RK2 data is focused, and the file is searched for a record that matches the RK2 data (332). This search process (S30, S31, 532) determines the location of the maintenance record to be registered.

After these processes, a process is performed to register a maintenance record corresponding to the key code searched for in the Menre file 15. In other words, the record is updated using the update word data included in the maintenance record. (333), processing (S2
9) Or after processing (S33), read the next maintenance record (S34)L, and then perform processing (322).
). In this determination (S22), as long as there are unprocessed maintenance records, the above-described operations are repeated sequentially, and when there are no unprocessed maintenance records (N), the file is closed (535).
)finish.

Through the above-described processing, the data input from the keyboard is registered and updated in the files 19 to 21. In the embodiment of the present invention, the key codes of the maintenance records (main files) have the same structure. Therefore, the number of programs to be updated by the update device can be at least one.

FIG. 8 is an explanatory diagram of file codes in updating.

The maintenance records created in the maintenance record file 15 are called in code units by the update program PX loaded into the update processing device 18, a file with a corresponding file name is opened, and the file is accessed. In the past, it was necessary to create a program to update the update program device for each file, but in the embodiment of the present invention, a record is created using a file definition document, and the file specified by the record is accessed and the key code of the file is accessed. Since the numbers are unified (even if the numbers are different, you can unify them by entering data as null), each maintenance record file 1
It is only necessary to access the file indicated in step 5, and only one update program is required.

〔Effect of the invention〕

As described above, in the present invention, the keywords of the input records are converted into the file definition document to match the keyword structure of the file, so if the keyword structure of each file is unified, the update program for each file can be Even if the keyword structure of an input record is newly changed, there is no need to create an update program corresponding to the change.Also, it has the feature that the burden of maintenance is reduced.

[Brief explanation of the drawing]

Figure 1 is a functional block diagram of the present invention, Figure 2 is a system configuration diagram of an embodiment, Figure 3 is an explanatory diagram of an input definition document, Figure 4 is an explanatory diagram of an input file, and Figure 5 is a menu creation process. Fig. 6 is an explanatory diagram of the file definition document, Fig. 7 is a flowchart of update processing, Fig. 8 is an explanatory diagram of update, and Fig. 9 (a), Tb) is an explanatory diagram of conventional update. . 1... Input means, 2... Designation means, 3... Conversion means, 4... Update means. Patent applicant: Casio Computer Co., Ltd.

Claims (1)

[Scope of Claims] A file processing device that manages a plurality of files having a unified number of keywords, comprising: input means for inputting a record including a keyword and an update word; designation means for specifying a file to be updated; a converting means for converting the keyword of the input record into a keyword that matches the keyword structure of the file specified by the specifying means; searching the specified file using the keyword converted by the converting means; and searching the specified file using the input update word. A file processing device comprising: update means for updating the specified file.