JP2629034B2 - File management method for data with identifiers of unlimited length - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Overview] Regarding a file management system that centrally manages a large number of data having identifiers in a file, when a file with a limited file name length such as a UNIX file is used, an application program The purpose of this is to make it possible to handle identifiers of unlimited length in a single file structure without special consideration. For a given data identifier, the number of characters that is at least one less than the number of characters limited to the above file name Means for creating a series of part names by subdividing and adding a special continuation character indicating continuation after each part of the subdivided part except for the last one, and a given data identifier After subdividing, a series of partial names are sequentially extracted, and the tree structure of the file is traversed in the depth direction for each partial light, and matches the partial name Means to create a file by adding a new path to the partial name when the file cannot be found. After segmenting the given data identifier, a series of partial names are sequentially extracted and the tree structure of the file is extracted. And a means for searching for a corresponding file by tracing the path in the depth direction, and a means for searching and deleting the corresponding path.

[Industrial applications]

The present invention relates to a file management system for centrally managing a large number of data having an identification name in a file, and in particular, managing data having a long identification name such as a drawing in a file structure having a limited file name length. Related to file management method.

[Conventional technology]

In recent years, automation of design by a CAD system has progressed, and manufacturing drawings and the like are often managed in files by a computer. By the way, in a manufacturing factory that handles many kinds of products and parts, the number of drawings to be managed is enormous, and it can reach tens of thousands to hundreds of thousands, so it is increasingly important to improve the efficiency of file management by computer. It has become.

Drawings are given drawing identifiers (hereinafter referred to as drawing names), which are usually used in combination with various control items such as sequence numbers, equipment types, manufacturing locations, and other related symbols and numbers. It is common to make it easy to distinguish. For this reason, the drawing name becomes long, and when the number of drawings is large, a drawing name having a length of 30 to 40 characters is often used.

On the other hand, when a CAD system is built on UNIX, the file structure becomes a tree structure. However, since the file name including the directory of the tree structure has a limit on the length, the drawing name has N characters (usually N = 14). ).

[Problems to be solved by the invention]

Conventional UNIX files have a limited file name length. When handling data with particularly long identifiers, such as drawing names, the identifiers must be limited to the number of characters N
It had to be shortened to characters and corresponded to the file name.

For this reason, an index file for obtaining a file name from an identification name such as a drawing name is required, so that the file becomes a double file, which complicates processing such as addition and deletion of data, and increases the amount of data to be backed up. There was an inconvenience.

The present invention enables an application program to handle an identifier having an unlimited length in a single file structure without special consideration when using a file having a limited length of a file name such as a UNIX file. The purpose is to do.

[Means for solving the problem]

The present invention makes it possible to cope with a file structure having a limited file name length by subdividing a data identifier having an unlimited length. In the present invention, when the limited number of characters in a file having a limited file name length is N and the length of a data identifier having no given length is variable n, the data identifiers are sequentially arranged from the top. n, at least one less than N, for example N
A special character indicating continuation is inserted between each character, and a tree structure is formed by extending a path for each division unit.

FIG. 1 is a diagram for explaining the principle of the present invention. 1 is an application program for requesting data input / output or deletion, 2 is a file library management program based on the present invention, 3 is an OS, and 4 is an OS.
Is a data file managed by.

The functions of the file library management program 2 are as follows.

.., _Mn, and the special character indicating continuation is &. The limit number of characters of the file name in OS3 is N. At this time, (1) if nN, the file name is M ₁ ... _Mn ; (2) if N <n2 (N−1), the file name is
And _{M 1 ··· M N-1 &} / M N ··· M n, (3) 2 (N-1) <n3 if (N-1) a, the name of the file M ₁ ··· M _{N -1} & / M _N ... M2 _(N-1) & / M _2N-1. Similarly, a string of N characters consisting of N-1 characters and continuation character & Construct a tree structure of a file in which the number of characters is limited to N or less by considering it as a partial name.

[Action]

The principle of the present invention shown in FIG. 1 will be described with reference to a specific example in FIG.

When a new file is created, the character string of the identification name of the given data is replaced by the above (1), (2), (3),.
Subdivided like…, fetch the subdivided individual part names sequentially, follow the path on the existing tree structure, and then extend the new path first from the node (directory) where there is no more match Go on. The presence or absence of the following partial name is determined based on whether or not the current partial name includes the continuation character &.

For example, in the example of FIG. 2A, the given data identification name is abcdefg, and when the limit number of characters is N = 3, the subdivided file name is ab & / cd & / efg.

This is applied to the tree structure illustrated in FIG.
Follow the matching path from &&, cd &, and since there is no matching path first, branch the efg path from cd & to create a file. The end of this path (indicated by ◎, the same applies hereinafter) has information indicating the data position of the data file 4 in FIG.

Next, when searching for a file, the data identifier specified to be searched is subdivided in the same manner as in FIG. 2 (a), and the sequential path on the file tree structure is determined using the resulting series of partial names. Search and follow a series of paths that match the sequential part names to detect the end.

Next, when deleting a file, the tree structure is searched as described above. If the search is hit, the path of the search result is traced in the reverse direction. When the first branch point is reached, the path to that point is searched. delete.

The example of FIG. 2 (c) is a process for deleting the file with the data identifier abcdrst. The path of the corresponding file is searched by, and the paths rs & and t to the branch point cd & are deleted by.

〔Example〕

FIGS. 3A and 3B show the flow of each process of file creation and deletion of the file library management program according to the embodiment of the present invention. Hereinafter, each processing will be described according to the steps in the figure.

 In the file creation process shown in FIG. 3A, the data identifier specified is subdivided into partial names.

: Compare the subdivided sequential part name with the path of the sequential depth of the file tree structure (if there is a branch, the path of each branch).

: If there is a matching path, return and follow the path to the next depth. If there is no matching path, execute.

: Create a new path at the next depth.

: Repeat if there are remaining part names, and end when there are no remaining part names.

 In the file deletion process of FIG. 3B, the data identifier of the designated file is subdivided.

: Move the matching path on the file tree structure in the depth direction using the subdivided part names.

: If there is a remaining part name, the process is repeatedly executed. If there is no remaining part name, the search is terminated (hit).

: Reverse (backtrack) the next searched path and delete the next path.

: Return until the branch point is reached, execute, delete the path, and end.

〔The invention's effect〕

According to the present invention, it is possible to manage drawings having drawing identifiers of any length in a CAD system using UNIX files, and there is no need to create a special drawing management file. There is an advantage that the burden is significantly reduced.

[Brief description of the drawings]

FIG. 1 is a diagram showing the principle of the present invention, FIG. 2 is an explanatory diagram showing a specific example of file creation and deletion processing in the present invention, and FIG.
FIG. 11 is a flowchart of a file creation and deletion process according to the embodiment of the present invention. In Fig. 1, 1: Application program 2: File library management program 3: OS 4: Data file

Claims (1)

(57) [Claims] In a file management system for managing data having a data identifier having an unlimited length in a tree structure using a file name having a predetermined number of characters, a given data identifier has the same file name as that of a given file. Means for generating a series of part names by subdividing the number of characters by at least one less than the limited number of characters, and adding a special continuation character indicating continuation after each substring of the subdivided part except the final character string After subdividing the given data identifier, a series of partial names are sequentially extracted and the tree structure of the file is traversed in the depth direction for each partial light, and no path matching the partial name is found. Sometimes a file is created by adding a new path to the partial name, and after subdividing the given data identifier, a series of partial names are Means to search for the file by tracing the path of the file tree structure in the depth direction, searching the file tree structure for the given data identifier, and terminating a series of paths of the search result A file management method for data having an identifier with an unlimited length, characterized in that it has means for tracing in the reverse direction from the first branch to the first branch and deleting a path therebetween.