JPH04101244A - Multi-sectioned data controlling system in small computer - Google Patents

Abstract

PURPOSE:To improve the using efficiency of a disk file device and a main memory by providing an index file having a head data storing position storage area and a rearmost data storing position storage area and a data control means to control data in a data file on the basis of this index file. CONSTITUTION:The index file 10 is provided with a data file name storage area 11 to store the data file name of the identification information of the corresponding data file 20, the head data storing position storage area 12 to store the head data storing position of each data section, and the rearmost data storing position storage area 13 to store the rearmost data storing position of each data section. The data control means 30 controls the storage, the retrieval and the deletion, etc., of the data in the data file 20 on the basis of the index file 10. Thus, the data of all the data sections is stored as far as there is room in the data file 20, and the using efficiency of the disk file device and the main memory is improved.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention is a compact computer with a limited main memory size, and is capable of storing multi-section data (such as daily product sales data) in a disk file device. This invention relates to a multi-section data management method in a small computer i that stores, searches, deletes, etc.

[Conventional technology]

Conventionally, in the multi-section data management method for this type of small computer, a data file and an index file having an index assigned to each data section are used, and the data stored in the data file is classified based on the specified data section. After the data is classified, it is stored in a data file, and information regarding the data storage position of the data is stored in the index corresponding to the data classification.

FIGS. 3(a) and 3(b) are diagrams showing the operation of an example of a multi-section data management method in a conventional small-sized computer when there are three data sections AB and C. (This is a model representation of the storage state.)

The data generation order is Al, B1. B2. ClA2. C2
,B3. A3. In the case of A4 and C3, the storage state of data in the data file and each inte node in the index file (index ID for data division A, A.

The storage status of the index ID for data section B, the inte node ID for B and data section C, and the information indicating the data storage position (relative record position number of the data file) in C) is as shown in Figure 3 (a). become.

In the case of the state shown in FIG. 3(a), new data is A5. B4. B5. When A6 and C4 occur in this order, the storage state of data in the data file and the storage state of information indicating the data storage position in the index file are as shown in FIG. 3(b).

When data classified into data category A is retrieved from a data file in the state shown in FIG. 3(b), the index ID for data category φ in the index file in the same figure, the data storage in A, The location is referenced and the data storage location in the data file of the data classified into data category A is recognized, and the target data A1 to A
6 is taken out.

[Problem to be solved by the invention]

In the above-mentioned conventional multi-section data management method for small computers, information regarding the data storage location is stored only in the index file, so information regarding the data storage location stored in each index is proportional to the number of data for each data section. The number of information changes. In order to improve data search efficiency, we want to ensure that each index in the index file has the same size and is located in a continuous area. Therefore, it is necessary to unify the size of the index to the size of the data division that has the largest amount of data.

From the above, the conventional multi-section data management method for small computers has the following drawbacks.

First of all, depending on the data classification settings, the int.

There are many unused parts in the file.

Furthermore, when the information in the index file is expanded into the main memory, an area in which the index for the data section with the largest amount of data can be expanded must be exclusively occupied in the main memory, which reduces the efficiency of use of the main memory.

Furthermore, if the amount of data in a particular data category exceeds the maximum number of data storage location information that can be stored in the index, the data cannot be stored even if there is room in the data file. For example, in the example shown in FIGS. 3(a) and 3(b), only up to 10 pieces of data can be stored in one data section.

In view of the above-mentioned points, it is an object of the present invention to store information regarding data storage locations in a data file along with an index file.
By including the index file in the file as well, the size of the index file can be made a fixed size that does not depend on the amount of data, which improves the usage efficiency of the disk file device (device that has data files and index files) and main memory. The object of the present invention is to provide a multi-section data management method in a small computer that can improve the performance.

[Means to solve the problem]

The multi-section data management method in the small computer of the present invention is as follows:
In a multi-section data management method for small computers that manages multi-section data in a disk file device in small computers with limited main memory memory size, data storage is used to configure data storage areas and chains in each record. A data file that has a storage area for information related to position, an index file that exists corresponding to this data file and has a first data storage position storage area and a last data storage position storage area for each data division, and an index file that is based on this index file. and data management means for managing data in the data file.

[Effect]

In the multi-partition data management method in a small computer of the present invention, a data file has a data storage area in each record and a storage area for information on data storage positions for configuring a chain, and exists corresponding to the data file. The index file has a first data storage position storage area and a last data storage position storage area for each data division, and the data management means manages the data in the data file based on the index file.

〔Example〕

Next, the present invention will be explained in detail with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of an embodiment of a multi-section data management system in a small computer according to the present invention. The multi-section data management system in the small-sized computer of this embodiment includes an index file 10, a data file 20, and a data management means 30.

The index file IO includes a data file name storage area 11 that stores a data file name that is identification information of the corresponding data file 20, a first data storage position storage area 12 that stores the first data storage position of each data division,
It has a last data storage position storage area 13 for storing the last data storage position of each data section. Note that a set of records in the data file 20 that is a free area after deletion (an area where data was stored and then deleted) is also treated as one data division.

The data file 20 includes a previous data storage position storage area 21, a next data storage position storage area 22, and a data storage area 23 for each record (each record is assigned a relative record position number). It is configured. Note that the present invention can be implemented even if only one of the previous data storage position storage area 21 and the next data storage position storage area 22 exists. Such a previous data storage position storage area 21 and a next data storage position storage area 22 (
If only one of them exists, the other is called the storage area for information regarding the data storage position for configuring the chain.

The data management unit 30 is a unit that manages storage, search, deletion, etc. of data in the data file 20 based on the index file 10, and is realized by conventional basic software related to data management. In addition, each operation described below is performed by this data management means 3.
0 (in the following description, the data management means 30 will not be mentioned).

Next, the operation of the multi-section data management system in the small-sized computer of this embodiment configured as described above will be explained. Here, we will explain the operation when there are three data divisions, A, B, and C, as shown in Figure 2 (a) to (e) (Figure 2 (a) to (e) are data divisions). (This is a model representation of the storage status of information related to information and data storage locations).

FIG. 2(a) is a diagram showing the initial state of the index file 10 and data file 20.

Index ID, A, for data divisions A, B, and C in the index file 10 that has the data file name of the data file 20 in the data file name storage area 11;
, ID, B and ID, C, the first data storage location storage area 12 and the last data storage location storage area 13 contain information indicating that no data exists (here, "-1").
'') is stored (post-deletion free space index LD for the post-deletion free space, r-IJ is also stored in the first data storage position storage area 12 and the last data storage position storage area 13 in X). ing). Note that the contents of the data file 20 are undefined.

The data generation order is A1. Bl, B2. C.I.

A2. C2, B3. A3. In the case of A4 and C3, index file 10 and data file 2
The stored state at 0 is as shown in FIG. 2(b).

For example, for data division B, data file 20
Data B1 is stored in the record with the relative record position number rlJ, data B2 is stored in the record with the relative record position number "2", and data B3 is stored in the record with the relative record position number "6". Ru. Therefore, the relative record position number in the data file 20 is “
In the previous data storage location storage area 21 of the record "1", information indicating that the data Bl stored in that record is the first data of data division B (here, "-1") is stored. , the relative record position number "2" of the record in which data B2 following data B1 is stored is stored in the next data storage position storage area 22 in the same record. In addition, the previous data storage position storage area 2 in the record whose relative record position number is "2" in the data file 20
1 stores the relative record position number "1" of the record in which data B1 before data B2 is stored, and data B is stored in the next data storage position storage area 22 in the same record.
The relative record position number "6" of the record in which data B3 subsequent to "2" is stored is stored. Furthermore, in the previous data storage position storage area 21 of the record with the relative record position number "6" in the data file 20, the relative record position number "2" of the record in which data B2 before data B3 is stored is stored. is stored, and the next data storage location storage area 22 in the same record contains information (here, "-1") indicating that data B3 stored in that record is the last data of data division B. Stored.

On the other hand, the index ID in the index file 10
, A, "0" and "8" are stored in the first data storage position storage area 12 and the last data storage position storage area 13 in index ID.

"1" and "6" are stored in the first data storage position storage area 12 and the last data storage position storage area 13 in B, and the index ID, the first data storage position in C [12 and the last data storage area] are stored. In the location storage area 13, “3
” and “9” are stored. In addition, the free space index ID after deletion, the first data storage position in X, storage area 12
And "-1" remains stored in the last data storage location storage area 13.

In the case of the state shown in FIG. 2(b), new data is A5. B4. B5. When A6 and C4 occur in this order, the storage state in the index file 10 and data file 20 becomes as shown in FIG. 2(C).

For example, for data division C, data file 20
Data C4 is added to and stored in the record whose relative record position number is "14". Therefore, in the previous data storage position storage area 21 of the record whose relative record position number is "14" in the data file 20, the relative record of the record in which the data C3 before the data C4 stored in that record is stored. The position number "9" is stored, and the next data storage position storage area 22 in the same record has data C4 stored in that record in data classification C.
Information (r-IJ) indicating that the data is the last data is stored. Further, in the next data storage position storage area 22 of the record whose relative record position number is "9" in which data C3 is stored, "14" is stored instead of "l".

On the other hand, the index ID in the index file IO
, the last data storage position storage area 13 in index ID, A is updated to "13", the last data storage position storage area 13 in index ID, B is updated to "12", and the last data storage position storage area 13 in index ID, B is updated to "12".
The last data storage location storage area 13 in D and C is “14”
will be updated.

In the state shown in FIG. 2(b), when retrieving or retrieving data in data section C is performed, the following procedure is performed (see FIG. 2(d)).

First, the index ID in the index file IO
, "3" in the first data storage location storage area 12 in C is acquired, and data C1 stored in the data storage area 23 in the record with the relative record position number "3" in the data file 20 is read out. .

Next, "5" stored in the next data storage position storage area 22 of this record (the record with the relative record position number r3J) is acquired, and the relative record position number is "5".
Data C2 stored in the data storage area 23 in the record `` is read out.

Similarly, data C3 in the record with the relative record position number "9" and data C3 in the record with the relative record position number "14"
Data C4 in the record is read out. Since "-1" is stored in the next data storage position storage area 22 of the record with the relative record position number "14", it is determined that data C4 is the last data of data division C.

Through the above procedure, one or more of the four pieces of data 01 to C4 of data category C stored in the data file 20 can be extracted.

In the state shown in FIG. 2(c), when data A3 and A4 are deleted, index file 1
0 and the storage state in the data file 20 is as shown in FIG. 2(e).

Since data A3 and A4 in the records with relative record position numbers rIJ and r8J are deleted, the previous data storage location storage area 21 in the record with relative record position number 17 will have free space after that record is deleted. Information indicating that it is the beginning of a (empty record) (here, "-"
1) is stored, and r8J, which is the relative record position number of the next empty record after the deletion of the same record, is stored in the next data storage position storage area 22 in the same record. In addition, in the previous data storage location storage area 21 of the record whose relative record position number is 18, the relative record position number 7 of the empty record after deletion before the same record is stored, and the next The data storage location storage area 22 stores information (here, "-1") indicating that the record is the last empty record after deletion.

Furthermore, in order to chain data A2 and data A5 to reflect the deletion of data A3 and A4, the next data storage location storage area 22 in the record with the relative record position number "4" is updated to "IO". , previous data storage position storage area 2 in the record with relative record position number "10"
1 is updated to "4".

On the other hand, the free space index LD after deletion in the index file IO, the first data storage position storage area 12 in X
"7" and "8" are stored in the last data storage location storage area 13.

Next, the specific operation of the multi-section data management method in the small-sized computer of this embodiment will be explained with reference to the fourth subsections (a) to (C).

FIGS. 4(a) to 4(C) are diagrams showing an example in which the multi-section data management method in the small-sized computer of this embodiment is used to record daily product sales data in a personal computer.

The data in this example is classified into 10 data categories by product, and data file 20 with the data file name rURIAGEJ (hereinafter referred to as data file/l, rURIA
GEJ).

Index file 10 with index file names rlD and UJ (hereinafter referred to as index files rld and U
J) is the index ID for data classification by product, and L! It consists of 01 to ID, Ulo, and post-deletion free space indexes ID and X, and each index stores a relative record position number in the data file rURIAGEJ as information on the first data storage position and the last data storage position.

Figure 4(a) shows products UO1, UO3 [JO4] on the first day.
, UO7 and UO9 (D data file - IUO3-1
, LIO4-1, UO7-1 and UO9-1 are stored in the data file rURI AGEJ in order, and on the second day, the products UO2, UO4, UO8UO9 and UI O(D
Theta U02-2. LIO42,00112,UO
9-2 and Ul O-2 are in turn data file rUR
It is a diagram showing the storage state of both files when stored in IAGEJ.

FIG. 4(b) shows that the product LI03. UO4, UO8 and 'U 100)
Data UO3-3, UO4-3, UO3-3 and Ul
It is a figure which shows the storage state of both files when o-3 is additionally stored in data file rUREAC;El in order.

FIG. 4(c) is a diagram showing, by arrows, the procedure when the data of product UO4 in which three pieces of data are stored is retrieved in the state of FIG. 4(b). The index ID in the index files rlD and UJ, "2" in the first data storage position storage area 12 of UO4 is obtained, and the relative record position number "2" in the data file "URIAGEJ" is obtained.

Records "6" and "11" are traced in order, and data UO4-1, UO4-2, and UO4-3 are extracted.

〔Effect of the invention〕

As explained above, the present invention allows the size of the data file to be a fixed size that does not depend on the amount of data by providing information regarding the data storage location in the data file as well as the index file. , there is no need to affect the size of the index file due to changes in the amount of data, the size of the index file can be related only to the number of data partitions, and unused portions of the index file are eliminated, reducing waste. It has the effect of disappearing.

In addition, since there is no storage limit on the amount of data for each data division due to the maximum number of data storage location information that can be stored in an index, which was the biggest drawback of the conventional method, all data divisions can be stored as long as there is room in the data file. This has the effect of improving the usage efficiency of the disk file device and main memory. This means that even if the amount of data exceeds the predicted value, it can be handled simply by enlarging the size of the data file, which also has the effect of increasing the tolerance for estimation of data files and index files. give birth to

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention; FIGS. 2(a) to (e) are diagrams illustrating the operation of the multi-section data management method in the small computer shown in FIG. 1; Figures 3(a) and (b) are diagrams for explaining the operation of the multi-partition data management system in the conventional small computer, and Figures 4(a) to (C) are diagrams for explaining the operation of the multi-partition data management system in the conventional small computer. This episode is for explaining the operation when the segmented data management method is used to manage daily product sales data. In the figure, 10... Index file, 11... Data file name storage area, 12... First data storage position storage area, 13... Last data storage position storage area, 20... Data file, 21... Previous data storage location storage area, 22... Next data storage location storage area, 23... Data storage area, 30... Data management means. Patent applicant: NEC Software Co., Ltd. Representative
Person Patent Attorney Jun Kawahara Figure 2 (b) Index File Data File No. 21W (C) 2] l j Second Cause (e) J Figure 2 (d) Figure 3 (Q) Section 3 (b) Inodex file Figure 4 (α) Inodex file 1st day products uo+, UO3 uo4. UO7, UO9 Figure 4 (b) 3rd day product LI03. UO4, UO8, UIO

Claims (1)

[Claims] In a multi-partition data management method for a small-sized computer that manages multi-partition data in a disk file device in a small-sized computer with a limited main memory memory size, a data storage area and a chain are defined in each record. A data file that has a storage area for information regarding data storage positions for configuration; and an index file that exists corresponding to this data file and has a first data storage position storage area and a last data storage position storage area for each data division. , a data management means for managing data in the data file based on the index file.