JP2002082965A - Document retrieval method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a function for enabling a user to manage a document by using an arbitrarily preparable information node, and to link the document to the information node, and to freely search user's intended document. SOLUTION: Information nodes being classification view are hierarchically constituted 600, and linked to documents. Then, the information node is selected from the hierarchy of the information nodes, and the document is narrowed down so that the information necessary for a user can be freely searched. Also, it is possible to start an AP according to data managed by the information node for the searched document, and to execute attribute retrieval or full sentence retrieval.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a document management system for managing documents using a computer, and more particularly, to managing documents managed by the computer irrespective of the management system of the file system of the computer.・ Related to a document management method suitable for classification.

[0002]

2. Description of the Related Art At present, companies create and manage documents using application programs such as word processing software and spreadsheet software on personal computers and workstations.

Conventionally, on these computers, documents are managed in the form of data files on the file system using a file system which is a subsystem of an OS (operating system). For example, in the Microsoft Windows operating system (product name: Microsoft Corporation, USA), it is possible to manage documents using a control file called a directory on a hierarchical file system that hierarchically manages data files. Documents are hierarchically managed using this directory. At this time, when a document is composed of a plurality of data files such as a text data file and a format data file, as a technique for associating the document with the data file,
Store multiple data files in the directory by associating the format of the file name (document name is the base name of the data file and extension is assigned to each data file type) and directory name corresponds to the document name The technique of making it do is used.

As a technique for associating a document with an application program, for example, Microsoft Windows has a file manager which is a program for managing a file system, and uses an extension part of a data file name. When a start of an application program is instructed for a data file, the corresponding application program is searched for from the extension of the data file, and the data file can be started as data. ing.

[0005] As another technique, Macintosh (trade name: Apple Computer Co., USA) uses a technique of storing information of an application program in each data file.

Further, as a technique for classifying and browsing documents, there is a technique for classifying documents by directories using a hierarchical file system. For example, by giving a directory a name corresponding to the classification, and by arranging the directory and data files hierarchically in a tree structure, the user can freely construct a classification system and determine what documents exist in the directory. By following, it is possible to browse. At this time, as a technique for classifying one document from directories in different hierarchies, the above-described Macintosh uses a function called a file alias to change a special control file that refers to another data file. There is a technique for creating a plurality of classifications by placing them in directories in different hierarchies.

[0007]

In the prior art, the OS
Since the document is managed using the file system of the above, there is a case where sufficient management cannot be performed due to the restriction of the OS.

First, when a document is composed of a plurality of data files, the association between the document and the data file group must be managed by the user himself using the file name. In some cases, for example, when the user wants to copy, he or she sometimes forgets to copy a part of the data file. Also, when associating with an application program, a data file name is used or information is stored in each data file, so if you want to change the corresponding application program,
I had to change the data file name and recreate the data file.

Second, since the documents are classified using the hierarchical directory of the file system, the performance may be degraded if the names of the documents are restricted by the file system or the classification hierarchy is deepened. Also, when it is desired to provide a class with special information, for example, when the class is created by the creator of the document, it is necessary to make the creator name correspond to the directory, and other information such as the creator's address is newly added. I had to create and store a data file separate from the directory control file.

Third, since a hierarchy of document classifications is created in a directory hierarchy system of the file system, it is possible to browse documents by following individual classifications.
No consideration was given to browsing by combining multiple classifications.

The present invention has been made in view of the above circumstances, and a first object of the present invention is to provide a document management method for facilitating the association between a document and a data file or the application program. That is.

A second object of the present invention is to provide a document management method in which the classification of documents is not restricted by the restrictions of the file system.

A third object is to provide a document management method which facilitates browsing of a document by combining a plurality of classifications.

[0014]

A first object of the present invention is to provide an information node corresponding to the type of a document in order to manage the document, so that the document belongs to the information node corresponding to the type. Further, this information node stores information on the configuration of the data file of the document to which it belongs and information on the corresponding application program. For documents, document information, which is the data that stores the data file names and locations of the documents, is provided, and these document information is linked from an information node indicating the type of the document. Achieved.

A second object is to arrange the information nodes hierarchically irrespective of the directory hierarchy, and to store a set of lower information nodes and a set of document information in each information node. Further, this is achieved by allowing a user to store arbitrary information in the information node.

The third object is achieved by providing a plurality of information node hierarchies and performing a logical product or logical sum operation on a set of document information belonging to the information node when browsing a document.

[0017]

A document stores configuration information of the document and information on an application program in an information node to which the document belongs. By referring to the information node to which the document belongs, batch processing of a plurality of data files and connection with an application program are performed. Cooperation is possible. Further, even if the configuration of the data file or the application program is changed, it is sufficient to change the corresponding information of one information node, and it is not necessary to change individual documents.

Since the information nodes store information on a set of lower-level information nodes and a set of documents, the classification can be configured irrespective of the limitation of the hierarchical directory. Further, since the user can set arbitrary information in the information node, related information can be stored separately from the classification name.

Since a document can be managed in a plurality of categories by using a hierarchy of a plurality of information nodes, a document belonging to an information node of a certain category can be recursively included, including a document included in a lower information node. , A set of documents is created, and the set of created documents is combined with a set of documents created by other classifications.
By creating a new set of documents by performing a logical sum or a logical product operation, it is possible to freely browse a document in which a plurality of classifications are combined.

[0020]

FIG. 1 shows the basic configuration of this embodiment.

An input / output device with the user includes a pointing device 101 such as a mouse, a display device 102, and a keyboard 103, and accesses the main storage device 105 through the CPU 104. The main storage device 105 includes a document management program 106. The document management program 106 includes a data display unit 107 for displaying data, a data control unit 108 for controlling data in response to a request from a user,
A document information management unit 109 for managing documents, an information node management unit 110 for controlling information nodes, and a data operation management table 111 for editing documents are included. The database 112 includes a document information storage unit 113 for storing documents,
It has an information node storage unit 114 for storing information nodes.

FIG. 2 shows the relationship between information nodes in the information node storage unit 114 and documents in the document information storage unit 113 in this embodiment. The information node roughly has three types of views: a company 201, a product 202, and a document class 203. Information node and each document have ID for identification
Is attached.

The view of the company 201 is a company A 2
11, B company 212, and C company 213. The lower node of the company B 212 has a B1 section 221 and a B2 section 222. The lower nodes of the B1 section 221 have a first G231, a second G232, and a document 5 (245). This document 5 (245)
It is directly related to section 221. Document 1 (241), document 2 (242), document 4 (24
4) is associated. In addition, document 2 (242) and document 3 (243) are associated with the second G232.

The view of the product 202 is the OS2
14 and AP215. AP215 is product X223,
The document 4 (244) is associated with the node of the product Y224. Product X223 includes Document 2 (242) and Document 5
(245), Document 3 (243) is associated with product Y.

The view of the document class 203 is the specification 251
And the minutes 252. Specification 251 is document 1 (24
1), document 2 (242), and document 3 (243) are associated with each other. The minutes 252 are document 4 (244), document 5
(245) is associated therewith.

By using information nodes in this way, one document (for example, document 3 (243)) can be classified into a plurality of categories (company B, B) regardless of the structure of the OS file system.
It can be managed in the first section, 2G, AP product Y).

FIG. 3 shows the configuration of an information node used when classifying documents. The information node can be created when the user arbitrarily classifies the document in addition to the document class, and can be linked to the document. Document browsing is possible based on the created information nodes. The information node 300 is created by the user, and shows an example of the B1 section 221 in FIG. The information node 300 includes data such as an ID, a node creator, and a node creation date. The node link 301 stores the number of nodes linked downward and their IDs. The document link 302 stores the number of documents associated with the node and its ID. User attribute information 30
Reference numeral 3 denotes arbitrary information given by the user, and information such as an address can be stored in the node (company organization), for example.

FIG. 4 shows the structure of document information for managing documents. This document information shows an example of the document 1 (241). The affiliation information node ID 405 stores the node of the document class to which the affiliation belongs. Since the document 1 (241) is associated with the specification 251, the ID of the specification 251 is
Is stored. The document information 400 is I
D, a document name, a document owner, an update date, a document size, a position where the document is stored, the number of configuration files, and the like are stored. In the information location type 403, in the case of direct access possible 404, a file name 410 used by a plurality of computers is stored, the affiliation information node ID 405 is traced, an AP of a document class to which this document belongs is acquired, and the AP is started. It is possible. When direct access is not possible, for example, information indicating the position of a document shelf in which a document is stored is stored, and there is an effect that it is possible to manage a document which is not digitized in the computer. The user information link 411 is
This is the same as the user information link 303 in FIG.

FIG. 6 shows the structure of a document class information node. This example shows an example in which the document class is the specification 251. Each document belongs to a document class information node indicating the type of the document. The document class information node 600 has an attribute including an attribute name 601 and an attribute value 630. The attribute 601 of the information node includes an ID 602, a node name 603,
It has a node creator 604, a node creation date 605, a node link 606, a document link 607, a user attribute number 608, a user attribute link 609, an AP name 610, a file configuration number 611, and a file link 612. The node link 606 has information 640 of a lower information node linked to the information node. In the specification document 251, the number of link destination nodes is 0 because there are no lower nodes. The document link 607 has information 641 of the document to which the information node is linked.

The AP name 610 stores an AP name used when updating a document. Here, it is shown that an AP named “word processor A” is used. The user attribute link 609 is arbitrarily set by the user in the same manner as 303 in FIG. The file link 612 includes a file type 643 of a document to which the attribute belongs.
Having. As described above, since the information node 600 has the AP name, it has information on the AP that created the document. Therefore, when it is desired to edit a document belonging to the information node, the application can be started, and there is an effect that the user does not need to be aware of the application of the document registered at the time of updating. The AP name may be changed by changing this information. Further, since the structure of the file related to the AP can be retained, the file can be copied at a time when the document is copied.

The browsing examples of the condition search type (FIGS. 7 to 19) and the narrow search type (FIGS. 20 to 28) will be described below with reference to screen diagrams and PADs. First, conditional search browsing will be described.

FIG. 7 shows an initial screen of a condition search type. FIG.
The first condition search type browsing program 2900 is executed, and is in a state of waiting for user input (step 2901). The view 700 is selected (Step 2902), and "Company" is selected from the pull-down menu. Then Figure 8
As shown in, "Company" is displayed in the view 700,
The hierarchy 1001 of the information node is displayed (step 2910). At this time, the current top node ID 502 in FIG.
Is stored as the ID of the company 201. Next, node hierarchy 1
When the first G1002 is selected from 001 (step 2093), the current node operation ID 501 is incremented, and the current top node ID (ID = 1) and the selected node ID (ID = ID) are added to the operation table 504 of the current node operation ID.
20) is stored (step 2912). Also, when another information node is subsequently selected, the current node operation ID 501 is similarly incremented, and the current top node ID and the selected node ID are stored in the operation table 504 of the current node operation ID (step S1). 2912). Next, "Open document list" is selected from the pull-down menu (not shown) of the file (F) in FIG. 8 (step 2).
905). Then, the condition search type display program is executed (step 2914), and as a result of the processing of the condition search type display program described below, the document list 1202 includes the document 1 (1203) and the document 2 (120) as shown in FIG.
4) Document 4 (1205) is displayed.

The condition retrieval type display program 2914 shown in FIG. 22 executes the document acquisition processing for the number of storages 3001 stored in the node operation table 504, and acquires the document linked to the node ID (step 300
2) If there is a lower node in the node ID (step 3003), a document linked to all lower nodes is obtained (step 3004). The acquired documents are OR-merged to create a document list 505, which is stored in the node operation table 504 (step 300).
5). If the user has selected a plurality of information nodes, the node operation table 504 stores a plurality of node IDs, so that the document acquisition process is executed for all the nodes stored in the node operation table 504. I do. After this process is completed, a logical operation by the user is performed for each top node ID, and one document list is created. This is executed when the user has selected a plurality of views.

That is, the number of storages in the node operation table is repeated (step 3006), and the set management table 50
6 (step 3008).
If the same top node exists, the document list 505 of the node operation table 504 and the set management table 50
The document list 507 of No. 6 is subjected to a user-specified logical sum or logical product operation stored in the document logical operation mode 503, the documents are merged, and the document list 507 is updated (step 3010). Also, the same top node I
If there is no D, the top node ID of the node operation table 504 and the document list 505 are added to the set management table 506.
(Step 3009). As described above, when the logical operation for each top node ID is completed, the process is repeated for the number of storages in the set management table (step 3011), and the document list of each top node ID is logically operated (step 3).
012), and is displayed in the document list 1201 (step 30).
13).

In the above example, the node operation table 504
Is stored, and the document to which the node ID = 20 is linked is acquired (step 3002). That is, document 1 (241), document 2 (242), and document 4 (244) are acquired. Next, it is determined whether or not this node ID has a lower node (step 3003).
The acquired document is stored in the document set merge of the node operation table 504 (step 3005). Next, since nothing is stored in the set management table 506, the top node ID of the node operation table 504 is not equal to the top node ID of the set management table 506 (step 3008), and the node operation table is added to the set management table 506. A document list of the top node ID 504 and the node ID = 20 in the document set merge is stored. Therefore, the storage number of the set management table 506 is 1. Next, a logical product merge of the document list of each top node ID is executed, but since there is only one, the documents included in this document list are displayed in the document list (steps 3013 and 310).
1).

Next, as shown in FIG.
Select the first G1002 and the second G1003 from 1
When the logical product 1004 is selected as the logical operation mode, the above-described condition search type browsing program 2900 and condition search type display program 2914 are executed, and a document list of the result is created. Here, in order to select an information node in the same view, a logical AND operation is performed on the document list of the first G1002 and the document list of the second G1003, and as a result, as shown in FIG.
402) is displayed. When a logical sum is designated in the logical operation mode, as shown in FIG.
A document 1 (1502), a document 2 (1503), a document 3 (1504), and a document 4 (1505) are displayed on a screen 501.

In this example, information of two nodes is stored in the node operation table 504. The stored information is that node ID = 2 for top node ID = 1
Node ID = 21 for 0 and top node ID = 1. The document acquisition for each node is the same as in the above-described example, and the former document list includes document 1 (241) and document 2
(242) and document 4 (244), and the latter document list includes document 2 (242) and document 3 (243). The created document list is stored in the document set merge. Next, the process is repeated for the number of times stored in the node operation table 504. In the first repetition process, the set management table 506 is used.
Has nothing, so the top node ID that is equal to the first top node ID = 1 in the node operation table 504
Because there is no (step 3008), the same as the previous example,
The set management table 506 stores a document list for the top node ID = 1 and the node ID = 20 (step 3009). In the second repetition processing, the top node ID of the node operation table 504 becomes equal to the top node ID of the set management table 506 (step 3008). The document list of the management table 506 is calculated by the logical product specified by the user, and the calculated document list is set as the document list of the top node ID = 1 in the set management table 506.

The document list here is document 2 (242)
, And the storage number of the set management table 506 is 1. Next, the process is repeated as many times as the number stored in the collective management table 506 (step 3011). Since there is only one document, the document (document 2 (242)) included in the document list with the top node ID = 1 in the collective management table 506 is deleted. It is displayed on the document list (step 3013). If the user specifies a logical sum, document 1 (241), document 2 (242),
Document 3 (243) and document 4 (244) are displayed (step 3013).

FIG. 13 shows the second G1 from the view companies.
FIG. 13 is a diagram when a view is changed after selecting 003, in which a view 700 is changed to a product using a pull-down menu, and a node hierarchy 1005 is displayed.
Here, when the product X1006 is selected from the node hierarchy and the document list is opened, as a result, the document 2 (1902) is displayed in the document list 1901 as shown in FIG.

That is, here, the second G1003 document list for the view company is created, then the document list of the product X1006 for the view product is created, and both document lists are subjected to logical AND operation in the set management table 506. And the results are displayed. The values in FIG. 5 show the values when this example is executed. In this example, first, the second G232 of the view company 201 is selected. However, the same operation as in the above-described example is performed, and the node operation table 50 is selected.
4 stores the top node ID = 1 and the node ID = 21 (step 2912). Next product 20 of view
Since the second product X223 is selected, the top node ID = 2 and the node ID = 12 are stored in the second of the node operation table 504 (step 2912). Next, a document is obtained for each of these two node IDs (step 3002), a document list is created, and links are made to each document set merge (step 3005).

That is, in the document list here, the former includes document 2 (242) and document 3 (243), and the latter includes document 2 (242) and document 5 (245). Next, a group management table 506 is created from the node operation table 504.
Since D and the top node ID of the set management table 506 are not equal, the set management table 506 includes a document list of top node ID = 1 and node ID = 21 and a document list of top node ID = 2 and node ID = 12. Stored (steps 3006, 3007, 300
8, 3010). Next, the process is repeated for the number of times stored in the set management table 506 (step 3011), and each top node ID
AND operation of the document list linked to (step 30)
12), the documents (document 2 (2
42)) is displayed in the document list (step 3013).
That is, in this example, there is an effect that it is possible to narrow down documents by a simple browsing operation of displaying a document list by specifying a plurality of nodes.

Next, the narrow search type will be described with reference to FIGS. 15 to 20 and FIGS.

FIG. 15 shows an initial screen of the narrow search, in which the view list 2000 is displayed in advance, the narrow search browsing program 3200 is executed, and the user is waiting for an input (step 3201 in FIG. 24). . When the company 2101 is selected from the view list in FIG. 16 (step 3202), information nodes are displayed in the node list 2201. If the information node is already displayed (step 3210), the displayed information node is deleted (step 3211), and the information node for the view is displayed (if the document list is already created). (Add sign)
(Step 3212). At this time, the current top node I
The ID = 1 of the view node ID is stored in D502 (step 3213). Next, when the first G2202 of the information node is selected from the node list 2201 (step 320)
3) The current node operation ID 501 is incremented, and the current top node ID (ID = 1) and the selected node ID (ID = 20) are added to the operation table 504 of the current node operation ID.
Is stored (step 2912), and the first G is displayed in the history column 2203 (step 3215).

When another information node is subsequently selected, the current node operation ID 501 is similarly incremented, and the current top node ID and the selected node ID are stored in the operation table 504 of the current node operation ID. (Step 2912) The selected information node is displayed in the history column 2203 (Step 3215). Next, “Open 2602” is selected from “File 2601” in the menu of FIG. When "Open 2602" is selected (Step 320)
5) The narrowing-down search type display program 3217 is executed, and as a result of the processing of the narrowing-down type display program described below, the document 1 (2402), the document 2 (2402), and the document 4 ( 240
4) is displayed.

The narrowing-down search type display program 3217 shown in FIG. 25 executes document acquisition processing for the number of documents 3301 stored in the node operation table 504. For the narrowing-down search, a logical AND operation of the document list is executed each time the repetition is performed.

That is, the first time (step 3302), the document acquisition program is executed (step 3305), and the document linked to the node ID is acquired (step 340).
1) If there is a lower node in the node ID (step 3402), a document linked to all lower nodes is obtained (step 3403). The acquired documents are OR-merged to create a document list 505, which is stored in the node operation table 504 (step 340).
4). If the user has selected a plurality of information nodes, the second and subsequent repetitions are executed. If the second and subsequent times (step 3303), the document acquisition program 3305 is executed.
Is merged with the document list 505 created by the previous repetition processing, and the document list 5
05 is created and stored in the node operation table 504 (step 3306).

In the last repetition (step 330)
4) Execute the operation with reference to the designation of the logical operation mode for the last selected information node. The document logical operation mode 503 includes DEEP and SHALLOW.
The EP 3308 acquires a document linked to the selected information node and a document linked to all the lower nodes of the information node, and is the same as executing the document program 3305 here. SHALLOW3
307 obtains 3309 only the document linked to the selected information node. This DEEP or SHALL
The document list obtained by the OW and the document list 505 obtained by the previous repetition are logically merged, and the final document list 505 is obtained.
Is created and stored in the node operation table 504 (step 3310). After the final document list 505 is created, the documents included in the document list are displayed on the document list screen 2400.
(Step 3013).

In the above example, the node operation table 504
Store the top node ID = 1 and the node ID = 20, and the node operation table 504 stores one piece of information. Although there is only one in the table, the last loop is executed (step 3304), and the document acquisition program 3305 (D if the document logical operation mode is not specified,
In order to give EEP by default, the processing for DEEP is executed (step 3308), and node ID = 2
0 is obtained (step 340).
1) Since there is no lower node (step 3402), the acquired documents (document 1 (241), document 2 (242), document 4 (244)) are made into a document list and stored in the document set merge (step 3404). . Next, document 1 (241), document 2 (242), document 4 included in this document list
(244) is displayed on the document list screen (step 301).
3).

Next, after selecting the first G from the companies of the view (“1G” is displayed in the history column of FIG. 18), when the product 2503 is selected from the view list 2000, the product 2503 is displayed. Information node is node list 220
1 is displayed. The AP 2505 is selected from this information node, and the AP is displayed in the history column 2203. Next, when the logical operation mode is switched to SHALLOW 2603 and “Open 2602” in the “File 2601” menu is selected, the above-mentioned narrow search browsing program 32
As a result, the document 4 (2702) is displayed in the document list 2701 as shown in FIG. When the logical operation mode is DEEP, document 2 (2802) and document 4 (2803) are displayed in the document list 2801 as shown in FIG. In this example, the node operation table 50
4 stores a top node ID = 1, a node ID = 20, a top node ID = 2, and a node ID = 9, and the node operation table (504) stores two pieces of information.

Next, the first loop is executed (step 3302), and the document acquisition program 3305 is executed.
Document 1 (241) and document 2 (24) with node ID = 20
2) The document list including the document 4 (244) is stored in the document set merge. Subsequently, the last loop is executed (step 3304), and the document logical operation mode 503 is SHALLOW specified by the user (step 330).
7), document 4 (2) directly linked to node ID = 9
44) and a document list is created (step 3).
309), perform a logical product merge with the document list created in the previous loop to create a document list, and store this document list in the document set merge with node ID = 9 (step 33).
10). The documents (Document 4 (24
4)) is displayed on the document list screen (step 301).
3).

When the user designation is DEEP (step 3308), the document acquisition program 3305 causes the document 4 (244) linked to the node ID = 9.
(Step 3401) and documents (document 2 (242) and document 5 (245)) linked to all the lower nodes of the node ID (steps 3402 and 340).
3) A logical sum of the acquired documents is merged to create a document list (step 3404). Therefore, the document list includes document 2 (242), document 4 (244), and document 5 (2
45) is included. This document list and the document list of the previous loop are logically merged, and the document list (document 2 (24
2) Document 4 (including 244) is created and stored in the document set merge with node ID = 9 (step 331).
0). The documents (document 2 (24
2) The document 4 (244) is displayed on the document list screen (step 3013).

That is, here, there is a SHALLOW designation for acquiring only the document linked to the information node, and there is no need to obtain a document set relating to the lower-level information nodes. Therefore, there is an effect that a document set with improved performance can be created. In addition, there is an effect that a detailed search for acquiring a document linked to an information node and a document linked to a lower node can be performed. In addition, at the time of narrowing down, nodes that have already been narrowed down and have no relation to them are displayed with a code added, so that there is an effect that unnecessary operations by the user can be prevented.

The above-described display of the document list is a process common to the condition search type and the narrow search type, and is represented by a “document list / document list screen display program 3013” shown in FIG. This program displays the documents included in the final document list in the document list list (step 3101). Also, from the menu of the document list or the document list screen, “AP start 1903, 2
804 "(step 3102), the assigned document node ID 4 based on the file 410 for the selected document.
05, the AP with the AP name 210 can be extracted and activated (step 3105). When “search 1904, 2805” is selected from the menu (step 3103), an attribute search or a full-text search can be performed on the documents displayed in the document list (step 3106). When "close" is selected from "file" in the menu (step 3104), this screen is closed (step 3107).

In addition, the document can be registered on the browser screen in both the condition search type and the narrow search type, and can be selected by selecting “document registration (S)” in “file 2601” (step). 2906, 3206), Document I
When D is entered (steps 2915 and 3218), the document IDs entered for all nodes in the operation table
Link In other words, the document can be registered in all necessary places by one operation, and the operation of searching and registering the storage location each time is not required, which has the effect of reducing user operations.

When a document is acquired by browsing, there is a function that each document has an access right and can be displayed only to a user who has been granted the access right. That is, each information node has a creator of the node with respect to the node name as shown in FIG. 2 and FIG. 6, and links the documents for which the access right is permitted to the document links 241 and 301. You cannot see documents that are not on the document link here. In other words, there is an effect that the publication or update of the document can be limited to only necessary users. Also, when a condition search is desired, a document set to be searched can be created by the processing as in the present embodiment, so that there is an effect that the search performance can be improved by narrowing down the conditions in advance.

[0056]

According to the present invention, a user can manage a document from a freely categorized viewpoint (view) that exceeds the functions of directories and folders provided by the OS. Since an information node can be created according to the type of document, a plurality of files and applications can be easily associated with the document. By creating a plurality of views and selecting an information node constituting the view, it is possible to quickly find a document required by the user. Even in the system, it is possible to extract a document according to the needs of the user by managing the association between the information node and the document without requiring the management of directories and folders. Further, the user can easily narrow down documents by selecting an information node based on the node hierarchy of the information node displayed on the screen. In addition to selecting information nodes and narrowing down documents, for information nodes, only directly linked documents are extracted, or in addition to directly linked documents, all documents of lower information nodes are extracted. An operation that improves the document extraction performance and an operation that reduces the number of operations can be selected. When an information node across views is selected, a logical operation is performed in the system, thereby simplifying user operations and automatically narrowing down documents.

[Brief description of the drawings]

FIG. 1 is a diagram of a basic configuration according to an embodiment of the present invention.

FIG. 2 is a diagram showing a relationship among views, information nodes, and documents used in the embodiment of the present invention.

FIG. 3 is a diagram showing a table configuration for managing attribute data of an information node.

FIG. 4 is a diagram showing a table configuration for managing data of document information.

FIG. 5 is a diagram showing a work table used in the system when narrowing down documents.

FIG. 6 is a diagram showing a table configuration for managing attribute data of a document class information node.

FIG. 7 is a diagram showing an initial screen of a condition search type.

FIG. 8 is a diagram in which a condition search type information node is selected.

FIG. 9 is a diagram illustrating a list of documents for a selected information node of a condition search type.

FIG. 10 is a diagram in which a plurality of condition search type information nodes are selected.

FIG. 11 is a diagram showing a document list when a logical product is designated for a plurality of information nodes of a condition search type.

FIG. 12 is a diagram showing a document list when a logical sum is designated for a plurality of information nodes of a condition search type.

FIG. 13 is a diagram in which an information node for a view whose condition search type has been changed is selected.

FIG. 14 is a diagram showing a document list when an information node is selected for a plurality of views of a condition search type.

FIG. 15 is a view showing a view list on a refined search type initial screen.

FIG. 16 is a diagram in which a refined search type information node is selected.

FIG. 17 is a diagram showing a list of documents for a selected information node of a narrowed search type.

FIG. 18 is a diagram illustrating an operation of opening a document list by designating SHALLOW in a logical operation mode by selecting information nodes for a plurality of views of a narrow search type.

FIG. 19 is a diagram showing a document list when a narrow search type multiple view is specified.

FIG. 20 is a diagram showing a list of documents when a logical operation mode is set to DEEP for an information node of a narrow search type that specifies a plurality of views.

FIG. 21 is a diagram showing a condition search type browsing program.

FIG. 22 is a diagram showing a condition search type display program.

FIG. 23 is a diagram showing a program for displaying a document list of a condition search type and a narrow search type.

FIG. 24 is a diagram showing a refined search type browsing program.

FIG. 25 is a diagram showing a refined search type display program.

FIG. 26 is a diagram showing a narrow search type document acquisition program.

[Explanation of symbols]

109 Document Information Management Unit for Managing Document Information 110 Information Node Management Unit for Managing Information Nodes and Related to Documents 111 Data Operation Management Table Used to Narrow Documents 112 Database Having Document Information and Information Nodes 113 Documents Document information storage unit 114 for storing information 114 Information node storage unit for storing information of information nodes 200 Table for holding data of information nodes of document class 300 Table for holding data of information nodes 400 Table for holding data of document information 2900 Conditional search type browsing program showing algorithm of conditional search type browsing 2914 Conditional search type display program showing algorithm of conditional search type browsing document acquisition 3013 Conditional search type displaying document of result of conditional search type browsing Display program 3200 Refinement search-type browsing algorithm Refinement search-type browsing program 3217 Refinement search-type browsing document acquisition algorithm Refinement search-type display program 3305 Algorithm for acquiring documents linked to information nodes of refinement search-type browsing Document acquisition program shown

 ──────────────────────────────────────────────────の Continuing on the front page (72) Inventor Tetsu Wakayama 5030 Totsuka-cho, Totsuka-ku, Yokohama-shi, Kanagawa Prefecture Inside the Software Development Division of Hitachi, Ltd. Inside Hitachi Systems Development Laboratory (72) Inventor Tetsuya Hashimoto 1099 Ozenji Temple, Aso-ku, Kawasaki City, Kanagawa Prefecture Inside Hitachi Systems Development Laboratory (72) Inventor Keiji Kojima 1099 Ozenji Temple, Aso-ku, Kawasaki City, Kanagawa Prefecture Hitachi, Ltd. Inside the System Development Laboratory (72) Inventor Takayoshi Yamamoto 3-29 Kitahama, Chuo-ku, Osaka-shi, Osaka F-term in Hitachi Seibu Software Co., Ltd. 5B075 NK43 UU06

Claims (3)

[Claims] 1. A document search method in a document management system having node information hierarchically arranged for each classification, wherein the information node relates to information of a document directly related to the information node and information related to the information node. Information of another information node is added, and based on the designation of the classification, the information node of the designated classification is displayed in a hierarchical structure, and based on the designation of the displayed information node, the designated information is displayed. A document search method comprising: creating and displaying a set of logical sums from a document directly related to a node to a document related to another information node related to the specified information node. 2. A document search method in a document management system having node information hierarchically arranged for each classification, wherein the information node relates to information of a document directly related to the information node and information related to the information node. Information of another information node is added, the information node of the specified classification is displayed in a hierarchical structure based on the specification of the classification, and the specified information is specified based on the displayed specification of the information node. A first logical OR set is created from a document directly related to the node to a document related to another information node related to the specified information node, and based on the specification of another classification, The information nodes of the classified information are displayed in a hierarchical structure, and based on the displayed designation of the information nodes, the designated information nodes are extracted from documents directly related to the designated information nodes. Creating a second set of logical sums up to documents related to other information nodes related to the node, and calculating a logical product of the first set of logical sums and the second set of logical sums; A document search method characterized by displaying the calculation result. 3. A document search method in a document management system having node information hierarchically arranged for each classification, wherein the information node relates to information of a document directly related to the information node and information related to the information node. Information of another information node is added, the information node of the specified classification is displayed in a hierarchical structure based on the specification of the classification, and the specified information is specified based on the displayed specification of the information node. Creating a first OR set from a document directly related to the node to a document related to another information node related to the specified information node; Based on the designation of the information node, a second from a document directly related to the designated information node to a document related to another information node related to the designated information node. And generating a set of logical sums, and displaying a result of a logical product of the set of the first logical ring and the set of the second logical sum.