JPH0350644A - High speed access system for massive data file - Google Patents

Abstract

PURPOSE:To process more than two telephone numbers at a high speed by dispersing files, newly providing control files and causing respective files to execute an I/O action at every time. CONSTITUTION:When there is no update, a C-file is developed on a memory for improving processing efficiency. When the processing of the telephone number is selected from an online terminal, a toll/local number or other information is inputted. A job program searches the C-file at first so as to obtain the relative record number of a B-file corresponding to the inputted toll/local number. When other information is inputted, the toll/local corresponding to information concerned and the relative record number are obtained. Then, the record of the obtained relative record number is obtained from the B-file, and the record of the B-file is searched from the head so as to obtain the number in an unused state. The relative position from the head comes to the lower four digits of the telephone number, namely, a subscriber number.

Description

[Detailed Description of the Invention] (Industrial Application Field) The present invention relates to a large-capacity file access method, and in particular, a file access method using a main record key (prior art).A large-volume data file is a file for managing telephone numbers. , the phone number becomes the primary record key.

Further, some information regarding the telephone number serves as a secondary record key. The secondary record key distinguishes whether the telephone number is in use or not. Other information is valid only if you issue an unused phone number according to the above conditions.

FIG. 2 is an explanatory diagram showing a series of access methods for a grand total data file according to the prior art.

In FIG. 2, key 1 is a main record key 1-2 to key n are sub-record keys, respectively.

Depending on the combination of keys 2 to h, it is determined whether the device is in an unused state or not.

In Figure 2, the file (File A) is subtitled.
It is very inefficient because it performs a collective search based on combinations of keys.

As mentioned above, this type of conventional access method performs a search using a combination of alternate record keys.
Access efficiency was low.

(Problem to be Solved by the Invention) In the conventional access method described above, it is necessary to search all records in order to search for a record that matches a specific key. For this reason, there are disadvantages in that the larger the number of records, the longer the search time, and the difficulty in providing smooth service for tasks that require a response.

The purpose of the present invention is to eliminate the above-mentioned drawbacks by distributing files and creating a new management file, and performing one I10 operation on each file, thereby providing smooth service even for tasks that require a response. The object of the present invention is to provide a high-speed access method for nine large-volume data files.

(Means for Solving the Problems) A high-speed access method for large-volume data files according to the present invention is configured to include first and second files.

The first file stores a large amount of data and allows the main record to be searched by a specific key combination.

The second file has a bit indicating whether or not the record matches a specific key, and is accessed using the relative position of the bit as the key of the main record.

(Example) Next, the present invention will be explained with reference to the drawings.

FIG. 2 is an explanatory diagram showing an embodiment of a high-speed access method for large-volume data files according to the present invention.

In FIG. 2, file A is similar to the file in the prior art and is the original file. The B file is a relative organization file, and is coded for one station number. File B manages the last four digits of the phone number, starting with 'oooot' and ending with %.
9999'.

In the B file, each bit represents the status of use/unuse for each station number. The C file includes other information for each area/city code and the relative record number of the B file.

When there is no update, the C file is expanded in memory to improve processing efficiency. When the online terminal selects the call number issue service, the area/city code or other information is entered. The business program first searches the C file and obtains the relative record number of the B file corresponding to the input area/city code. On the other hand, if other information is input, the area/city code and relative record number corresponding to the information are acquired. Next, a record with the obtained relative record number is obtained from the B file, and records in the B file are searched from the beginning to obtain an unused number.

The relative position from the beginning is the last four digits of the telephone number, or the subscriber number. The first relative position %OI is the subscriber number'ooo.

and henceforth, % 0001 ' % 0002 #
. . . The last 10-digit phone number obtained is used as the main record key to access files A, and the information is returned to the terminal.

In the present invention, each item is treated as a telephone number, but it will be more versatile if it is replaced with an employee code, product code, etc.

(Effects of the Invention) As explained above, the present invention distributes files to create new -hwwm files, and performs one I10 operation on each file, thereby allowing two or more telephone numbers to be added. It has the effect of being able to be paid out at high speed.

In addition, since subscriber numbers are managed using 1 bit as a code, even if a variable number (2 or more) of consecutive numbers are required, only one I10 operation is required, which results in faster payout. This has the effect that it is possible.

[Brief explanation of drawings]

FIG. 1 is an explanatory diagram showing an embodiment of a high-speed access method for large-volume data files according to the present invention. FIG. 2 is an explanatory diagram showing a series of access methods for large-volume data files according to the prior art. Patent author NEC Corporation

Claims (1)

[Claims] A first file that stores a large amount of data and can search for a main record using a combination of specific keys, and a bit that indicates whether or not a record matches the specific key; 1. A high-speed access method for a large amount of data file, comprising: a second file for accessing as a key of a main record.