JPH04344952A - System for managing tree-structure file - Google Patents

Abstract

PURPOSE:To manage a large amount of file properly and immediately by executing processing operation of each directory and file through the reference or change of elements in structure expressions. CONSTITUTION:Files under tree-structure directories are managed by logical structure expression, not by pointer expression. That is, the structure of directories and files are converted into the structure expression capable of arithmetical operation using logical symbols '/' representing the relation between up-and- down directories and that between a directory and a file and '+' connecting files under the same directory, a pair of dilimeters '()' including the file group under the same directory, and the names A to N of each directory and file. The connection is expressed using the logical arithmetic symbols as shown in the expression I. The processing operation of each directory and file is performed by referring to or changing the elements of the structure expression 6 in the expression I.

Description

[Detailed description of the invention]

0001

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a tree-structured file management system in a computer system, and more particularly to a management system for moving, adding, deleting, etc. files without using a pointer format.

0002

2. Description of the Related Art Conventionally, when a computer has a large number of files to manage, a large number of files are organized by creating tree-structured directories and accommodating files in each directory. In this case, each directory or file is usually in the form of a pointer, that is, in a serially connected state (
They are managed in a mutually linked format using pointers that point to addresses in a parallel connection state (parent-child relationship) or in a parallel connection state (sibling relationship) under the same directory, and when moving, adding, or deleting these, pointers that change the link state are used. Processing operations were being performed.

0003

[Problem to be Solved by the Invention] However, in order to implement a file management method using pointer format, the system must be capable of pointer processing, and even if the system is capable of pointer processing, it is difficult to access the desired file. When processing, the name of each directory or file and the link status of the tree structure to which the file belongs are recognized before processing, so the processing speed greatly depends on the number of accumulated files and the pointer processing capacity of the system. be done. Therefore, in a system that handles a huge number of files, such as an electronic filing system, it has not been possible to perform file management even if a high-speed character processing CPU or the like is used.

The present invention was devised to solve such problems, and its purpose is to appropriately manage a large amount of files even in systems that do not have pointer processing ability or systems that have weak processing ability. Another object of the present invention is to provide a tree-structured file management method that can be performed quickly.

[0005]

[Means for Solving the Problem] In order to achieve the above object, the present invention manages files under a plurality of directories constructed in a tree structure using a logical format structural expression instead of using a pointer format. It is something.

[0006] As a concrete means, a first logical symbol representing upper and lower directories and the relationship between directories and files, a second logical symbol that connects multiple files under the same directory, and a system that includes a group of files under the same directory. The tree structure is converted into a structural formula that can perform four arithmetic operations using a pair of delimiters before and after, and the names of each directory and file, or their identification symbols. Now performs directory and file processing operations.

[0007]

Embodiments Hereinafter, embodiments of the present invention will be described with reference to the drawings.

FIG. 1(a) shows a tree-structured directory and file state diagram, and FIG. 1(b) shows structural blocks and structural formulas regarding the file state diagram. In the figure, A to N are names of directories and files.

The file management method according to this embodiment manages directories and files in a tree structure using a logical structural formula instead of using the conventional pointer format, and performs file operations such as moving, adding, and deleting using this structural formula. This is done by converting .

To explain more specifically, in this embodiment, first, the relationship between a directory (parent) and a file (child), or between a directory (parent) and a directory (child) is represented by the first logical symbol "/". ” symbol, and this creates the last file E, F, K, L, M, H, I, N.
Create a structural block that represents *1 in FIG. 1(b) represents each of the eight files in the state diagram of FIG. 1(a) using this structural block.

[0011] This structural block uses logic that allows four arithmetic operations as shown in *2 in Figure 1(b) by using the sign "+" which is the second logical symbol that connects multiple files under the same directory, for example, the root directory. Created in a structure of the form. This structural formula corresponds to the state diagram of the tree structure in FIG. 1(a).

[0012] Next, use a pair of front and rear delimiters "(" and ")" that include a group of files under the same directory, and use the above "/" symbol as a quotient (OR: | in logical expression).
The structural formula of *2 is logically expanded by regarding the "+" symbol as a sum (AND:・ in the logical formula). *3 to *5 indicate the expansion process, and *6 is a structural formula summarized as a result of logical expansion. In this way, the phase diagram of FIG. 1(a) can be expressed in the form of a *2 or *6 structural formula.

FIG. 2 is a state diagram of address storage areas for directories and files. As shown in this figure,
Each directory and file has a unique identification symbol for management, such as numbers (1), (2), etc., a directory or file name (A to N in this example), and the address where it is stored. element is assigned. That is, a file or the like can be identified not only by its file name, but also by its identification symbol or address.

[0014] Hereinafter, a method for actually managing files using, for example, identification symbols will be explained.

FIG. 3 shows a file structure when identification symbols are used. Here *7 is a modification of the above-mentioned structural formula *2. Also, in the same way that the quotient symbol can be omitted in the four arithmetic operations in ordinary logical formulas, if the "/" symbol in the structural formula *7 is omitted, the identification symbol group and each file are A structural formula containing only the connecting "+" symbol is created. *9 is a so-called summary type structural formula in which common identification symbols are summarized by the symbols "(" and ")" by logically expanding the structural formula *8. This *8 or *9 structural formula is stored in a memory or the like as management information.

FIG. 4 shows a screen display (input and result) when performing file operations and current directory information at that time.

[0017] Before file operation, the root directory (\
), the current directory information is ¥. *10 shows the command (CD) to change the current directory from \ to \A\B in this state. When this command is input, the address storage area in Figure 2 is referred to and into an identification symbol, and its identification symbol (1) (2)
is managed as new current directory information.

DIR *11 is a command to display contents on the current directory. When this command is input, the structure of *8 or *9 stored as management information is stored as current directory information. Search for terms that include (1) and (2), and search for terms that include (1), (2), and (5).
, (1) (2) (6) , (1) (2) (7) (11
) , (1) (2) (7) (12) , (1) (2) (
7) (13) is extracted. Among these, (1) (
2) Referring to the address storage area in FIG. 2, the identification symbols (5), (6), and (7) immediately below are converted into file names E, F, and directory name G, and these are displayed on the screen.

*12 shows a command (CD) to further change the current directory to the directory of G. At this time, G is identified by the identification symbol (7) in the address storage area of FIG.
This identification symbol (7) is added to the current directory information to obtain (1), (2), and (7).

*13 is a command to move the file M under the directory G to the directory \A\D\J in this state. FIG. 5(a) is a state change diagram when this instruction is executed, and FIG. 5(b) is a change diagram of the structural formula. This instruction is shown in Figure 5.
The content is to move the file M indicated by the broken rectangle line in (a) to the position indicated by the solid rectangle line. To explain the process, first, the file name M is entered in the address storage area of Figure 2 with the identification symbol ( 13) and subtract (1), (2), (7), and (13) from the management information (*8 or *9). On the other hand, the destination directory \A\D\J is (1) (4) (10
), so the identification symbol (13) is added to this (
1) Add (4), (10), and (13) to the management information. *16 in FIG. 5(b) represents this situation using a structural formula. Also, *17 is a structural formula that organizes *16,
*18 is a structural formula obtained by rearranging *17. The management information is changed to the contents of *18.

*14 in FIG. 4 is an instruction to copy the file K to \A\D\J in this state. FIG. 6(a) is a state change diagram when this instruction is executed, and FIG. 6(b) is a change diagram of the structural formula. This command is indicated by the rectangular solid line in Figure 6(a).
¥A¥D file with the same content as the file ¥B¥G¥K
The content is to be created at the position indicated by the rectangular solid line below ¥J. To explain the process, the file K is converted to the identification symbol (11) by referring to the address storage area in Figure 2, and this is converted to the identification symbol (1), (4), and (10) at the copy destination. Management information (
*18). *19 in FIG. 6(b) represents this state using a structural formula, and *20 is a structural diagram in which *19 is rearranged. The management information is changed to the contents of *20.

[0022] *15 in Figure 4 is current management information (*20)
This is a command to search for the location of the file I under . When executing this command, first convert the file I to the identification symbol (9) in the address storage area of Figure 2,
Extract (1), (4), and (9) including (9) from *20 with (9) as the target. The directory to which (9) belongs is the identification symbol (1) (4) immediately before it, so the directory name \A\D in the address storage area in Figure 2.
Convert it to display it on the screen.

[0023] In this way, this embodiment not only converts directory names and file names into identification symbols, but also represents tree-structured directories and file groups using a logical format structural formula that allows four arithmetic operations, and the elements of this structural formula. Since it is a method that directly manages files by simply referencing or modifying them, it is possible to effectively utilize the CPU's ability to perform four arithmetic operations, and it is possible to quickly and reliably manage a large number of files regardless of whether or not it has pointer processing ability. can be managed.

It goes without saying that directory and file names can be directly used as elements of the structural formula without converting them into identification symbols.

[0025]

[Effects of the Invention] As explained above, according to the present invention,
It is possible to provide a tree-structured file management method that can appropriately and quickly manage a large amount of files even in a system that does not have pointer processing ability or a system that has weak processing ability. The present invention particularly applies to high-speed character processing CPUs.
In electronic filing devices with
It has a great effect in that it can be used to manage huge files by effectively utilizing its capabilities.

[Brief explanation of drawings]

FIG. 1(a) is a tree-structured file state diagram, and FIG. 1(b) is a diagram showing structural formulas of file structure blocks, files, etc. according to the management method of this embodiment.

FIG. 2 is a state diagram of an address storage area used in the management method of this embodiment.

FIG. 3 is a diagram showing a structural formula when directories and files are actually managed using identification symbols.

FIG. 4 is a diagram showing changes in screen display and current directory information when a file operation is performed using the management method of this embodiment.

FIG. 5(a) is a state change diagram when a file move command is executed, and FIG. 5(b) is a diagram showing changes in the structural formula.

FIG. 6(a) is a diagram showing state changes when a file copy command is executed, and FIG. 6(b) is a diagram showing changes in the structural formula.

[Explanation of symbols]

A to D, G, J...Directory name, E, F, H, I
, K to M...File name, (1) to (14)...Directory or file identification symbol.

Claims (3)

[Claims] 1. A file management method for managing files under a plurality of directories constructed in a tree structure without using a pointer format, wherein the serial and parallel connection states of the tree structure are each represented by logical operation symbols, and , convert the tree structure into a structural formula in logical form using this logical operation symbol and the names of the directories and files, and perform processing operations on each directory and file by referencing or changing the elements of this structural formula. A tree-structured file management method characterized by: 2. A file management method for managing files under a plurality of directories constructed in a tree structure without using a pointer format, wherein serial and parallel connection states of the tree structure are each represented by logical operation symbols, and , assign a unique identification symbol to each directory and file name, convert the tree structure into a logical format structural formula using these logical operation symbols and identification symbols, and refer to or change the elements of this structural formula. A tree-structured file management method characterized by executing processing operations for each directory and file. 3. The logical operation symbols include a first logical symbol representing upper and lower directories and the relationship between directories and files, a second logical symbol that connects a plurality of files under the same directory, and a group of files under the same directory. The tree-structured file management according to claim 1 and claim 2, wherein the first and second logical symbols are logical symbols that enable four arithmetic operations. method.