JPS6180424A - Data input method of electronic computer - Google Patents

Abstract

PURPOSE:To reduce greatly the collating time by collating a key code with another key code of 1/2 position of registered data and reducing by half the collation record position for each time according to the result of collation of said two key codes. CONSTITUTION:When data are supplied from an input device, the key code of these data is collated with another key code of 1/2 position of all key codes stored in a memory in a regular order. Then the key code of the input data is collated with the 1/2 remaining stored record to which the input key code is possibly belonging in accordance with the result of collation of said two key codes. Such collations are repeated to reduce by half the subject range for each collation. In such a way, the collating time is greatly reduced compared with a conventional case.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention provides an electronic computer which reduces wasteful storage capacity of a main storage device and improves data processing speed when processing data by an electronic computer. This relates to data input methods.

[Conventional technology]

FIG. 5 is a block diagram showing the configuration of a conventional electronic computer. In FIG. 0, 1 is a central processing unit (CPU) 11;
An electronic computer with a built-in rewritable main memory 12, etc.
2 is an auxiliary memory such as a magnetic disk or a floppy disk; 3 is a data input device such as a keyboard; and 4 is a cathode ray tube (CRT) such as a display device.

For example, when managing the inventory of parts using a computer as shown in Fig. 5 above, part numbers 1 to n indicating the parts classification assigned to each part as shown in Fig. 6, and the parts Name of M, ~Mn, number of parts in stock2. ~Zn is considered as one record, and 1 part number is 1 to n in the sort order of 1 to n.
When rewriting one ledger, a data file consisting of n records is transferred to the main memory 12 of the computer 1,
The following operations were performed.

First, when registering a new part, the ledger maintenance program inputs the part number, part name, and part inventory quantity of the new part into the (n+1)th record, and then sorts the records in order of part number.

The file in auxiliary memory 2 is rewritten.

In addition, in the case of purchasing and dispensing registered parts, the 7th
As shown in the figure, using the input program for purchasing and dispensing, input the purchase and dispensing slips for one gender and the number and date of the purchase or dispensing, corresponding to the part number, and then create the "Purchasing and Dispatch Data File" ” is stored in the auxiliary memory 2.

In addition, when inputting purchasing and dispensing data, in order to check whether the part is registered in the parts ledger, the part number registered in the parts ledger is stored in the main memory 12.
The part number of the input purchase or disbursement slip is compared with the ledger part numbers 1 to n in sequence, and if the part number is already registered, the input is accepted and the part number is registered in the ledger. When it is not registered, it is displayed on CBr4 that it is not registered.

Start the ledger maintenance program and instruct it to register in the ledger.

Also, when aggregating purchases and disbursements and changing the inventory amount in the ledger, the ledger file is transferred from the auxiliary memory 2 to the main memory 12.
After transferring it to , read the purchasing and dispensing data one by one from the [Purchasing and dispensing file] in auxiliary memory 2,
The purchasing and dispensing data and part numbers are sequentially compared with the part numbers in the 0 ledger up to ln, and when one part number matches, the inventory quantity in the ledger is increased or decreased according to the number of purchased or disbursed items, and the parts A file for counting the number of items purchased and delivered by number is created and displayed on the CRT 4 or printed out on a printer device (not shown).

[Problems to be solved by the invention]

Conventional electronic computers such as those mentioned above check whether the ledger has been registered when inputting purchasing and disbursing quantities, and verify part numbers when changing the number of stocks in the ledger.

Since all records in the ledger from 1 to n are checked sequentially, there is a problem in that it takes a very long time. Also, when registering new parts in a ledger or outputting a ledger in order of part number, it is necessary to sort in order of part number.

In this case as well, there was a problem that it took a long time.

In addition, when inputting and aggregating purchasing and disbursing slips, 1
It is necessary to store a plurality of files in the main memory 12, including the ledger file and the purchase and payout data files, resulting in a problem that the amount of data that can be handled is reduced.

This invention was made in order to solve this problem, and it is possible to perform the process of matching the key code of input data at the time of search without having to perform the matching process on all the target key codes. The purpose of this invention is to obtain a data input method for an electronic computer that can significantly reduce time.

[Means for solving problems]

A data input method for a computer according to the present invention.

When comparing the key code of input data with the key code of already registered data, it is compared with the key code at the 1/2 position of this already registered data.

Depending on the magnitude relationship between the two key codes, the record position to be compared is reduced to H each time.

[Effect]

In the computer data input method of the present invention, the key code of the input data is compared with the key code at the 1/2 position of all the key codes already stored in the key code order in the storage device, and the input data is By reducing the number of record positions to be collated into numbers each time based on the size relationship between the key code obtained and the key code of the storage device, the collation processing time can be significantly shortened.

〔Example〕

FIGS. 1 and 2 each show a data input method for an electronic computer, which is an embodiment of the present invention.

FIG. 3 is a flowchart showing each procedure at the time of new data registration and its aggregation, and is a diagram showing an example of a data file used in the data input method of the computer shown in FIGS. 1 and 2. A data file as shown in FIG. 3 consists of N records corresponding to N key codes that are mutually non-overlapping, and each record includes a key code A(t,) and each data B?).

C(n) and D(n) are recorded.

First, new key codes A, c and data BX, Cx
.

The case of registering Dx will be explained according to the flowchart shown in FIG. First, in step 51, a data file consisting of N records already registered in the main memory 12 is read from the auxiliary memory 2. Step 5
2, key code A newer than keyboard input device 3
x and each data Bx related to this key code Ax
, Cx, and Dx.

In step 53, the total number of records N registered in the 1M register
and enter the value of 1/2 of the total number of registrations N into the Y register. In step 54, it is compared whether the key code Ax is in the sorting order between the key code with the y-th record number ~) and the key code A (y+1) with the y+1-th record number. Key code Ax is each key code~
) and A (A+1).

In step 55, the key code Ax is compared to see if each record number is between y and y-1th key code ~) and A (A1). When the key code AX is not between each key code Aty) and A(y-1), in step 56, it is compared whether the key code Ax is larger than the key code ~), and the key code Ax is compared with the key code ~). If it is smaller, the value of y is entered into the M register in step 57, and if the key code Ax is greater than the key code ~), the value of M+y is entered into the M register in step 59. In step 58, the key code A to be checked next
Define record number y of (y) as M/2, enter the value of M/2 in the Y register, and return the process to step 54.
At Stetsubushi.

New key code A8 is each registered key code~) and A
If it is determined that the value is between (A+1), the value of y+1 is entered into the Y register, and in step 55, the key code A
If it is determined that X is between each key code 80 and A(y-1), leave the value of y as is.

At step 62, the record numbers from number Y to the last number N are incremented by 1, each record from each key code to A (to) is added by 1, and the total number N is incremented by 1. With the step mill, new key code Ax and each data B, ,
C, , Dx are recorded at the position of record number y. In the step diagram, the new registration process is completed, the files recorded in the main memory 12 are transferred to the auxiliary memory 2 in the order of key codes,
Record and finish.

Next, the case of data aggregation will be explained according to the flowchart shown in FIG. Key code A6 recorded in the record shown in FIG. ) is the part number and data DCII) is the inventory amount, and the processing when Dx parts of part code Ax are paid out as the part number will be described step by step. In step 71, the parts ledger already registered in the auxiliary memory 2 is read into the main memory 12. At step 72, the part code Ax and the number Dx of the delivered part are input using the input device 3 of the keyboard. In step 73.

Put the value of the total number of records N into the M register, and put the H value of the total number of records N into the Y register. In step 74, y
Check whether the part code A(y) of the th record and the part code Ax of the delivered part are equal.0 If they are not equal, in step 75, check whether the part code ``person'' is greater in the sort order than the part code ~). If the part code Ax is smaller than the part code A(y), the value of y is placed in the M register in step 76, and if the part code Ax is larger than the part code A(y), the value of y is entered in the M register in step 78. Put the value of M+7 into the register, step 77
Then, the value of the Y register is changed to M/2, and the process returns to step 74.

At step 74, part code A is changed to part code A(y).
When is the same, the inventory quantity of part code A(y) is D(y)
The number of payouts Dx is reduced. In the main memory 12,
As described above, the parts ledger file in which the inventory quantity Dω has been changed is stored in the auxiliary memory 2 in step 80.

This completes the payout process.

FIG. 4 is a flowchart showing the procedure for data aggregation in a data input method for a computer according to another embodiment of the present invention. The flowchart shown in Figure 4 is as follows:
One method is to reduce the range of records to be compared to an issue each time, one method is to add the newly registered amount to the existing registered amount when the matching key code is found as a result of matching, and another method is to add the newly registered amount to the existing registered amount, and when there is no corresponding key code. New input key code should be located 2
This example shows a case in which the method of intervening between two records is combined, and in this case, it is possible to register a new key code and calculate the numerical value belonging to the same key code at the same time, but detailed explanations are omitted. do.

As mentioned above, in the data input method for an electronic computer of the present invention.

(1) Compare the key code of the input data with the key code located at position H of the number of records of already input key codes arranged in sort order.

If the key code does not match, by comparing it with the key code at the 1/2 position of the key code group to be matched, which is reduced to J (%) for each match, the total number of records is reduced from 1 to N, as in the conventional method. Compared to the method of matching all the key codes in In contrast, in the method of this invention.

Only one more verification is required, and the verification time can be significantly reduced when the amount of data to be processed is large.

(2) The key code matching method of (1) above, which compares with the key code at 1/2 position of the record to be matched each time, and when there is no corresponding key code, the key code of the data input from the sort order By using the method of recording data by interrupting the record position where the code should be located, the data file is arranged in the order of the key code, and the sorting of one ledger can be omitted. Conditions arranged in order can be arranged naturally without using any other processing means.

(3) As shown in Figure 4 above, the key code verification method in Figure 1 above, the record interrupt recording method in (2) above, and the calculation data processing method shown in Figure 2 above are combined. For example, when compiling parts purchasing and dispensing data.

■Numerical data calculations can be performed while recording input key codes and numerical data one after another in sorted order, so the number of records is mainly based on the number of key codes purchased and paid out during the current aggregation period. It only needs to be stored in the memo IJ 12, and there is no need to read into the main memory 12 the entire parts ledger that has no track record of purchasing or dispensing, as is the case with conventional methods. Can process a lot of data.

■Compared to the conventional method, which collates the input key code against the total number of registered key code records and then processes the numerical data of the corresponding key code, the amount of records to be collated is reduced. This also speeds up data processing.

■Ledger record containing all registered key codes
This is because we do not perform arithmetic processing on ζ.

Especially in the case of data processing that does not require verification with a ledger, there is no inconvenience such as not being able to perform aggregation processing unless the key code is registered in the ledger.

In the above embodiment, a case was explained in which a keyboard was used as an input device, but the input device can transfer data from a storage device in which key codes and data for each slip have already been recorded by another means. A configuration in which input is performed may also be used, and the same effects as in the above embodiment can be achieved.

〔Effect of the invention〕

As explained above, in the data input method of a computer, when the key code of the input data and the key code of the already registered data are compared, the position of 1/2 of the already registered data is The record position to be compared is reduced to H each time depending on the size relationship between the two key codes, which greatly reduces the matching process time compared to this type of conventional method. It has the excellent effect of being able to

[Brief explanation of drawings]

FIGS. 1 and 2 are flowcharts showing each procedure at the time of new data registration and the time of aggregation, respectively, in a data input method for a computer which is an embodiment of the present invention;
Figure 3 is a diagram showing an example of a data file used in the computer data input method of Figures 1 and 2;
FIG. 5 is a flowchart showing the procedure for aggregating data in a data input method for a computer according to another embodiment of the present invention, FIG. 5 is a block diagram showing the configuration of a conventional computer, and FIGS. FIG. 7 is a diagram showing an example of an inventory management ledger file and a purchasing and dispensing data file used in the computer shown in FIG. 5, respectively. In the figure, 1...Electronic computer, 2...Auxiliary memory, 3...Input device, 4...Cathode ray tube (CRT), 1
1... central processing unit (CPU), 12... main memory.

Claims (3)

[Claims] (1) In a data processing device having a rewritable storage device and an electronic computer having a data input device, when data is input from the input device, the key code of the input data is transferred to the storage device. The input key code is compared with the key code at the 1/2 position of all the key codes already stored in the key code order, and the input key code is determined to belong according to the magnitude relationship between the input key code and the key code of the storage device. By comparing the key code at the 1/2 position of the remaining 1/2 recorded record and repeating this process, the target range is reduced by 1/2 for each comparison.
A data input method for an electronic computer characterized by subtracting data by two. (2) When a corresponding key code is found as a result of the verification, data belonging to the corresponding key code is calculated. input method. (3) As a result of the above verification, if there is no corresponding key code, increase the rank of data belonging to a key code larger than the input key code one by one, and insert the data belonging to the input key code. A data input method for an electronic computer according to claim 1, characterized in that the data is stored.