JPH0225948A - record data processing device - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a record data processing device such as an office computer that updates records in various files such as a sales file, an inventory file, and a personnel file.

[Prior Art J] Conventionally, office processing devices such as personal computers, office computers, and general-purpose computers have been generally used to process data such as sales slips. These office processing devices store and manage, for example, a sales detail file, a sales total file, a sales file by customer, an inventory file, and the like.

[Problems to be Solved by the Invention] Incidentally, in order to store and manage such various files, System Enshare must design in advance a file management system compatible with the various files.

In other words, the record structure of the file is different for each file, so in order to update the contents of the corresponding file based on the input slip data, it is necessary to create an update file for each file corresponding to l:l. It is necessary to design a program, and in order to update the contents of the file corresponding to the input data individually according to the desired update type 1, for example, "add", "delete", etc., it is necessary to design a program according to the update type. It is necessary to design a program for inputting update data and a program for updating files with update data input for each type of update in correspondence with each type of update. Therefore, when the number of files is very large, it takes a lot of time and effort to design the program.

An object of the present invention is to significantly reduce the labor required for designing a file management system while the design of the file management system is in progress, and to enable efficient file updating.

[Means to solve the problem] The means of the first invention is as follows.

The file storage means tA (see the functional block diagram in Figure 1 (A); the same applies hereinafter) is a floppy disk, hard disk, etc., in which each record is composed of a keyword and a data word, and each record is arranged and stored in the order of the keyword. be.

The update record generation means 2A stores this file storage means I.
In order to update records in A, an update record consisting of a keyword, data word, and update content is generated based on input record data. Here, "updated content" includes, for example, "addition", "deletion", "correction",
Indicates either "aggregation".

The clock word generation means 3A generates clock data indicating the generation time of an update record, and inserts it into the update record as a clock word. Here, the clock data refers to date and time data indicating the generation date and time of an update record, a counter value for counting a serial number, or the like.

The update record storage means 4A is a floppy disk, a hard disk, or the like that stores an update record for which a timekeeping word has been generated by the timekeeping word generation means 3A.

The record organizing means 5A rearranges the updated records in the updated record storage means 4A in the order of keywords and timekeeping words.

The update processing means 6A updates each update record to the record in the file storage means IA in the order rearranged by the record organization means 5A, but at this time, it performs a type of update processing (for example, additional processing) based on the update contents of the update record. , deletion processing, correction processing, aggregation processing).

The means of the second invention is as follows.

The file storage means IB (see the !R function block diagram in FIG. 1, the same applies hereinafter) and the update record generation means 2B are similar to the file storage means IA and the update record generation means 2A according to the first invention. The structure is as follows.

The affiliation word generation means 3B inserts affiliation data indicating the affiliation of the update record set in advance as an affiliation word into the update record. Here, the affiliation data is, for example, a machine number unique to the record data processing apparatus, a user number unique to the user, etc., and represents the affiliation of the generated update record.

The update record storage means 4B is a floppy disk, a hard disk, or the like that stores the update record for which the affiliation word has been generated by the affiliation word generation means 3B.

When updating each update record in the update record storage unit 4B to a record in the file storage unit IB, the update processing unit 5B performs a type of update process based on the update content of the update record.

The notification means 6B is a display device or the like that, when an error occurs during update processing in the update processing means 5B, notifies the affiliation of the update record based on the affiliation word of the update record in which the error occurred.

[Work] The operation of the means of the first invention is as follows.

First, when slip data and the like are input, the update record generating means 2A generates an update record consisting of keywords, data words, and update contents based on the input record data. Further, when an update record is generated, the clock word generation means 3A generates clock data indicating the time when the update record was generated, and inserts it as a clock word into a predetermined position of the update record.

The update record in which the clock word has been generated and inserted in this way is stored in the update record storage means 4A, and
The records are rearranged by the record organizing means 5A in keyword order and clock word order.

Then, the update processing means 6A responds to the file update command, etc., and executes a process of accumulating the updated records after record organization into the records in the file storage means IA. Perform update processing.

Therefore, by storing an update record including update contents generated based on an input record in the update record storage means 4A and reading it at an arbitrary time, different updates can be made for each record based on the update contents of this update record. You can update compatible files by type at any time, so
The contents of the update record generation process based on the input record and the file update process based on this update 1 code can be set independently, the settings can be very individualized, and the system design can be designed independently for each. , the effort required for its design can be significantly reduced. Furthermore, since the update records are organized in the order of the clock words based on the clock word included in the update record as a type of keyword, file updates can be efficiently processed in chronological order according to the data input order. I can do it.

Next, the operation of the means of the second invention will be explained.

First, when slip data and the like are input, the update record generating means 2B generates an update record consisting of keywords, data words, and update contents based on the input record data. Furthermore, when an update record is generated, the affiliation word generation means 3B inserts affiliation data indicating the affiliation into a predetermined position of the update record as an affiliation word of the update record.

The update record V into which the belonging word has been inserted in this way is stored in the update record storage means 4B.

Then, the update processing means 5B responds to the file update command etc. and executes a process of accumulating the updated records in the records in the file storage means IB. In this case, the update processing means 5B performs a type of update based on the update contents of the updated record. At this time, if an update error occurs, the affiliation of the update record is notified based on the affiliation word of the update record in which the error occurred.

Therefore, in the second invention, as in the first invention described above, the system design is simple and the labor required for the design can be significantly reduced. Furthermore, by including the word to which the record belongs in the update record, if an error occurs in the file update performed at any time, it is possible to notify where the record was created, by whom, etc.

[Example] An example will be described below with reference to FIGS. 2 to 11.

FIG. 2 is a block circuit diagram showing a record data processing device as a workstation for constructing a data communication system.

The input device ll is used to manually enter various data such as slip data and various commands.
It is equipped with a numeric keypad, character keys, and various function keys. Data input from this input device 11 is sent to an input processing device 12.

The input processing device 12 processes input data from the input device 2211 and stores the data as a result of the processing in the input record memory 1.
In this case, when the input processing device 2112 inputs data consisting of one document's worth of codes or data consisting of a plurality of records for one document to the input record memory 13, the input of data for one document is completed. The record generation device g14 is activated in response to a key operation instructing the record generation device g14. The input record memory 13 stores each word of the input record, and each word data of the input record is stored in correspondence with a predetermined word pattern.

The record generation device 14 processes the input record from the input record memory 13 based on the settings preset in the record designation memory 15, thereby generating a maintenance record for updating the contents of the master file, which will be described later. Generate maintenance record memory 16
In this case, the record generation device 14 saves various data (date and time data, process ID, machine ID, user ID, shelf ID) stored in the setting memory 17 in the work memory 18, and A maintenance record in the form of a record is written in the maintenance record memory 16 by extracting predetermined data from the work memory 18 and inserting the predetermined data extracted from the work memory 18 into a predetermined position of the generated maintenance record. In addition, the maintenance record memory 16 is refu FJl? The record generation device 2114 refers to the contents of the table memory 19 and corresponds to the maintenance records stored in the maintenance record memory 16. It is checked whether the file name is registered in the table memory 19, and if it is not registered, it is registered in the table memory 19 and the maintenance file recording section 20.

In addition to keywords and data words expressed in word collapse from the input record memory 13, the record specification memory 15 stores
Data indicating the file name to be updated and the contents of the update are arbitrarily set and stored from the input device 11 as record designation data. Note that the record designation memory 15 is capable of storing a plurality of record designation data.

The setting memory 17 contains date and time data, process ID, and machine I.
D. It stores the user ID and the fence ID, and the date and time data includes the current date and time data input from the clock circuit section 21 at each predetermined timing, as well as the process ID, machine In,
User ID,! ! IID is an input device! ! This is the setting data input from 11. Here, the date and time data is data indicating the date and time when the update record was generated. In addition, the process ID, machine ID, user ID, and 1l ID are data that indicate which 7'O process, machine, user, and shelf the updated record belongs to.
The process ID is identification data indicating the type of processing such as record input processing and update record generation processing. The user ID, which indicates the machine number, is identification data unique to a general user, and the fence ID is data that identifies, for example, the group to which the user belongs, that is, the department or division of the company.

The maintenance file storage unit 20 is composed of a floppy disk, a hard disk, etc., and stores maintenance records for file updates created by the record generation device 14 in correspondence with various files.
Input to file update device 22? When a file update is instructed from tfill, the contents of the maintenance file storage section 20 are sequentially read out by the file update device 22.

The file update device 22 is a maintenance file storage section 2
Specify the corresponding file in the master file storage unit 23 according to the file name of the maintenance record read from 0, and use the update memory 24 to perform update processing according to the "update content" of the maintenance record. The update device 22 detects errors when updating files, and notifies the error contents from the error display section 25.

Note that the transmission/reception control device 26 is a communication device that sends and receives data with other record data processing devices constructing the network system, and when a maintenance record that does not exist in the master file recording unit 23 is created, the record generation device 14 reads it from the maintenance file storage unit 20 etc. and transmits it from the transmission/reception control device 26 to another record data processing device, and conversely, the record generation device t14 reads it from the other record data processing device to the transmission/reception control device W126. The maintenance record transmitted via the server is taken in and written into the maintenance file storage section 20.

Next, the operation of this embodiment will be explained.

Now, when slip data and the like are input from the input device Mll, this data is input to the input processing device W112. Then,
The input processing device M12 processes the input data and sequentially writes the processing results as word data into the input record memory 13. In this case, as shown in FIG. J,rI2J,r
Each word data "m]", "m2", "m3" of the input record corresponding to IxJ-...rlnJ...φ
rmnJ is stored. In the figure, ", J" indicates a word delimiter code, and each word data consists of variable length data (the same applies hereinafter).

When the input of record data for l slips into the input record memory 13 is completed, the input processing device 12
starts the record generation device 14.

Thereby, the record generation device fi14 generates a maintenance record from the input record in the input record memory 13 based on the record designation data set in advance in the record designation memory 15.

It is now assumed that record designation data is set in the input record memory 13 in correspondence with various files as shown in FIG. That is, the input record memory 13 contains the file name to be updated arbitrarily set by the user in advance,
One or more keywords, data indicating update contents, and data words are stored as record designation data, and among this record designation data, keywords and data words are represented by word movements in the input record memory 13. For example, as shown in FIG. 4, record designation data RED 1 has a file name of rFa J, keywords of rIz, I3J, update content of "totalization", and data word of rI5. It consists of I6, I+, and I4J, and the record designation data RED2 has a file name of rFe.
J, keyword is rI+J, update content is "tally", data word is rI 13. The record designation data RED n is composed of I + aJ, and the file name is rFkJ and the keyword is ri5. I6J, update content is "addition", data words are rIs, Iq, I22,
I23". Here, in this example, the update content in the record specification data is "add",
One of the four types of "deletion", "correction", and "aggregation" is set. Note that ";" in the figure is a delimiter code that indicates a boundary between a file name and a keyword and between a keyword and updated content.

When generating maintenance records from input records in the input record memory 13 based on such record designation data, the record generation device 14 executes processing operations according to the flowcharts of FIGS. 5 and 6. Note that FIG. 5 is a flowchart showing the generation processing, and FIG. 6 is a flowchart showing the subsequent processing.

When the record generation device 14 is activated, it starts executing operations according to the flowchart shown in FIG. First, the record generation wave M14 secures a memory area for the number of files preset in the record designation memory 15 in the maintenance record memory 16 (step AI), and then,
Various data preset in the setting memory 17,
That is, date and time data, process ID, and machine ID.

Read the user ID, [ID and save it in the work memory 18 (step A2), select one date/time data, process ID, and machine ID from the work memory 18, and use it as variable length data, that is, adopted in this embodiment. If the data does not match the various delimiter codes, it is converted into variable length data consisting of the number of bytes corresponding to the length of the valid data and saved in the work memory 18 (Step A
3).

When such initial setting processing is completed, the record designation data set in the record designation memory 15 is read from the beginning, and it is checked whether the file name in this record designation data is registered in the table memory 19 ( Step A4): If the file name is not registered in the table memory 19, the file name is written in the empty area of the maintenance file storage unit 20 to secure a file area for creating a new file ( Step A5) Next, read the date and time data, Floss ID, machine ID, user ID, and fence ID that were saved in the work memory 18 at the time of initial setting, and store the header in a new file area secured in the maintenance file storage unit 20. Write as information (step A6)
Also, the file name is stored in the table memory 19 (step A7). When a new file name that is not registered in the table memory 19 is specified in this way, the maintenance file storage unit 20 Since the file name is stored in the table memory 19 after securing the file area, the file names corresponding to all maintenance records in the maintenance file storage section 20 are registered in the table memory 19. .

Therefore, if the specified file name is already registered in the table memory 19, or as described above,
9, the process advances to step A8 to check whether the maintenance record memory 16 is full. Here, if an empty area remains in the maintenance record memory 16 to which data for a predetermined maximum record length can be written, maintenance record generation processing is performed (steps A9 to A13).

Now, an example will be described in which a maintenance record corresponding to the first record designation data REDI (see FIG. 4) set in the record designation memory 15 is generated. Note that (al) to (a5) in FIG. 5 specifically show the contents set in the maintenance record memory 16 corresponding to the maintenance record generation process in each step of steps A9 to A13.

First, a delimiter code r (J
The address is updated by writing it into the maintenance record memory 16 (step A9).

Next, the machine ID and process ID in the work memory 18
The address is updated while reading and writing to the maintenance record memory 16, and the delimiter code "
," (Step A10) 0 Next, write the keywords "Work 2" and "
The address is updated while sequentially writing the word data "ml" and "m5" in the input record memory 13 indicated by "I3" together with the delimiter code "," (Step A1
1), and updates the address while reading the date and time data in the work memory 18 and writing it to the maintenance record memory 16, and writes the delimiter code "," (step A12). Then, the first record designation data RED After writing the updated contents in I to the maintenance record memory 16 and writing the delimiter code "," in the first step, the word data (indicated by each word positive in the input record memory 13) in the record designation data REDl is updated. Maintenance record memory based on 16
For example, as shown in FIG. 4, the record designation data RED
1 enters the word collapse "I5", rI6J', r-work + J
.

Input record memory 1 if indicated by “■4”
rm5J word data in 3.

Arrange "m6", "ml", and "m4" in the order and write them into the maintenance record memory 16 (see Figure 7). Note that Figure 7 shows the maintenance record of 1 ref - 1 minute generated in this way. It shows.

After generating the corresponding maintenance record based on the record designation data REDI of the first file name rFaJ in this way, the process proceeds to step A14, where maintenance records for the number of files preset in the record designation memory 15 are created. The record specification memory 15 stores record specification data for multiple files as shown in FIG. Since we have already generated the corresponding maintenance record based on the record specification data RED1 of the file name rFa J, next, we need to generate the corresponding maintenance record based on the record specification data RED2 of the file name rFcJ. Returning to step A4, similar processing is performed thereafter, whereby a maintenance record corresponding to the record designation data RED2 with the file name rFcJ is generated and written into the maintenance record memory 16.

Thereafter, similarly, maintenance records for the number of setting files in the record designation memory 15 are sequentially generated and written to the maintenance record memory 16, but in this case,
When the maintenance record memory 16 becomes full and there is no empty area, this is detected in step A8 and the process proceeds to step A15, where l records from the beginning of the maintenance record in the maintenance record memory 16 are read out, and this maintenance record is read out. The contents of the maintenance record memory 16 are written to the maintenance file storage section 20 when the maintenance record memory 16 becomes full.

Then, proceed to the next step A1B, and after clearing the contents of the maintenance record memory 16, proceed to step A1B.
At step 9, maintenance record generation processing is performed.

In this way, the number of maintenance records set in the record designation memory 15 is generated based on one input record in the input record memory 13. Note that if a plurality of input records are stored in the input record memory 13, the maintenance record generation process described above is performed for each input record.The maintenance record generation process is performed for all input records in the input record memory 13. After finishing, execution of the post-processing according to the flowchart of FIG. 6 is started.

First, the beginning of the table memory 19 is specified, and if a file name is stored at that position a (step Bl), it is checked whether the file name matches the file name of a predetermined master file (step B2) Here, when a match is detected, if the record corresponding to the file name has not already been written to the maintenance file storage unit 20, that is, the record remains in the maintenance record memory 16. in case of,
Reads the record corresponding to the file name from the maintenance record memory 16 and writes it into the maintenance file storage section 20 (Stella 7'B4). Also, if the file name does not match the file name of the master file, stores the record corresponding to the file name in the maintenance record memory 16. Or read it from the maintenance file storage unit 20 and send it to the transmission/reception control device 26.
and transmits it to another device (step B3).

Next, proceeding to step B5, the file name is cleared from the table memory 19. Then, the process proceeds to step B6, where the next file name in the table memory 19 is specified, and then the process returns to step B1, and the same process is executed thereafter.

Then, when the same process is performed on all the file names stored in the table memory 19, all the file names in the table memory 19 will be cleared at that point, so this is detected in step B1. The process then proceeds to step B7, where the maintenance record memory 16 is cleared.

As a result, only maintenance records corresponding to various master files are set in the maintenance file storage section 20.

Note that when a maintenance record transmitted from another record data processing device is received, the record generation device 3
114 writes it into the maintenance file storage unit 20 on the condition that it is a maintenance record corresponding to its own master file.

Next, when a command to instruct a file update is inputted from the input device 11, the file update device 22 is activated in response to this and executes the file update process according to the flowchart of FIG.

Note that FIG. 8 is a flowchart showing an overview of the update process.

In this case, the storage form of one file in the master file storage section 23 is such that a large number of records consisting of keywords and data words are arranged in file order and keywords, as shown in FIG. Here, in the same figure, "(J" is the record delimiter code, and "
;'' is a delimiter code that indicates the boundary between a keyword and a data word, and rmJ indicates variable length data consisting of the number of bytes depending on the length of valid data.
Within the II 23, each word and each record contains only existing information, completely packed.

When the file update device 22 starts executing the flowchart shown in FIG. 8, it first checks whether there is a file in the maintenance file storage unit 20 (step CI).
, if it doesn't exist, you can exit from this flow, but if it exists, ! Out of each record for the file, only the records that can be stored in the update memory 24 are read from the maintenance file storage unit 20 and written to the update memory 24 (step C2), and the records in the update memory 24 are set in a predetermined manner. Then, the sorted contents of the update memory 24 are written to the maintenance file storage section 20 (step C4), and the process continues until all records for l files are sorted (step C5). ) and until all files are sorted (
Repeat the operations described in step C6), . . h (steps 02 to C4).

After sorting all the records in each file in the predetermined order for all the files in the maintenance file storage unit 20 in this way, step C
Proceeding to step 7, it is checked whether there are multiple maintenance files with the same file name among the sorted maintenance files, and if there are, the maintenance files with the same file name are merged (step C8), and the process returns to step C7. If there are multiple maintenance files with the same file name, merge them in the same way.

After merging all the multiple maintenance files with the same file name in this way, the process advances to step C9, where one maintenance file is read out from the maintenance file storage section 20 and the correspondence in the master file storage section 23 is created according to the file name. Specify the file to be updated, and perform "aggregation", "correction", "
performing update processing such as "deletion" using the update memory 24;
That is, if the "update content" is "addition", this maintenance record (consisting of keywords and data words) is inserted into the corresponding mask file in keyword order.

Moreover, if it is "delete", the record in the master file that matches the keyword of the maintenance record is deleted. If it is "correction", the word corresponding to the data indicated by the data word of the maintenance record among the records of the master file that match the keyword of the maintenance record is corrected. Furthermore, “Update content” is “
In the case of "Total", among the records of the master file that are -i with the keyword of the maintenance record, the data indicated by the data word of the maintenance file is added to the corresponding word and the data is totaled. Note that if the data in the data word of the maintenance record is negative, the data is subtracted and totaled.

When the update process for one file is completed, Stella 7'
Proceed to C10 and check whether all master files have been updated. If not, return to step C9 and update the first file. Once all master files have been updated, proceed to step C1l. Proceed to and handle errors that occur when updating files.

FIG. 10 is a flowchart showing the specific processing contents of the above-mentioned sorting and merging, and the case where sorting is performed will be described below as an example.

First, two maintenance records are sequentially read from the beginning of the update memory 24 (step D1).The previous record among the two maintenance records read from the update memory 24 is referred to as the record ".
1", and the subsequent record is called record "2", then in the next step D2, record "1" and record '2"
The 1st word of "machine ID, skip process IDJ 0" Next, record "1" and record "2" 2
The word th word (keyword) is compared (step D3), and as a result, if record “l” is record “2” and record “1”>record “2” (step D4), this comparison Arrange each record in ascending order in the update memory 24 according to the result (step D11)
, On the other hand, if record "1" = record "2", (
step D4), then record “l” and record “
Compare the third word (keyword) of ``2'' (step D5), and as a result, if record ``1'' is record ``2'' and if record ``1''>record ``2'' (step D6), Each record is arranged in ascending order in the update memory 24 according to the comparison result (step Dll).
, On the other hand, if record "1" = record "2", that is, if the keyword of the third word as well as the keyword of the second word of record "1" and record "2" are equal (step D6) 1 Next, the fourth word (date and time) of record "l" and record "2" are compared (step D7), and as a result, record "l"> record "2" and record "l"> record "2" are compared. (step D8), each record is arranged in ascending order in the update memory 24 according to the comparison result (step Dll). On the other hand, if record "l"=record "2", that is, record "1" If the keywords of `` and the keywords of record ``2'' as well as the date and time are the same (step D8),
Next, the fifth word (updated content) of record "1" and record "2" are compared (step D9), where:
The order of "update contents" is determined in advance in the order of "deletion", "addition", "correction", and "aggregation".
1″> In the case of record “2” (step DIO),
Each record is arranged in ascending order in the update memory 24 according to the comparison result (steps Dll, DI3).On the other hand, in the case of record "1" and record "2"', that is, record "1" and record "2" ” are the same for each keyword, date and time, and even the updated content (step D10).
), record “1” and record “2” are arranged in this order (step D12).

In this way, the above-described flowchart is repeated until all the records in the update memory 24 are arranged in ascending order of keyword, in ascending order of time if the keyword is the same, and in order of update content if the keyword and date and time are the same.

FIG. 11 is a flowchart showing specific details of the error processing at the time of file update described above.

First, determine the type of update error (Step El), and as a result, whether the error is due to a problem with the maintenance record or
Check whether it is another error (step E2).

Here, errors caused by problems with the maintenance record itself include (1) an attempt to delete a record of a keyword that does not exist in the master file, and (2) an attempt to add a record of a keyword that already exists in the mask file. (3) If you try to correct a record with a keyword that does not exist in the mask file, (4)
This is the case, for example, when an attempt is made to collect records for keywords that do not exist in the master file. Further, other errors that do not cause problems in the maintenance record include a case where there is no empty space in the mask file storage section 23.

If a problematic error occurs in the maintenance record itself, the machine ID, process ID, and date and time of the variable-length data contained in the record are read, and the machine ID is read in step E3, and the process ID is read in step E4. In step E5, the date and time are converted into normal data. A file having the machine ID, process ID, and date and time thus converted is searched from the maintenance file storage unit 20, the header information of the file is read (step E6), and this header information is displayed in the error display unit. 25 to output 1 display. As a result,
It is reported when the maintenance record that caused the error was created, by which machine, in which fence, by whom, and by what process. And step E
Proceeding to step 9, the update process for the maintenance record is canceled and the update process is not performed.

On the other hand, if another error that is not a problem occurs in the maintenance record, the process proceeds to step E8, and after displaying a message to that effect on the error display section 25, update cancellation processing is performed (step E9).

Note that the records in the master file updated as described above are searched and output by specifying the keyword of the record to be output, such as display or print.

Although the embodiment described in -h shows date and time data as time measurement data, the value of a counter that automatically counts consecutive numbers at regular intervals may be used, and furthermore, error notification may be performed by printing, etc. Of course, the application is not limited to workstations that constitute a network system, but also applies to stand-alone machines.

[Effects of the Invention] According to the first invention, an update record including update contents generated based on an input code is stored, and by reading this at any time, the update record can be updated. Since the configuration is configured so that the corresponding file can be updated at any time using a different update type for each record based on the content, it is now possible to process input records and files independently, and each process The settings for the processing contents for each system can be made independent, and each system can be designed independently, thereby significantly reducing the labor required for the design. Furthermore, in the above file update process, a large number of update records input in various orders are organized in the order of clock words based on a clock word as a type of keyword included in each update record, and then updated. As a result of updating files to update records in a chronological manner according to the input order, the record input order and the record update order are consistent, and efficient processing becomes possible.

Similarly to the first invention described above, in the second invention, the system design is simple, and the labor required for the design can be significantly reduced. Furthermore, by including the word to which the record belongs in the update record, even if an error occurs when updating the file, it is possible to notify where the record is, who created it, etc.

[Brief explanation of the drawing]

FIG. 1(A) is a functional block diagram of the first invention;
B) is a functional block diagram of the second invention, FIGS. 2 to 11 show embodiments, FIG. 2 is a circuit configuration diagram of a record data processing device, and FIG. 4 is a diagram showing a specific example of the setting contents of the record designation memory 15, FIG. 5 is a flowchart showing the generation process of the record generation device 14, FIG. 6 is a flowchart showing the subsequent processing, and FIG. 7 is a diagram showing the storage format of the code in the maintenance record memory 16, FIG. 8 is a flowchart showing an overview of the file update process performed by the file update device 22, and FIG. 9 is a diagram showing the storage contents of the master file storage unit 23. , FIG. 1O is a flowchart showing the specific processing contents of sorting or merging, and FIG. 11 is a flowchart specifically showing the error processing at the time of file update. 11... Input device, 12... Input processing device, 13... Input record memory, 14...
... Record generation device H216 ... Maintenance record memory, 17 ... Setting memory, 2
0-...Maintenance file storage section, 21...
... Clock circuit section, 22 ... File update device, 23 ... Master file storage section, 24 ...
...Update memory, 25...Error display section.

Claims (2)

[Claims] (1) A file storage means in which one record is composed of a keyword and a data word, and each record is arranged and stored in the order of the keyword; and in order to update the record in this file storage means, based on the input record data. an update record generating means for generating an update record consisting of a keyword, a data word, and update contents; and generating time measurement data indicating when the update record was generated;
A clock word generation means for inserting the clock word into the update record as a clock word; an update record storage means for storing the update record in which the clock word has been generated by the clock word generation means; record organizing means for rearranging records in the order of clock words; and update processing for performing a type of update process on the records in the file storage means in the order rearranged by the record organizing means and based on the update contents of each update record. A record data processing device comprising: means; (2) A file storage means in which one record is composed of a keyword and a data word, and each record is arranged and stored in the order of the keyword; and in order to update the record in this file storage means, based on the input record data. update record generation means for generating an update record consisting of a keyword, data word, and update content; and affiliation word generation means for inserting preset affiliation data indicating the affiliation of the update record into the update record as an affiliation word. , an update record storage means for storing an update record for which an affiliation word has been generated by the affiliation word generation means; and when updating each update record in the update record storage means to a record in the file storage means; an update processing means that performs a type of update processing based on the update contents of a record; and when an error occurs during update processing in this update processing means, update processing of the update record is performed based on the word to which the update record that has caused the error belongs; A record data processing device comprising: a notification means for notifying an affiliation; and a record data processing device.