JPS60134969A - Recording system - Google Patents

Abstract

PURPOSE:To accelerate retrieval of sequential file data recorded in an auxiliary memory device by preparing index files in plural hierarchies until the number of counted blocks becomes the prescribed value. CONSTITUTION:When a host computer 11 tansmits data, and the data are filed in a floppy disk FD12, the data are stored in the FD12 in sequence. Then a counting part 16 counts the number of blocks, and an index file IDF generation part 14 is activated when a decision part 17 decide >1. By gathering top data in a block, which are arranged in the ascending order, an index file IFn is prepared. This operation is repeated until one file becomes one block, and an index file IF1 with n-stages of hierarchies is generated. By building the index file IF1 in n-stages of hierarchies in memory, access of the FD12 is reduced, and retrieval of sequential file data can be accelerated.

Description

DETAILED DESCRIPTION OF THE INVENTION (a1) Technical Field of the Invention The present invention relates to a recording method capable of increasing the search speed of data recorded in an auxiliary storage device or the like in an automatic transaction device.

(b) Technical background In recent years, automated teller machines (Cash
Dispenser: CD) and cash automatic deposit payment N&(8 automatic Teler Ma
Automated transaction devices such as Chine (ATM) are widely used.

In these devices, transactions such as cash payments and deposits are usually performed by inserting a credit card (hereinafter referred to as a card) or a bankbook, and inputting transaction information from a keyboard.

Because of their convenience, their usage has increased and the number of installed units has also increased, and they are now being installed not only in financial institution stores but also at transportation stations.

Furthermore, not only online processing but also offline processing has come to be performed.

In order to prevent unauthorized use that has occurred due to loss or theft of cards as usage has increased, in the case of offline processing, a magnetic recording file in the device is used to quickly check the account numbers of these accidental cards. Registration is being done.

Therefore, since the amount of data to be registered is large, it is desirable to shorten the search time for comparing this data.

TCI Prior Art and Problems Conventionally, when an automatic transaction device is used offline, the account number of the accident cart is stored in a magnetic recording medium within the device as data necessary for transactions.

If the amount of data is small, it may be stored in memory, but if the amount of data is large, an auxiliary storage device must be used. As the auxiliary storage device, for example, a floppy disk (hereinafter referred to as FD) is used.

However, auxiliary storage devices take a long time to access data, and it takes time to search using the same method as in memory, and each time a transaction is made, a search is performed to match the account number of the accident card and the card used. This has the disadvantage that not only does the transaction time become longer and the service quality deteriorates, but also the operating efficiency of the automatic equipment is reduced.

(d) Purpose of the Invention The purpose of the present invention is to solve the above-mentioned drawbacks, and to provide a recording method that can increase the search speed of sequential file data recorded in an auxiliary storage device. .

te1 Structure of the Invention The present invention provides an index file creation means for creating an index file by collecting the first or last data of each block in a lower hierarchy of data to be filed and recording it in a block in an upper hierarchy; a counting means for counting the number of blocks for each layer of the file;
This recording method is characterized in that it is equipped with a determination means that compares the counted value with a predetermined value and makes a determination, and creates index files in multiple layers until the number of counted blocks reaches a predetermined value, By doing so, the purpose can be achieved.

[f) Embodiment of the Invention An embodiment of the present invention will be described below with reference to FIGS. 1 to 5, as an example of an offline automatic transaction device. FIG. 1 is a block diagram showing an embodiment according to the present invention, and FIG. 2 is a block diagram showing an embodiment according to the present invention.
3 is a flowchart of FIG. 2, FIG. 4 is an explanatory diagram of the data retrieval method of FIG. 1,
FIG. 5 is a flowchart of FIG. 4.

In FIG. 1, 1 is the main control unit, 2 is the display, and 3
1 is a display side faf, 4 is a display buffer, 5 is a keyboard, 6 is a key input control unit, 7 is a buggy sofa, 8 is a card read/write unit, 9 is a card read/write faf, 11 is a host computer, 12 is an FD , 13 is an FD control unit, 14 is an index file creation unit (hereinafter referred to as 1DF creation unit), 15 is an index file control unit (hereinafter referred to as 1DF control 91), 16 is a counting unit, and 17 is a discrimination unit.

The host computer 11 is connected only when sending data to the FD 12, and is disconnected after data has been recorded and updated. When recording data by operating the keyboard 5 without transmitting it from the boss computer 11, the input data is displayed on the display 2 and after confirmation is pressed
It is recorded in D12.

The FD 12 has an area for recording sequential data and an area for index files created in multiple layers using a method described later. For example, it has a data file and an index file in which the account number of the accident card, etc. are recorded sequentially. That is, one block is one sector, which is the minimum unit for accessing data on the FD 12, and several pieces of data are stored in it, and a collection of these blocks is called a file. Data is arranged in ascending order through blocks and files.

The FD control section 13 includes the main control section 1 and the IDF creation control section 15.
It controls access to data recorded on the FD 12 based on commands from the FD 12. When recording data, the data file creation and IDF creation control unit 15
Writes the index file according to the command. Furthermore, when performing a data search, the main controller 1a has a function of sequentially checking in which block the search data commanded by the main control section 1a is located, starting from the upper hierarchy of the index file.

The IDF creation unit 14 creates a lower level I- of the filed data.
It has a function to collect the first or last data of each block and record it in the upper layer block to create an index file.

11) F creation control section 15D1? Creation part 14. It controls the counting section 16 and the discriminating section 17, and is in charge of creating and searching an index file of data recorded in 12.

The counting unit 16 counts the number of blocks for each layer of the created index file.

The determining unit 17 has a function of determining the counted value (>1) in order to create index files in multiple layers until the counted number of blocks reaches a predetermined value (\=1).

Since it has such a configuration and function, when data is sent from the host I-computer 11 and filed in the FI 2, the data is first transferred to the FD 12, as explained with reference to FIG. 2 and FIG. recorded sequentially. Each line in FIG. 2 indicates one block, and the end of the data file F of the block group in which data is filed is indicated by EOF.

Next, the counting unit 16 counts the number of blocks, and when the determining unit 17 determines 〉], the IDF creating unit 14 is activated. Then, the first data in the blocks arranged in ascending order are collected to create an index file IFn. At this time, the number of blocks
becomes.

Then, the counting section 16 counts the number of blocks, and the discriminating section 17
When the index file IF(n
-1) Create.

This process is repeated until one file becomes one block. Then, an n-layer index file IFI is created, and a maximum of M pieces of data can be filed. The number of blocks in all the data files at that time is Σm”
' pieces are required.

If all index files are created within 17D12, the required information can be obtained with (n-1-1) accesses. If you create an index file that uses less memory, for example IFI, in memory, FD12
accesses are reduced, allowing faster searches.

Next, the operation when searching for data from the FD 12 in which the data is indexed will be described with reference to FIGS. 4 and 5.

First, when a card is inserted into the card slot (not shown) of the device, the card read/write section 8 reads the card number and sends it to the FD control section 13.

The FD control unit 13 first looks at the index file IF1 and checks in which block of the index file IF2 the data is located.

This is continued until the index file IFn is reached, which block is found, and the target data is extracted from that block.

If the data can be found and repeated, the card is determined to be an accident card, and necessary measures are taken, such as not conducting the transaction and notifying the staff.

If the data cannot be found in the file, it is determined that the cart is not an accident and the transaction is started.

In this way, the data to be searched is sequentially searched for from the index file IFI in the upper hierarchy to the lower hierarchy to find the block in the index file IFn.
Search speed can be significantly improved.

In the above example, the index file was created by building up the data at the beginning of the block, but it is also possible to create the index file by collecting the data at the end of the block.

The present invention will be explained in detail with reference to FIGS. 6 and 7(a) to (C1). FIG. 6 is a block diagram showing the main parts of an application example, and FIGS. 7(a) to (C1 are It is an explanatory view of Fig. 6. The same reference numerals indicate the same objects throughout the figures.

FIG. 6 shows a block diagram of a method for rapidly updating data stored in a sequential file.

In the conventional method of updating sequential files recorded in ascending order on an FD, in order to maintain the ascending order of data, ■ All data after the data to be inserted is I? ]) How to read and write.

■How to operate by attaching a pointer to all individual data.

is taken.

However, although the method (2) allows a complete sequential file to be obtained, updating requires accessing a large amount of data and takes time, and the method (2) has the disadvantage that the number of accesses increases during a search, which takes time.

In this application example, a pointer for updated data is provided at the end of the relevant block, and the data is filed in another area.

That is, in FIG. 6, la is the main control unit, and 12a is F.
D, 1.3 a is the FD control section, 18 is the pointer setting section,
19 indicates a data update control section.

As shown in FIG. 7+al and (bl), the FDI 2a has a block number for recording sequential data, a pointer area provided at the end of each block, and an extended block area for recording update data.

In the pointer area, when data is updated, an extension block number is added to the end of the block into which the updated data should originally be inserted, indicating that the updated data is recorded in the extension block with that number.

The FD control unit 13a controls access to data recorded on the FD 12a based on commands from the main control unit 1a and the data update control unit 19, and when recording update data, the commands from the data update control unit 19 are used. Write the
When searching for updated data, the main control unit 1a has a function of searching for the block number of the data specified by the main control unit 1a using a pointer, and searching from the block to which the pointer is attached.

The pointer setting section 18 has a function of specifying the number of an extended block in which update data is recorded and sending it to the data update control section 19.

The data update control unit 19 has a function of recording the specified block number sent from the pointer setting unit 18 in the pointer of the block where the update data is to be written, and also recording the update data 8 in the specified extended block. ing.

With such a configuration and function, when additional data is to be recorded, the FD1 has already been used as shown in FIG.
2a has data recorded in blocks B1 to Bn, and when additional data RN is sent from the host combiner 11, the block to which the additional data is to be stored is searched and, for example, R21,>RN>R31. Then, as shown in FIG.
Q+l is recorded in the pointer of , and the data is recorded in the empty area of extended block B(n+1).

When it is acceptable for the data in block B2 to be out of ascending order, it is recorded in this manner. When ascending order is required, as shown in FIG. 7fcl, block B2 is rewritten in ascending order and the last data is placed in the empty area of extended block f3rn-1-1). When the expansion block B(n-)1) becomes full, it is expanded using a new expansion block B(n4-2),-.

Also, when erasing data recorded in extension block B (n+1), first erase data recorded in extension block B (n + L).
, and then divide fi+l of the pointer of the corresponding block B2 by t.

When searching for data recorded in expansion block B(n+1), for example, the account number of the card is read by a part of the card reader 1 (not shown), and the search data is transferred from the main control unit 1a to the FD control unit 13a. When the data is sent to the FD 12a via the FD 12a, it is first searched for the presence or absence of data at the position of the corresponding block among blocks Bl to Bn, and if there is no data, the number of the extended block recorded in the pointer at the end of that block is read. Retrieve data from the corresponding extension block.

In this way, the number of accesses to the data in the FD 12a is small, and updates can be performed quickly.

In all of the above examples, the account numbers of accident cards are sequentially filed in transactions using automated teller machines, but in general, sequential file recording and searching are performed using an auxiliary recording device such as an FD.

The same effect can be obtained even when applied in cases where

([1] As described in detail, according to the present invention, file data in a magnetic recording medium can be searched at high speed, and as shown in the application example, data can be updated at high speed.) There is an effect that it can be done.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment according to the present invention, FIG. 2 is an explanatory diagram of the data recording method of FIG. 1, FIG. 3 is a flowchart of FIG. 2, and FIG. 4 is a data retrieval method of FIG. 1. FIG. 5 is an explanatory diagram of the flowcharts 1 to 4 in FIG. 4, FIG. 6 is a block diagram showing the main parts of the application example, and FIG.
is an explanatory diagram of FIG. 6. In the figure, ■, 1a is the main control unit, 11 is the host computer, 12.12a is a floppy disk (FD), 1
3.13a is an FD control section, 14 is an index file (IDF) creation section, 15 is an IDF creation control section, 16 is a counting section, 17 is a discrimination section, 18 is a pointer setting section, and 19 is a data update control section. 1 Healing 2 Cake Cse- Fu 3 Roka 4- Gate broom Otsu Figure I1

Claims (1)

[Claims] Create an index file that configures one block with multiple units of data, configures a file with multiple blocks, and creates an index file consisting of multiple blocks that collects the first or last unit data of each block. and counting means for counting the number of blocks in the created index file, and the index file is created over multiple layers until the counted number of blocks reaches a predetermined value. Recording method.