JP2003178079A - Document management device and document management program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a document management device capable of expanding the functional property for classification and allowing an operator to perform an efficient narrowed retrieval. <P>SOLUTION: A client side selects a route of a tree, and selects a retrieving function to execute a retrieving key designation command. When the retrieving key destination is selected from a menu, a dialogue is displayed. When a retrieving key of a name of the document is designated, the client side requests the short-cut of the retrieval appropriate documents and the non-appropriate documents to a server side. The server side acquires a list of the appropriate documents and the non-appropriate documents, creates a short-cut file of the appropriate documents and the non-appropriate documents, and transmits the file to the client side. The client side copies the short-cut of the appropriate documents and the non-appropriate documents to a main storage medium, a node of the appropriate documents is newly created, a node of the non- appropriate documents is created under the same, and a list of the fitted documents as a result of the retrieval of all documents, is displayed on a right view. <P>COPYRIGHT: (C)2003,JPO

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an electronic document management apparatus, and more particularly to a document management apparatus and a program for executing document management, which can easily retrieve a desired document from a storage device storing document information.

[0002]

2. Description of the Related Art The mainstream of the existing document management software has a tree hierarchical structure as shown in FIG. 13, and each information is stored in order in a recording device. This document management software has a document management root 101, branches into a folder 102 and a subfolder 103, and a document 104 exists in the subfolder 103. One document is composed of a combination of minimum units of document management called a section 105, and those sections are allowed even if they are of different formats such as a word processing original or an image.

Usually, the sections 104 are organized in file units and are the minimum units on the OS, and they exist independently on the OS. Those files on the OS (unless collected in a folder unit)
Cannot be associated and combined. However, in the actual work of the operator and in the operation of file management, it is necessary to associate them into one, so that the document management software combines these sections to form a "document".

In the document management system that manages using the tree system as described above, it is possible to create a management system intended by the operator for the folders 102 and the subfolders 103. The operator is the folder 102
Create, delete, move, copy, and again, folder 1
Documents are managed by classifying them in 02 (arranging them with rules). Also, folder 102, subfolder 1
03, the document 104, and the section 105 can each be given a name intended by the operator.

[0005]

However, with such a document management software, the operator can create only one management system and cannot support a plurality of classification methods. For example, it is assumed that past documents (plan, contract, delivery note, etc.) issued to a plurality of customers have been registered in the document management system. At this point, one may want to sort by customer, and another may want to sort by document type. Of course, the operator can create a folder and classify the documents by considering which is suitable for the operation. However, unless one document is registered in duplicate, these two (customer, document type) cannot be classified at one time.

[0006] In a database search system having a search function based on a keyword or a time stamp, particularly in a document management system, the search method and the display method of the search result are conventionally the search key (keyword or time stamp). The specified search execution button is pressed. In many cases, a list of documents matching the search key is displayed. Further, these search results are only displayed temporarily, and it is necessary to execute the search again after restarting the software.

If it is desired to further narrow down the search from this state, a search key is designated, and a narrowing down search button is pressed to display a list of documents matching the designated search key. However, in order to refer to the search result at this time again, it is necessary to return to the new search and perform the search again. Also, the search results of and cannot be immediately switched and displayed.

The present invention has been made in view of the above circumstances, and a first object thereof is to provide a document management apparatus which expands the functionality of classification and enables an operator to perform efficient narrowing-down search. Especially.

A second object is to provide a document management device and a document management program which are excellent in operability.

A third object is to provide a document management program capable of reproducing the same search system in a plurality of clients.

A fourth object is to provide a document management program which can provide an operator with a work environment independent of the client.

[0012]

To achieve the above object, a first means is a document management apparatus for managing a document stored in a storage device, and a means for an operator to specify a search key, Means for searching a document from the storage device based on the retrieved search key, means for obtaining a list of search results, means for displaying the search key as a node of the tree, and creating a shortcut for the document of the search results Means, a means for displaying a list of search results corresponding to the nodes of the selected tree, a means for hierarchically displaying the tree, and a means for scanning the search key of the parent node of the selected node to the root. The present invention is characterized by comprising means for storing a tree in association with a search key, and means for storing the structure of the displayed tree and a document list corresponding to each node. That.

The second means is a means for searching a search key which does not correspond to the specified one or more search keys of the same hierarchy in the first means, in other words, a NOT search of the specified one or more search keys. It is characterized by comprising means for performing.

A third means is characterized in that, in the second means, it has means for updating the search result when the search keys in the same hierarchy are increased or decreased.

A fourth means is a document management program for managing documents stored in a storage device, a procedure for searching for a document based on a designated search key, and a procedure for obtaining a list of search results. And displaying the search key as a tree node, creating a shortcut for the search result document, displaying the search result list corresponding to the selected tree node, and displaying the tree hierarchically. Procedure, scanning the search key of the parent node of the selected node to the root, storing the created search key by associating it with the tree structure and the document list information corresponding to each node. Based on the procedure to save with the file name specified by the operator and the file structure saved with the file name specified by the operator, A step of restoring the document list corresponding to the node is written, and executes the management on the basis said been downloaded to each step to the information processing apparatus.

A fifth means is a document management program for managing a document stored in a storage device, a procedure for searching a document based on a designated search key, and a procedure for obtaining a list of search results. And displaying the search key as a node in the tree, creating a shortcut for the search result document, displaying the search result list corresponding to the selected tree node, and displaying the tree hierarchically. The procedure, the procedure of scanning the search key of the parent node of the selected node to the root, the procedure of storing the created search key in association with the created tree, the configuration of the displayed tree and the information of the document list corresponding to each node are stored in the server. To the server, the procedure to save the sent information to a file on the server side, and the tree configuration and each based on the saved file. A procedure for restoring the document list corresponding to these nodes is written, downloaded to the information processing device, and the management is executed based on each of the procedures.

A sixth means is a document management program for managing documents stored in a storage device, in which a document is classified based on a designated search key and a list of search results is obtained. And displaying the search key as a tree node, creating a shortcut for the search result document, displaying the search result list corresponding to the selected tree node, and displaying the tree hierarchically. Procedure, scan the search key of the parent node of the selected node to the root, store the created search key in association with the tree, save the tree structure and the document list corresponding to each node. Procedures, a procedure for searching for a search key that does not correspond to one or more specified search keys in the same hierarchy, and when the number of search keys in the same hierarchy increases or decreases. A procedure for storing a flag for determining whether or not to update the search result and a procedure for updating the search result according to the flag are written and downloaded to the information processing device to perform the management based on each procedure. It is characterized by executing.

The programs in the fourth to sixth means are written in a recording medium, the written program is downloaded to a document management device or an information processing device, or a program supply medium is supplied via a communication means. It is received from, and downloaded to a document management device or an information processing device for use.

[0019]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below with reference to the drawings.

<First Embodiment> This first embodiment is an example in which a list of results that do not correspond to the obtained search results is displayed on the parent node to expand the functionality of classification. . It should be noted that in the following description, the same reference numerals are given to the respective equivalent parts, and the duplicated description will be omitted.

FIG. 1 is a block diagram showing an example of a document management system in which a document management DB server 1 and a client 2 are connected.

Although FIG. 1 shows a peer-to-peer diagram, a network may be provided between two machines. It is also possible for a single machine to act as both a server and a client. Hereinafter, in the present embodiment, a system including two machines will be described.

FIG. 2 is a block diagram showing the internal structure of the devices of the server 1 and the client 2. Since the server 1 and the client 2 have the same internal structure, only one of them will be illustrated and described. Further, although the network control unit is connected to the network 3, in the case of peer-to-peer connection as described above, they are connected to the network control units of the respective devices.

The server 1 is basically composed of a control unit 11, a memory 12, an input control unit 13, a main memory control unit 14, a display control unit 15, and a network control unit 16, and these respective units are connected via a bus 10. It is connected. Further, the input control unit 13 controls the keyboard 17 and the mouse 18,
The main storage control unit 14 controls the main storage medium 19, and the display control unit 15 controls the display 20 as a display unit. As the main storage medium 19, for example, a hard disk H
DD, floppy disk FD, magneto-optical disk MO, etc. are used. A client 2 having the same configuration as this is connected via a network 3.

The processing procedure in such a system is shown in the flowchart of FIG. 3, and an example of the display screen displayed on the display 20 is shown in FIG. The processing in FIG. 3 is as follows.

First, when the root of the tree is selected on the client 2 side and the search function is selected, a "search key designation" command is executed (step S1). As a result, the window shown in FIG. 4 is displayed. By right-clicking on the root personal document in the left tree view to display a menu and selecting "specify search key", a dialog for inputting a search key is displayed (step S2). When "R company" is designated as the search key for the document name (step S3), the client 2 side requests the server 1 side for the shortcuts of the retrieved document and the undocumented document (step S4). The server 1 side obtains a list of relevant documents and non-corresponding documents to be searched (step S5), creates shortcut files for the relevant documents and non-corresponding documents (step S6), and creates shortcuts for the relevant documents and non-corresponding documents. It is transmitted to the client 2 side (step S7). On the client 2 side, the shortcuts of the corresponding document and the non-corresponding document are copied to the main storage medium 19, for example, the HDD (step S8), and a new node "Search result for [September]" is newly created as shown in FIG. , And a new node of [September] non-corresponding document is created under it, and a list of hit documents is displayed in the right view after searching all documents (step S).
9).

Here, for example, "search result of [contract]"
When is selected, a list of documents that are searched by the contract and hit is displayed in the right view. At this time, the search is not executed, and the result of the previous search is displayed.

Here, for example, it is assumed that all documents are the following six documents.

· RI company September contract · September payment unpaid list · RI company September payment statement · September financial statement · RI company October contract · RI company October payment statement , The top 4 documents that hit the search key "September" are displayed as "Search results for [September]", and the remaining two documents are displayed as "Not applicable documents for [September]" It

According to this embodiment, since the result list that does not correspond to the search result obtained for the parent node is displayed, the functionality of classification is expanded and the operator is provided with an efficient narrowing-down search method. be able to.

<Second Embodiment> This second embodiment expands the functionality of classification by displaying a result list that does not correspond to one or more search keys of the same hierarchy obtained for a parent node. Here is an example to try.

The processing procedure according to the second embodiment is shown in the flowchart of FIG. 6, and an example of the display screen displayed on the display 20 is shown in FIG. Since the system itself is equivalent to that of the first embodiment shown in FIGS. 1 and 2, the description thereof will be omitted.

In this embodiment, when the root of the tree is selected on the client 2 side and the search function is selected, a "search for unhit document" command is executed (step S1).
1). As a result, the window shown in FIG. 7 is displayed.
Then, the child nodes of the designated node are scanned to obtain a list of search keys (step S12). Then, the shortcut of the document which has not been hit by the OR search with all the search keys is requested (step S13). In response to this, the server 1 side performs a search to obtain a list of unhit documents by OR search (step S14), creates a shortcut file of unhit documents (step S15), and creates a shortcut of unhit documents. Is transmitted to the client 2 side (step S16).

On the client 2 side, the shortcut of the non-hit document is copied to the main storage medium 19 such as the HDD (step S17), and a new child node "non-hit document" is newly created as shown in FIG. 7 ( Step S18). That is, when a plurality of searches are performed, documents that do not match any search result are displayed in the “unhit document” folder. Note that FIG. 7 is a diagram showing a state in which the "RI company" and the "contract" are searched.

Here, for example, it is assumed that all documents are the following six documents. RI company contract unhit document ・ RI company September contract contract ○ ○ ・ September payment unpaid list ○ ・ RI company September payment statement ○ ・ September financial statement ○ ・ RI company October contract ○ ○ ・ RI company's October delivery note ○ In this case, documents that hit the search keys "RI company" and "contract" are displayed in the respective search results, and the rest that did not hit either search result 2 documents (“September's unpaid list” and “September's financial statements”) are displayed in the right view as “[September's non-applicable documents]” In addition, when the search is executed only once, the result of the “non-hit document” is the same as that of the “non-corresponding document” described in the first embodiment.

According to this embodiment, since the result list that does not correspond to the one or more search keys of the same hierarchy obtained for the parent node is displayed, the functionality of classification is expanded and the operator is efficiently narrowed down. It is possible to provide a search method of.

<Third Embodiment> In the third embodiment, the operability is improved by dynamically updating the "result list not corresponding to one or more search keys in the same hierarchy". In the example, the predetermined search result is deleted after the processing in the first or second embodiment is executed.

In this embodiment, as shown in the flowchart of FIG. 8, on the client 2 side, the root of the tree is selected and the "search key designation" command is executed (step S31). Then, the "search key specification dialog" is displayed (step S32), the search key is specified from the displayed dialog, the "search" command is executed (step S33), and the shortcut of the search target document is requested (step S33). S34). In response to this request, the server side 2 performs a search and obtains a corresponding document list (step S3).
5). Then, a shortcut file of the relevant document is created (step S36), and the shortcut of the relevant document is transmitted to the client 2 side (step S37).

On the client 2 side, the shortcut information of the relevant document is stored in the main storage medium (HDD) 19 (step S38). Then, a new node is created in the tree view and a list of documents is displayed (step S3).
9). Then scan the child nodes of the specified node,
A list of search keys is obtained (step S40), and a shortcut for a document that has not been hit in the OR search with all search keys is requested to the server 1 side (step S41).

On the server 1 side, the requested OR search is carried out to obtain a list of hits that are not hit in the OR search (step S4)
2). Then, the shortcut of the unhit document is created (step S43), and the shortcut of the unhit document is transmitted to the client 2 side (step S44).

On the client 2 side, the shortcut of the unhit document is copied to the main storage medium 19, for example, the HDD (step S45), and the "unhit document" list is updated (step S46).

With the above processing, the search result of "RI company" is deleted by updating after the second embodiment is executed.

The results are as follows.                        Contract unhit document ・ RI company September contract ○ ・ Unpaid list for September payment ○ ・ RI company September delivery note ○ ・ September financial statements ○ ・ RI company October contract ○ ・ RI company October delivery note ○ Perform a search on the “delivery note” for the entire personal document.

The results are as follows. Contract delivery note Non-hit document ・ RI company September contract agreement ○ ・ September payment unpaid list ○ ・ RI company September payment statement ○ ・ September financial statement ○ ・ RI company October contract ○ RI company's October delivery note ○ It should be noted that each unit not particularly described is configured and functions in the same manner as in the first embodiment described above.

According to this embodiment, when the number of search keys in the same layer increases or decreases, the result list not corresponding to one or more search keys in the same layer in the second embodiment described above is dynamically updated. This can save the operator the trouble of performing the updating operation.

<Fourth Embodiment> In this embodiment, the same search system can be reproduced in a plurality of clients.

FIG. 9 is a flowchart showing the processing procedure of the document management system according to this embodiment.

In this processing, the first client 2a
, A second client 2b, and a server 1 constitute a system, and the first and second clients 2a, 1
Reference numeral b is a document management application, and the server 1 corresponds to the document management system. In the first client 2a, "save search result" is selected from the display menu and executed (step S51). Then, information on the tree structure of the search results and the shortcut to the document is stored in the main storage medium 1.
9, for example, it is stored in the HDD (step S52), and the process ends.

On the other hand, in the second client 2b, "import of search result saved data" is executed from the display menu (step S53), the tree structure of the search result is marked on the tree view, and the information of the show cut to the document is displayed. Is displayed in the view (step S54). During this time, no processing is performed on the server 1 side.

Specifically, when the search function is selected from the document management system, a window as shown in FIG. 4 is displayed. Select the File menu from the tree view,
Select "Save search results". Then, a file save dialog is displayed as shown in FIG. 10, and a file name is designated and saved.

On the other hand, another client (second client 2b) displays the same search window as in FIG. 4 and selects "import search result saved data" from the file menu. As a result, the same folder structure as that shown in FIG. 10 is reproduced. If the client is connected to the same server, the shortcut to the document under each folder is effective. If the client is connected to a different server, right-click each folder and "Update" to build a search system for this server.

In addition, each part not particularly explained is the same as the first
Is configured and functions in the same manner as the embodiment of FIG.

According to this embodiment, it is possible to provide a method of reproducing the same search system in a plurality of clients. Also, by distributing this file, the search system can be shared with other operators. In addition, it is possible to share even the server / client in which different documents are stored.

<Fifth Embodiment> In this embodiment, the information of the displayed tree structure and the document list (shortcut) corresponding to each node is saved / restored on the server side so that the operator does not depend on the client. It is intended to provide a working environment.

FIG. 11 is a flow chart showing the processing procedure of the document management system according to the fifth embodiment.

In this process, first, the first client 2a executes the search end from the search menu of the document management system (step S61). Then, the tree structure of the search result and the information of the shortcut to the document are stored in the main storage medium 19, for example, the HDD (step S6).
2) Send the saved file to the server (step S63).

The server 1 saves the transmitted file (step S64). On the other hand, the second client 2
In b, a search window is displayed (step S65),
The server 1 is requested to download the information of the tree structure of the search result (step S66), and the server 1 transmits the file to the second client 2b in response to the request (step S67). Second client 2b
Saves the transmitted file (step S68) and checks whether the search result is saved in the HDD (step S69). If it is stored in the HDD, the tree structure of the search results stored in the HDD is displayed in the tree view, and the information of the shortcut to the document is displayed in the view (step S70). If it is not stored in the HDD, the search result tree only for the root is displayed (step S71). Then, the search end is executed from the menu (step S72), the tree structure of the search result and the information of the shortcut to the document are stored in the HDD (step S73), and the stored file is transmitted to the server (step S74). The server 1 saves the file received from the second client 2b (step S
75).

On the other hand, in the first client 2a, the system and OS are restarted (step S76), and the search window is displayed (step S77). Then server 1
Is requested to download the information of the tree structure of the search result (step S78). The server 1 transmits the file in response to this request (step S79), and the first client 2a saves the received file (step S8).
0). Then, it is checked whether the search result is stored in the HDD (step S81). If it is stored in the HDD, the tree structure of the search results stored in the HDD is displayed in the tree view, and the information of the shortcut to the document is displayed in the view (step S82). HD
If not stored in D, the search result tree of only the root is displayed (step S83).

The display state of the window at this time is the same as that shown in FIG. This figure shows the initial display state when the search function is selected from the document management system. When the search window is closed, the tree structure and the document shortcut information are transmitted to the server 1. When the search window is opened next time, information is downloaded from the server 1 and the same situation is reproduced. In addition, each unit not particularly described is configured and functions in the same manner as in the first embodiment described above.

According to the present embodiment, by storing the information on the server 1 side, it is possible to provide the search system created by the operator without depending on the client 2. In particular, it is effective in a server / client type web application.

<Sixth Embodiment> In the present embodiment, when the number of search keys in the same layer is increased or decreased in the second and third embodiments, "the search keys of one or more same layers are not satisfied. The operability is improved by dynamically updating the “result list” when the folder is selected.

FIG. 12 is a flow chart showing the processing procedure of the document management apparatus according to the sixth embodiment.

In this process, first, the client 2 selects the root of the tree and executes the "search key designation" command (step S91). Then, the "search key specification dialog" is displayed (step S92), the search key is specified and the "search" command is executed (step S9).
3). Then, the server 1 side is requested for the shortcut of the search target document (step S94).

On the server 1 side, a search is performed in response to the request in step S94 to obtain a corresponding document list (step S9).
5). Then, a shortcut file of the relevant document is created (step S96), and the shortcut of the relevant document is transmitted to the client 2 side (step S97).

On the client 2 side, the main storage medium 19,
Here, the shortcut of the relevant document is copied to the HDD (step S98), a new node is created in the tree view, and a list of documents is displayed (step S99). Then, on the screen of FIG. 7, "unhit document" is clicked (step S100), the node in the same hierarchy as the designated node is scanned, and a list of search keys is obtained (step S10).
1). Next, the server 1 side is requested to provide a shortcut for a document that has not been hit in the OR search of all the search keys digital (step S102).

On the server 1 side, after executing the search to obtain a list of unhit in the OR search (step S103), a shortcut for the unhit document is created (step S10).
4) The shortcut of the unhit document is transmitted to the client 2 side (step S105).

On the client 2 side, the main storage medium 19,
Here, the shortcut of the unhit document is copied to the HDD (step S106), and the unhit document list is updated (step S107).

Specifically, when a plurality of searches are performed as shown in FIG. 7, documents that do not match any search result are displayed in the “unhit document” folder. Therefore, as shown in FIG. 7, when a search is performed with “RI company” and “contract”, this information is not information that is needed immediately at the time of search, so more processing than necessary is performed at the time of search, resulting in The operation becomes slow. In addition, when the "RI company" is searched and then the "contract" is searched without referring to the unhit document, it means that unnecessary update is performed.

Therefore, the update is not performed when the search is made for "RI company" or the "contract", and the shortcut update processing is performed and displayed when the unhit document is clicked.

In addition, each part not particularly explained is the same as the above-mentioned first part.
Is configured and functions in the same manner as the embodiment of FIG.

According to the sixth embodiment, since the update is performed dynamically, not only the labor for the operator to perform the update operation is saved, but also the delay of the update process is delayed, so that the server / client does not have an unnecessary load. Can be reduced and the operation can be made lighter.

[0072]

As described above, according to the present invention, since the result list that does not correspond to the obtained search result is displayed for the parent node, one or more same layers obtained for the parent node are displayed. Since the result list that does not correspond to the search key is displayed, the functionality of classification can be expanded, and the operator can be provided with a document management apparatus that can perform efficient narrowed search.

Further, according to the present invention, when the number of search keys in the same layer increases or decreases, the obtained result list that does not correspond to one or more search keys in the same layer is dynamically updated. An excellent document management device and document management program can be provided.

Further, according to the present invention, since the file is exported to a file designated by the operator and imported into another system, it is possible to provide a document management program capable of reproducing the same search system in a plurality of clients.

Further, according to the present invention, the information of the document list corresponding to the displayed tree structure and nodes is saved and restored on the server side, so that the operator can be provided with a work environment independent of the client. It is possible to provide various document management programs.

[Brief description of drawings]

FIG. 1 is a block diagram showing an example of a document management system in which a document management DB server and a client are connected.

FIG. 2 is a block diagram showing an internal structure of a server and a client device.

FIG. 3 is a flowchart showing a processing procedure in the first embodiment.

FIG. 4 is a diagram showing an example of a display screen (search initial screen) in the first, fourth, and fifth embodiments.

FIG. 5 is a display screen (search screen) according to the first embodiment.
It is a figure which shows the other example of.

FIG. 6 is a flowchart showing a processing procedure in the second embodiment.

FIG. 7 is a diagram showing an example of a display screen (non-hit document search screen) in the second and sixth embodiments.

FIG. 8 is a flowchart showing a processing procedure in the third embodiment.

FIG. 9 is a flowchart showing a processing procedure in the fourth embodiment.

FIG. 10 is a diagram showing an example of a display screen (file save screen) in the fourth embodiment.

FIG. 11 is a flowchart showing a processing procedure in the fifth embodiment.

FIG. 12 is a flowchart showing a processing procedure in the sixth embodiment.

FIG. 13 is a diagram showing a tree hierarchical structure of document management software that has been conventionally implemented.

[Explanation of symbols]

1 server 11 Control unit 12 memories 13 Input control section 14 Main memory controller 15 Display control unit 16 Network control unit 17 keyboard 18 mice 19 Main storage medium 20 display 2 clients 3 network

Claims (6)

[Claims] 1. A document management device for managing a document stored in a storage device, comprising means for an operator to specify a search key, and means for searching a document from the storage device based on the specified search key. , Obtaining a list of search results, displaying the search key as a tree node, creating a shortcut for the search result document, and displaying the search result list corresponding to the selected tree node To display the tree hierarchically, to scan the search key of the parent node of the selected node to the root, to store the created search key by associating it with the created tree. A document management device, comprising: a means for storing a document list corresponding to each node. 2. The document management apparatus according to claim 1, further comprising means for searching a search key that does not correspond to the specified one or more search keys in the same hierarchy. 3. The document management apparatus according to claim 2, further comprising means for updating the search result when the number of search keys in the same hierarchy increases or decreases. 4. A document management program for managing a document downloaded to an information processing device and stored in a storage device, wherein a document search procedure based on a specified search key and a list of search results are displayed. How to get, display the search key as a node of the tree, create a shortcut for the document of the search result, display the search result list corresponding to the node of the selected tree, and hierarchical tree To display the tree, to scan the search key of the parent node of the selected node to the root, to store the created search key in association with the tree, the structure of the displayed tree, and the document list corresponding to each node. Of saving the information of the file with the file name specified by the operator, and the file saved with the file name specified by the operator A document management program in which a tree structure and a procedure for restoring a document list corresponding to each node are written and downloaded to an information processing apparatus and the management is executed based on each of the procedures. . 5. A document management program for managing a document stored in a storage device, a procedure for searching a document based on a designated search key, a procedure for obtaining a list of search results, and a search key. As a tree node, creating search result document shortcuts, displaying the search result list corresponding to the selected tree node, displaying the tree hierarchically, and selecting The procedure of scanning the search key of the parent node of the node to the root, the procedure of storing the created search key in association with the created tree, and the procedure of sending the configuration of the displayed tree and the document list information corresponding to each node to the server. And the procedure for saving the sent information in a file on the server side, and the tree structure and each node based on the saved file. A step of restoring the document list corresponding to de, is written, a document management program and executes the management on the basis the downloaded to the information processing apparatus in each step. 6. A document management program for managing documents stored in a storage device, a procedure for classifying documents based on a designated search key, a procedure for obtaining a list of search results, and a search key. To display as a tree node, to create shortcuts for search result documents, to display the search result list corresponding to the selected tree node, to display the tree hierarchically, Specify the search key of the parent node of the selected node up to the root, store the created search key in association with the tree, save the displayed tree structure and the document list corresponding to each node, specify The search procedure for searching for a search key that does not correspond to the one or more search keys in the same hierarchy and the search result when the search keys in the same hierarchy increase or decrease. A procedure for storing a flag for determining whether to update or not, and a procedure for updating the search result according to the flag are written, downloaded to the information processing device, and the management is executed based on each procedure. A document management program characterized by: