JPH0224714A - Data processor - 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 computer system, and more particularly to a data processing device that manages data in words and records.

〔overview〕

When data is managed by a computer system,
Because data is stored using data management codes, the file structure becomes complicated.

The present invention manages data using delimiter codes between records and words, and arranges each record in an external storage means in the order of keywords.

According to the present invention, data management can be simplified and data processing methods can be unified.

[Conventional technology]

With the development of microprocessors, it has become common practice to manage various types of data using stand-alone systems. For example, databases can now be created easily. For example, in databases, methods are often used in which files are created for each item and the files are chained based on the data item.Furthermore, the relationships between data are stored in advance and data is searched based on the structure and relationships. ing.

[Problem to be solved by the invention]

Conventional databases such as those described above manage data in terms of items, so relationships can be established across multiple files, which poses the problem of requiring a large amount of time to search.

In particular, when there are many keys to search, there is a problem in that it takes even more time.

In addition, data that changes by date and time, such as sales at trading companies, etc.
In the management of inventory, etc., there has been a problem in that the processing for aggregating -days requires updating the data for each item, making the processing complicated.

SUMMARY OF THE INVENTION In view of the above-mentioned conventional drawbacks, it is an object of the present invention to provide a data processing device that can simplify data management and unify data processing.

[Means to solve the problem]

The means of the present invention are as follows. In a data system that manages data by dividing a word and a record consisting of a plurality of such words using a delimiter code, an external storage means 1
(See the block diagram of the invention in FIG. 1, the same applies hereinafter) stores the records in the order of keywords.

The internal storage means 2 reads and stores records stored in the external storage means 1.

The processing means 3 sequentially reads the records stored in the internal storage means 2 and executes the specified processing, and ends the processing when the read data matches a predetermined delimiter code.

When the writing means 4 completes reading the record data from the external storage means 1 to the internal storage means 2,
Write the data end delimiter code at the end of the data.

The update record storage means 5 sequentially stores the input data as an update record.

The merging means 6 executes processing based on each update record in the update record storage means 5, and merges the records into the external storage means 1 in keyword order.

[For production]

The operation of the present invention is as follows.

The external storage means 1 stores data by dividing words and records each consisting of a plurality of words using delimiter codes.

The writing means 4 stores in the internal storage means 2 a code indicating the end of the record at the final position of the record read by the internal storage means 2.
reads the data sequentially, performs processing (arithmetic processing), and ends the processing when the read data is the final code. Since the final code has been written by the writing means 4, the processing means 3 can continuously process the data of each record stored in the internal storage means 2 until the end code of the record is reached.

Furthermore, since the merging means 6 stores update records to be newly added in the update record storage means 5,
New records can be merged into the external storage means 1 in keyword order.

〔Example〕

A detailed explanation will be given below using FIGS. 2 to 6.

FIG. 2 is a configuration diagram of the embodiment. The central processing unit 10 has a data bus DB, an address bus AB, and a control bus C.
B, each bus (DB, AB.

CB) includes an output unit 11, a console control device 12, and a random access memory 13.14.15.16 (RAM-
R1, RAM-R2, RAM-W) Disk control device 1
7 is connected. The console control device 12 is connected to an input section 18 and a display section 19, and, for example, an operator operating the device inputs command data and the like for performing a desired process through the input section 18. When data such as this command is input from the input unit I8, the console control device 12 notifies the central processing unit 10 that the input has been input, and the central processing unit IO executes processing corresponding to the input data. Then, for example, the results are outputted to the display section 19 via the console control device 12. Further, if the result is to be output to a printer or the like, it is output to the output unit 11.

Furthermore, the index file (1) F1 data file DF and update file KF of the external storage device 20 are connected to the disk control device 17.

FIG. 3 is a diagram showing the data structure within the data file DF.

m indicates variable length data, and each variable length data is separated by a word delimiter code ",". Further, an l record is composed of a plurality of words, and each record is separated by a delimiter code "(".The word data from the beginning of each record to the delimiter code ";" is constituted as a keyword.

One data file is made up of multiple records, and data is managed using words and records. For example, in order to find out where the desired data exists, an internal file IF is provided. There is.

FIG. 4 is a diagram showing the structure of the index file.

In the data structure mentioned above, for example, the delimiter code " (
The first word of `` and the second word that follows represent a keyword. For each key in this keyword order, the index file IF stores an address (pointer) in the data file correspondingly. This key can be stored for all records, but in this embodiment, the pointer is provided for the first key in blocks, for example, in units of multiple records.

Each record in the data file DF is stored sequentially and consecutively in the order of keywords, so if a record is added, deleted, or corrected, immediately updating that record will save all records in the data file DF. The data must be arranged in keyword order again. For this reason, in the embodiment, an update file KF is provided, and records that require updating are temporarily stored in the update file KF.

This system is not intended to manage data in real time, but is intended for processing, for example, one millimeter of aggregation in one day.

FIG. 5 is a diagram showing the internal configuration of the central processing unit 10. As shown in FIG.

Instruction memory 21 stores instructions.

The address counter 22 is the instruction memory 21
This specifies the address of .

From the instruction memory 21, a signal that specifies the address of the next instruction is sent to the address counter 22, and a signal that determines read/write of the random access memories 13, 14, 15, and 16 is sent to the address lines ABI and A.
Via B2, the delimiter code data is output to the address control circuit 23, the delimiter code data is output to the code detection circuit 24, the processing number data is output to the processing counter 25, and the instruction code is output to the decoder 26. A control circuit 27 is connected to the decoder 26 and outputs various control signals according to the commands decoded by the decoder 26 to each circuit in the central processing unit 10.

The address control circuit 23 uses the address on the address line ABI or the address line ABZ as an initial value, and the control circuit 27
The address is updated by a control signal from the address bus AB and outputs this address to the address bus AB. When this address is output, for example, the random access memory 14 is instructed and outputs data to the data bus DB. The result is then applied to the arithmetic circuit 28 and the code detection circuit 24. The code detection circuit 24 is a circuit that determines, each time data is read, whether the data matches the delimiter code output from the instruction memory 21 and further determines whether the delimiter code indicates the end of data. The arithmetic circuit 28 performs arithmetic operations on the read data. Code detection circuit 24
The output is output to the processing counter 25 and the control circuit 27. When a delimiter code indicating the end of data is detected from the code detection circuit 24, the control circuit 27 stops outputting the control signal, updates the address of the address counter 22, and moves on to the next process. On the other hand, the code detection circuit
If the same delimiter code as the delimiter code output from the instruction memory is detected, the count value in the processing counter 25 is subtracted and the count value in the processing counter 2 is counted.
When the count value in 5 becomes "O", this signal is output to the control circuit 27, and as a result, the control circuit 27 moves on to the next process as described above.

FIG. 6 is a flow chart of record reading.

When an operator inputs a command to read data of a record having a specific keyword from the input unit 1B, the central processing unit 10 executes the process shown in FIG. 6. When this process is started, first, a process S1 is performed to open the index file IF, and then the index file is read out (S2). Then, find the pointer where the record with the corresponding key exists (S3)
.

Subsequently, it is determined whether a record of the target keyword exists in the index file IF (S4);
If the data file exists, the data file is first opened (S5), and then the corresponding record is read and stored in the random access memory 14 (S6). Through this process, the corresponding record is stored in the random access memory 14. Subsequently, a process (S7) is performed in which a wrap-up ND code is written as a delimiter code indicating the end of data at the end of the record in the random access memory 14 that stores the read record. Through this processing, as will be described later, when some processing is performed from the central processing unit, it is possible to determine where the end of the record is.

Next is the process of closing the data file DF (S8)
I do.

If the corresponding key does not exist (absent) in the determination (S4), or after the data close process (S8), the process of closing the Intel 7 file (S9) and, for example, the process requested from the input unit (StO) is performed. . And in this (310), END is placed at the end of the record in memory.
Since a code has been written, by determining the END code data, it is possible to recognize that the record is final and terminate the process (S I O).

FIG. 7 is a flowchart of update record input processing.

When this update process flowchart is executed, an update record is first created (311). This converts the input record into an update record format consisting of a keyword, update type data, and data word. In the embodiment of the present invention, each record is managed using keywords.

The update type data includes addition, deletion, correction, etc. As a result, an update record is created in the random access memory, the next step is to open the update file KF (S12), and then write the update record created in the process (Sll) to the update file KF (
313), followed by changing the update file header (S 1
Do 4).

The update file KF stores update records sequentially, so it remembers the beginning and end of each record.The above-mentioned update file header means that the area where the current update file is stored is found and changed by rewriting the header. It is. After the update file header change process (S14), the update file is closed (315) and the process ends.

For example, when one day's processing is completed, the data file is updated using an update record.

FIG. 8 is a flowchart of the merging operation by updating with an updated record.

First, when the update process is executed (started), the update process is opened (520). Update file KF
The records are not necessarily stored in keyword order; when records are added, corrected, deleted, or tallied, updated files are opened and sequentially stored record by record, so they are not arranged in keyword order. Therefore, after the oven process (S20), a process of sorting the update records in the update file in keyword order (S21) is performed, first the update file is called (S22), and then an index file oven process is performed to update the data file. Perform (323). Then, after the oven, read the index file and random access memory 1
3 (RAM-X). Next, the data file is opened (S25). Through these processes, the index file, data file, and update file are all in an open state. Subsequently, the data specified by the index file is read out, and the record is called and stored in the random access memory RAM-R2. Furthermore, a process (S26) is performed to write an END code at the end of the last record. process(
326) is similar to the file calling process flowchart shown in FIG. Note that the file is not closed in this process (S26), and after the above-mentioned process (S26), S is executed to read the corresponding record.
27) Furthermore, those records are read from the random access memory 14 and 15 and processed according to the update type (3
28) 0 For example, if it is aggregation, process (328)
Execute aggregation processing and update records. Then, the process of writing to the random access memory 16 is performed (S 2
9). After this process (S29), a process (330
)I do. In this embodiment, the data capacity per index is determined, and it is determined whether the fixed capacity has been exceeded (531), and if the fixed capacity has been exceeded, a new index creation process (332) is subsequently performed. The new code in the random access memory 16 is then written to the data file (S33), and the data capacity is initialized (334). After the process (S34) or when it is determined (N) that the capacity has not been exceeded in the determination (S30), the random access memory 1
4 is completed. When the data in the random access memory 14 is not completed, and furthermore, when the data in the random access memory 16 is not completed, it is determined that the data is not completed (N) in the determination (S35) and (S36), and the process ( Repeat from 327).

On the other hand, in the determination (335), the random access memory 14
When processing of data in (RAM-R1) is finished (Y)
It is determined whether there are any remaining update records in the update file (337), and if there is no update file, the process of reading the next data from the update file (338) is performed.
If the update file has been completed, a determination is made (S36). Then, in the determination (33, 6), if the random access memo IJ15 is completed (Y), it is determined whether or not the record in the data file is to be completed (S39).
do. Furthermore, it is determined that the updated file has ended (
340).

If the data file is finished or the update file is not finished, specify the next index (S41),
The process is repeated from step S26.

On the other hand, if it is determined in the determination (339) that the data file has ended and that the update file has ended (Y), a process (342) is performed to write the current new index group to the index file.

This will write a new index.

Then, close the data file (S43),
Furthermore, the index file is closed (S44). This will update the index file and data file.

Through the above processing, all update records in the update file are updated to the data file and become O. Therefore, in order to clear the update file, the update file header is changed accordingly and the update file is closed (345, 346).

As described above, according to the present invention, data is managed in units of words and records, and data is provided with delimiter codes and key codes, which simplifies management.Furthermore, processing is terminated with an END code. Arithmetic processing can be started and ended automatically. Further, since a separate update file is provided, there is no need to update the data every time the data changes, and the update can be performed later blindly by writing to the update file.

〔Effect of the invention〕

As described above, according to the present invention, it is possible to obtain a data processing apparatus in which data management is simplified, data processing can be unified, and hardware can be set optimally for the data format.

[Brief explanation of the drawing]

Figure 1 is a block diagram of the present invention, Figure 2 is a system configuration diagram of an embodiment, Figure 3 is a data configuration diagram, Figure 4 is an index file configuration diagram, and Figure 5 is a central processing unit configuration diagram. FIG. 6 is a flowchart of record read processing, FIG. 7 is a flowchart of update record input processing, and FIG. 8 is a flowchart of updating by update processing. DESCRIPTION OF SYMBOLS 1... External storage means, 2... Internal storage means, 3... Processing means, 4... Writing means, 5... Update record storage means, 6... Merging means. Patent applicant Casio Computer Co., Ltd. Figure Figure Figure EI Figure

Claims (2)

[Claims] (1) A data processing device that processes data in which records consisting of words and a plurality of words are divided by delimiter codes, comprising an external storage means for storing the records in the order of keywords, and data read from the external storage means. an internal storage means for storing data; a writing means for writing a data end delimiter code at the end of the data when reading data of a record into the internal storage means is completed; and a write means for writing a data end delimiter code at the end of the data; and a processing means for sequentially reading out the data and executing specified processing, and executing the processing until the read data matches a predetermined delimiter code or until the data end delimiter code is detected. A data processing device characterized by: (2) In a data processing device that processes data in which words and records consisting of multiple words are divided by delimiter codes, external storage means stores records in the order of keywords, and sequentially stores input data as update records. update record storage means; processing means for reading data in the external storage means and executing specified processing, and for terminating the processing when the read delimiter code matches a predetermined delimiter code; A data processing device comprising: merging means for merging each update record in said update record storage means into said external storage means in the order of keywords of the records.