JP5836893B2 - File management apparatus, file management method, and program - Google Patents

Description

  The present invention relates to a file management apparatus, a file management method, and a program, for example, to a technique for virtually classifying files on a computer.

  In recent years, with the development of computers, a plurality of users commonly share files in a plurality of computers connected by a network. For example, a file on a file server may be shared by multiple users. When managing files, it is common to use a fixed hierarchical folder (physical folder). When a file is stored, it may be stored in a folder determined by operational rules in the organization. The operation rule is, for example, storing in a predetermined folder for each file type or each department to which the user belongs. Furthermore, various patterns are conceivable, such as creating a folder for each year in which a file is created or creating a folder for each product. Such a folder management method is performed not only when a file is shared by a plurality of people but also when a single user manages the file.

  Depending on the work contents of the user, there are cases where it is desired to use several files stored in a plurality of physical folders for one purpose. In such a case, for example, it is necessary to find a necessary file from each folder and copy it to one folder, which is a burden on the user. In addition, if such work is repeated, the same files increase in the file server, which reduces the capacity of the file server. Furthermore, if only some of the files are changed, similar files will be scattered in the file server, and the latest file will not be known.

  Therefore, a method for managing metadata (attribute information) of a document (file) in association with the document is considered. For example, Patent Document 1 proposes a virtual folder system. The virtual folder system is a system that provides a folder (virtual folder) for storing files and folders that meet the conditions regardless of the location where the files actually exist. For example, by setting metadata in a file and defining a search condition for the metadata in the virtual folder, a file that matches the search condition can be stored in the virtual folder. When referring to the virtual folder, only files based on the search condition are displayed. For example, in the scene of managing sales documents, first, “document type” (contract, order, estimate, etc.) is defined as an attribute. The attribute is a phrase representing the type of metadata such as “document type” or “customer”. If a document type is assigned to all files and a search condition “a document type is“ contract ”” is assigned to a virtual folder, a list of contracts can be acquired by referring to the virtual folder. As described above, since the virtual folder system classifies files semantically, documents can be effectively used. In addition, since it can be managed in various folders virtually regardless of the physical folder structure, it is possible to solve the problem of capacity compression due to useless copying of files and the inability to know the latest version.

JP 2003-323326 A

Teruo Koyama, “Extracting compound terms from Japanese text”, Journal of Information and Knowledge Society, vol.19, No.4, pp.306-315, 2010

  However, according to the technique of Patent Document 1, the user must define the virtual folder, and this work is a burden on the user. In addition, the user must consider the criteria for classifying files. In order to perform this work, it is necessary to know what kind of file exists in the file server, and the user must determine from what point of view it should be classified. In general, it is difficult to grasp the contents of the entire file server and perform proper classification.

  The present invention has been made in view of such a situation, and provides a technique for automatically performing virtual classification on a file stored in a file server with high accuracy and ease of use for a user. To do.

  In order to achieve the above object, a file management apparatus of the present invention is an apparatus that generates a virtual folder for virtually classifying files. The device extracts a keyword from a character string constituting file metadata, a search query in a search log, and the like, and registers the keyword in a storage device. In addition, in the metadata group and the search query group used when generating the virtual folder, the apparatus automatically determines the condition of the file stored in the virtual folder based on keywords that appear frequently.

  That is, the file management apparatus according to the present invention stores a processor that executes a program for generating a virtual folder for classifying a plurality of physical files, and metadata management information for managing the metadata of the plurality of physical files. And a storage device. Here, the virtual folder is a virtual folder for managing link information of a plurality of physical files and physical folders irrespective of the locations where the plurality of physical files or the plurality of physical folders storing them exist. .

  Then, the processor first extracts a plurality of keywords from the character strings constituting the metadata of the plurality of files of the metadata management information, and acquires information on the appearance frequency of each extracted keyword. Further, the processor extracts a plurality of keywords from character strings constituting a plurality of search queries included in the search log data, and acquires information on the appearance frequency of each of the extracted keywords. Further, the processor generates a specified number of virtual upper folders using keywords whose appearance frequency is equal to or higher than a predetermined value. In addition, the processor uses another keyword including a keyword used for the virtual upper folder, a keyword searched simultaneously with the keyword used for the virtual upper folder, or a character string constituting the metadata in the virtual upper folder. A virtual lower folder associated with the virtual upper folder is generated using a keyword used at the same time as the keyword used for the virtual upper folder. Then, the processor outputs a virtual classification display for displaying the relationship between the generated virtual upper folder and virtual lower folder folder, and the contents of the virtual upper folder and the virtual lower folder.

  ADVANTAGE OF THE INVENTION According to this invention, the virtual folder for searching the file group stored in the file server can be created automatically so that it may be accurate and easy for the user to use. Thereby, even if the user has little knowledge about the contents of the file stored in the file server, the user can construct a virtual folder with a small number of work steps. Since the virtual folder is generated based on the frequently used keyword, the search keyword, and the co-occurrence keyword, a virtual folder that is more convenient for the user is generated.

  Further features (problems, configurations, and effects) related to the present invention will become apparent from the description of the present specification and the accompanying drawings. The embodiments of the present invention can be achieved and realized by elements and combinations of various elements and the following detailed description and appended claims.

  It should be understood that the description herein is merely exemplary and is not intended to limit the scope of the claims or the application of the invention in any way.

It is a figure which shows schematic structure of the system (file management apparatus) which concerns on embodiment of this invention. It is a figure which shows an example of a metadata file. It is a figure which shows an example of search log data. It is a figure which shows an example of virtual folder data. It is a figure which shows an example of extraction keyword data. It is a figure which shows an example of search keyword management data. It is a figure which shows an example of co-occurrence keyword data. It is a figure which shows an example of virtual high-order folder data. It is a figure which shows an example of virtual subfolder data. It is a flowchart for demonstrating a keyword registration process. It is a flowchart for demonstrating an extraction keyword registration process. It is a flowchart for demonstrating a search keyword registration process. It is a flowchart for demonstrating a co-occurrence keyword registration process. It is a flowchart for demonstrating the whole virtual folder production | generation process. It is a flowchart for demonstrating a part of virtual folder production | generation process. It is a figure which shows an example of the data used by an extraction keyword registration process. It is a figure which shows an example of a virtual classification screen.

  Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. However, it should be noted that this embodiment is merely an example for realizing the present invention, and does not limit the technical scope of the present invention. In each drawing, the same reference numerals are assigned to common components.

  In the following description, the information of the present invention will be described in the form of a table (table). However, the information does not necessarily have to be expressed in a data structure in the form of a table. It may be expressed in other than. Therefore, “table”, “list”, “DB”, “queue”, etc. may be simply referred to as “information” to indicate that they do not depend on the data structure.

  In addition, when explaining the contents of each information, the expressions “identification information”, “identifier”, “name”, “name”, “ID” can be used, and these can be replaced with each other. It is.

  In the following description, “program” will be the subject, but the program is executed by the processor, and processing determined by using the memory and communication port (communication control device) will be performed. It is good. Further, the processing disclosed with the program as the subject may be processing performed by a computer such as a management server or an information processing apparatus. Part or all of the program may be realized by dedicated hardware, or may be modularized. Various programs may be installed in each computer by a program distribution server or a storage medium.

<Configuration of virtual classification device>
FIG. 1 is a functional block diagram showing a schematic configuration of a virtual classification device (also referred to as a file management device or a document processing device) according to an embodiment of the present invention. The virtual classification device includes a central processing unit (processor) 100 that performs necessary arithmetic processing and control processing, an input / output device 110 for inputting and outputting data, and a program necessary for processing in the central processing unit 100. A program memory 120 for storing the data, a storage device 130 for storing data after processing in the central processing unit 100, and a data memory 140 for storing data to be processed in the central processing unit 100. .

  The input / output device 110 includes a display device 111 for displaying data, an output device including a printer (not shown), and a keyboard for performing operations such as selecting a menu for the displayed data. 112, a pointing device 113 such as a mouse.

  The program memory 120 includes a search program 121 that searches for metadata, a keyword registration program 122 that extracts keywords from the metadata and the search log, a virtual folder generation program 123 that generates a virtual folder based on the keywords, and a virtual folder And a virtual classification program 124 for displaying the contents of files stored in each virtual folder. Each processing program is stored in the program memory 120 as a program code, and each processing is realized by the central processing unit 100 executing each program code.

  The storage device 130 includes a metadata file 131 of each file, search log data 132 storing a search query log, virtual folder data 133 storing virtual folder definition information generated based on a keyword, Is stored. The storage device 130 may be a storage system that is remotely arranged via a network.

  The data memory 140 stores extracted keyword data 141, search keyword management data 142, co-occurrence keyword data 143, virtual upper folder data 144, and virtual lower folder data 145. Details of these data will be described later.

  The processing program, data, each program, etc. described above can be provided by being stored in various recording media such as a CD-ROM, DVD-ROM, MO, floppy (registered trademark) disk, USB memory or the like.

<Metadata>
FIG. 2 is a diagram illustrating an example of the metadata file 131 in the storage device 130. In the embodiment of the present invention, it is assumed that each file (files 001, 002, 003,...) Registered in the metadata file 131 is managed in the metadata file 131 together with the metadata 202. Therefore, it is assumed that a file whose metadata 202 is not registered is not registered here.

  The metadata file 131 is managed in a table format, for example, and one file corresponds to one line. The metadata file 131 has an ID 201 that uniquely identifies the file and metadata 202 registered in the file as configuration items.

  The metadata 202 constitutes a column for each attribute managed by this system. FIG. 2 shows, for example, file metadata obtained by scanning a paper business document with a scanner. In the example of FIG. 2, the file path 203 of the file, the document type 204, the customer name 205, etc. are included as attributes. In addition to the metadata shown in FIG. 2, various patterns are conceivable. For example, metadata regarding a date such as a file access date and a last update date, and metadata regarding a person such as a file creator or an updater can be considered.

<Search log data>
FIG. 3 is a diagram illustrating an example of the search log data 132 in the storage device 130. The search log data 132 is data in which a search query input by the user and its date and time 303 are described. The search query holds a plurality of data. FIG. 3 shows an example in which two types of data (search query A301 and search query B302) are held. This indicates a log in which the user performs an AND search using the search query A301 and the search query B302. In the example of FIG. 3, the data on the first line indicates that “contract” and “document management system” are logs obtained by AND search. When the search query B302 is blank, it indicates that the search is performed using only the search query A301.

  In the present embodiment, the case where the search log data 132 includes two search queries will be described. However, the number of search queries may be one or three or more.

  Further, the search log data 132 has, for example, a plurality of registration information files for each attribute. Therefore, for example, in the case of a search using a document type and a customer name, each attribute may be separately registered for each attribute (document type and customer name).

<Virtual folder data>
FIG. 4 is a diagram illustrating an example of the virtual folder data 133 in the storage device 130. This virtual folder data indicates information of the finally generated virtual folder.

  The virtual folder data 133 is data in which a definition of a virtual folder generated by an attribute unit and generated by a virtual folder generation program described later is described. Here, the virtual folder refers to a folder that stores files and folders that meet the conditions, regardless of where the files and folders (physical files and physical folders) actually exist. The virtual folder does not store the main body of the file or folder but stores one or a plurality of shortcuts. When a physical file / folder is changed / created / deleted, the result is reflected in the virtual folder and the contents of the virtual folder change. Note that a virtual folder is a concept different from simple shortcuts and aliases. More specifically, since a file shortcut is not a folder, a plurality of files cannot be collected, and a folder shortcut only allows a physical folder to be referred to from another location. Alias is almost synonymous with shortcut, but it is a technology that makes it possible to refer to it from another place with another name. Neither shortcuts nor aliases store files (folders) that meet the conditions.

  FIG. 4 shows an example in which the attribute is a document type and a virtual folder having two layers of a virtual upper folder 401 and a virtual lower folder 402 is described.

  The virtual upper folder 401 is defined by a single keyword that includes the contents of the virtual lower folder 402. A character string assigned to the virtual upper folder 401 represents a search condition. More specifically, a file including a character string assigned to a virtual upper folder in a target attribute in the metadata file is a search target. For example, in the first data in FIG. 4, a file including a character string “contract” in the document type is a search target.

  The virtual lower folder 402 is defined by a more detailed keyword for the contents of the virtual upper folder 401, and has the following three patterns.

  One is a case of being composed of a character string including a keyword of the virtual upper folder 401. For example, the virtual upper folder 401 is “contract” and the virtual lower folder 402 is “contract”. In this case, a file including a character string “contract” in the document type is a search target.

  The second is a case where the keyword of the virtual upper folder 401 is the search query A301 in the search log data 132. For example, the virtual upper folder 401 is “contract” and the virtual lower folder 402 is “contract, legal”. In this case, a file including both “contract” and “legal” in the document type is a search target. That is, it is a case of a file that includes both words (eg, legal affairs) that are often used for searching in pairs with words (eg, contracts) in the upper virtual folder.

  The third is composed of two keywords as in the second case. One keyword is a keyword of the virtual upper folder 401. The other keyword is a case in which metadata in the metadata file 131 is another keyword that appears at the same time as the keyword of the virtual upper folder 401. For example, when the metadata is “basic contract creation request (product ABC)”, the virtual lower folder 402 is “contract, product ABC”. In this case, a file including both “contract” and “product ABC” in the document type is a search target. This pattern is a case of a file including a pair of words that are likely to appear together regardless of search.

  Note that the virtual folder data 133 may be generated after an instruction to execute the virtual classification process is input, or may be automatically generated when a predetermined number of files are accumulated or accumulated at predetermined time intervals. You may make it generate automatically for the file. Further, when generating the virtual folder data 133, the user may specify a keyword used for folder generation.

<Extracted keyword data>
FIG. 5 is a diagram illustrating an example of the extracted keyword data 141 in the data memory 140. The extracted keyword data 141 describes a characteristic word (extracted keyword) 501 and its frequency 502 based on character string information (for example, file path 203, document type 204, customer name 205, etc.) in the metadata file 131. Data. The frequency 502 represents the number of files including the keyword in the metadata file 131 in the storage device 130. In the example of FIG. 5, the file registered in the metadata file 131 indicates that there are 292 files including the keyword “acceptance”.

  The extracted keyword data 141 has, for example, a plurality of registration information files for each attribute. Note that such extracted keyword data 141 can be generated by the method described in Non-Patent Document 1, and thus the description of the generation method is omitted.

<Search keyword management data>
FIG. 6 is a diagram illustrating an example of search keyword management data 142 in the data memory 140. The search keyword management data 142 is data generated based on the search log data 132 in the storage device 130. Search query A 601 and search query B 602 represent a combination of search query A 301 and search query B 302 in search log data 132. In order to represent a combination, the same data is obtained even when the character strings of the search query A301 and the search query B302 are interchanged. At this time, the characters are sorted by character codes, and the order of the search query A601 and the search query B602 is unified. For example, when the search query A301 and the search query B302 are “contract, document” and “document, contract”, the search query A601 and the search query B602 are unified as “contract, document”. The appearance frequency 603 represents the number of occurrences of the combination of the search query A301 and the search query B302 in the search log data 132. When either one of the search queries A301 and B302 is blank, the search query B602 is blank.

  Note that the search keyword management data 142 has, for example, a plurality of registration information files for each attribute. Further, the search keyword management data 142 may manage the information obtained from the search log within a predetermined period.

<Co-occurrence keyword data>
FIG. 7 is a diagram showing an example of co-occurrence keyword data 143 in the data memory 140. The co-occurrence keyword data 143 is an extracted keyword 701 obtained from the extracted keyword data 141 in the data memory 140 and another keyword that appears together with the character string of the extracted keyword 701 in the metadata file 131 in the storage device 130. This is data in which the starting keyword 702 and the frequency 703 of the combination of the extracted keyword 701 and the co-occurrence keyword 702 are described. The frequency 703 represents the number of files including the keyword combination in the metadata file 131. In the example of FIG. 7, the files registered in the metadata file 131 indicate that there are 80 files that include both the keyword “delivery note” and the keyword “acceptance”. As another example, the document type 204 of the document 011 and the document 008 in FIG. 2 is “delivery note and acceptance request document” or “contract document examination sheet”. When independent words (keywords) are separated by symbols such as “cum”, “etc.”, and “/” “+”, the independent keywords appear together in the same metadata. The possibility is high and it becomes a co-occurrence keyword.

  The co-occurrence keyword data 143 has, for example, a plurality of registration information files for each attribute. Further, since the co-occurrence keyword data 143 can be generated by the method described in Non-Patent Document 1, description of the generation method is omitted.

<Virtual upper folder data>
FIG. 8 is a diagram illustrating an example of the virtual upper folder data 144 in the data memory 140. The virtual upper folder data 144 is a candidate for a character string that becomes a search condition for the virtual upper folder. In the keyword 801 extracted from the search keyword management data 142 and the extracted keyword data 141, the extracted keyword frequency representing the frequency of the keyword is extracted. In the search keyword management data 142, the search frequency 803 representing the frequency of the keyword, and the score 804 calculated based on the extracted keyword frequency 802 and the search frequency 803 are described. The score 804 represents the degree of matching of the keyword as a virtual upper folder. The virtual folder generation program 123 determines a virtual upper folder based on the score 804.

  Note that the virtual upper folder data 144 has, for example, a plurality of registration information files for each attribute.

<Virtual subfolder data>
FIG. 9 is a diagram illustrating an example of the virtual lower folder data 145 in the data memory 140. The virtual lower folder data 145 includes a keyword A 901 and a keyword B 902 which are combinations of character strings of search conditions for the virtual lower folder, an extracted keyword frequency 903 indicating the number of keywords in the extracted keyword data 141, and search keyword management data. In 142, the search frequency 904 representing the number of data including the keyword combination, the co-occurrence keyword data 143, the co-occurrence frequency 905 representing the number of data including the keyword combination, the extracted keyword frequency 903, and the search frequency The score 906 calculated based on 904 and the co-occurrence frequency 905 is described.

  In keyword A901, a keyword (eg, contract) included in the virtual upper folder is entered. In keyword B902, a keyword that is a co-occurrence keyword with respect to keyword A901 is entered. The case where “-” is entered in the keyword B902 is when the co-occurrence keyword does not exist.

  The score 906 represents the degree of matching of the keyword combination as a virtual lower folder. The virtual folder generation program 123 determines a virtual lower folder based on the score 906.

  The virtual lower folder data 145 includes, for example, a plurality of registration information files for each attribute.

<Virtual classification screen>
FIG. 17 is a diagram illustrating an example of a virtual classification display screen (GUI) generated by the virtual classification program 124. As shown in FIG. 17, in the GUI window, a search function 1701 for searching for a file and a tree display 1702 using a virtual folder are displayed in the left pane, and a search function or a virtual folder is displayed in the right pane. Is selected, a search result 1703 of the corresponding file is displayed.

  The search program 121 uses the metadata file 131 in the storage device 130 when displaying the search result.

  The virtual classification program 124 uses the virtual folder data 133 in the storage device 130 when displaying the virtual folder on the GUI screen. The virtual classification program 124 executes the search program 121 when a virtual folder is selected. That is, the same processing as executing the search program with the character string assigned to the virtual folder is performed. The search program displays a file including a search query character string in the search result 1703 from the metadata file 131 in the storage device 130. When there are two search queries, a file including both of the two character strings is displayed as a search result. In the present embodiment, the case where there are three or more search queries is not described in detail, but can be processed in the same manner as in the case where there are two search queries.

  When an update button 1707 is pressed, the keyword registration program 122, the virtual folder generation program 123, and the virtual classification program 124 are executed in order, and the display screen (GUI) is updated.

  The search function part includes a pull-down 1704 for selecting a search target attribute, a text box 1705 for inputting a search query, and a search execution button 1706 for executing a search process. In the virtual classification display portion, a virtual upper folder 1708 and a virtual lower folder 1709 are displayed.

  The virtual folder tree display 1702 is displayed only when virtual folder data in the storage device 130 is defined. Not displayed if not defined.

  The search query executed by the search program 121 is stored in the search log data in the storage device 130.

  There are two major search methods. A method for selecting an attribute with a pro-down 1704 and inputting a keyword 1705 to search the corresponding document, and selecting an attribute with a pull-down 1704 and selecting one virtual folder from the displayed virtual classification 1702 to search for the corresponding document. It is a method to do. The former method is irrelevant to the virtual folder. In this case, no folder is opened in the tree display of the virtual classification 1702.

  FIG. 17 shows a state where the attribute “document type” is selected and the child folder “contract, product ABC” of the virtual upper folder “contract” is selected. The search result 1703 displays a file including both “contract” and “product ABC” in the attribute “document type”. Further, metadata of attributes such as a file name 1711, a document type 1712, and a supplier name 1713 are displayed. When the virtual upper folder 1708 is selected, the search result 1703 displays a file including the character string of the virtual upper folder. In the search result 1703, when a file is selected by the user, an application associated by the operating system is activated and the file is opened.

  For example, a user interface (GUI) as shown in FIG. 17 is displayed by the virtual classification process, and the user can refer to files stored in physically different folders for each virtual folder. It becomes. The user can refer to the file by semantic classification without considering the physical folder in which the file entity is stored. In addition, the user can select an attribute on the GUI, and a different virtual folder tree is configured for each attribute, and a file can be searched from the viewpoint of searching.

<Outline of processing in document processing apparatus>
First, an outline of processing (processing corresponding to the operation on the GUI in FIG. 17) performed in the document processing apparatus having the above-described configuration will be described. The operating subject at this time is the central processing unit 100 unless otherwise specified, and the central processing unit 100 reads and executes various programs.

  First, the virtual classification program 124 is executed. The virtual classification program 124 reads the metadata file 131 and the virtual folder data 133 from the storage device 130, and displays the virtual folder (see FIG. 17) based on the definition of the virtual folder described in the virtual folder data 133.

  Next, the virtual classification program 124 receives an input from the user, and when a search process or a virtual folder is selected, the corresponding file is searched from the metadata file 131 and displayed in the search result 1703. At this time, the used search query is stored as search log data 132 in the storage device 130.

  When an update button 1707 is pressed, the keyword registration program 122, the virtual folder generation program 123, and the virtual classification program 124 are executed in order.

  The keyword registration program 122 reads the metadata file 131 and the search log data 132 in the storage device 130, extracts characteristic words (keywords) from the metadata file, and stores them as extracted keyword data 141 in the data memory 140. Further, the statistical information of the used search query is stored in the data memory 140 as the search keyword management data 142. Further, in the metadata file 131, statistical information of another keyword used together with the keyword registered in the extracted keyword data 141 is stored in the data memory 140 as co-occurrence keyword data 143.

  The virtual folder generation program 123 reads extracted keyword data 141, search keyword management data 142, and co-occurrence keyword data 143 from the data memory 140, generates virtual folder definition information based on the characteristics of these keywords, and stores the storage device. 130 is stored as virtual folder data 133. At this time, data in which keywords that are candidates for a virtual upper folder are stored is stored in the data memory 140 as virtual upper folder data 144. In addition, data in which keywords that are candidates for virtual lower folders are stored is stored in the data memory 140 as virtual lower folder data 145.

  The virtual classification program 124 reads the metadata file 131 and the virtual folder data 133 from the storage device 130, and displays the virtual folder based on the definition of the virtual folder described in the virtual folder data 133. The virtual classification program 124 receives an input from the user. When a virtual folder is selected, the virtual classification program 124 searches for a file stored in the virtual folder from the metadata file 131 and displays the corresponding file. Each process will be described in detail below.

<Keyword registration process>
FIG. 10 is a flowchart for explaining the keyword registration process executed by the keyword registration program 122. Here, a description will be given assuming that the operation subject is the keyword registration program 122.

  In step 1001, the keyword registration program 122 selects one attribute for virtual folder generation target. Hereinafter, a case where “document type” is selected as an attribute will be described. Note that it is not necessary to read an attribute that does not require generation of a virtual folder.

  In step 1002, the keyword registration program 122 performs extracted keyword registration processing described later, and generates extracted keyword data 141.

  In step 1003, the keyword registration program 122 performs a search keyword registration process, which will be described later, and generates search keyword management data 142.

  In step 1004, the keyword registration program 122 performs co-occurrence keyword registration processing, which will be described later, and generates co-occurrence keyword data 143.

  In step 1005, the keyword registration program 122 determines whether or not processing has been performed for all the attributes for which the virtual folder is to be generated. If there are attributes that have not yet been processed, the process returns to step 1002. finish.

<Extracted keyword registration process>
FIG. 11 is a flowchart for explaining extracted keyword registration processing executed by the keyword registration program. Here, a description will be given assuming that the operation subject is the keyword registration program 122.

  In step 1101, the keyword registration program 122 reads all the metadata files 131 (the metadata of the attribute selected in step 1001) from the storage device 130.

  In step 1102, the keyword registration program 122 selects one file from the read metadata file and reads the metadata. For example, let us consider a case where data having the attribute “document type” value “acknowledgment notice 1” is read.

  In step 1103, the keyword registration program 122 performs morphological analysis on the data read in step 1102. Details of morphological analysis are disclosed in Non-Patent Document 1. FIG. 16A shows the result of morphological analysis performed on “acknowledgment notice 1”. The “acknowledgment notice 1” is divided into four character strings “acceptance”, “notification”, “book”, and “1”. In addition, in the part of speech line, each character string is a noun or an unknown word, and ancillary contents are described. An unknown word is a character string whose part of speech is determined to be unknown as a result of morphological analysis. In the morphological analysis, the part of speech of the input character string is determined based on the dictionary used internally. Therefore, the character string not registered in the dictionary is determined as an unknown word. Specifically, proper nouns such as product names and personal names can be unknown words. In addition, since morphological analysis is used for Japanese analysis, alphanumeric characters and symbols may not be registered in the dictionary. In the example described above, the case where “1” is determined to be an unknown word is shown.

  In step 1104, the keyword registration program 122 extracts a character string in which one or more nouns or unknown words are continued based on the result of the morphological analysis in step 1103, and uses the character string as an extracted keyword. A technique for extracting a character string of such a part-of-speech pattern as a keyword is generally used. Many techniques for analyzing extracted keywords in more detail and improving the keyword extraction accuracy have been proposed.

  In step 1105, the keyword registration program 122 performs filtering of extracted keywords according to a predefined rule. In the virtual folder generation process by the virtual folder generation program 123, a virtual folder is generated based on the extracted keyword. Therefore, if a keyword that is inappropriate as a virtual folder is included, an inappropriate virtual folder is generated. there is a possibility. For this reason, keywords that are considered inappropriate as virtual folders are excluded in this process. For example, when a virtual folder is defined from the keyword “acknowledgment notice 1”, it is desirable to exclude numbers from the viewpoint of easy understanding of classification for the user. In order to realize filtering, a character or special noun to be excluded is registered in a dictionary or DB in advance, and it is determined whether or not it is a character to be excluded. Characters to be excluded are symbols such as American signs and arrows, and numbers (however, since numbers may be necessary as keywords, it is not appropriate to always exclude them). You may ask if you want to exclude them). FIG. 16C shows an example in which keywords including numbers are excluded from the keywords in FIG. 16B. Also, special patterns in nouns should be excluded. For example, pronouns, ny adjective stems, some suffixes, etc. The Nai adjective stem is a noun that takes the form of “not” such as “sorry” and “adult”. The noun suffixes that should be excluded include, for example, honorific names that follow the names of people such as “~ Kimi” and “~ san”, “Gotchi” for “I tend to take a break”, and “Same” for “I won”. There are adjective verb stems.

  In step 1106, the keyword registration program 122 updates the extracted keyword data 141 in the data memory. That is, the keyword registration program 122 registers the extracted keyword acquired in the process from step 1102 to step 1105. If there is an extracted keyword already registered in the extracted keyword data 141, the frequency is incremented by one. If the extracted keyword is not yet registered in the extracted keyword data 141, the extracted keyword is registered as frequency 1.

  In step 1107, the keyword registration program 122 determines whether or not the processing from step 1102 to step 1106 has been performed on all the metadata. If there is metadata that has not been performed yet, the keyword registration program 122 returns to step 1102 and all the metadata is processed. If the metadata has been processed, the process is terminated.

<Search keyword registration process>
FIG. 12 is a flowchart for explaining search keyword registration processing executed by the keyword registration program. Here, a description will be given assuming that the operation subject is the keyword registration program 122.

  In step 1201, the keyword registration program 122 reads the search log data 132 from the storage device 130 for the attribute selected in step 1001.

  In step 1202, the keyword registration program 122 selects one piece of data from the read search log data 132. For example, a case where the search query A is “contract”, the search query B is “document management system”, and the date and time is “2009/01/22 23:12:05” can be considered.

  In step 1203, the keyword registration program 122 updates the search keyword management data 142 in the data memory 140 based on the read data. Specifically, if the combination of the search query A and the search query B in the read data is included in the search keyword management data 142, the frequency of the corresponding data in the search keyword management data 142 is incremented by one. If not included, an entry of the read data is added and the frequency is registered as 1.

  In step 1204, the keyword registration program 122 determines whether all data in the search log data 132 has been processed. If all data has not been processed, the process returns to step 1202, and if all data has been processed, the process ends.

<Co-occurrence keyword registration process>
FIG. 13 is a flowchart for explaining the co-occurrence keyword registration process executed by the keyword registration program. Here, a description will be given assuming that the operation subject is the keyword registration program 122.

  In step 1301, the keyword registration program 122 reads all the metadata files 131 from the storage device 130 and the extracted keyword data 141 from the data memory 140 for the attribute selected in step 1001.

  In step 1302, the keyword registration program 122 reads one extracted keyword from the read extracted keyword data. Here, for example, the extracted keyword is described as “contract”.

  In step 1303, the keyword registration program 122 reads one piece of metadata from the metadata file 131. For example, the metadata is described as “contract (search system)”.

  In step 1304, the keyword registration program 122 determines whether the extracted keyword is included in the metadata. If not included, the process proceeds to step 1308. If it is included, the process proceeds to step 1305. In the case of the extracted keyword “contract” and metadata “contract (search system)”, since the character string “contract” is included in the metadata, the process proceeds to step 1305.

  In step 1305, the keyword registration program 122 performs morphological analysis on the metadata. In the case of the above example, it is decomposed like “contract” “book” “(” “search” “system” “)”, and part-of-speech information is given to each.

  In step 1306, the keyword registration program 122 extracts a keyword that does not include and does not include the extracted keyword selected in step 1302 based on each word after morphological analysis. The keyword extraction method is the same as the keyword extraction method in the extracted keyword registration process described above, and a character string in which nouns or unknown words are continued is regarded as a keyword. In the case of the above example, keywords that do not include “contract”, are not included in “contract”, and are not adjacent to “contract” are “search”, “system”, and “search system”. Possible patterns. Other examples include the extracted keyword “contract” and metadata “basic contract”. In this case, as a result of the morphological analysis, the “basic contract” is decomposed into “basic”, “contract”, and “book”. Keywords that do not include the extracted keyword “contract” include “basic”, “contract”, and “document”. Among these, “contract” and “book” are inappropriate because they are included in “contract”. “Basic” is not suitable because it is a keyword adjacent to “contract”. Furthermore, as another example, in the case of the extracted keyword “delivery note” and metadata “delivery note / acceptance request document”, the “delivery note / acceptance request document” ”“ Acceptance ”“ Request ”“ Book ”. Among these, “delivery request” and “acceptance request form” are not suitable for co-occurrence keywords because “acceptance request form” does not include the word “delivery form” and two are separated by “cum”. It is judged that

  In step 1307, the keyword registration program 122 updates the co-occurrence keyword data 143 in the data memory 140. Specifically, the combination of the extracted keyword selected in step 1302 and the keyword extracted in step 1306 is registered. In the case of the above example, three patterns of data are registered. One is “contract” and “search”, the second is “contract” and “system”, and the third is “contract” and “search system”. If these data are included in the co-occurrence keyword data 143, the frequency of the corresponding data in the co-occurrence keyword data 143 is added and registered. If not included, a new entry for the data is added and the frequency is registered as 1.

  In step 1308, the keyword registration program 122 determines whether or not processing has been performed on all metadata. If all the metadata has not been processed, the process returns to step 1303, and if all the metadata has been processed, the process proceeds to step 1309.

  In step 1309, the keyword registration program 122 determines whether all extracted keywords have been processed. If all the extracted keywords have not been processed, the process returns to step 1302, and if all the extracted keywords have been processed, the process ends.

<Virtual folder generation process>
FIG. 14 is a flowchart for explaining virtual folder generation processing executed by the virtual folder generation program 123. In the virtual folder generation process, the virtual upper folder data 144 and the virtual lower folder data 145 are generated based on the extracted keyword data 141, the search keyword management data 142, and the co-occurrence keyword data 143 in the data memory 140. Then, virtual folder data 133 in the storage device 130 is generated.

  In step 1401, the virtual folder generation program 123 generates virtual upper folder data (see FIG. 8) and sorts it in descending order of score. Specifically, the virtual folder generation program 123 first reads the extracted keyword data 141 and the search keyword management data 142 in the data memory 140, and merges these data. When merging, the character strings of the extracted keyword in the extracted keyword data 141 or the search query A or the search query B in the search keyword management data 142 are added and registered as one entry. For example, if the extracted keyword “contract” has a frequency of 100, and the combination of search query A and search query B is “contract” and “Company A” with a frequency of 80, the first line in FIG. Register like the data. The score 804 at that time will be described later. If there is a character string corresponding to either one of the search query A and the search query B, the character string is added. For example, when the combination of the search query A and the search query B is “contract” and “company A” with a frequency of 100, and there is data with a frequency of 50 for “contract” and “company B”. The search frequency 803 in the virtual upper folder data 144 is 150. The score 804 is obtained by adding the extracted keyword frequency 802 and the search frequency 803 with weights. In the example of FIG. 8, the metadata frequency weight is 1 and the search frequency weight is 5, and the result of addition is shown. The reason for performing the weighted addition is that the degree of importance for the user differs depending on what data is obtained. In the example of FIG. 8, the search frequency is weighted five times as much as the metadata frequency. This is because the character string used for the search is a character string intentionally designated by the user, and is considered to be highly important. When the calculation of the scores for all data is completed, the data are sorted in descending order of scores. Note that the virtual upper folder data is generated for all the attributes of the virtual folder generation target.

  In the processing from step 1402 to step 1409, a keyword serving as a search condition for the virtual folder is determined based on the virtual upper folder data 144 and generated as virtual folder data 133.

  In step 1402, the virtual folder generation program 123 selects one attribute for generating a virtual folder.

  In step 1403, the virtual folder generation program 123 selects one keyword from the virtual upper folder data 144. At this time, a keyword having the highest frequency is selected from unprocessed keywords.

  In step 1405, the virtual folder generation program 123 registers the keyword adopted in step 1404 in the virtual upper folder data 144 as a keyword in the virtual upper folder. At this time, as described above, the registered virtual upper folder and the data of the virtual lower folder are deleted as necessary.

  In step 1406, the virtual folder generation program 123 generates a virtual lower folder based on the keyword of the virtual upper folder registered in step 1405, that is, registers the virtual lower folder data 145. The generation of the virtual lower folder data will be described later.

  In step 1407, the virtual folder generation program 123 determines whether all keywords in the virtual upper folder data have been processed. If there is an unprocessed keyword, the process proceeds to step 1408, and if all keywords have been processed, the process proceeds to step 1409.

  In step 1408, the virtual folder generation program 123 determines whether or not the number of virtual upper folders in the virtual upper folder data 144 has reached a specified value. If the predetermined value has not been reached, the process proceeds to step 1403. If the predetermined value has been reached, the process proceeds to step 1409.

  In step 1409, the virtual folder generation program 123 determines whether all the attributes of the virtual folder generation target have been processed. If all attributes have not been processed, the process proceeds to step 1402, and if all attributes have been processed, the process ends.

  Through the processing as described above, virtual folder data 133 as shown in FIG. 4 is generated.

<Virtual subfolder generation process>
FIG. 15 is a flowchart for explaining a virtual lower folder generation process executed by the virtual folder generation program 123. In the virtual lower folder generation process, a keyword to be a virtual lower folder is selected based on the keyword specified for the virtual upper folder. Here, a description will be given assuming that the operation subject is the virtual folder generation program 123.

  In step 1501, the virtual folder generation program 123 generates virtual lower folder data based on the keywords of the virtual upper folder and sorts them in descending order of score. Specifically, the extracted keyword data 141, the search keyword management data 142, and the co-occurrence keyword data 143 in the data memory 140 are first read and merged in the same manner as when the virtual upper folder data 144 is generated. . When merging, the character strings of the extracted keyword, search query A, search query B, and co-occurrence keyword in the extracted keyword data 141, search keyword management data 142, and co-occurrence keyword data 143 are added together as one entry. sign up. There are two patterns of summation at this time. The first pattern is a case in which the keyword B has a null value in the virtual lower folder data 145, and the other pattern is a pattern in which the keyword B does not have a null value. Each pattern will be described. First, a case where the keyword B has a null value will be described. In this case, the data including the keyword of the virtual upper folder is added to the search keyword A in which the extracted keyword in the extracted keyword data 141 or the search query B in the search keyword management data 142 has a null value. For example, the first data in FIG. This represents the result of adding up the data of the character string “contract” including the keyword “contract” in the virtual upper folder. In this case, the extracted keyword frequency 903 is 100, and the search frequency 904 is 80. The keyword B902 and the co-occurrence frequency 905 are not used. A score 906 indicates the degree of matching as a virtual lower folder. The higher the score 906, the higher the degree of matching as a virtual lower folder. A method for calculating the score 906 will be described later. Next, a pattern in which the keyword B does not become a null value will be described. In this case, data in which one of the combinations of search query A and search query B in the search keyword management data 142 is a keyword in the virtual upper folder, and data in which the extracted keyword in the co-occurrence keyword data 143 is a keyword in the virtual upper folder. Add together. For example, the second data in FIG. The score 906 is obtained by weighted addition of the extracted keyword frequency 903, search frequency 904, and co-occurrence frequency 905. In the example of FIG. 9, the metadata frequency weight is 2, the search frequency weight is 10, and the co-occurrence frequency weight is 1. The reason for performing the weighted addition is the same as that when generating the virtual upper folder. When all the data has been calculated, the score is sorted in descending order.

  The processing from step 1502 to step 1508 is processing for determining the virtual lower folder of the virtual upper folder based on the virtual lower folder data 145 generated in step 1501 and storing it as the virtual folder data 133 in the storage device 130. Thereafter, in the virtual lower folder data 145, processing is performed in order from the data with the higher score.

  In step 1502, the virtual folder generation program 123 determines whether all keywords in the virtual lower folder data 145 have been processed. If all keywords have been processed, the process ends. If an unprocessed keyword is included, the process proceeds to step 1503.

  In step 1503, the virtual folder generation program 123 selects one piece of unprocessed data (P) from the virtual lower folder data 145 (see FIG. 9).

  In step 1504, the virtual folder generation program 123 determines whether or not the score is a certain value or more. If the condition is satisfied, the process proceeds to step 1505. If not satisfied, the process ends.

  In step 1505, the virtual folder generation program 123 determines whether or not the lengths of the character strings of the keywords A and B in P are both greater than or equal to a certain value. If this condition is satisfied, the process proceeds to step 1505. Otherwise, the process returns to step 1502.

  In step 1506, the virtual folder generation program 123 determines whether or not there is a longer keyword that includes both the character strings of the keywords A and B of P and has a score equal to or higher in the virtual lower folder data 145. judge. Here, “same level or higher” means that if the score value is SC, a score value slightly smaller than SC is allowed, and the score value can be expressed as (SC−α) or higher. For example, when the keyword A / B of P is (contract, consignment) and the score 906 is 612, the keyword A / B is (contract, business consignment) and the score 906 is 645 in the virtual lower folder data 145. Is applicable. In this case, since the condition of step 1506 is satisfied, the process returns to step 1502. That is, P is not generated as a virtual lower folder. This is because, when the scores are almost the same, a longer keyword character string is more suitable for the nature of the virtual lower folder. If the condition of step 1506 is not satisfied, the process proceeds to step 1507. The processing in step 1506 is processing for preventing a number of virtual subfolders having similar keywords from being generated. In the above example, if the keywords A and B are (contract, consignment) and (contract, business consignment), the score values are the same at 612 and 645. In this case, a virtual subfolder is not created in (contract, consignment), but a virtual subfolder is created in (contract, business consignment). This is because the latter is more specific and easier to understand than the former. Since (contract, consignment) does not generate a virtual subfolder, documents that include the keyword (contract, consignment) (excluding documents that include business consignment) are classified directly under the virtual upper folder of the keyword “contract”. Will be.

  In step 1507, the virtual folder generation program 123 stores the P keyword as a virtual lower folder in the virtual folder data 133 in the storage device 130.

  In step 1508, the virtual folder generation program 123 determines whether or not the number of virtual lower folders for the target virtual upper folder has reached a specified value. If the condition is not satisfied, the process returns to step 1502, and if the condition is satisfied, the process ends.

<Summary>
As described above, according to the present embodiment, morphemes are generated from character strings that constitute metadata (particularly, each attribute information) of a plurality of physical files (physical files) managed on the metadata file. Extract multiple keywords using analysis, etc., extract search query keywords from the log data of search queries used by the user, and search for keywords that often appear with keywords extracted from metadata Then, the metadata is extracted from the metadata, and a score indicating the degree of matching as a virtual folder is calculated from the keywords. Then, a specified number of virtual upper folders are generated using keywords whose score is equal to or greater than a predetermined value, and a virtual lower folder associated with the virtual upper folder is further generated using another keyword including the keyword of the virtual upper folder. Generate. Further, a virtual classification display (FIG. 17) for displaying the relationship between the generated virtual upper folder and the virtual lower folder and the contents of the virtual upper folder and the virtual lower folder is displayed as a GUI on the screen. By doing so, it becomes easy to automatically classify files automatically, and file management using virtual folders can be realized efficiently. Generally, when a human creates a virtual folder, the tendency to define a virtual folder with a character string that frequently appears, a character string that is frequently used for search, or a character string that often appears with a character string that frequently appears It is thought that there is. Therefore, it is considered that the present invention performs processing according to human thought, and classification close to human classification policy is possible. In addition, since the virtual upper folder is generated so as to include various character strings, similar virtual upper folders are rarely generated, resulting in a refined processing result. In addition, because the virtual subfolder is generated based on the keywords that appear frequently and the keywords that are frequently used for searching among the files contained in the virtual upper folder, it is possible to search for files efficiently even with finer granularity. is there.

  Further, when generating a virtual upper folder, a keyword having a character string length of a predetermined value or more is used. As a result, it is possible to prevent an excessive number of virtual upper folders from being generated. This character string length can be specified by the user, and can be changed when a number of virtual folders different from the number expected by the user are generated after the automatic virtual classification process. It is possible.

  Also, a plurality of keywords are extracted for each piece of metadata attribute information, and score information indicating the degree of matching of each extracted keyword as a virtual folder is calculated. Then, a virtual upper folder and a virtual lower folder are created for each of a plurality of attribute information, and a virtual classification display (FIG. 17) corresponding to the selected attribute is output in response to a user attribute selection input. I have to. Thereby, a virtual folder can be generated for each attribute, and a virtual classification display with a sense of unity can be presented by the user. Therefore, this virtual classification display is very convenient for the user.

  Furthermore, when generating a virtual lower folder, a plurality of keywords including a keyword corresponding to the virtual upper folder name and having a character string length longer than the keyword and having an appearance frequency ratio within a predetermined range are included. If it exists, a virtual subfolder is generated using the keyword with the longest character string length as the folder name. This makes it possible to generate a virtual lower folder that more specifically shows the characteristics of the folder, and the user can easily grasp the tendency of file classification.

  Note that the present invention is not limited to the embodiments as they are, and can be embodied by modifying the constituent elements without departing from the scope of the invention in the implementation stage. Various inventions can be formed by appropriately combining a plurality of constituent elements disclosed in the embodiments. For example, some components may be deleted from all the components shown in the embodiment. Furthermore, constituent elements over different embodiments may be appropriately combined.

  In addition, each configuration, function, processing unit, processing unit, and the like described in the embodiments may be realized in hardware by designing a part or all of them with, for example, an integrated circuit. Further, each of the above-described configurations, functions, etc. may be realized by software by the processor interpreting and executing a program that realizes each function. Information such as programs, tables, and files for realizing each function is stored in a recording or storage device such as a memory, hard disk, or SSD (Solid State Drive), or in a recording or storage medium such as an IC card, SD card, or DVD. be able to.

  Furthermore, in the above-described embodiment, control lines and information lines are those that are considered necessary for explanation, and not all control lines and information lines on the product are necessarily shown. All the components may be connected to each other.

100: Central processing unit (processor)
110 ... Input / output device 111 ... Display device 112 ... Keyboard 113 ... Pointing device (mouse)
120 ... Program memory 121 ... Search program 122 ... Keyword registration program 123 ... Virtual folder generation program 124 ... Virtual classification program 130 ... Storage device 131 ... Metadata file 132 ... Search log data 133 ... Virtual folder data 140 ... Data memory 141 ... Extracted keyword data 142 ... Search keyword management data 143 ... Co-occurrence keyword data 144 ... Virtual upper folder data 145 ..Virtual lower folder data

Claims (10)

A file management device for classifying and managing a plurality of physical files,
A processor for executing a program for generating a virtual folder for classifying the plurality of physical files;
A storage device for storing metadata management information for managing metadata of the plurality of physical files and search log information for managing search history;
The virtual folder is a substantive folder for managing link information of the plurality of physical files and physical folders regardless of the location of the plurality of physical files or the plurality of physical folders storing them. Yes,
The processor is
A plurality of metadata keywords are extracted from the constituent character strings constituting the metadata of the plurality of files of the metadata management information, and first appearance frequency information indicating the appearance frequency of the extracted metadata keywords is obtained. And
Extracting a plurality of search keywords from each search character string constituting the plurality of search histories of the search log information, obtaining second appearance frequency information indicating an appearance frequency of each of the extracted search keywords,
Calculating a first score that is a score of each keyword by weighted addition of the frequency of each keyword indicated by the first and second appearance frequency information;
Generating a specified number of virtual upper folders using keywords whose first score is equal to or greater than a predetermined value;
Displaying the created virtual upper folder on a display screen;
A file management apparatus. In claim 1,
The processor is
An inclusion keyword which is another keyword including the keyword used for generating the virtual upper folder, a combination keyword which is another keyword included in the same metadata as the keyword used for generating the virtual upper folder, and the virtual upper Using at least one of the co-occurrence keywords that are searched simultaneously with the keyword used to generate the folder, to generate a virtual lower folder associated with the virtual upper folder;
The virtual classification display for displaying the relationship between the generated virtual upper folder and the virtual lower folder and the contents of the virtual upper folder and the virtual lower folder is performed on the display screen.
A file management apparatus. In claim 2,
The processor is
Obtaining third appearance frequency information indicating an appearance frequency in which a combination of the keyword used for generating the virtual upper folder and the co-occurrence keyword is used in the search;
The first and second appearance frequency information about the inclusion keyword, and the second and third appearance frequency information about the combined keyword and the co-occurrence keyword, for each keyword used for virtual subfolder generation Calculating a second score that is a score of each keyword used for generating the virtual subfolder by weighting and adding the frequency;
Generating a specified number of virtual subfolders using a keyword having the second score equal to or greater than a predetermined value;
A file management apparatus. In claim 3,
The file management apparatus, wherein the processor generates the virtual subfolder with a keyword having a character string having a predetermined length or more. In claim 3,
When there is a lower concept keyword composed of a longer character string including the target keyword that is the target of the generation process of the virtual lower folder, the processor determines that the second score of the lower concept keyword is (the A file management device that generates the virtual subfolder with the subordinate concept keyword without using the original keyword when the target keyword is equal to or greater than the second score-a predetermined value. In claim 1,
When the processor determines whether to generate a virtual upper folder for a lower concept keyword including a character string constituting an existing virtual upper folder, the first score of the character string constituting the existing virtual upper folder is determined. And the first score of the lower concept keyword, and a larger one is used to construct a virtual upper folder. In claim 6,
As a result of the comparison between the first score of the character string constituting the existing virtual upper folder and the first score of the lower concept keyword, the processor determines that the first score of the lower concept keyword is the A file management device that deletes the existing virtual upper folder and configures a virtual upper folder with the lower concept keywords when the character string constituting the existing virtual upper folder is larger than the first score . A file management method for classifying and managing a plurality of physical files into virtual folders,
The virtual folder is a substantive folder for managing link information of the plurality of physical files and physical folders regardless of the location of the plurality of physical files or the plurality of physical folders storing them. Yes,
A processor that executes processing for generating the virtual folder reads metadata management information for managing metadata of the plurality of physical files from a storage device, and metadata of the plurality of files of the metadata management information Extracting a plurality of metadata keywords from each constituent character string that constitutes the first character, and obtaining first appearance frequency information indicating an appearance frequency of each extracted metadata keyword;
The processor reads search log information for managing a search history from the storage device, extracts a plurality of search keywords from each search character string constituting the plurality of search histories of the search log information, and extracts the search Obtaining second appearance frequency information indicating the appearance frequency of each search keyword,
The processor calculates a first score that is a score of each keyword by weighted addition of the frequency of each keyword indicated by the first and second appearance frequency information;
The processor generates a predetermined number of virtual upper folders using a keyword having the first score equal to or greater than a predetermined value;
The processor displaying the created virtual upper folder on a display screen;
A file management method characterized by comprising: The claim 8, further comprising:
An inclusion keyword that is another keyword including the keyword used by the processor to generate the virtual upper folder, a combined keyword that is another keyword included in the same metadata as the keyword used to generate the virtual upper folder, And generating a virtual lower folder associated with the virtual upper folder using at least one of the co-occurrence keywords that are searched simultaneously with the keyword used for generating the virtual upper folder;
The processor performs a virtual classification display on the display screen for displaying the relationship between the generated virtual upper folder and the virtual lower folder and the contents of the virtual upper folder and the virtual lower folder;
A file management method characterized by comprising: A program for classifying and managing multiple physical files into virtual folders,
The virtual folder is a substantive folder for managing link information of the plurality of physical files and physical folders regardless of the location of the plurality of physical files or the plurality of physical folders storing them. Yes,
In a processor that executes processing for generating the virtual folder,
Metadata management information for managing the metadata of the plurality of physical files is read from the storage device, and a plurality of metadata keywords are formed from the constituent character strings constituting the metadata of the plurality of files of the metadata management information. And obtaining first appearance frequency information indicating the appearance frequency of each extracted metadata keyword;
The search log information for managing the search history is read from the storage device, a plurality of search keywords are extracted from the search character strings constituting the plurality of search histories of the search log information, and the extracted search keywords Processing for obtaining second appearance frequency information indicating the appearance frequency of
A process of calculating a first score that is a score of each keyword by weighted addition of the frequency of each keyword indicated by the first and second appearance frequency information;
A process of generating a predetermined number of virtual upper folders using a keyword having the first score equal to or greater than a predetermined value;
A process of displaying the created virtual upper folder on a display screen;
A program characterized by having executed.

Images