JP2013149068A - Method, system, and program for analyzing relevancy between files - Google Patents

Abstract

PROBLEM TO BE SOLVED: To extract a related file having a "weak relationship" by a search system or the like by mechanically analyzing files that are not associated with each other by a hyperlink, and display it on a screen.
SOLUTION: After acquiring file name and file path information from indexed file information, data of each file is acquired based on the file path, and a file name that conforms to the file name character string determination rule is included in the file data. It is determined whether or not the character string to be described is described. If it is described, the file path of the described file is set as the reference source file path, and the described file name is set as the reference destination file name in the second database. At the same time, for each file of the reference source file path, it is determined whether there is a file with a file name that matches the search key using the reference destination file name as a search key. Obtained from 1 database and has a weak relation in which the relation between the referrer and the referee is specified As file information.
[Selection] Figure 1

Description

  The present invention relates to a technique for analyzing a relationship between a large number of files stored in a file server, and in particular, in a search system, a file that can display a file related to a searched file in a search result. The present invention relates to a method and system for analyzing the relationship between programs, and a program.

  Conventionally, a large number of files have been created as computer performance increases and HDD capacity increases. For this reason, there is an increasing need for a search system that can quickly and accurately find a desired file from an enormous number of files. In particular, since each file is often associated with each other, the need to find other files related to a certain file has greatly increased.

For web pages in HTML (Hyper Text Mark-up Language) format stored in hypermedia databases represented by the WWW (World Wide Web), the search engine Google (registered trademark of Google Inc.) It provides a function to display other web pages related to the web page based on the correlation of hyperlinks.
The following patent documents 1 and 2 are mentioned as a well-known technical document relevant to this invention.

JP 2002-304393 A US patent US 6,285,999 B1

The above-mentioned Patent Documents 1 and 2 presuppose a correlation between hyperlinks created between Web pages when determining the relevance between files.
However, even if each file is related to each other, the correlation is not always clearly indicated by a hyperlink, and it is implied by referring to the name of another file in the file. There is also.
The former can be regarded as a “strong relationship” because the path of the linked file is clearly indicated by a hyperlink and the relationship is clear.
On the other hand, in the latter, the path of the link destination file is not shown directly, and the relationship is found based on data such as the file name and the update date and time, so that it can be regarded as a “weak relationship”.

Previously, files with “strong association”, that is, files associated with hyperlinks, could be mechanically recognized as related files by the system, but files with “weak association” Regarding files that are not associated with each other, that is, hyperlinks, it is necessary for a human to estimate that the files are related files based on their own judgment.
As a result, related files with “strong relevance” could be mechanically searched by the system, while related files with “weak relevance” require human judgment. There was a problem that it was not possible to automate, and it took a lot of time and labor to search manually.

  An object of the present invention is to mechanically analyze files having “weak relevance” that are not related by hyperlinks, to extract related files having “weak relevance” in a search system, etc. It is possible to provide a method, a system, and a program.

In order to solve the above-mentioned problem, the relationship analysis method between files according to the present invention includes a first step of acquiring file name and file path information from indexed file information stored in a first database;
When the data of each file is acquired based on the acquired file path, a character string indicating a file name that conforms to the file name character string determination rule is described in the file data, and if it is described Is stored in the second database with the file path of the described file as the reference source file path and the described file name as the reference destination file name, and the process of associating and storing the information of the detection date and time A second step for executing the file data;
The reference source file path stored in the second database is acquired, and the first destination file name stored in the second database is used as a search key for the file of each reference source file path. The index information stored in the database is searched to determine whether a file with a file name that matches the search key exists. If the file exists, the file path of the file is obtained from the first database, and the reference source A process of storing, in the third database, the information of the reference source file path, the information of the reference destination file path, and the information of the date and time when the relationship is determined as the information of the file having the weak relation in which the relation between the relation and the reference destination is specified. A third step executed on all file data, and a reference source and a reference destination not specified by a hyperlink And extracting the information of a file having a weak binding relationship.
The indexed file information stored in the first database includes information on the creation completion date / time of the indexed file information. In the third step, the creation completion date / time of the indexed file information Compare the information of the date and time when it is determined that the file with the file name matching the search key exists, and the reference source file path, the information of the reference destination file path, and the relevance only when the difference is within the allowable range. A fourth step of storing the determined date and time information in a third database is provided.
When a file path of a file linked to an arbitrary link is specified, the third database is searched using the file path as a search key, and a reference file path that matches the inspection key exists. It is characterized by comprising a fifth step of acquiring and displaying information on the date and time when the link to the reference destination file path and the relevance are determined from the third database.

The relevance analysis system between files of the present invention includes a first means for acquiring file name and file path information from indexed file information stored in a first database,
When the data of each file is acquired based on the acquired file path, a character string indicating a file name that conforms to the file name character string determination rule is described in the file data, and if it is described Is stored in the second database with the file path of the described file as the reference source file path and the described file name as the reference destination file name, and the process of associating and storing the information of the detection date and time A second means for executing on file data;
The reference source file path stored in the second database is acquired, and the first destination file name stored in the second database is used as a search key for the file of each reference source file path. The index information stored in the database is searched to determine whether a file with a file name that matches the search key exists. If the file exists, the file path of the file is obtained from the first database, and the reference source A process of storing, in the third database, the information of the reference source file path, the information of the reference destination file path, and the information of the date and time when the relationship is determined as the information of the file having the weak relation in which the relation between the relation and the reference destination is specified. A third means for executing all file data, and a reference source and a reference destination not specified by a hyperlink And extracting the information of the file having had relevant relationship.
The indexed file information stored in the first database includes information on the creation completion date / time of the indexed file information. In the third step, the creation completion date / time of the indexed file information Compare the information of the date and time when it is determined that the file with the file name matching the search key exists, and the reference source file path, the information of the reference destination file path, and the relevance only when the difference is within the allowable range. A fourth means for storing the determined date and time information in a third database is provided.
When a file path of a file linked to an arbitrary link is specified, the third database is searched using the file path as a search key, and a reference file path that matches the inspection key exists. A fifth means for acquiring and displaying information on the date and time when the relevance of the link to the reference destination file path is determined is obtained from the third database.

The file relevance analysis program according to the present invention also includes a file relevance analysis server that obtains file name and file path information from indexed file information stored in a first database. Means,
When the data of each file is acquired based on the acquired file path, a character string indicating a file name that conforms to the file name character string determination rule is described in the file data, and if it is described Is stored in the second database with the file path of the described file as the reference source file path and the described file name as the reference destination file name, and the process of associating and storing the information of the detection date and time A second means for executing on file data;
The reference source file path stored in the second database is acquired, and the first destination file name stored in the second database is used as a search key for the file of each reference source file path. The index information stored in the database is searched to determine whether a file with a file name that matches the search key exists. If the file exists, the file path of the file is obtained from the first database, and the reference source A process of storing, in the third database, the information of the reference source file path, the information of the reference destination file path, and the information of the date and time when the relationship is determined as the information of the file having the weak relation in which the relation between the relation and the reference destination is specified. Function as a third means to execute on all file data, referrers and references not specified by hyperlink Doo is characterized by extracting the information of the file having a weak association relationship.
The indexed file information stored in the first database includes information on the creation completion date / time of the indexed file information. In the third step, the creation completion date / time of the indexed file information Compare the information of the date and time when it is determined that the file with the file name matching the search key exists, and the reference source file path, the information of the reference destination file path, and the relevance only when the difference is within the allowable range. It functions as a fourth means for storing the determined date and time information in a third database.
When a file path of a file linked to an arbitrary link is specified, the third database is searched using the file path as a search key, and a reference file path that matches the inspection key exists. It is characterized by functioning as a fifth means for acquiring and displaying information on the date and time when the link to the reference destination file path is determined from the third database.

According to the present invention, after acquiring the file name and file path information from the indexed file information stored in the first database, the data of each file is acquired based on the acquired file path, and the file data It is determined whether a character string indicating a file name that conforms to the file name character string determination rule is described, and if it is described, the file path of the described file is described as the reference source file path The file name is stored in the second database as a reference destination file name, and the process of associating and storing the information of the detection date and time is executed for all file data, and further stored in the second database. The reference source file path is acquired, and the files of each reference source file path are stored in the second database. The index information stored in the first database is searched using the reference file name being searched as a search key, and it is determined whether a file with a file name matching the search key exists. The file path of the file is acquired from the first database, and the information of the reference source file path, the information of the reference destination file path, and the relation as the information of the file having the weak relation in which the relation between the reference source and the reference destination is specified By executing the process of storing the date and time information determined in the third database for all file data, information on the file having a weak relation between the reference source and the reference destination not specified by the hyperlink is extracted. Therefore, files with “weak association” have “weak association” by mechanical analysis. It is possible to create a list of that related files.
As a result, a related file having a “weak relationship” can be displayed on the screen in a search system or the like.

It is a system configuration figure in a first embodiment concerning the present invention. It is a data block diagram of indexed file information storage DB2. It is a data block diagram of file name appearance location information storage DB3. It is a data block diagram of "weak relation" information storage DB4. 4 is a flowchart showing the operation of file name character string extraction means 8. It is a flowchart which shows operation | movement of the file name appearance location extraction means 9. FIG. 4 is a flowchart showing the operation of the mentioned file path specifying means 10. 4 is a flowchart showing the operation of “weak association” analysis means 11. 7 is a flowchart showing the operation of the related file display means 12. It is a conceptual diagram of a screen on which a link to a related file is displayed with respect to the related file display means 12. It is a conceptual diagram of the related file information display screen when there is no related file regarding the related file display means 12. It is a conceptual diagram of a related file information display screen when a related file exists regarding the related file display means.

Hereinafter, a first embodiment for carrying out the present invention will be described in detail with reference to the drawings.
FIG. 1 is a system configuration diagram according to the first embodiment of the present invention.
The relationship analysis system between files shown in FIG. 1 includes a relationship analysis server 1 and a file server 17 (hereinafter referred to as “server etc.”) using a wired or wireless communication line such as a LAN (Local Area Network) 16. These are systems that are communicably connected to each other.
In FIG. 1, servers and the like are communicably connected to each other via a LAN 16, but the connection method is not limited to the LAN, and may be connected by, for example, a WAN (Wide Area Network) or the Internet.
In FIG. 1, servers and the like are connected on the same LAN segment. However, this configuration is merely an example, and any configuration may be used. Further, in FIG. 1, one relevance analysis server 1 and one file server 17 exist, but two or more each may exist. Further, the relationship analysis server 1 and the file server 17 do not need to be different devices. For example, the functions of the relationship analysis server 1 and the file server 17 can be realized by a single device.

With the configuration as described above, the relevance analysis server 1 creates a list of files having “weak relevance” among the files on the file server 17.
The relevance analysis server 1 and the file server 17 are devices such as a PC.
The relevance analysis server 1 is provided with an indexed file information storage DB 2, a file name appearance location information storage DB 3, and a “weak relevance” information storage DB 4.
The relevance analysis server 1 stores index data 5, a file name character string determination rule list 13, reference destination specifying setting data 14, and scheduler setting data 15.

The storage device 18 is a device such as a magnetic disk, and is built in the file server 17 or connected externally. The storage device 18 stores a search target file 19 and is set so that the search target file 19 can be referred to from the relevance analysis server 1.
The index data 5 is data derived as a result of performing lexical analysis and normalization in the process of indexing the search target file 19 by the indexer 7.

  The file name character string determination rule list 13 stores a list of determination rules to be referred to when the file name character string extraction unit 8 determines and extracts a character string indicating a file name in the form of a regular expression.

The reference destination specifying setting data 14 is a setting value indicating an allowable range of date and time differences to be referred to when the reference destination file path specifying unit 10 specifies a reference destination file path.
The scheduler setting data 15 is a setting value of an execution interval that the scheduler 6 refers to in order to periodically execute file relevance analysis.

  The relevance analysis server 1 includes a scheduler 6, an indexer 7, a file name character string extraction unit 8, a file name appearance location extraction unit 9, a reference destination file path identification unit 10, a “weak relevance” analysis unit 11, and a related file display Means 12 are provided.

  When the scheduler 6 periodically creates a list of related files, the scheduler 6 refers to the list creation processing execution interval of the scheduler setting data 15 and executes the file name appearance location extraction means 9 and the “weak relation” analysis means 11. Create a list of related files.

  The file name character string extraction unit 8 extracts a character string indicating a file name from the indexed file information storage DB 2 based on the information in the file name character string determination rule list 13. This operation will be described later as a processing flow (S501, etc.) of the file name character string extraction means 8.

  The file name appearance location extraction means 9 stores the file path of the reference source file referring to another file and the reference destination file name extracted by the file name character string extraction means 8 in the file name appearance location information storage DB 3. . This operation will be described later as a processing flow (S601, etc.) of the file name appearance location extraction means 9.

  The reference destination file path specifying unit 10 obtains the reference destination file path from the indexed file information storage DB 2 based on the reference destination file name extracted by the file name appearance location extracting unit 9 and the information of the reference destination specifying setting data 14. Extract. This operation will be described later as a processing flow (S701 and the like) of the reference destination file path specifying unit 10.

The “weak association” analyzing unit 11 creates a list of correspondence information between the reference source file path 311 and the reference destination file path specifying unit 10 in the file name appearance location information storage DB 3, and the list Is stored in the “weak relevance” information storage DB 4.
This operation will be described later as “weak association” analysis means 11 (S801, etc.).

  The related file display means 12 refers to the information stored in the “weak relationship” information storage DB 4 and displays a related file having a “weak relationship” with a certain file on the screen. This operation will be described later as a processing flow (S901, etc.) of the related file display means 12.

FIG. 2 is a data configuration diagram of the indexed file information storage DB2.
The indexed file information storage DB 2 stores information defined by the indexed file information table 21.
The indexed file information table 21 includes a file path 211, a file name 212, and an index creation completion date and time 213. The file path 211, the file name 212, and the indexing relating to the search target file 19 for which the indexer 7 (not shown) has completed the indexing. The completion date and time 213 is registered.

FIG. 3 is a data configuration diagram of the file name appearance location information storage DB 3.
The file name appearance location information storage DB 3 stores information defined in the file name appearance location information table 31.
The file name appearance location information table 31 includes a reference source file path 311, a reference destination file name 312, and an appearance location extraction date / time 313, and the file name appearance location extraction unit 9 uses the file path 311 of the reference source file, The file name 312 of the reference destination and the system date and time 313 at the time of extraction are registered.

FIG. 4 is a data configuration diagram of the “weak association” information storage DB 4.
The “weak association” information storage DB 4 stores information defined in the “weak association” information table 41. The “weak relationship” information table 41 includes a reference source file path 411, a reference destination file path 412, and related information update date / time 413, and the “weak relationship” analysis unit 11 uses the file path 411 of the reference source file. The reference file path 412 searched from the indexed file information storage DB 2 and the system date and time 413 at the time of analysis are registered.

FIG. 5 is a flowchart showing the operation of the file name character string extracting means 8.
The file name character string extraction unit 8 is a process of extracting a character string of a file name that conforms to the file name character string determination rule using each file of the file path indicated by the index data 5 as a reference source.
The process of FIG. 5 is called from the processes shown in the flowchart of FIG.
First, the file name character string judgment rule list 13 is referenced and described in the regular expression format (for example, “* .doc” “* .xls” “* .pdf” ”*. Txt”). The current rule is read (S501).

Next, the index data 5 is searched for the file specified when called from the processing of the file name appearance location extraction means 9 by using the rule read in S501 as a search key (S502). Next, the character string hit in the search is regarded as the file name character string and extracted, and the extraction result is returned to the process of the file name appearance location extracting means 9 (S503).
In S503, if the number of extractions is “0”, a NULL value is returned to the process of the file name appearance location extraction unit 9, and if the number of extractions is multiple, the extraction of the file name appearance location is performed. All the cases are returned to the processing of means 9.

FIG. 6 is a flowchart showing the operation of the file name appearance location extraction means 9.
The file name appearance location extracting means 9 is a process for extracting information on the location where the reference file name appears from the reference source file. Until S601 in FIG. 6, as described above, the scheduler 6 refers to the list creation processing execution interval of the scheduler setting data 15 to start processing when periodically creating a list of related files.
First, indexed file information is acquired from the indexed file information storage DB 2 (S601).
Next, all the file data indicated by the file path existing in the acquired indexed file information is acquired one by one, the call of the file name character string extraction means 8 and the steps from S602 to S605 are repeated.

In this iterative loop, first, the file name character string extraction means 8 is called. Conditional branching is performed based on whether or not a file name character string that conforms to the rules defined in the file name character string determination rule list 13 is extracted by the file name character string extraction means 8 (S602). If not extracted, the processing of the next indexed file data is shifted.
If extracted, the steps from S603 to S605 are repeated until all the extracted file name character strings are processed (a plurality of file name character strings are referred to in a certain indexed file data). Because there are cases, there is a process for each file name string).

When extracted, the value of the file path 211 of the indexed file information table 21 (that is, the file path of the file from which the file name character string that conforms to the rules defined in the file name character string determination rule list 13 is extracted) Is stored in the reference source file path 311 of the file name appearance location information table 31 (S603).
Next, the value of the file name character string extracted by the file name character string extracting means 8 is stored in the reference destination file name 312 of the file name appearance location information table 31 (S604).
Next, the system date value at the time of extraction is stored in the appearance location extraction date 313 of the file name appearance location information table 31 (S605).

FIG. 7 is a flowchart showing the operation of the reference destination file path specifying means 10.
The reference destination file path specifying means 10 is a process for specifying the reference destination file path from the information of the reference destination file name 312 in the file name appearance location information table 31.
The process of FIG. 7 is called from the processes shown in the flowchart of FIG.
The indexed file information storage DB 2 is stored using the reference file name 312 of the file name appearance location information table 31 specified when called from the processing of the “weak association” analysis unit 11 as a search key for the file name 212. Search is performed (S701).
Conditional branching is performed depending on whether or not the search is hit (S702).

If the search is not hit, the process is terminated, and a NULL value is returned to the process of the “weak relevance” analysis unit 11.
When the search is hit, the steps from S703 to S708 are repeated until all the files are processed (there is a case where a file having a name equal to one reference destination file name 312 exists in a plurality of file paths). Therefore, processing is performed for each file existing in each file path).

Next, the appearance location extraction date and time 313 of the record corresponding to the reference source file path 312 specified when called from the processing of the “weak association” analysis unit 11 is acquired from the file name appearance location information storage DB 3 ( S703).
Next, the update date 213 of the file is obtained from the indexed file information storage DB 2 (S704).
The difference between the acquired appearance location extraction date and time 313 and the update date and time 213 is calculated (S705).
The allowable range value is acquired from the reference destination specifying setting data 14 (S706).
Conditional branching is performed based on whether or not the difference is within the allowable range acquired in S706 (S707).

If the difference is within the allowable range, the file path 211 of the file is acquired from the indexed file information storage DB 2 (S708).
When a plurality of values of the file path 211 are acquired in S708 (a file having the same name as the reference destination file name 312 exists in a plurality of file paths), after exiting the iterative loop, the “weak relevance” analysis is performed collectively. Return to the process of means 11.
The processing from steps S703 to S707 is for excluding files with old index completion dates and times, and is added as necessary.

FIG. 8 is a flowchart showing the operation of the “weak association” analysis unit 11.
The “weak association” analysis unit 11 is a process of analyzing “weak association” and deriving correspondence information between the reference source file path 411 and the reference destination file path 412.
After the process shown in the flowchart of FIG. 6 is completed, the scheduler 6 starts the process of FIG. Information of the reference source file is acquired from the file name appearance location information storage DB 3 (S801).
First, until all the reference source files are processed, the calling of the reference destination file path specifying unit 10 and the conditional branching of S802 and the inner iteration loop of S803 to S805 are repeated.

In this iterative loop, first, the reference destination file path specifying means 10 is called.
Conditional branching is performed depending on whether the path can be specified by the reference destination file path specifying means 10 (S802).
If it cannot be identified, the process moves to the next reference source file.
If it can be specified, the steps from S803 to S805 are repeated until all the specified paths are processed. Here, the value of the reference source file path 311 of the reference source file is stored in the reference source file path 411 of the “weak association” information table 41 (S803). Further, the value of the reference destination file path specified by the reference destination file path specifying means 10 is stored in the reference destination file path 412 of the “weak association” information table 41 (S804). Then, the system date and time value at the time of identification is stored in the related information update date and time 413 of the “weak relationship” information table 41 (S805).

FIG. 9 is a flowchart showing the operation of the related file display means 12.
The related file display means 12 is a process for displaying a list of files related to a certain file.
Until S901 in FIG. 9, when a link 102 to a related file linked to a certain file 101 is clicked (designated) in the screen 100 as shown in the conceptual diagram of FIG. Be started.
First, the file path 103 of the file 101 linked to the link 102 is acquired (S901). The “weak relevance” information storage DB 4 is searched using the file path as a search key for the reference source file path 411 (S902).
Conditional branching is performed depending on whether or not the search is hit (S903). If the search is not hit, a message 111 “No related file” is displayed in the screen 110 as shown in FIG. 11 (S904).

  If the search is hit, the steps from S905 to S906 are repeated until all hit records are processed. In other words, the reference destination file path 412 corresponding to the reference source file path 411 hit in the search is acquired from the “weak association” information storage DB 4 (S905). Next, the related information update date and time 413 corresponding to the reference source file path 411 hit in the search is acquired from the “weak relationship” information storage DB 4 (S906). Then, a link 121 to the reference destination file path 412 acquired in S905 and S906 and a list 121 of related information update date and time 413 are displayed in the screen 120 (S907).

  FIG. 10 is a conceptual diagram of a screen on which a link to a related file is displayed regarding the related file display means 12. The content of the screen 100 is only an example. The wording of the link 102 to the related file is not limited to that illustrated in FIG. 10, and may be arbitrary as long as the content indicates that the link is to the related file.

  FIG. 11 is a conceptual diagram of the related file information display screen when no related file exists for the related file display means 12. The content of the screen 110 is only an example. The wording of “no related file” 111 is not limited to that illustrated in FIG. 11, and is arbitrary as long as the content conveys that fact.

  FIG. 12 is a conceptual diagram of a related file information display screen when there is a related file regarding the related file display means 12. The content of the screen 120 is only an example. The wording of the list 121 is not limited to that illustrated in FIG. 12, and may be arbitrary as long as the information of the list of files related to a certain file is transmitted.

1 Relevance analysis server 2 Indexed file information storage DB
3 File name appearance location information storage DB
4 "Weak relevance" information storage DB
DESCRIPTION OF SYMBOLS 5 Index data 6 Scheduler 7 Indexer 8 File name character string extraction means 9 File name appearance location extraction means 10 Reference destination file path specification means 11 "Weak relevance" analysis means 12 Related file display means 13 File name character string judgment rule list 14 Reference destination specifying setting data 15 Scheduler setting data 16 Network 17 File server 18 Storage device connected to file server 17 19 Search target file

Claims (9)

A first step of obtaining file name and file path information from the indexed file information stored in the first database;
When the data of each file is acquired based on the acquired file path, a character string indicating a file name that conforms to the file name character string determination rule is described in the file data, and if it is described Is stored in the second database with the file path of the described file as the reference source file path and the described file name as the reference destination file name, and the process of associating and storing the information of the detection date and time A second step for executing the file data;
The reference source file path stored in the second database is acquired, and the first destination file name stored in the second database is used as a search key for the file of each reference source file path. The index information stored in the database is searched to determine whether a file with a file name that matches the search key exists. If the file exists, the file path of the file is obtained from the first database, and the reference source A process of storing, in the third database, the information of the reference source file path, the information of the reference destination file path, and the information of the date and time when the relationship is determined as the information of the file having the weak relation in which the relation between the relation and the reference destination is specified. A third step executed on all file data, and a reference source and a reference destination not specified by a hyperlink Association analysis method between file and extracts the information of the file having a weak binding relationship.   The indexed file information stored in the first database includes information on the creation completion date / time of the indexed file information. In the third step, the creation completion date / time and search key of the indexed file information are included. The information of the date and time when it was determined that there is a file with a file name that matches the above is compared, and the reference source file path, the information of the reference destination file path, and the relevance are determined only when the difference is within the allowable range. The relevance analysis method between files according to claim 1, further comprising a fourth step of storing date and time information in a third database.   When a file path of a file linked to an arbitrary link is specified, the third database is searched using the file path as a search key, and if there is a reference file path that matches the inspection key, the reference The relationship between files according to claim 1 or 2, further comprising a fifth step of acquiring and displaying information on the date and time when the link to the destination file path is determined from the third database. Sex analysis method. First means for obtaining file name and file path information from the indexed file information stored in the first database;
When the data of each file is acquired based on the acquired file path, a character string indicating a file name that conforms to the file name character string determination rule is described in the file data, and if it is described Is stored in the second database with the file path of the described file as the reference source file path and the described file name as the reference destination file name, and the process of associating and storing the information of the detection date and time A second means for executing on file data;
The reference source file path stored in the second database is acquired, and the first destination file name stored in the second database is used as a search key for the file of each reference source file path. The index information stored in the database is searched to determine whether a file with a file name that matches the search key exists. If the file exists, the file path of the file is obtained from the first database, and the reference source A process of storing, in the third database, the information of the reference source file path, the information of the reference destination file path, and the information of the date and time when the relationship is determined as the information of the file having the weak relation in which the relation between the relation and the reference destination is specified. A third means for executing all file data, and a reference source and a reference destination not specified by a hyperlink Association analysis system between file and extracts the information of the file having had relevant relationship.   The indexed file information stored in the first database includes information on the creation completion date / time of the indexed file information. In the third step, the creation completion date / time and search key of the indexed file information are included. The information of the date and time when it was determined that there is a file with a file name that matches the above is compared, and the reference source file path, the information of the reference destination file path, and the relevance are determined only when the difference is within the allowable range. 5. The relationship analysis system between files according to claim 4, further comprising a fourth means for storing date and time information in a third database.   When a file path of a file linked to an arbitrary link is specified, the third database is searched using the file path as a search key, and if there is a reference file path that matches the inspection key, the reference 6. The association between files according to claim 4 or 5, further comprising fifth means for acquiring and displaying information on the date and time when the relevance of the link to the destination file path is determined from the third database. Sex analysis system. Relevance analysis server between files
First means for obtaining file name and file path information from the indexed file information stored in the first database;
When the data of each file is acquired based on the acquired file path, a character string indicating a file name that conforms to the file name character string determination rule is described in the file data, and if it is described Is stored in the second database with the file path of the described file as the reference source file path and the described file name as the reference destination file name, and the process of associating and storing the information of the detection date and time A second means for executing on file data;
The reference source file path stored in the second database is acquired, and the first destination file name stored in the second database is used as a search key for the file of each reference source file path. The index information stored in the database is searched to determine whether a file with a file name that matches the search key exists. If the file exists, the file path of the file is obtained from the first database, and the reference source A process of storing, in the third database, the information of the reference source file path, the information of the reference destination file path, and the information of the date and time when the relationship is determined as the information of the file having the weak relation in which the relation between the relation and the reference destination is specified. It functions as a third means to execute on all file data, and refers to references and references not specified by hyperlinks. File between relevant program for analysis, characterized in that preceding the extracts information about files having a weak association relationship. The indexed file information stored in the first database includes information on the creation completion date / time of the indexed file information. In the third step, the creation completion date / time of the indexed file information Compare the information of the date and time when it is determined that the file with the file name matching the search key exists, and the reference source file path, the information of the reference destination file path, and the relevance only when the difference is within the allowable range. 8. The program for analyzing the relationship between files according to claim 7, wherein the program functions as a fourth means for storing the determined date and time information in a third database.   When a file path of a file linked to an arbitrary link is specified, the third database is searched using the file path as a search key, and a reference file path that matches the inspection key exists. 9. The file according to claim 7, wherein the file is made to function as a fifth means for acquiring and displaying information on a date and time when the link to the reference destination file path is determined from the third database. A program for analyzing the relationship between the two.

Images