JPH0219968A - File device - Google Patents

Abstract

PURPOSE:To shorten a retrieving time and to freely add or delet items by collecting the data on a single item into a data file. CONSTITUTION:A file control part 2 is prepared together with a control file part 3 and a data file part 4. A group data producing part collects data for each item and produces the group data for each item. Then the part 4 files each group data obtained by said data producing part into a magnetic disk device. The additional new items are added to the group data which are already collected and registered. At the same time, one of these group data is selected in response to the due retrieving command and the data are retrieved out of the selected group data. Thus the data are extracted in response to the retrieving command. As a result, the data retrieving time is shortened and the items can be freely added or deleted without rearranging data.

Description

[Detailed Description of the Invention] [Objective of the Invention 1 (Field of Industrial Application) The present invention provides a file device that files a plurality of data belonging to a plurality of items in association with each other, and searches the filed data. Regarding.

(Prior art) When handling multiple pieces of data covering multiple items, in order to facilitate searches, these pieces of data are related to each other in a file, and the items that are expected to be searched are designated as “key items.” In many cases, the data corresponding to this "digital item" is extracted from the file (data file) in which each of the above-mentioned data is stored, and a file (index organization file) is created in which the extraction results are arranged.

Then, during a search, while referring to the indexed file, each data in the data file is sequentially read in one data unit (for example, "256" byte unit), and the contents jqed by this reading operation are compared. , and the search content, and repeats this operation until they match, and extracts data corresponding to the search content.

(Problem to be Solved by the Invention) By the way, in such a conventional file device, when there are multiple sets of data of multiple items A to F, these are serially arranged in units of sets as shown in Figure 8. Since the file was created by repeating the operation, when searching for the same item, for example item A, after reading item A1 written in the first field, up to the field where the next item A2 was written. , have to jump.

Therefore, by jumping between these fields,
There is a problem in that the time required for the search becomes long.

Also, as shown in Figure 9, after the final item F, another item G
When adding items, it is impossible to add items unless an empty area is created between each set, so it is practically impossible to add items.

In view of the above circumstances, it is an object of the present invention to provide a file device that can significantly shorten the time required for a search operation and that can freely add and delete items without rearranging data. It is an object.

[Structure of the Invention] (Means for Solving the Problems) In order to achieve the above object, a file device according to the present invention is a file device that files a plurality of data covering a plurality of items in a related manner. a group data creation unit that creates group data for each item by creating group data for each item; a file unit that fills each group data obtained by the group data creation unit into a magnetic disk device; and a search unit. When a command is input, one of the group data corresponding to the search command is selected, and the group data selected by this selection operation is searched to extract data corresponding to the search command. It is characterized by having a search section for searching, and the following.

(Function) In the above configuration, when data of a new item is added, the group data creation section collects the data as group data, and the file section adds the group data to the already registered group data. .

Furthermore, when a search command is input, the search unit selects one of the navigation group data corresponding to the search command, and the data in the selected group data is searched by this selection operation. The data corresponding to the search command is extracted.

(Embodiment) FIG. 1 is a block diagram showing an embodiment of a file device according to the present invention.

The file device shown in this figure includes an operation section 1, a file management section 2, a management file section 3, a data file section 4, and an output section 5, and is capable of registering input data, Search for data that has already been registered.

The operation unit 1 includes a keyboard, a CRT, etc.
When data, commands, etc. are input from the keyboard, they are supplied to the file management section 2, and when display data is supplied from the file management section 2, it is prevented from being displayed.

The data file unit 4 also includes a plurality of data horn files 10(1) to 10(N) and an empty area 7, as shown in FIG. When supplied, the data supplied together with this write command is stored in the specified address of the data file designated by the M edict write command. Further, when a read command is supplied from the file management unit 2, the content stored at the specified address of the data file specified by the read command is read out, and this is supplied to the file management unit 2. .

The data file 10(1) includes term 1-1'“A
This is the part where data subject to "is stored, and includes one management record 11 and multiple data records 12(1) to 1
It is divided into 2 (L).

Data record 12(1) is m'' belonging to item “A”
a relative record number area in which relative position data from the record indicated by a pointer (not shown) is written;
"m" pieces of data A(1) composing the term 4A Il
It is divided into (IIl) detailed data areas into which A(Il) is loaded.

Further, the other data records 12(2) to 12(L) are configured similarly to the data record 12(1).

And these data records 12(1) to 12(L)
Each detailed data area is arranged in order from the smallest number.
If the last detailed data area is used, it is rewritten and reused in order starting from the first detailed data area.

Furthermore, the management record 11 includes each data record 12 (
This is a record for managing 1) to 12(1-),
Relative to the record pointed to by said pointer (
A relative record number area where relative position data indicating the O position is written, a current pointer area where the vertical current value and horizontal current value indicating the currently specified detailed data position are updated, and this data file 10 (1) It is divided into a recycle identifier area, which is set when the detailed data area within is used.

Other data files 10(2) to 10(N> are also configured in the same manner as the data file 10(1) described above, and each includes detailed data B(1) belonging to item 111-3 IT to "N". )~B (M)...N(1)~N(M)
is stored cyclically.

Further, the management file section 3 stores each data file 10(1) to 10(N) stored in the data file section 4.
As shown in FIG.
It is divided into.

The management file record 15(1) is a record for managing the data file 10(1), and includes an area 16 for specifying the data file 10(1) and a data file 10(1) specified by this area 16. 1
) and each detailed data A(1) to A(m)-N(1) to N stored in each data file 10(1) to 10(N).
(n) The area 18 is divided into an area 18 in which the data of the genus t't is stored.

As shown in FIG. 4, the area 16 includes an item group name area where a name (item group name) specifying the data file 10(1) is written, and a file number value automatically generated by the system. 5EQ (No> area) and an external file information area where the name of the magnetic disk device in which the data file section 4 is located and the external file name used when specifying the data file section 4 are written. Separated.

The area 17 also contains data that does not indicate the address (management line address data) of the management record 11 in the data file 10(1) or 7 of the data record 12(1) in the data file 10(1). 4 data indicating the address (starting row address), data indicating the address (ending row address) of data record 12(N), and the number of detailed data that can be stored in each of the data records 12(1) to 12<N>. (Increment number) is written in the address information area, the data number area is written in which the number of detailed data stored in the data file 10(1) is written, and the number of terms stored in the area 18 is too large. If it cannot be managed with one management record, the S of the next management record
It is divided into a connected information area where the EQ (No) value is updated.

The area 18 is divided into "N+1" item attribute information areas into which attribute data of each item "Δ" to "'N" is written.

In this case, each item attribute information area includes a record registered flag area where data indicating whether the corresponding item is accessible or not is inserted, and an attribute type area where attribute data of the corresponding item is written. , and a number of effective digits area where data indicating the number of effective digits of the corresponding item is read.

Further, when the print data is supplied from the file management section 2, the output section 5 prints it on a recording paper 6 and discharges it to the outside.

Further, the file management section 2 includes a processing device such as a microprocessor, and controls the operation of the entire file device based on a preset program.

Next, the search operation of this embodiment will be explained with reference to examples of paper-making operation event data management in a paper pulp factory shown in FIGS. 5 and 6 (a) to (d).

For example, if the operation unit 1 is now operated and "' SOG Y O" indicating that the search item is a date and the date data ladder '880203' to be searched are input,
The file management section 2 selects the management file record whose item group name is described as "SOG Y O" from among the management file records 15(1) to 15(N>) of the management file section 3.

In this case, management as shown in Figure 5)? illre code 1
Since "5OGYO" is written in the item group name of 5(1), the file management unit 2 determines whether this management file code 15(1) corresponds to the search target item. It is determined that the code is invalid, and it is read.

After this, the file management unit 2 stores the external device name, external file name, management line address, start line address, etc. written in the management file record 15(1) just found.
As an increment number, each “D Koo” “αI+
111 TT Read out “2” and “6”, which is the search target item group name, along with the reading size.
The contents of the item attribute information area (1) corresponding to "Y O" are read out.

Thereafter, the file management unit 2 reads the management record 11 of the data noisle 10(1) specified by the external device name, external file name, and management line address that have just been read, and reads this management record 11. Check the vertical current value and horizontal current value written in the current pointer.

If ii 3 u is written as the vertical current value and 5'' is written as the horizontal current value in this management record 11 as shown in FIG. 6(a), the file management section 2
The data records 12 designated by these vertical current values "3" are read out all at once.

Thereafter, the file management section 2 checks whether the cycle identifier of the management record 11 has the value "1'".

If this cycle identifier has the value "1", the file management unit 2 determines that the detailed data of the data file 10(1) is circulating, and specifies the data by the horizontal current value "5". The value of the detailed data (oldest detailed data) at the next address (the address specified by point P (1)) is read out, and the date data "880203°" that is the search target is found in this data file. 10(1).

In this case, the oldest detailed data contains the value “'87121
0” is written, and “871210” < “88
0203'' holds, the file management unit 2 determines that there is a possibility that the date data “880203” that is the search target exists in this data file 10(1), and As shown in FIG. 6(b), among the detailed data in the data record 12(3),
Compare the value "880220" of the first detailed data (the data value specified by pointer P2) with the date data "880203" that is the search target, and search in the data record 12 (3). Check whether the target day fij data "880203" exists.

In this case, '1180220''>“880203''
Therefore, the file management unit 2 stores the date data "880" to be searched in the data record 12(3).
6 (C ), check the first row of detailed data (data specified at point P3) at the beginning.

And here, the detailed data at the beginning has the value “880
202” is input and output, “880202” < “880
203” holds, the file management unit 2
It is determined that the date data "880203°' to be searched exists in each of the detailed data that has just been read, and the values of each of these detailed data are sequentially imported from the beginning, and these multi-value and search The target date data value "880203" is sequentially compared, and the address number of the detailed data with which they match is extracted.

In this case, vertical address value “3”, horizontal address value “°3”
Since the detailed data at the vertical address value "3" and the detailed data at the horizontal address value "6" match the value "880203" of the date data being searched for, the file management unit 2 It is determined that each detailed data is the search target data, and the vertical address value and horizontal address value of each of these detailed data are stored as search parameters.

After this, the file management unit 2 stores this data file 10.
After finishing the processing of (1), processing of another data file, for example, data file 10(2), is started.

In this process, the file management unit 2 first stores the detailed data corresponding to (IC1) in the ttJ search parameter, that is, the address specified by the pointers P4 to P8 of the data record 12(2) as shown in FIG. 6(d). ``Frame change'' ``Frame B'' Frame change'' Direct change described in ``Frame change'' is read out, and these are supplied as search results to the operation unit 1 for display,
It can be printed out from the output section 5.

Next, the file management unit 2 sequentially selects the remaining data files 10(3) to 10(N>) in the same manner as described above, and selects each of these data files 10(3) to 10(N>) sequentially.
) to 10(N), the content described in the number specified by the search parameter is read out, and this is supplied as a search result to the operation unit 1 for display or output. From part 5 onwards, there will be a first act.

In this way, in this embodiment, data belonging to one item is collected as one data file, so the search process can be performed without performing a zip operation or the like.
It is possible to search for target data and extract data from other data files based on the search results.

This makes it possible to reduce the time required for searching.

In the example mentioned above, each of the 111 detailed data is compiled item by item into each data file 10(1) to 1.
0(N) and each management file record 15(1) to 15
(N), each of these data files 10(1) to 10(N) is created as shown in Figure 7 <a> and (b).
) and each management file record 15(1) to 15(N>), management file record 15(P) corresponding to the new item and data file 10(P) are added to each free area 7.8 without changing the management file records 15(1) to 15(N>). can be easily added.

[Effects of the Invention] As explained above, according to the present invention, it is possible to significantly shorten the time required for a search operation, and it is also possible to freely add or delete items without rearranging data. .

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an embodiment of the file device according to the present invention, FIG. 2 is a schematic diagram showing the details of the data file section shown in FIG. 1, and FIG. Figure 4 is a schematic diagram showing the details, and Figure 4 is a schematic diagram showing the relationship between the management file section and the data and tough aisle section shown in Figure 1.
The figure is a schematic diagram for explaining a search operation example of the same embodiment, and FIGS. (b) is a schematic diagram for explaining the item addition operation of the same embodiment, FIG. 8 is a schematic diagram showing an example of a file created by a conventional file device, and FIG. 9 is a diagram shown in FIG. 8. FIG. 2 is a schematic diagram for explaining an operation of adding a file item. 2...Group data creation section, file section, search section (
file management department)

Claims (1)

[Claims] (1) In a file device that files multiple items of data related to each other, there is a group data creation unit that collects data into the same item and creates group data for each item, and a group data creation unit that creates group data for each item. a file section that files each group data retrieved in a magnetic disk device; and when a search command is input, selects one of the group data corresponding to the search command from among the group data, and selects one of the group data corresponding to the search command by this selection operation. 1. A file device comprising: a search section that searches within group data that has been searched and extracts data corresponding to a search command.