JPH0785102A - Document retrieving method - Google Patents

Abstract

PURPOSE:To facilitate a browsing of a lots of electronically processed documents. CONSTITUTION:Electronically processed documents as document objects are stored in a document database 120 and respective data such as an index of words, plural index classification classifying hierarchically the index, and corresponding information between the index and the document objects are stored in an index dictionary 140 respectively in a document management system. Index data are read out and an index hierarchy is displayed on an index display window on a display device 103, the user is able to be interactive with the system by means of a key board 101 and a pointing device 102. A document object with an index added thereto is retrieved based on the interactive information, the relevant document object or its document object information is displayed on the window, and the processing for displaying an updating an index, an index hierarchy, corresponding information between the index and the document object and the document object information is executed.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for retrieving a digitized document which is information in which a document including text or graphics is represented by a code processable by a computer.

[0002]

2. Description of the Related Art When user digitized documents are stored by using a directory hierarchy and those digitized documents are browsed, if the user forgets the document name and the directory name in which the digitized document is saved, he / she must It is difficult to obtain a desired electronic document even with a stored electronic document. In addition, when a directory hierarchy is used by multiple users, the document classification system (viewpoint for classifying documents) differs depending on the user. Therefore, desired electronic documents cannot be collectively obtained, and electronic documents owned by other users cannot be obtained. Finding documents across is not easy.

Therefore, for example, Japanese Patent Laid-Open No. 5-128815
As described in Japanese Patent Publication No. 7, a technique has been proposed in which a user specifies a node in a plurality of classification trees to search an electronic document. However, according to the above-mentioned search technique, since the nodes are designated and then they are collectively searched, it is not possible to obtain the digitized document in stages.

[0004]

As described above, the conventional document management method has a problem that it is difficult to browse (brows) a document in a directory hierarchy by a single user or a plurality of users.

It is an object of the present invention to provide a search method and a display method which allow a user to easily browse an electronic document stored in a hierarchy such as a directory.

[0006]

To achieve the above object, an index is added to a user-created electronic document by using an index dictionary having a plurality of index classifications in which indexes representing phrases are hierarchically classified. Then, the digitized document is registered in the document database, the index hierarchy is displayed on the screen, and the digitized document to which the index selected by the user browsing or the subordinate index is added is searched from the document database. , The retrieved electronic document is displayed on the screen.

[0007]

The method of managing the electronic document and the information associated with the electronic document of the present invention, and the principle and operation of these display methods will be described below. Hereinafter, the digitized document will be simply referred to as a document.

First, a method of managing a document and information associated with the document (hereinafter referred to as document information) according to the present invention will be described with reference to FIG. The document and its document information have entity (file) information for managing files in the memory and dictionary information for managing document contents and the like. The dictionary information is composed of indexes that represent words and phrases and index classification based on the hierarchical relationship between the indexes. It also stores and manages character strings such as directory names in the directory hierarchy in the index dictionary. One character string in the dictionary or a character string set having a character string and a synonym of the character string as an element is called an index. Therefore, not only one character string can be used as an index, but also a plurality of character strings such as "CPU" and "central processing unit" can be stored as one index. When a plurality of character strings are stored in one index, one of the character strings is used as the index name of the index. Indexes can have several types of hierarchical relationships between them.
The above hierarchical relationships are also stored and managed in the index dictionary (in memory). The hierarchical tree is called index classification.

Next, the overall structure and operation of a document management system using a document and its document information management method will be described, and the principle of the document information display method will be described. FIG. 1 is an example of a functional configuration diagram of a document management system. A user interacts with the system via a display device 103, a keyboard 101 and a pointing device 102 such as a mouse. This system registers a user's document in a shared document database, inputs / updates document information, searches for a document, and browses document information in response to a user's request. Each data of the entity information and the dictionary information is expressed in a text format, for example. These data are read into the main storage device 106 and converted into an internal data structure according to the type of data when the system is activated. Specifically, each data of the index, the hierarchical relationship of the index, and the correspondence information of the substantial file and the document is stored in the index dictionary 140.
The document information is read from the document database 120, respectively. The data expanded into the internal data structure is subjected to processing for displaying, updating, and searching a document or document information.

The interactive information with the user, that is, the input information from the keyboard and the pointing device is analyzed and its processing is executed. Correspondence information between the document information and the index information directory is acquired from the memory in response to a processing request from the user. In this specification, the shared document database 120 and the index dictionary 140 are provided in the document management server (see FIG. 2), but a separate dictionary management server may be provided.

Next, FIG. 34 shows an example of an interactive screen used in this system. This interactive screen is an index display window for displaying a hierarchical display of index classification and a document to which an index is added and its document information. The window is displayed on the multi-window according to a user's instruction. Further, the index registration window and the index edit window are displayed from the same window according to the user's instruction. The index display window can be selected by the user as to whether the same type of screen is redrawn on a single window or displayed on a plurality of windows.

The document retrieval process will be described below.
The document search process is executed by the document search program 240 (see FIG. 26).

Any one of the index and the sub-index selected in the first index classification currently displayed in the index display window and the index and the sub-index of the index classification different from the first index classification selected by the user Any of the above is added to the document, the document is searched from the document database 140 with reference to the index dictionary 120, and the document is displayed as a search result. The corresponding document (the icon thereof) is displayed in a predetermined display area on the screen. Similar to the search function with a single index classification, this operation can be performed continuously.

Further, at the time of search, the indexes in a plurality of index classifications can be designated by switching the display of the index classifications. In the index display window, indexes in a certain index classification are displayed hierarchically. It is also assumed that the highest index of another index classification is also displayed. When the user designates another index classification displayed in the same window, the indexes of the designated index classification are displayed hierarchically. Further, even when one index in one index classification is selected, the document search process can be executed.

Document retrieval can be realized as described above.

[0016]

【Example】

(System Configuration) The configuration of the device and the outline of the operation of the system will be described below with reference to the drawings. FIG. 1 is a system configuration diagram of a document management system according to an embodiment of the present invention. This system includes a CPU 105, a keyboard 101, a pointing device 102 such as a mouse, a display device 103, a main storage device 106, a document database 120, and an index dictionary 1.
It is composed of storage devices such as 40. Main storage device 106
The document search of this embodiment is executed by the multiple index search program 100 in the above.

As an application example of this system, a form as shown in FIG. 2 can be adopted via a network. For example, the document management server 210 and the client 260 are included. The document management server 210 includes a CPU 105, a main storage device 106, a shared document database 120, an index dictionary 140, and the like. Similarly to the server, the client 260 includes a CPU, a main storage device 261, a local document file group 265, a display device 103, a keyboard 101, and a pointing device 102 such as a mouse. A document is input to the document database 120, the document information is input, stored in an index dictionary, and the document is searched based on the document information. The local document file group 165 includes electronic documents created by the user,
Alternatively, electronic documents extracted from the shared document database are stored. It is assumed that the documents stored in the local document file group are classified using the directory hierarchy.

Substantial information, that is, document file information, is
A document composed of multiple files is managed as one document object. However, for simplification, one file is set for one document object in this specification.

The document created by the user is stored as a document object in the document database, the document information is stored in the index dictionary, and the contents of the document database and the index dictionary are read into the main storage device. The document object registered in the document database and the index registered in the index dictionary are displayed, and the user issues a processing request using the pointing device 102 such as the display device 103, the keyboard 101, and the mouse, and the document object A document object is searched using the index added to the index as a clue, and the search result is displayed on the display device. The index information is stored in a text file.

(Outline of Program) An outline of the document registration process, document object search process, and index edit process of this system will be described with reference to FIG. Data as above,
Specifically, the index table 500 holding the index and its synonym information, the index classification table 600 holding the highest index information of the index classification, the index hierarchy table 700 holding the hierarchical relationship of the indexes, and the directory information are held. A directory table 800, a correspondence information table 900 holding the correspondence information between the index and the directory, an additional index table 1000 holding information about the index added to the document object, and information about the document file registered as the document object. It is assumed that the document object table 1100 to be created is expanded in the memory.

(Initial screen) First, the user inputs a predetermined command or selects an icon with a pointing device to display the index display window 33.
00 (see FIG. 33) or 3400 (see FIG. 34) is displayed on the screen. In this state, each function is executed depending on the type of processing request input by the user.

(Outline of Document Registration Program) In the document registration program 230, a document file created by an application program or the like is stored in the document object table 1100 as a document object. At this time, the index hierarchy is displayed on the screen with reference to the index table 500, and the user selects an appropriate index for the document object, whereby the additional index table 1000 stores the index to be added to the document object. When the document file is stored in the directory, the directory table 800 and the association information table 900 are referred to, and the index associated with the directory in which the document file is stored is added to the document object. It can be displayed on the screen as a candidate.

(Outline of Document Retrieval Program) In the document retrieval program 240, the user selects a plurality of indexes displayed on the screen, and the index hierarchy table 700 is displayed.
Also, referring to the additional index table 1000, the document object registered by the document registration program 230 is searched from the document database, and the document object (icon thereof) is displayed on the screen as a search result. In this embodiment,
Search for a document object that has the index selected by the user or its subordinate index.

(Outline of Index Editing Program) In the index editing program 250, the index information, that is, the index table 500, the index classification table 600, and the index hierarchy table 7 are used.
00 and the association information between the directories, that is, the directory table 800 and the association information table 900
Edit and interactively.

(Details of Internal Data Structure) In order to generate display data such as a document object, the following information held in the memory is referred to.

The data structure of 1) document object 2) index 3) directory correspondence information will be described. Referring to FIG. 1, the information of the document object stored in the document database, the index information stored in the index dictionary, and the directory correspondence information are expanded in the main storage device. All of these data are managed by ID. However, in this specification, for simplification, the name may be used instead.

FIG. 3 shows an example of index classification in the index dictionary.
"Document type" 310, "Theme" 350, "Organization" 36
It is assumed that 0 is registered in the index dictionary as the highest index of index classification. For example, as a further lower index of the index “document type”, “specification” 320, “patent” 330,
“Laboratory” 340, “specification” 335, and “drawing” 336 are registered under the index “patent”.

On the other hand, an example of the directory hierarchy is shown in FIG. The directory “Project01” 423 is the highest-level directory (by user definition). Subordinate directories are "Hashimoto" 424 and "Yamazaki" 42
5, "Patent" 444 is registered. Below the directory “Hashimoto”, “Spec” 442, “Pa”
“Tent” 443 and “theme # 1” 426 and “theme # 2” 445 are respectively registered under the directory “Yamazaki”.

Here, the document file "concept retrieval method" 4
64 is a directory “patent” 444, document file “hierarchical structure display method” 466 is a subordinate directory “Patient” 466 of the directory “Hashimoto”, and document file “document management method” 467 is a subdirectory of the directory “Yamazaki” Each is registered in the "patent" 447 under the "theme # 2". That is, the document file “hierarchical structure display method” 466 is a patent-related document related to “Hashimoto”, and the document file “document management method” 467 is a patent-related document in which “Yamazaki” is “theme # 2” and has some relation. It can be inferred. On the other hand, the document file “concept search method” 464 is classified as “patent” 444 because there is no directory name that matches the content in the classification system of the directory “Project01”.

(Index Table, Index Classification Table, Index Hierarchy Table) The internal data structure of the index of FIG. 3 is shown in FIGS. First, in FIG. 5, the index table 500 stores an index ID, an index name, and synonyms of the index name. For example, the index ID of the index “document type” 310 in FIG. 3 is “# 0010” 510, and the character string “document type” is stored in the area of the index name. Also, the index "patent" 33
It can also be seen that the index ID of 0 is “# 0012” 512 and “Patient” is registered as a synonym thereof. Next, referring to FIG. 6, the index classification table 600 has an index classification ID and an index ID that is the highest index of the index classification.
To store. For example, the index classification ID “# 001” 601
“# 0010” 610 is stored as the index ID corresponding to. This indicates that the index “document type” 510 is the highest index of this index classification when referring to the index table 500 (FIG. 5). Similarly, the index classification ID “# 00
3 ”603 and“ # 004 ”604 are the highest-level indexes of the index classification are the index“ theme ”520 with the index ID“ # 0100 ”620 and the index“ organization ”530 with the index ID“ # 0400 ”630. is there. Next, referring to FIG. 7, the index hierarchy table 700 stores an index ID that is an upper index and an index ID group that is a lower index. For example, as a lower index of the index ID “# 0010” 710 corresponding to the index “document type”, the index ID “# 0011” corresponding to the index “specification” 511 (see FIG. 5) and the index “patent” 512 are associated. Index ID "# 0012", Index "Kenho" 515
The index ID “# 0015” and the like corresponding to are stored. As described above, the index name and the data of the index hierarchy are managed.

(Directory Table) FIG. 8 shows the internal data structure of the directory hierarchy shown in FIG. In the figure, the directory table 800 has a directory ID.
And store the directory name. For example, the directory “Patient” 842 has a directory ID “# 002
8 ".

(Association Information Table) Next, FIG. 9 shows an internal data structure of the association information between the index and the directory. In the figure, the association information table 900 stores an index ID and a directory ID group corresponding to the index. For example, if the index ID “# 0012” corresponding to the index “patent” 512 (see FIG. 5) is the directory ID
"# 0028", "# 0043", "# 0046",
“# 0047” is stored. 4 and 8, these are subordinate directories “patents” 428 and 828 of “theme # 1”, subordinate directories “Patient” 443 and 842 of “Hashimoto”, and “Project0”.
The index IDs correspond to the lower directories “patents” 444 and 844 of “1” and the lower directories “patent” 447 of “theme # 2”.

(Additional Index Table, Document Object Table) Next, examples of an internal data structure for associating an index with a document file are shown in FIGS. First, in FIG. 10, an index ID and a document object ID group to which an index is added are stored in the additional index table 1000. For example, the index ID “# 0012” (that is, the index “patent”)
Contains the document object IDs “# 02567”, “# 0
A document object such as "2566" is added.
Next, referring to FIG. 11, the document object table 110
A document object ID, a document object name, and a file ID are stored in 0. For example, the document object ID “# 02567” 1167 has a document object “document management method” and a file ID “# 0498”.
6 ”is stored. Referring to FIGS. 10 and 11, it can be seen that indexes “patent”, “theme # 2” and “Yamazaki” are added to the document object “document management method”. Although the index is associated with the document object in the present embodiment as an example, a method of storing the index ID group added to a certain document object as the information of the document object can be adopted.

Each process of document registration, document search, and index editing will be described below with reference to a display method, showing a specific example.

(1) Document Registration Program The document registration process is executed by the document registration program 230 (see FIG. 26). The user can store the document in the document database by moving the document in the dialogue screen to a predetermined window with the pointing device 102. The document name registered in the document database may or may not be the same as the actual document name (file name). If the same document name is already stored in the document database, a message is displayed and the user
You can choose to replace the existing document with a new document or rename the new document. Further, when registering a document, a plurality of indexes related to the document can be added. Select the corresponding menu item from the function list displayed on the screen to display the index registration window. The user can add the displayed indexes to the document by selecting them with a pointing device. Even if there is no suitable index, it can be selected after adding a new index. It is possible to add an index to an existing document.

When a user interface for registering a document in a directory of a directory hierarchy is used, the index associated with the directory in which the document is registered (as seen by the user) is referred to by referring to the association information between the directory and the index. By displaying as a candidate, an index can be added. The document objects thus accumulated are displayed in a predetermined window.

(Details of Document Registration Program) Registration of a document according to this embodiment will be described by taking an example of registering a document "document management method" in a local document file group as a document object.

Document registration program 230 (see FIG. 27)
First, avoid duplication of document names. In particular,
The document object table 1100 is referred to, and it is determined whether or not there is an object name that duplicates the document name to be registered. If there is no duplicate object name, the document name of the document to be registered is set as the object name (of the document object). Assuming that the document object “document management method” has already been registered, the object name is duplicated, and therefore it is determined whether the already registered document object is replaced with a new document. Assuming that the new document is not replaced, the processing request of the user is acquired and the input processing request is determined. When the registration cancellation request is acquired, the document registration process is forcibly terminated. When the name change request is acquired, the input is acquired from the user as the object name of the document "Document management method",
It is determined whether the input new document object name is appropriate. If the name is appropriate, the entered name is set as the object name.

Next, in order to narrow down the range of the index to be added to the document object, it is determined in step 2730 whether the document to be registered is in the highest directory of the directory hierarchy, that is, whether there is a directory name which is a clue to classify. . Step 27 if the directory containing the document is an intermediate or terminal directory
Proceed to 35. Here, "Document management method" is "Theme # 2"
Since it is in the lower directory “patent” 447 (see FIG. 4), the process advances to step 2735 to refer to the document object table 1100. Further in step 2737,
Get index information corresponding to a related directory.
Here, the directories related to the “document management method” are “Project01” 423, “Yamazaki” 425, “Theme # 2” 445, and “Patent” 447. From FIGS. 5, 8 and 9, the index associated with each directory is the directory “Project01” (directory ID “# 0023” 823) is the index “Project”.
t01 ”531 (index ID“ # 0401 ”931), directory“ Yamazaki ”(directory ID“ # 0025 ”)
825 is the index “Yamazaki” 533 (index ID “# 045
4 ”933) and the directory“ theme # 2 ”(directory ID“ # 0045 ”845) is the index“ theme # 2 ”.
522 (index ID “# 0102” 922), directory “patent” (directory ID “# 0047” 847)
Is the index “patent” 512 (index ID “# 0012” 91
2). Correspondence information registration window 7700
(See FIG. 77) is displayed on the screen. In the figure, among the indexes acquired in step 2737, “Yamazaki” and “Theme #
2 ”and“ patent ”and the indexes higher than the respective indexes are displayed, but“ Project 01 ”is not displayed. This is "Yamazaki" and "Project0
"1" is an index that belongs to the "organization" index classification, but "Yamazaki" is a lower index of "Project01", that is, "Yamazaki" is a more specific index in the "organization" index classification. Therefore, assuming that it is appropriate as an index to be added, only "Yamazaki" is displayed. As described above, in the present embodiment, when a plurality of indexes having a hierarchical relationship within the same index classification are listed as candidates for the index to be added to the document, only the lower index is displayed. Alternatively, a method of displaying all indexes that can be candidates can be adopted.

Next, in step 2750 (see FIG. 28), index data to be added to the document is generated. In step 2810, it is determined whether there is an object with the same name. Assuming that there is an object with the same name here, in step 2820, the index information added by the registered object to be replaced is acquired. Then, the processing request of the user is acquired, and in step 2830, the processing request input by the user is determined. If the already registered index is used, the process proceeds to step 2832, and the data of the already registered index and the index addition table 1200 are generated. The table has index 12
01, index classification 1202, upper index 1203, display flag 1204, index addition flag 1205, and the like. Here, after turning on the index addition flag of each index,
Proceed to step 2840. On the other hand, in the case of newly registering a document (adding an index), the process proceeds to step 2835, the index data is initialized, and then the process proceeds to step 2840.

Next, in step 2840, when the user's input information is acquired and the document registration request is acquired, step 2 is executed.
Return to 750 (see FIG. 27). If the input information is not a document registration request, the process advances to step 2845 to determine a processing request. When a request to add, in addition to the displayed index, an index corresponding to the character string input by the user as an index to be added to the same document is obtained, the process proceeds to step 2850, and it is determined whether there is data of the corresponding index. . If there is no data, the process proceeds to step 2855, the data of the corresponding index is generated, and then the process proceeds to step 2860. Then, in step 2860, the index addition flag of the index addition table is turned ON. If a request to delete the index designated by the user out of the indexes displayed in the window from the index to be added is obtained, the process proceeds to step 2865 and the index addition flag of the table is turned off. If the index edit request is acquired, the process moves to step 2670, and after editing the index, the consistency is checked in step 2875. The index edit will be described later.

Then, in step 2885, the index list to be added is displayed again based on the index addition flag of the index addition table, and then the process returns to step 2840 to acquire the input information of the user again. If the document registration request is acquired here, the process returns to step 2750 (see FIG. 27) to close the correspondence information registration window.

Next, at step 2770, the document is registered in the document database. If there is a registered document object with the same name, it is replaced with the new document to be registered and registered. If the object names do not overlap, register as a new document object.

At step 2780, the additional information is registered in the index dictionary. Assuming that there is a registered object with the same name, it is determined whether or not there is an index that is not added among the registered indexes. If there is an index that is not added, that document object is deleted from the document object information of the corresponding index in the additional index table 1000. Then, the index to be newly added is searched in the additional index table, and the document object to be replaced is added to the document object information of the index. If the appropriate index is not registered in the index dictionary, register the index (step 3860,
See FIG. 39). As described above, the method of storing the association information with the document object centered on the index is adopted, but the method of storing the document object centered on the index can also be adopted.

When the document registration is successful in this way, the icon of the document object is displayed at an appropriate position. The document registration can be executed as described above.

(2) Document Retrieval Program The retrieval of the document objects according to the present embodiment will be described by taking the case of retrieving the document objects related to the index “patent” and the index “Project01” as an example.

The index classification display method includes a single index classification display and a multiple index classification display. The single index classification display is a method of displaying an index hierarchy by switching screens, and the multiple index classification display is a method of displaying a plurality of index classifications on the same screen. Both utilize a view that browses the index hierarchy to perform the search for the desired document.

(Details of Document Retrieval Program) First, as a first document object retrieval process, a document object retrieval process by single index classification display will be described. First, in step 2905 (see FIG. 31), the index is displayed.
A specific display method will be described later. As shown in FIG. 34, it is assumed that the index display window 3400 is displayed on the screen. The window is the menu selection area 341.
0, route information display area 3420, index display area 343
0, index classification selection area 3440, document display area 3450
Etc. In the figure, in the index display area, among the index classifications of "document type", "document type" 3431, which is the highest index, and "specifications" 3432, "patents" 3433, " Research report ”34
34 and the like are displayed. The index "patent" is rectangle 3
It is surrounded by 435. This indicates that the user has just pointed to that index. Next, "document type" 3421 and "patent" 3422 are displayed in the route information display area. Also, the arrow (solid line) sandwiched between the two indexes 3
Reference numeral 425 indicates that the index “patent” is a subordinate index of the index “document type”. The index designated by the user in the index display area is displayed on the rightmost side of the same route information display area based on the index hierarchy. Next, in the document display area, a list of document objects (icons) to which the index selected in the index display area is added is displayed. In the figure, “information storage ...” 3451 and “hierarchical structure ...” 345
2. A document object to which an index “patent” is added, such as “idea sheet” 3454, is displayed. Next, in the index classification selection area, the highest index name of the index classification registered in the index dictionary is displayed. Then, the highest index name of the index classification displayed in the index display area at that time is highlighted. In the figure, the "document type" 34
41 is highlighted. When the user selects the (topmost) index in the same area with the pointing device, the index display area is switched to the hierarchy of index classification with the selected index as the topmost index. For example, assuming that the user selects the "organization" 3444 in the index classification selection area, the index display area is switched to the index classification "organization" as shown in FIG. In the figure, after the display is switched to the index classification of “organization”, the user further selects the index “Project01” 3532 with the pointing device. For example, the route information 3520 includes “organization” in addition to “document type” and “patent” displayed in FIG. 34.
"Organization" 3523 and "P", which are the highest indexes of the index classification of
project01 ”3524 is displayed. A switching symbol 3525 indicates that the user's viewpoint has been switched from the index “patent” to the “organization” index classification.

When the user selects an index in the index display area or the index classification selection area in this state, the multiple search flag is initialized and then the switching index table is initialized.

In step 2930, the lowest index is extracted from the route table for each index classification. In FIG. 34, the route information 3420 is composed only of index classifications of “document type”, so the lowest index of the index is the index “patent”. Further, in FIG. 35, since the route information 3520 is composed of the index classification of “document type” and the index classification of “organization”, the lowest index is the index “patent” and the index “Proj”.
ect01 ”.

Next, at step 2940, the switching index table 1700 (see FIG. 17) is generated. The switching index table includes the switching index extracted in step 2930, the index classification, the number of search results, and the like. Here, the switching index refers to the lowest index of the index classification that appears in the route information. Next, in step 2950, it is determined whether there are a plurality of switching index tables, that is, whether the index classification has been switched. If there are a plurality of switching index tables, the process advances to step 2955 to turn on the multiple search flag.

Next, in step 2960 (see FIG. 30), the indexed document object in the switch index table is searched. First, after turning on the search flag, in step 3020 the search result table is initialized. In step 3030, it is determined whether the search flag is OFF. If the flag is OFF, step 2960 (see FIG.
(Refer to). If the flag is ON, step 3040
Then, it is determined whether the list of the switching index table is NULL. If the list is NULL, step 3
Proceeding to 045, the search flag is turned off. List is N
If not, go to step 3050. In the same step, the additional index table 1000 is referred to, and the range of document objects to be searched, that is, the document object group to be searched is set. Before the search process is executed, all document objects are searched, and when the search process has already been executed for the same route, the document object group which is the latest search result is searched.

Next, in step 3055, the data of the switching index and its subordinate index and the document search table are generated. For example, when the switching index is “patent”, data of the index “patent” is first generated. Next, it is checked whether "patent" has a lower index. Referring to the index hierarchy table 700 (see FIG. 7), in this example, the “description” 335 (see FIG. 3).
Since "drawing" 336 and the like are subordinate indexes of "patent", data is also generated for these subordinate indexes. An example of the document search table is shown in FIG. In the document search table 1720, the switching index “patent” 1
721, followed by its subordinate index "Specification" 172
2, it can be seen that "idea" 1724 is stored. Next, the processing proceeds to step 3060, and the additional index table 1
000 (see FIG. 10) to search for a document object to which the switching index or its subordinate index is added.
For example, the index “patent” (index ID “# 0012” 103
It can be seen that the document object to which 0) is added is a “document management method” (object ID “# 02567”) or the like. When there is a document object to which the switching index or its subordinate index is added, an additional document table is generated, those document objects (object IDs thereof) are stored, and a pointer from the document search table is connected. The additional document table includes a search result ID, a document object (object ID of the document object), and the like.
For example, referring to FIG. 17, “patent” in the document search table
When the pointer 1726 from 1721 to the additional document table is traced, the document object added to the index “patent” is “document management method” 1731 (search result ID “000”).
0 ”) and 5 other cases are applicable. In addition, "patent" sub-index "idea" 1724 and "format" 1
Also for 725, while there is one document object to which the index is added, the "description" 1
Regarding 722 and “drawing” 1723, the pointer 1727 to the additional document table is NULL, indicating that there is no corresponding document object. When generating the additional document table, it is determined whether or not there is a duplicate document object among the document objects in the additional document table. If there is a duplicate, it is stored in the additional document table corresponding to the higher index. The existing document object.

Next, in step 3065, it is determined whether there is a corresponding document object. If there is a document object, the process proceeds to step 3070. If not, the process proceeds to step 3080, the search flag is turned off, the number of search results in the switching index table is set to 0, and the process returns to step 3030. In this example, since there are a total of 7 corresponding document objects, the search result number 1703 is set to “7”, and then the process proceeds to step 3070 to generate the search result table 1800. The search result table is a search result ID 1801, document object (object I
D) 1802, a narrowing-down flag 1803 and the like. In this example, "patent" is the first switch index, so
All the narrowing-down flags are set to "Matched" 1821 (see FIG. 18). After generating the table, the process returns to step 3030. Similarly, the search flag is OFF
Search for document objects until. In this example,
Since the search flag is not OFF, the process proceeds to step 3040. The switching index following "patent" is "Project01"
And therefore the list of switch index tables is NUL.
Since it is not L, the processing proceeds to step 3050 and the range of the document object to be searched is set. In this case, since the search result table 1800 has already been generated, the document object group stored in the table is the search target. Then, similar to "patent", the document search table 1
760 and additional document tables 1770, 1780, 17
90 is generated. Here, it is determined whether or not the document object stored in the search result table 1800 is stored in the additional document table. Change to. In this example, "Project01" or its subordinate index is not added to the document object "Format 1", so "Project"
It is not stored in any of the additional document tables related to ct01 ”1751. Therefore, the narrowing-down flag 1921 of “format 1” in the search result table 1900 (see FIG. 19) is changed. Also, the number of search results 1753 is set to "6". After the search result table is generated in this manner, the process returns to step 3030 (see FIG. 30) again.
Then, the process returns to step 2960 (see FIG. 29).

Next, at step 2970, the search result table 1900 is referred to, and it is determined whether or not there is a corresponding document object. If there is a document object, the process proceeds to step 2980 to display the search result. If not, that is, if the search result is 0, step 298.
Proceed to step 5 to display the message. In this example, since there is a corresponding document object, the process proceeds to step 2980, and the corresponding document object (icon thereof), that is, "document management method" is displayed in the document display area 3550.

Further, in FIG. 35, when the user selects the index "Yamazaki" 3537, the route information is updated first. Specifically, "Yamazaki" 1650 is stored in the corresponding portion of the route table 1600 (see FIG. 16), and the route information display area 3620 (see FIG. 36) is rewritten based on the table. Next, the switching index “P”, which is the upper index of “Yamazaki”
switching index table 1750 of “project01” (see FIG.
7)), refer to the additional document table 1790 for "Yamazaki", and of the narrowing-down flags of the search result table 1900 (see FIG. 19), the narrowing-down flag for the document object to which "Yamazaki" (or its subordinate index) is added. Only "M
to "attached". Otherwise a document object,
In this example, "hierarchical structure display method" and "concept search method"
The narrowing-down flags 2021 and 2022 are set to "-". By reusing the document search table and the additional document table that have already been generated in this manner, the document object search process can be efficiently performed. Then "patent"
And the search result table 2000 in the same manner as in the case of searching the document object related to “Project01”.
A document object (icon thereof) is displayed in the document display area 3650 based on the.

In this example, the method of displaying the index hierarchy in a tree format is adopted. However, as shown in FIG. 72, a document display area 7250 is added to the index display window (list format) (see FIG. 33), A method of searching the document object can also be adopted. As described above, the document objects can be searched by the single index classification display.

Next, as a second document object search process, a document object search process by multiple index classification display will be described. Similar to FIG. 36, FIG. 73 and FIG. 74 each show a window display example after executing the document object search function related to the indexes “patent” and “Yamazaki”. In the multiple index classification display, a method of displaying a plurality of index classification hierarchies as if they were a single index hierarchy (see FIG. 73), a method of simultaneously displaying a plurality of index classifications in a list format (see FIG. 74), etc. There are several display methods as shown in these figures.

For example, in FIG. 73, an index display window (index classification linked display format) 7300 is composed of a menu selection area 7310, a multiple index classification display area 7330, a document display area and the like. In the same figure, without displaying the index classification selection area of FIG. 36, in parallel with the lower index of “patent”,
The highest index of the index classification different from the index classification of “patent” such as “organization” 7332 is displayed. Further, by adopting a display method such that the indexes belonging to the same index classification are solid lines and the indexes belonging to different index classifications are connected by a dotted line 7335, a certain index, for example, a lower index of “patent” and another index classification It is possible to distinguish top-level concepts, for example indexes such as "organization".

For example, in FIG. 74, the index display window (multiple list format) has a menu selection area 7410,
The index selection area 7420 and the condition designation area 7440 are included. Further, the index selection area is composed of an index classification button 7421 and a lower index display area 7426 which indicate whether index classification is designated, and the condition specification area is composed of an AND condition button 7441 and an OR condition button 7442, respectively. In the index display window of FIGS. 36 and 73, the AND condition search of the document object added with the index selected by the user can be executed, but FIG. 74 provides a display method in which the OR condition search can also be executed. For example, in the same figure, if the user selects the "document type" 7421 and the "organization" 7424 displayed in the index selection area and then selects the AND condition button, step 2
40 (see FIG. 29) and the following processes are executed. On the other hand, OR
When the condition button is selected, the processing from step 240 onward is executed in the same manner, but with the range setting of the document object to be searched in step 3050 (see FIG. 30),
The search result table generation in step 3070 is executed by a method different from that when the AND condition button is selected. The range setting is that all the document objects are set as the range of the document objects to be searched, and the search result table generation is performed after the OR operation of the document objects stored in the additional document table is performed. The point is to store (the object ID of) the document object. In this way, the document objects can be searched by the multiple index classification display.

As described above, the document objects can be searched by various display methods such as the single index classification display and the multiple index classification display.

(2) -1 Index Display Processing The display of the index according to the present embodiment will be described by taking the case of displaying the index in the index classification of “document type” and “organization” as an example.

As shown in FIG. 33, it is assumed that the index display window 3300 is displayed on the screen. The window includes a menu selection area 3310, an index classification display area 3320, a lower index display area 3330, an index name input area 3340, and the like. In the figure, in the index classification display area, “document type” 3321, “event” 3322, “theme” 3323, “organization” 3324.
The top index of the index classification such as is displayed in a list format. Further, the index classification “document type” is enclosed by a rectangle 3325, and the lower index display area includes “specifications”, “patents”, “laboratory” and the like, which are lower than the highest index of the same index classification. Are displayed in list format.

FIG. 13 shows an internal data structure for displaying in the lower index display area. Index display table 1300
Is composed of an index to be displayed, an upper index thereof, a display flag, a lower display flag, and the like. For example, for the index “document type” 1310, there is no information on the upper index, indicating that the index is the highest index in the index classification. The display flag and the lower display flag are "display". These flags indicate that the index and its subordinate indexes are in the display state.

First, in step 3110 (see FIG. 31),
It is determined whether the designated index is in the index category being displayed. If the index is in index classification, step 31
If not, go to step 3150.

A case where the designated index is not included in the index categories in the display area will be described. For example, in FIG. 33, when the user selects the index classification “organization” 3324 with the pointing device, step 3150 (FIG.
2) and switch to the designated index classification. In step 3210, the index designated immediately before is added to the route table 1600 (see FIG. 16). For example, if the index "patent" was selected immediately before, "patent"
"Organization" is added from the highest index "document type" to the index "patent" of the index classification to which the belongs. Referring to the index display table, the route to the "patent", in this case,
"Document type" 1610 and "patent" 1611 are stored in the route table in this order. Further, the index "organization" 1612 is added. Next, in step 3220 (see FIG. 32), the display data and index display table of the corresponding index classification are generated, and then in step 3230, the display flag of each index is set. The display data of the index classification “organization” is shown in FIG. Then, in step 3240, the index display table 1
After redisplaying the window 7500 (see FIG. 75) based on 400, the process returns to step 3150 (see FIG. 31).

A case where the designated index is in the index classification will be described. In step 3115, the display flag in the index display table of the lower index is set. That is, it is determined whether or not the lower index is displayed. If the lower index is displayed, the display flag of the lower index is set to "non-display", and if it is not displayed, the display flag of the lower index is set to "
Then, the window is re-displayed based on the index display table in step 3130. That is, if the user designates an index in which the subordinate index is displayed, the subordinate index is hidden, and When the user designates an index for which a lower index is not displayed, the lower index is displayed, for example, in FIG.
If the index “Project01” 7531, which is lower than the index of “Project01” 7531, is selected in FIG.
After setting the lower display flag of 10 to "display" 1514, the index hierarchy table is referred to, and the lower index "Hashimoto" 152
0, "Yamazaki" 1530, etc. index display table 1500
Add to. Then, the window 7600 (see FIG. 76) is displayed again based on the table.

When a lower index display request for a certain index is acquired, the lower index can be efficiently displayed by setting the number of lower indexes to be displayed as default. Specifically, when all the lower indexes are hidden, the default number of lower indexes extracted from the index hierarchy table are additionally displayed in the lower index display area, and the hidden lower indexes are not displayed. A symbol or character string indicating that there is is displayed in the same area. In addition, the lower display flag in the index display table is changed to “undisplayed”, and the number of undisplayed lower indexes is stored in the corresponding location.
When a lower index display request is obtained again for the same index, the default number of lower indexes among the lower indexes that have not been displayed (if the number of lower indexes that have not been displayed is less than the number set by default) Displays all undisplayed lower indexes) in the same area, and updates the lower display flag and the number of undisplayed lower indexes in the index display table. Further, when a lower index display request is acquired for the same index, this processing is repeated. By displaying the lower index in the lower index display area in several stages with respect to an index having a large number of lower indexes in this manner, the time required to redisplay the window can be shortened.

Further, when an index having a lower display flag of "no lower" is designated, the lower index display function is not executed, so that the user's useless operation is omitted and the index hierarchy is efficiently browsed. be able to. The index can be displayed as described above.

(3) Index Editing Program Index editing processing is executed by the index editing program 250 (see FIG. 26). You can perform the following functions when editing the index.

1) New Creation of Index The character string designated by the user is registered in the index dictionary. Multiple character strings can be registered in one index. If necessary, it is possible to register the hierarchical relationship with another index already registered in the index dictionary.

2) Editing of synonyms Add / change (replace) / delete synonyms for the indexes registered in the index dictionary.

3) Change of Index Name Change the name of the index designated by the user.

4) New Creation of Index Classification This is a specialization of the new creation function of the index or the moving function of the index. That is, this is the case where the upper index is not specified when a new index is created, or the index classification and the upper index are not specified when the index is moved.

5) Editing the index hierarchy Add / delete index hierarchy, move index, delete index, integrate index.

6) Change of Correspondence Information When the directory hierarchy is used as the user interface, it is possible to change the correspondence information of the index and the directory. Specifically, the association information between the directory designated by the user and the index in the index dictionary is added / changed / deleted. If the appropriate index is not registered in the index dictionary, the index edit function can be executed. When the user creates a new directory, the functions of changing the index-directory correspondence information can be executed. The same can be done when the user changes the directory hierarchy.

Various functions of index editing according to this embodiment will be described. First, the process proceeds to step 250 (see FIG. 37). Next, in step 3710, the input information of the user is acquired and the edit target is determined. Each editing function is executed according to the type of editing target acquired in the same step.

(3) -1 New Index Creation Process Regarding the new index creation process, the index “Project0
The case where the index "Sato" is created as a subordinate index of "1" will be described as an example. When the new index creation request is acquired in step 3710 (see FIG. 37), the process proceeds to step 3720 (see FIG. 38).

It is determined whether or not a window in which a new index can be created, for example, an index display window is displayed. When the window is displayed, the corresponding window is activated, and when it is not displayed, the index display window 7500 (see FIG. 75) is displayed. Next, the registration flag is initialized. Next, in step 3825, the input information of the user is acquired, and it is determined whether the input information is a request for ending index creation. When the index creation end request is acquired, the index display window is closed (or deactivated), and the new index creation process ends. If not, the process advances to step 3830 to determine whether the input information acquired in step 3825 is an index registration request. If the index registration request is acquired, the process proceeds to step 3850. If not, the process proceeds to step 3835. Assuming that the input information acquired in step 3825 is not the index registration request,
Proceeding to step 3835, for example, as shown in FIG.
Index name input area 6140 input from the keyboard while "Project01" is already selected
The user input information such as a character string (“Sato” 6141 in this case) is acquired. Here, the method of inputting the character string of the index name to be registered in the index name input area in the same window is adopted, but the method of separately displaying the window for entering the character string of the index to be registered on the screen is adopted. You can also

Next, proceeding to step 3840, the registration flag is set. Specifically, it is determined whether or not there is a registered index with the same name as the input character string "Sato". If there is no registered index, the registration flag is turned ON. Assuming that there is a registered index here, the processing request of the user is acquired after displaying the index of the same name. For example, "Project0
If "Sato" is registered in the lower index of "2",
Here, the index with the same name is displayed, and the higher-level index "Project02" and the index classification "Organization" are displayed. Based on the processing request thus obtained, it is determined whether or not to register as an index of a different meaning. When registering, the registration flag is turned ON, and when not registered, the registration flag is turned OFF. Here, since the index is displayed as a different meaning, the registration flag is turned on.

Next, it is determined whether the registration flag is ON. Assuming that the flag is ON, it is determined whether the total number of indexes is equal to the allowable range, that is, whether a new index can be created. When it is equal to the allowable range, the message is displayed after turning off the registration flag. Then, in step 3830, the user's input information is acquired again, and if the input information is an index registration request, step 3850
If not, the registration flag setting process is similarly performed. Here, it is assumed that the index registration request is acquired.

Next, in step 3850, it is determined whether the registration flag is ON. If the flag is ON, the process proceeds to step 3855, but if the flag is OFF, the process returns to step 3825. If it is assumed that the flag is ON, the process proceeds to step 3855, and it is determined whether the input contents are appropriate. If the contents are appropriate, go to step 3860; otherwise, go to step 3860.
Proceed to 65 to display the message. Assuming that the contents are appropriate here, step 3860 (see FIG. 39)
Move to and register the index.

In step 3910, the index ID to be registered and the new index ID are extracted. Index table 500
The index ID is extracted by referring to (see FIG. 5) and searching for an invalid index ID (index ID for which information such as index name is not registered). Invalid index I in index table
Method of using the minimum value of D as a new index ID, effective index ID
There is also a method of setting a value next to the maximum value of (index ID in which information such as index name has already been registered) as a new index ID.
Next, in step 3920, index information such as the index name and synonyms is substituted into the corresponding portion of the index table based on the index ID thus extracted. In this example, "Sato" is stored as the index name, but since no synonym is input, it is set to the initial state.

Next, in step 3930, it is determined whether or not there is an index designated as the upper index. If there is a corresponding upper index, the process proceeds to step 3940, and the new index ID is added to the lower index information of the upper index in the index hierarchy table. In this example, since the index "Project01" is specified as the upper index, "Project01" (index ID) in the index hierarchy table (see FIG. 7) is specified.
The lower index information corresponding to “# 0401” 731) is searched, and a new index ID such as “# 05” is added to the lower index information.
41 ”is added.

Next, in step 3950, it is determined whether there is an index designated as a lower index. If there is a corresponding lower index, the process proceeds to step 3960, and the index I of the index designated as the lower index is added to the lower index information of the new index.
Add D. In this example, since the lower index is not designated, the process directly proceeds to step 3970. Next step 3
After updating the total number of indexes at 970, step 3860
Return to FIG. 38.

Next, proceeding to step 3870, it is determined whether index registration has succeeded. If registration is successful, the process proceeds to step 3875, but if registration is unsuccessful, step 382 is performed.
Return to 5. If it is assumed that the registration is successful, the process proceeds to step 3875, and the registered index, "Sato" in this example, is registered.
6241 (see FIG. 62) is displayed in the lower index display area. Then, after clearing the input area, the registration flag is initialized and the process returns to step 3825. This process is repeated until the index creation end request is obtained in the same step.
On the other hand, if the index creation end request is obtained in the same step, the index display window is closed (or deactivated).
Then, the new index creation process ends.

(3) -2 Synonym Editing Process The synonym editing process, specifically, the synonym deletion, synonym change (replacement) and synonym addition processes will be described. When the synonym edit request is acquired in step 3710 (see FIG. 37), the process proceeds to step 3730 (see FIG. 40).

It is determined whether or not the window in which the synonym of the designated index can be edited and the synonym edit window 6300 are displayed. If the same window is displayed, the corresponding window is activated, and if it is not displayed, the same window is displayed. The synonym edit window includes a synonym display area 6310, a synonym input area 6320, and function menu buttons 6330, 6340, 6350, 636.
0, 6370, etc. Although the function menu button is used in this embodiment, a pull-down menu can also be used. A check (check mark) 6315 is added to the synonyms that are the index names so that they can be distinguished. Next, in step 4020, the input information of the user is acquired, and it is determined whether the input information is a synonym editing end request. When the synonym edit end request is acquired, in this case, when the user selects “OK” 6330, the synonym edit window is closed and the synonym edit processing is ended. If not, the process advances to step 4030 to determine a detailed processing request for synonym editing. Acquires a synonym deletion request (in FIG. 63, the user selects “Delete”)
If 6360 is selected), the process advances to step 4035.
Obtain a synonym change request, that is, a synonym replacement request (see FIG. 6).
In 3), when the user selects “Substitute” 6350), the process proceeds to step 4050. If the synonym addition request is acquired (in FIG. 63, the user selects “Add” 6340), the process moves to step 4060.

(Details of Synonym Deletion Processing) When a synonym deletion request is acquired, the synonym “br” of the index “patent” is acquired.
The case of deleting "evet" will be described as an example. The user uses the pointing device to synonym “brevet” 6
It is assumed that 313 (see FIG. 63) is selected. In step 4035, it is determined whether or not a plurality of synonyms are registered. If more than one is registered, step 40
40, but if not, that is, if only one name is registered in the designated index, step 4
After proceeding to 045 and displaying the message, step 40
Proceed to 70. In this example, the synonyms of the index “patent” 6311 are “patent” 6312 and “brevet” 63.
Since it is 13, and therefore a plurality of synonyms are registered, the process moves to step 4040 (see FIG. 41). First, the table change flag and the delete flag are initialized.

Next, proceeding to step 4130, it is determined whether or not there is a directory associated with the index by referring to the association information table 900. If there is a corresponding directory in the table, step 4135
Otherwise, to step 4170.
Assuming that there is a corresponding directory, the process proceeds to step 4135, and among the directories extracted in step 4130, the synonym to be deleted, in this case "bre".
It is determined whether there is a directory with the same name as "vet". If there is a directory with the same name, a confirmation message is displayed, and in step 4165, the processing request is determined based on the user input information, and the deletion flag and the table change flag are set. When the corresponding table change request is acquired, the delete flag is turned ON and then the table change flag is turned ON. When the index change request is acquired, after turning on the delete flag, turn off the table change flag.
To When the cancellation request is acquired, the deletion flag is set to OF.
After setting to F, the table change flag is turned off.

Next, in step 4170, it is determined whether the deletion flag is ON. If the flag is ON, the process proceeds to step 4175, the index table 500 is referred to, the index that is the target of the synonym editing, in this case, “patent” 512, is identified, and then the synonym selected by the user is set to the synonym information. Remove from. Then after deleting the synonyms,
Returning to step 4040 (see FIG. 40).

(Details of Synonym Replacement Process) A case where a synonym replacement request is acquired will be described. It is assumed that the user has selected a synonym to be replaced with the pointing device and then entered a new synonym in the synonym input area. In this embodiment, the name input in the synonym input area is used as the synonym after replacement, but it is also possible to specify a new synonym name using the cut-and-paste function or the like. First, the table change flag and the replacement flag are initialized.

Then, in step 4225 (see FIG. 42),
The index table 500 is referred to, and it is determined whether or not there is an index having the same name as the name designated (input) as the synonym after replacement. If there is an index with the same name, the process proceeds to step 4230, but if not, step 4250.
Proceed to. Assuming that there is an index with the same name, step 4230 displays the corresponding index with the same name. Next, the processing request of the user is acquired, and in step 4245, it is determined based on the acquired processing request whether the name designated (input) as the synonym after replacement is registered as the index of the different meaning. Step 4 if you want to register as an index with a different meaning
If not, the process proceeds to step 4247, and the replacement flag is turned off.

Next, at step 4250, the replacement flag is set to O.
Determine if it is not FF. If the flag is not OFF, the process proceeds to step 4252. That is, the flag is OFF
In the case of, the process proceeds to step 4285. Here the flag is OF
If it is not F, the flow advances to step 4252 to refer to the inside of the association information table to determine whether or not there is a directory associated with the index subject to the synonym replacement process. If there is a corresponding directory, the process proceeds to step 4255, and it is determined whether or not there is a directory having the same name as either the synonym before replacement or the name of the synonym after replacement. If the corresponding directory exists, a confirmation message will be displayed.

Next, proceeding to step 4257, the processing request is judged based on the user input information, and the replacement flag and the table change flag are set. When the corresponding table change request is acquired, the replacement flag is turned ON, and then the table change flag is turned ON. If you get an index change request,
After turning on the replacement flag, set the table change flag to OF
Set to F. If a stop request is acquired, set the replacement flag to O.
After setting to FF, the table change flag is turned off.

Next, proceeding to step 4285, it is determined whether the replacement flag is ON. If the flag is ON, the flow advances to step 4290 to refer to the index table to identify the synonym editing target index, and then replace the synonym selected by the user with the replaced synonym. Then, after replacing the synonyms, step 4050 (see FIG. 40)
Return to.

(Details of Synonym Addition Processing) When a synonym addition request is acquired, the synonym “pa” is added to the index “patent”.
The case of adding "t" will be described as an example. It is assumed that the user has newly input a synonym character string in the synonym input area. In the present embodiment, similar to the synonym replacement process, the name input to the synonym input area is a synonym to be added, but a new synonym name can be specified by using a cut and paste function or the like. . First, the table change flag and the addition flag are initialized.

Next, in step 4325 (see FIG. 43), the index table 500 is referred to, and it is determined whether or not there is a name to be added as a synonym, in this case, an index having the same name as "pat". If there is a corresponding index, step 43
If not, proceed to step 4350. Assuming that there is a corresponding index, step 4330 displays the index with the same name. Next Step 43
In step 40, the processing request from the user is acquired, and step 4345 is performed.
Then, it is determined whether or not to register the synonym input as the synonymous index. When registering the synonym as an index of different meaning, the process proceeds to step 4350. On the other hand, if not, that is, if adding as a synonym, step 43.
Proceeding to 47, the additional flag is turned off.

Next, proceeding to step 4350, it is determined whether the additional flag is OFF. If the flag is not OFF, the process proceeds to step 4352. If not, that is, if the flag is OFF, the process proceeds to step 4385. Assuming that the addition flag is not OFF, it is determined in step 4352 whether or not there is a directory associated with the index that is the target of the synonym addition process by referring to the association information table. If there is a corresponding directory, the process proceeds to step 4355. Next, in step 4355, it is determined whether or not there is a directory having the same name as the name to be added as a synonym among the directories extracted in step 4352. If the corresponding directory exists, a confirmation message will be displayed.

Next, proceeding to step 4357, the processing request is judged based on the input information of the user. When the corresponding table change request is acquired, the addition flag is turned ON and then the table change flag is turned ON. When the index change request is acquired, the addition flag is turned ON and then the table change flag is turned OFF. If a cancellation request is acquired, turn off the addition flag and then turn off the table change flag.
To

Next, in step 4385, it is determined whether or not the additional flag is ON. If the flag is ON, the process proceeds to step 4390, the index table 500 (see FIG. 5) is referred to, the index (in this case, the index “patent” 512) that is the target of the synonym editing is identified, and then the synonym Add the name you want to add to the synonym information of the index. Then, after adding the synonyms, step 4060 (see FIG.
(Refer to).

Then, the process proceeds to step 4065, and it is determined whether the table change flag is ON. If the flag is ON, the process moves to step 3770 to change the association information. A method of changing the association information will be described later.

Next, in step 4070, it is determined whether the processing has succeeded. Step 40 if processing is successful
Proceed to 75 to redisplay the synonyms. Otherwise, it proceeds to step 4077 and displays a message. Then, the process returns to step 4020. The process is repeated until the synonym editing end request is acquired. On the other hand, when the synonym editing end request is acquired in the same step, the synonym editing window is closed and the synonym editing process is terminated.

(3) -3 Index Name Change Processing The index name change processing will be described. Step 3710
If the index name change request is acquired in (see FIG. 37), the process proceeds to step 3740 (see FIG. 44).

At step 4410, the number of synonyms registered in the designated index is determined. If the number of synonyms is one, the process proceeds to step 4050 and the synonyms are replaced. on the other hand,
If there are two or more synonyms, the process proceeds to step 4445.

First, the case where there is one synonym, that is, the case where the designated index has no alias will be described. It is determined whether a window in which a synonym of the specified index can be replaced or a synonym edit window is displayed. If the same window is displayed, the corresponding window is activated, and if it is not displayed, the same window is displayed. Then, the process proceeds to step 4050, and the synonyms are replaced. The synonym replacement method has already been described as one function of the synonym editing process, and thus the description thereof is omitted here. Next, proceeding to step 4418, it is determined whether the table change flag is ON. If the flag is ON, the association information is changed. A method of changing the association information will be described later.
Next, proceeding to step 4420, it is determined whether the synonym replacement process has succeeded. If the processing is successful, step 442
Go to 5 and redisplay the synonyms. Otherwise, it proceeds to step 4427 and displays a message. Then, the synonym edit window is closed, and the index name changing process when there is one synonym is finished.

Next, the case where there are two or more synonyms will be described. It is determined whether the window in which the index name of the designated index can be changed, the synonym edit window 6300, is displayed. If the same window is displayed, the corresponding window is activated, and if it is not displayed, the same window is displayed. Next, after the change flag is initialized, the process proceeds to step 4445, the user's input information is acquired, and it is determined whether or not the input information is an index name change end request. If it is assumed here that the user's input information is not the index name change end request, the synonyms are displayed in step 4450.

Next, the procedure proceeds to Step 4455, and Step 4
It is determined whether the input information acquired in 445 is an index name change request. In the case of an index name change request (for example, in FIG. 63, when the user double-clicks on a synonym that is not checked (marked) with the pointing device), the process proceeds to step 4465. If not, the process proceeds to step 4460. . Assuming that the input information is not an index name change request, the user input information is acquired, and it is determined whether the changed name input by the user is the same as the index name at that time. If the names are the same, the change flag is turned off and a message is displayed. If the names are different, the change flag is turned on.

Next, at step 4465, the change flag is set to O.
Determine if N. When the flag is ON, the index table 500 is referred to, the index ID that is the target of the index name change is extracted, and then the information of the index name of the corresponding index is changed. Specifically, the changed name is written in the storage area for the index name.

Then, in step 4480 (see FIG. 48),
It is determined whether the change process has been successful. If the processing is successful, the flow advances to step 4485 to redisplay the index name. Otherwise, it proceeds to step 4487 and displays a message. Then close the synonym edit window,
If there are two or more synonyms, the index name changing process ends.

(3) -4 New Creation Process of Index Classification A new creation process of index classification will be described. Step 3
When the new index classification creation request is acquired in 710 (see FIG. 37), the process proceeds to step 3760 (see FIG. 45).

It is determined whether or not a window capable of creating an index classification, for example, an index display window is displayed.
If the same window is displayed, the corresponding window is activated, and if it is not displayed, the same window is displayed. After initializing the classification creation flag, step 4525
Then, the input information of the user is acquired, and it is determined whether or not the input information is a request for ending index classification creation. When the request to end the index classification creation is acquired, the window is closed and the index classification new creation processing ends. Assuming that the input information is not a request to end the index classification creation, step 45.
In step 30, it is determined whether the input information acquired in step 4525 is an index classification creation request. Assuming that the input information is not the index classification creation request, step 45.
At 35, it is determined whether the registered index is the highest index of the index classification. If you want to use the highest index, set the classification creation flag. If not, that is, if the newly created index is the highest index of the index classification, step 45.
Proceed to 55.

First, the case where the registered index is the highest index of the index classification will be described. It is assumed that the user selects the index in the lower index display area and then selects the corresponding menu item in the menu selection area. By referring to the association information table 900 (see FIG. 9), it is determined whether the index designated by the user is already registered as the highest index. If not registered, the classification creation flag is turned on. Assuming that the index has already been registered as the highest index, the processing request is determined based on the input information of the user after displaying the confirmation message. When the index classification creation request is acquired, the classification creation flag is turned ON. on the other hand,
When the cancellation request is acquired, the classification creation flag is turned off. Next, it is determined whether the classification creation flag is ON. Assuming that the classification creation flag is ON,
It is determined whether the total number of index classifications is equal to the allowable range, that is, whether a new index classification can be created. If it is equal to the allowable range, the classification creation flag is turned off and then a message is displayed. In the present embodiment, a method of creating an index classification using a list format index display window is adopted, but a method of creating an index classification using a window having two index display areas as shown in FIG. 64 is adopted. You can Specifically, for example, in the figure, after the user selects the index displayed in the first index display area 6430 with the pointing device, the user drags it to the second index display area 6450, or the corresponding menu. A method such as selecting an item can be adopted.

Next, the case where the newly created index is the highest index of the index classification will be described. It is assumed that the user has selected the corresponding menu item in the menu selection area after inputting the name of the index classification to be newly created in the index name input area of the index display window. For example, in FIG. 61, when the user selects a corresponding menu item after inputting a character string in the index name input area 6140 of the index display window 6100, the index addition window 6
500 (see FIG. 65) is displayed. The window is for confirming the edited contents of the input character string, and the user can select buttons 6510 and 652 in the window.
By selecting 0 or 6530, it is possible to select any one of a new index creation process, a synonym addition process of an already registered index (including the highest index of index classification), and a new addition process of index classification. Here, when the user selects the button 6530 corresponding to the new creation of the index classification and selects the OK button, the window can be shifted to the new creation processing of the index classification.

After the registration flag is initialized, the input information of the user is acquired. Next, proceeding to step 4555, it is determined whether the input contents are appropriate. If the contents are appropriate, the process proceeds to step 4557 and the registration flag is set. Since the method of setting the registration flag has been described in the process of newly creating the index, the description thereof will be omitted here. On the other hand, if the content is not appropriate, proceed to step 4560,
After turning off the registration flag, a message is displayed in step 4562. Next, proceeding to step 4565, substituting the value of the registration flag for the classification creation flag, and then returning to step 4530. In the same step, the input information of the user is acquired, and it is determined again whether it is an index classification creation request. When the index classification creation request is acquired, the process proceeds to step 4575, but these processes are repeated until the index classification creation request is acquired. Assuming that the index classification creation request has been acquired, the process proceeds to step 4575.

At step 4575, the classification creation flag is set to O.
Determine if N. If the flag is ON, the process proceeds to step 4582, but if the flag is not ON, the process returns to step 4525. If it is assumed that the flag is ON, the process proceeds to step 4580 (see FIG. 46).

In step 4610, it is determined whether the newly created index is registered as the highest index of the index classification. When registering as the highest index, step 3860
Move to and register the index. When registering the registered index as the highest index, the process proceeds to step 4620. The method of registering the index has been described in the process of newly creating the index, and thus the description thereof is omitted here. Next, proceeding to step 4620, the index classification table 600 is referenced, and the index classification ID is set as a new index classification at the corresponding position in the table.
And the index information that is the highest index is substituted. Index classification I
As a setting method of D, in addition to the method of using the next value of the index classification ID effective at that time as the index classification ID, an invalid index classification ID (index classification in which information such as the highest index of the index classification is not registered) A method using ID) can also be adopted. Next, in step 4630, after updating the total index classification number, the process returns to step 4580 (see FIG. 45).

Next, in step 4582, it is determined whether the index classification has been successfully registered. Assuming that the registration is successful here, the flow advances to step 4584 to display the registered index classification. Next, after clearing the input area, the classification creation flag is initialized. Then, the process returns to step 4525. In the same step, the input information of the user is acquired again,
It is determined whether the input information is a request for ending index classification creation. If it is not the end request, the process advances to step 4530 to repeat the index classification creating process. If you get a termination request, close (or deactivate) the index display window,
The index classification new creation processing ends.

(3) -5 Index Hierarchy Editing Process Editing of the index hierarchy, specifically, moving the index, deleting the index,
Each process of changing the hierarchical relationship and integrating the indexes will be described. When the registered index change request is acquired in step 3710 (see FIG. 37), step 3750 (see FIG. 47)
Move on to.

It is determined whether or not the window for editing the index hierarchy of the designated index and the index hierarchy editing window are displayed. If the window is displayed, the corresponding window is activated, and if it is not displayed, the index hierarchy edit window 6400 (see FIG. 64) is displayed.

Next, proceeding to step 4720, the user's input information is acquired, and it is determined whether or not the input information is a request to end the index hierarchy editing. When the request to end the index hierarchy editing is acquired, the window is closed and the index hierarchy editing processing is ended. Otherwise, the process advances to step 4730 to determine a detailed processing request for index hierarchy editing. If the hierarchy deletion request is acquired, the process advances to step 4735. If the layer move request is acquired, the process advances to step 4745. When the layer addition request is acquired, the process proceeds to step 4765.
If a deletion request has been acquired, the process moves to step 4775. If the integration request is acquired, the process moves to step 4780.

(Details of Hierarchy Delete Processing) A case where a hierarchy deletion request is acquired will be described. In step 4735, the number of upper indexes of the index whose hierarchical relationship with the upper index is desired to be deleted is determined. If the number of upper indexes is 0, that is, if the specified index is the highest index of the index classification, step 47.
Proceed to 37 to display the message. If the number of upper indexes is one and the hierarchical relationship with the upper index is deleted, the lower index becomes the highest index of the index classification, so the process moves to step 3760 and the processing of creating the index classification is performed. If the number of upper indexes is 2 or more, the process moves to step 4740 (see FIG. 48).

The description of the case where the number of upper indexes is 0 or 1 is omitted here, and the case where the number of upper indexes is 2 or more will be described by taking the case of deleting the index “Suzuki” as an example. First, the superordinate relationship change table is initialized. The superordinate relationship change table is composed of a superordinate index of an index to be deleted and a flag (a flag indicating whether to delete the superordinate relation with the superordinate index) 2102 (see FIG. 21). Next, the process proceeds to step 4820 (see FIG. 48), the input information of the user is acquired, and it is determined whether or not the input information is a request to end the index hierarchy editing. Assuming that the input information acquired here is not a request to end the index hierarchy editing, step 4830
Then, the index hierarchy table 700 is referred to, and the index to be deleted from the index hierarchy, in this case, an index having “Suzuki” as a lower index is extracted, and its index ID is determined to be higher than the upper relationship change table 2100 (see FIG. 21). After substituting the index, display the upper index. In this example, the upper index of the index “Suzuki” displays “Project02”, “Theme # 1”, and “A University OB Meeting”. Next, get the user's input information,
In step 4850, the upper index designated by the user is identified based on the input information of the user, and the flag of the upper relationship change table corresponding to the designated upper index is turned on.

Next, the processing proceeds to step 4855, and the flag is set to O.
The number of upper-level relationship change tables that are FFs, that is, the number of upper-level indexes that maintain the hierarchical relationship is determined. Flag is OFF
When the number of the upper relation change tables is 1 or more, the process proceeds to step 4860, and the upper index (index ID thereof) corresponding to the corresponding table is extracted, and then step 487.
At 0, the corresponding (lower) index is deleted from the lower index information of the extracted upper index by referring to the index hierarchy table 700. On the other hand, the number of tables whose flag is OFF is 0
If it is, the confirmation message is displayed, and step 489 is performed.
At 0, all upper indexes (index IDs) of the upper relationship change table are extracted, the index hierarchy table is referred to, and the corresponding index is deleted from the lower index information of the extracted upper index. That is, the procedure moves to step 3760 to create an index classification. Then, the process returns to step 4740 (see FIG. 47) and proceeds to step 4787 to determine whether the processing has succeeded.

(Details of Tier Moving Process) A case where a tier moving request is acquired will be described. In step 4745, the user's input information, such as the user selecting the index displayed in the index hierarchy editing window with the pointing device, is acquired, and the index to be moved is identified based on the input information. Then, it is determined whether the index is the highest index in the index classification. If it is the highest index, the procedure moves to step 4750 to absorb the index classification. If not, the process proceeds to step 4755, and it is determined whether or not there is an index designated as the upper index based on the user input information. Step 476 if there is an indicated index
Move to 0 and move the index hierarchy. Otherwise, it moves to step 3760 and creates an index classification.

In the case of absorbing the index classification having the index to be moved as the highest index, the index having the indexes “Sato” and “Suzuki” as the lower indexes “A University OB Kai” is the highest index. The case of absorption in the lower level of “organization” will be described as an example. After initializing the absorption flag,
In step 4905 (see FIG. 49), the absorption flag is set. Specifically, referring to the index classification table 600 and the index hierarchy table 700, the index classification to which the index designated as the higher-level index belongs (“organization” in this example) and the index classification to which the index to be moved belongs (“in this example” University A OB
Group ”). Assuming that there are indexes (in this example, indexes “Sato” and “Suzuki”) that belong to both index classifications, in the index designated as a new upper index or its upper index group,
Determine whether there is an index you want to move or its subordinates. In this example, the index "organization" is the top index,
The subordinate index of the index you want to move "A University OB Association" is "Sato"
And because it is "Suzuki,""Organization" and "A University OB
It is determined whether or not the two indexes are the same index for each of the group “Group”, “Organization” and “Sato”, and “Group” and “Suzuki”. If there is an index or a subordinate index to be moved, the absorption flag is turned off, and if not, the absorption flag is turned on. In this example, since the indexes are different from “organization”, the absorption flag is set to ON.

Next, it is determined whether or not there is an index having the same name as the index to be moved or its subordinate index among the indexes in the index classification of the move destination. Assuming that there is an index with the same name, display the index with the same name. In this example, the index "Sato" has the same name (and is the same). Next, the input information of the user is acquired and the processing request is acquired. When the index classification absorption request is acquired, the absorption flag is turned on, and when the stop request is acquired, the absorption flag is turned off.

Next, in step 4960, it is determined whether the absorption flag is ON. Assuming that the flag is ON here, in step 4970, the index hierarchy table 700 (see FIG. 7) is referred to, the index ID of the index to be the upper index is extracted, and the index to be moved to the lower index information is extracted. to add. In this example, the index "organization" (index ID
“# 0400” 730) has a lower index information of “A University OB
The index ID of "Meeting" is added. Next, the moved index, that is, the part of the index classification table corresponding to the highest index of the index classification is cleared. Then, step 4750 (see FIG. 47)
(See reference) and proceeds to step 4787 to determine whether the processing has succeeded.

The case of moving an index to a lower index of a certain index will be described. After initializing the movement flag and the subtree movement flag, in step 5015 (see FIG. 50), the number of upper indexes of the index to be moved is determined. The number of upper indexes is 1
In the case of the number, the process proceeds to step 5017, and the flag of the upper relationship change table is turned on. If the number of upper indexes is two or more, the process advances to step 5018 to initialize the upper relationship change table. Next, in step 5020, after the movement flag is turned ON, in step 5025, only the range of the index to be moved, that is, the index designated by the user is targeted for movement, or the index and all lower indexes are moved. Determine whether to target. When moving only a single index, that is, an index designated by the user, the process proceeds to step 5027, and the subtree moving flag is turned off. When moving a subtree, the process proceeds to step 5030, and the subtree moving flag is turned on. Next, proceeding to step 5035, it is determined whether or not there is an index to be moved in the index classification to which the index designated as the superordinate index belongs. If it is assumed that there is an index to be moved in the index classification, the move flag is turned off in step 5040, and then a confirmation message is displayed. Next, in step 5050, the processing request is determined based on the input information of the user. If the request for adding the hierarchical relationship has been acquired, the process moves to step 4770 to add the hierarchical relationship. When the cancellation request is acquired, step 505
In step 5, the subtree movement flag is turned off. The method of adding the hierarchical relationship will be described later.

Next, in step 5060, it is determined whether the movement flag and the subtree movement flag are ON.
Assuming that both flags are ON here, in step 5065, the index hierarchy table 700 is referred to, and it is determined whether the index classification to which the index designated as the higher index belongs is the lower index of the index to be moved. . Assuming that there is a corresponding lower index here, step 5067.
Then, after the movement flag is turned off, a confirmation message is displayed. Next, in step 5075, based on the input information of the user, it is determined whether or not the input information is a hierarchical movement stop request. Step 5 if a tier move cancellation request is acquired
In step 077, the subtree movement flag is turned off.

Next, in step 5080, it is determined whether the movement flag is ON.

If the flag is ON, the process moves to step 5090 to update the index hierarchy. Assuming that the flag is ON here, in step 5110 (see FIG. 51), it is determined whether or not there are two or more superordinate indexes of the index to be moved. Assuming that there are two or more upper indexes, in step 5120, the upper indexes of the indexes to be moved are displayed based on the upper relationship change table. Next, the input information is acquired, and the upper index (index ID thereof) designated by the user is identified. Next, proceeding to step 5140, the flag of the higher-level relationship change table corresponding to the designated higher-level index is turned on.

Next, proceeding to step 5145, it is determined whether the subtree movement flag is OFF. Assuming that the flag is OFF, that is, only the index to be moved is moved, in step 5150, the index hierarchy table 700 is referred to, and among the superordinate indexes of the index to be moved,
An upper index that is also an index that is two layers higher than the lower index of the index that you want to move, that is, an index that has both the index that you want to move and its lower index as lower indexes, is extracted. Next, proceeding to step 5160, the lower index of the index to be moved is added to the lower index information of the upper index extracted at step 5150.

Next, proceeding to step 5170, the index hierarchy table 700 is referred to, and the index to be moved is added to the lower index information of the index to be newly set as the upper index. Next, proceeding to step 5180, the upper index whose flag in the upper relationship change table is ON is extracted, and the index ID of the moved index is deleted from the lower index information of the corresponding upper index in the index hierarchy table. Then, step 5080 (FIG.
Then, the process returns to step 4760 (see FIG. 47) and proceeds to step 4787 to determine whether the processing has succeeded.

(Details of Tier Addition Process) A case where a tier addition request is acquired will be described. In step 4765, the input information of the user is acquired, the index designated by the user is identified based on the input information, and it is determined whether the index is the highest index of the index classification. If it is the highest index, the flow advances to step 4767 to display a message. If not, the process moves to step 4770 to add the hierarchical relationship.

Assuming that the index pointed to here is not the highest index, after initializing the add flag, step 5
At 215 (see FIG. 52), the additional flag is set. Specifically, it is determined whether or not there is the same index designated by the user in the index classification to which the index designated as the upper index belongs. When there is no same index, the addition flag is turned on. Assuming that the same index is present, it is determined whether or not the index is the same as the upper index or the upper index group. When the same index exists, the addition flag is turned off. Next, it is determined whether or not there is the same index as the upper index or the lower index thereof, which is the same as the index to which the hierarchical relationship is added. If the same index exists, a confirmation message will be displayed. Next, the processing request of the user is determined, and if the hierarchical addition request is acquired, the addition flag is turned ON, and if the cancellation request is acquired, the addition flag is turned OFF.

Next, proceeding to step 5270, it is determined whether the addition flag is ON. If the flag is ON, the flow advances to step 5280 to refer to the index hierarchy table 700 to add the index to the lower index information of the index newly designated as the upper index. Then, the process returns to step 4770 (see FIG. 47) and proceeds to step 4787 to determine whether the processing has succeeded.

(Details of Index Deletion Processing) A case where a deletion request is acquired will be described. In step 4775 (see FIG. 53), the table change flag and the index deletion flag are initialized. Next, proceeding to step 5320, the directory table 800 is referred to, and it is determined whether or not there is a directory associated with the index to be deleted. Assuming that the corresponding directory exists, a confirmation message is displayed. Next, proceeding to step 5325, the table change flag and index deletion flag are set. Specifically, the processing request from the user is acquired, and when the corresponding table modification request is acquired, the table modification flag is turned on.
On the other hand, when the stop request is acquired, the table change flag is turned off and then the index deletion flag is turned off.

Next, in step 5350, it is determined whether the index deletion flag is OFF. Here the flag is OF
Assuming that the index is F, in step 5355, the index hierarchy table 700 is referred to, and it is determined whether or not the lower index is registered in the index to be deleted. If the lower index is not registered, the process proceeds to step 5360, and the index deletion flag is turned on. Assuming that the lower index is registered here, after the upper / lower change table is initialized in step 5365, step 5370 (see FIG. 54).
Proceed to and generate the same table. The upper / lower change table 2200 (see FIG. 22) includes an upper index 2201, a lower index 2202, and a flag 2203 (a flag indicating whether or not the lower index should be a lower index of the upper index). Next, in step 5410, the number of upper indexes of the index to be deleted is determined. If the number of upper indexes is 0, that is, if the index to be deleted is the highest index in the index classification, the process proceeds to step 5415. If the number of upper indexes is one, the process proceeds to step 5425. If the number of upper indexes is two or more, the process proceeds to step 5435.

The case where the number of upper indexes is 0 will be described. In step 5415, the index hierarchy table 700 is referred to, the lower index of the index to be deleted is extracted, the upper / lower change table is generated, and then the lower index is displayed based on this table. In this case, there is no higher index, so
Only the lower index is assigned to the lower change table. Next, in step 5417, the input information of the user is acquired. Next, the process proceeds to step 5420, and based on the input information acquired,
After turning on all the flags in the upper / lower change table corresponding to the instructed lower index, the process proceeds to step 5445.

A case where the number of upper indexes is 1 will be described. In step 5425, refer to the index hierarchy table,
After extracting the upper and lower indexes of the index you want to delete,
As many upper / lower change tables as the number of lower indexes are generated, and each set of upper and lower indexes is displayed based on the table. In this case, the upper index and the lower index belonging to the same index classification are substituted in the upper / lower change table. Next, the input information of the user is acquired, and the process proceeds to step 5430, and all flags of the upper / lower change table corresponding to the lower index designated based on the acquired input information are turned on.

The case where the number of upper indexes is two or more will be described. In step 5435, the index hierarchy table 700 is referred to, the upper and lower indexes of the index to be deleted are extracted, and the upper / lower change tables corresponding to the number of lower indexes are generated for one upper index. Display each set of upper index and lower index based on the table. The number of upper indexes is 1
Similar to the above case, the upper / lower indexes are assigned to the upper / lower change table. User input information is acquired, and in step 5440, all flags of the upper / lower change table corresponding to the set of the upper index and the lower index designated based on the user input information are turned ON.

After the flag of the upper / lower change table is set in this way, an index deletion flag is set in step 5442. Specifically, it is determined whether or not all the flags in the upper / lower change table are ON, and if all the flags are ON, the index deletion flag is turned ON. If not, that is, at least one is in the upper / lower relationship with the lower index. If you want to keep the index deletion flag, turn off the index deletion flag.
Next, in step 5455, it is determined whether the index deletion flag is ON. If the flag is ON, the process moves to step 5460 to change the vertical relationship between the index to be deleted and the lower index. If not, a confirmation message is displayed, and the processing proceeds to step 5475 to acquire the processing request of the user. If a request to move only the lower index whose flag in the upper / lower change table is ON is acquired, step 546
Move to 0 and change the vertical relationship between the index to be deleted and the lower index. If the cancellation request is acquired, the process advances to step 5480 to display a message.

Here, a case where the vertical relationship with the lower index is changed will be described. Step 5510 (see FIG. 55)
Then, determine the number of upper indexes of the index to be deleted. If the number of upper indexes is 1 or more, the process proceeds to step 5540,
Based on the upper / lower change table, the lower index of the index to be deleted is added to the lower index information of the index to be newly set as the upper index. The number of upper indexes of the index you want to delete is 0
If it is assumed that the sum of the number of index classifications with the lower index (of the index to be deleted) as the highest index and the total number of index classifications at that time does not exceed the allowable range, That is, it is determined whether a new index classification can be created for the number of lower indexes. If the allowable range is not exceeded, the process proceeds to step 5520, new index classification IDs corresponding to the number of lower indexes are extracted, and the uppermost index of the new index classification, that is, the index information of the lower index is added to the corresponding part of the index classification table 600. substitute. In Step 5525,
Update all index categories. If not, that is, if the index classification for the number of lower indexes cannot be created, the process proceeds to step 5530, and after turning off the index deletion flag,
In step 5535, display the message.

Next, proceeding to step 5550, the index to be deleted stored in the index hierarchy table 700 is searched and the lower index information is cleared. Then, the process returns to step 5370 (see FIG. 53).

Next, proceeding to step 5375, it is determined whether the index deletion flag is ON. Here the flag is O
Assuming N, in step 5377, the index hierarchy table 700 is referred to, the upper index of the index to be deleted is searched, and the index ID of the corresponding index is deleted from the lower index information of the upper index. Next, the part corresponding to the deleted index in the index table 500 is cleared. Next, in step 5382, the total number of indexes is updated.

Next, proceeding to step 5390, it is determined whether the table change flag is ON. Flag is ON
In the case of, the process moves to step 3770 and the association information is updated. The method of updating the association information will be described later. Then, the procedure returns to step 4775 (see FIG. 47), and step 4
Proceeding to 787, it is determined whether the processing has been successful.

(Details of Index Integration Processing) The case where the integration request is acquired will be described by taking as an example the integration of municipalities and the integration of “a town” and “b town”. Figure 2 Example of index hierarchy
5 shows. As shown in the figure, "a town" 2540 and "b"
“Town” 2550 has “B county” 2530 as an upper index, and “a town” is “letter a1” 2545, “letter a2” 2546,
“B town” is “letter b1” 2555, “letter b2” 2556,
It is assumed that each has "letter a1" 2557 as a lower index. First, move to step 4780 (see FIG. 56),
Initialize the integration flag, classification deletion flag and table change flag. Next, proceeding to step 5615, referring to the association information table 900, it is determined whether there is a directory associated with the index to be integrated. Assuming that the corresponding directory exists, a confirmation message is displayed. Next, proceeding to step 5617, the table change flag and integration flag are set. Specifically, the processing request is determined based on the user's input information, and when the corresponding table change request is acquired, the table change flag is turned on. On the other hand, when the stop request is acquired, the table change flag is turned off and then the integration flag is turned off.

Next, proceeding to step 5640 (see FIG. 57), the integration destination index is set. 2 instructed by the user here
Of the two indexes, the index that absorbs the information of the other index is called the integration destination index. Then, the other index, that is, the index absorbed by the integration destination index will be referred to as an integration source index. Initialize the integration source index, integration destination index and deletion classification. Next, in step 5720, it is determined whether the two indexes to be integrated belong to the same index classification. If it belongs to the same index classification, the flow advances to step 5722 to turn off the classification deletion flag. If it is assumed here that the two indexes belong to different index classifications, then in step 5725 it is determined whether at least one of the two indexes is the highest index in the index classification. If neither is the highest index, the flow advances to step 5765 to set the classification deletion flag to O.
Set to FF. Assuming that one of the indexes is the highest index in the index classification, first, step 5730 is executed.
Then, the classification deletion flag is turned on. Next in Step 574
After proceeding to 0 and substituting the index ID of the highest index into the integration source index, in step 5750 the index classification ID of the index classification of the integration source index is substituted into the deletion classification. Next in Step 576
Go to 0 and the index ID of the index that is not the highest index classification
To the integration destination index. Here, when both indexes are the highest indexes of the index classification, it is also possible to adopt a method of setting the integration destination index and the integration source index by comparing the numbers of the respective lower indexes. In this example, since the two indexes to be integrated belong to the same index classification, the flow advances to step 5722 to turn off the classification deletion flag.

Next, proceeding to step 5775, it is determined whether the classification deletion flag is ON. Here the flag is O
Assuming that N is not N, in step 5780, the number of lower-order lower indexes of the two indexes to be integrated is checked, and then in step 5785, the index ID of the index with the larger number of lower indexes is assigned to the integration destination index. In this example, the flag is OFF, so the processing proceeds to step 5780. Next in Step 5790
Then, the index ID of the index having the smaller number of lower indexes is assigned to the integration source index. In this example, comparing the number of lower subordinate indexes of "a town" and the number of lower subordinate indexes of "b town", the number of lower subordinate indexes of "b town" is larger. The index ID of "b town" and the index I of "a town" in the integration source index
Substitute D respectively. In this embodiment, in order to efficiently execute the change of the hierarchical relationship, a method of setting an index having a large number of lower indexes as the integration destination index is used, but the integration destination index should be set by using another criterion. You can also Then, the process returns to step 5640 (see FIG. 56).

Next, proceeding to step 5645, the index hierarchy table 700 is referred to, and it is determined whether or not there is a superordinate index in the integration source index. Assuming that there is a superordinate index in the integration source index, the process moves to step 5650 (see FIG. 58),
Add a higher-level index to the integration destination index. Specifically, in step 5810, it is determined whether or not there is an index that is the same as the integration-destination index or its subordinate index in the upper index of the integration source index. If there is the same index, the process proceeds to step 5820,
Turn off the integration flag. Next, proceeding to step 5830, it is determined whether the integration flag is OFF. Assuming that the flag is not OFF here, step 584
After initializing the superordinate relationship change table at 0, in step 5850, the superordinate index of the integration source index is searched in the index hierarchy table 700, and the index ID is substituted for the corresponding position in the superordinate relationship change table. Next, proceeding to step 5860, it is determined whether the list in the upper relationship change table is NULL. Initially, the list of the upper relationship change table is not NULL, so the processing proceeds to step 5870,
The index corresponding to the upper index is searched in the index hierarchy table, and the index ID of the integration destination index is added to the lower index information. Then, the process returns to step 5860, and it is determined again whether or not the list of the upper relationship change table is NULL. If the list of the table is not NULL, the process of adding the index ID of the integration destination index to the lower index information of the upper index in the index hierarchy table is repeated. Here, if the list of the table is NULL, step 5650 (see FIG. 56).
Return to.

Next, proceeding to step 5655, it is determined whether the integration source index has a lower index. If it is assumed that there is a lower index, the process moves to step 5660 (see FIG. 59), the lower index of the integration source index is searched in the index hierarchy table, and each lower index is moved as the lower index of the integration destination index. Specifically, in step 5910, the subordinate relationship change table is initialized. The subordinate relationship change table 2300 (see FIG. 23) includes a subordinate index 2301 and a flag 2302 (a flag indicating whether to move the index hierarchy of the subordinate index). Next step 5920 (see FIG. 59)
Then, the lower index (the index ID of the lower index) is assigned to the corresponding portion of the lower relationship change table. In this example, "letter a1" and "letter a2", which are subordinate indexes of "a town", are assigned to the subordinate indexes of the subordinate relationship change table (see FIG. 23). Next, the procedure proceeds to step 5930, and the list of the subordinate relationship change table is N.
Determine if it is ULL. Initially, since the list of the table is not NULL, the procedure proceeds to step 4760 to move the index hierarchy. Since the method of moving the index hierarchy will be described separately, the description is omitted here. However, in this case, the lower index and the lower index group are moved.
Then, the process returns to step 5930, and it is determined again whether the lower relation change table list is NULL. If the list in the table is not NULL, step 476.
The process proceeds to 0 and the process of moving the index hierarchy is repeated. Assuming that the list of the subordinate relationship change table is NULL, the process returns to step 5660 (see FIG. 56).

Next, in step 5670 (see FIG. 60), the synonyms of the two indexes are integrated. Step 6010
In step 6015, the index name of the integration-destination index and its synonyms are displayed. Similarly, in step 6015, the index name of the integration-source index and its synonyms are displayed. Next, proceeding to step 6020, the synonym addition table is initialized. The table 2400 (Fig. 2
4) includes a synonym 2401 and a flag 2402 (a flag indicating whether to add as a synonym of the integration destination index). Next, the processing proceeds to step 6055 (see FIG. 60), and the flag of the synonym addition table is set. Specifically, determine whether any of the index names or synonyms of the integration source index duplicates the index name or synonym of the integration destination index, and if there are no duplicates, set the flag in the synonym addition table. Turn all on. If it is assumed that there are duplicates, a confirmation message is displayed and the processing request is determined based on the input information of the user. When integrating while overlapping, the flag of the synonym addition table corresponding to the overlapping synonym is turned on. On the other hand, when avoiding duplication, the flag of the synonym addition table corresponding to the duplicate synonym is turned off. In this example, since the index name “b town” and its synonym “b” of the integration destination index and the index name “a town” and its synonym “a” of the integration source index do not overlap,
The flags "a town" and "a" in the subordinate relationship change table are both ON. Then proceed to step 6060,
A synonym whose flag is ON in the synonym addition table is added to the synonym of the integration destination index in the index table. In this example, "a town" and "a" are added to the synonyms of "b town". Then, the process returns to step 5670 (see FIG. 56).

Next, proceeding to step 5675, it is determined whether the table change flag is ON. Flag is ON
In the case of, the process moves to step 3770 and the association information is updated. The method of updating the association information will be described later.

Next, proceeding to step 5680, it is determined whether the classification deletion flag is ON. If the flag is ON, proceed to step 5685 to clear the corresponding part in the index classification table, and then proceed to step 5687.
Update all index categories.

After updating the lower index information of the integration source index, the upper index information of the integration destination index, and the association information with the directory in this way, the process moves to step 4775 to delete the index. The method of deleting the index will be omitted here because it will be described separately. Then, the process returns to step 4780 (see FIG. 47) and proceeds to step 4787 to determine whether the processing has succeeded.

Then, in step 4787, it is determined whether or not each editing process has succeeded. If the process is successful, proceed to step 4790 to redisplay the index hierarchy, otherwise proceed to step 4792 to display a message.
Then, the procedure returns to step 4720, and the input information of the user is again acquired, and it is determined whether or not the input information is a request for ending the index hierarchy editing. If it is not a termination request, step 4
Proceeding to 730, the above processing is repeated. When the end request is acquired, the index display window is closed (or deactivated), and the index hierarchy editing process ends.

(3) -6 Correspondence Information Change Processing The correspondence information change processing will be described. Step 3
When the correspondence table change request is acquired in 710 (see FIG. 37), the process proceeds to step 3770 (see FIG. 66). It is determined whether or not the window in which the association information can be changed and the association information display window are displayed. If the window is displayed, the corresponding window is activated, and if not, the corresponding information display window is displayed. Correspondence information display windows include an index priority type window (emphasizing browsing of the index hierarchy) 7800 (see FIG. 78) and a directory priority type window (emphasizing browsing of the directory hierarchy) window 7900 (FIG. 7).
9)), the user can switch to a display mode as necessary by selecting the corresponding menu item. In the corresponding information display window, the index (or directory) displayed in the window
By adding a mark such as “*” next to, it is indicated that there is correspondence information with the directory (or index). For example, in FIG. 78, the index "patent" 7831
The directory "P" displayed on the right side of the window
“Project01 / Hashimoto / Patient” 7851 and the like are associated with each other, while in FIG. 79, the directory “Patent” 7931 has an index “Project01”.
7951, "Yamazaki" 7952, "Theme # 2" 795
3, it can be seen that "patent" 7954 is associated. Next, proceeding to step 6620, the input information of the user is acquired, and it is determined whether the input information is a request to end the association information change. When the end request is acquired, the window is closed and the association information changing process is ended.
Assuming that the input information acquired here is not a termination request for changing association information, the index table 500 is referenced in step 6630 to extract the index for which association information is changed and its synonyms. Next, proceeding to step 6635, a processing request is determined based on the input information acquired at step 6620. Each process is executed according to the type of process request acquired in the same step.

(Details of Correspondence Information Deletion Process Accompanying Deletion of Synonym) The correspondence information deletion process when a synonym deletion request is acquired will be described. Step 6640 (FIG. 67)
See). Next, in step 6710, the input information of the user is acquired, and it is determined whether or not the input information is a deletion request of the association information of the index corresponding to the synonym. If it is assumed that the request is not a deletion request, the flow advances to step 6715 to determine the method for specifying the association information deletion.

The case where the index has priority, that is, the case where the index is designated in advance will be described. Proceeding to step 6720, the index whose association with the directory is to be deleted in the association information table and the directory corresponding to that index are extracted. Next, proceeding to step 6725, it is determined whether there is a directory associated with the index. If there is no corresponding directory, step 6735 follows and a message is displayed.

Assuming that there is a corresponding directory, in step 6730, the association information with the directory is deleted. Specifically, the index for which the association information is desired to be deleted and its synonym are displayed. Next, the input information of the user is acquired, and it is determined whether or not a directory having the same name as the designated synonym exists in the association information table 900. If there is a corresponding directory, the directory information with the same name is deleted from the corresponding portion in the correspondence information table. Assuming that there is no directory with the same name, the user's input information is acquired, and the processing request is acquired based on the input information. When the deletion request is acquired, the directory information designated by the user is deleted from the corresponding location in the association information table. After redisplaying the directory, the process returns to step 6710.

The case of prioritizing the directory will be described. In Step 6750, in the correspondence information table,
The directory for which the association information is to be deleted and the index corresponding to the directory are extracted. Next in Step 675
In step 5, it is determined whether there is an index associated with the directory. Step 6 if there is no applicable index
Proceed to 785 to display the message. Assuming there is a relevant index here, in step 6760 the relevant index and its synonyms are displayed. Next, the input information of the user is acquired, and the processing proceeds to step 6770 to acquire the processing request based on the input information. If a deletion request has been acquired, the process advances to step 6780 to delete the directory information for which the association with the index is to be deleted from the corresponding location in the association information table 900, and then the process returns to step 6710.
Further, when the cancellation request is acquired, the processing is directly performed in step 671.
Return to 0. In this embodiment, since the correspondence information between the index and the directory is stored with the index ID as the axis, the method of deleting the directory information is adopted even when the directory is selected in advance. It is also possible to adopt a method of storing the index information with the directory ID as the axis and deleting the index information.

At step 6710, the user's input information is acquired again, and it is determined whether the input information is a deletion request. If it is not a deletion request, the process advances to step 6715 to repeat the processing. Assuming that the deletion request has been acquired, the process returns to step 6640 (see FIG. 66), and step 6685.
Then, it is determined whether the processing is successful.

(Details of Correspondence Change Processing Accompanying Change of Synonym) The correspondence information change processing when the synonym change request is acquired will be described. Move to step 6650 (see FIG. 68). In step 6810, the user's input information is acquired, and it is determined whether or not it is a request to change the index correspondence information corresponding to the synonym of a certain index. When the change request is acquired, the process returns to step 6650. If it is assumed here that the input information is not a change request, then in step 6815, the method of designating the change of the association information is determined.

The case of index priority will be described. In Step 6820, the association information table 900 is referenced,
The directories corresponding to the index before change (index for which association information is to be deleted) and the index after change (index for which association information is to be added) are extracted. Next, proceeding to step 6825, it is determined whether there is a directory associated with any index. If there is no corresponding directory, step 6835 follows and a message is displayed.

Assuming that there is a corresponding directory, in step 6830, the association information with the directory is changed. Specifically, the directory names corresponding to the index before the change and the index after the change are displayed. Next, the input information of the user is acquired, and the processing request is determined based on the input information of the user. When the change request is acquired, the index ID of the changed index in the association information table
Is searched and the directory information is substituted for the corresponding portion, and then the directory information is deleted from the portion corresponding to the index before the change in the association information table. Next, the directory names corresponding to the index before the change and the index after the change are displayed again, and the process returns to step 6810.

The case of prioritizing the directory will be described. In step 6850, the association information table 900
And the directory for which you want to change the mapping information,
Extract the index corresponding to that directory. Next, proceeding to step 6855, it is determined whether there is an index associated with the directory. If there is no corresponding index, step 6895 is displayed and a message is displayed. Assuming that there is a corresponding index here, the index display window is displayed and the input information of the user is acquired. Next, proceeding to step 6870, the processing request is determined based on the input information. Assuming that the change request has been acquired here, in step 6880, the corresponding portion of the designated index in the association information table is searched and the directory information is substituted for that portion. Next, proceeding to step 6885, the directory information is deleted from the corresponding portion in the same table.

After closing the index display window, the process returns to step 6810. In the same step, the input information of the user is acquired again, and it is determined whether the input information is a change request. If it is not a change request, the process advances to step 6815 to repeat the change process. When the change request is acquired, the process returns to step 6650 (see FIG. 66). Then, the procedure returns to step 6650 and then proceeds to step 6685 to determine whether or not the processing is successful.

(Details of Correspondence Information Addition Process Associated with Addition of Synonym) The correspondence information addition process when the synonym addition request is acquired will be described. Step 6660 (FIG. 69)
See). In step 6910, the input information of the user is acquired, and it is determined whether or not the input information is a request for adding the association information of the index corresponding to the synonym. If the addition request is acquired, the process returns to step 6660. If it is assumed that the input information is not an addition request, then in step 6915, a method for designating addition of association information is determined.

The case of index priority will be described. In Step 6920, referring to the association information table 900,
Extract the directory corresponding to the index to which the association information is added. Next, proceeding to step 6925, the user's input information is acquired, and based on the input information, it is determined whether or not there is a directory having the same name as the synonym instructed by the user. Step 69 if applicable directory exists
Proceed to step 30 to display the directory name.

Next, the user's input information is acquired, and the process proceeds to step 6945 to identify the designated directory based on the user's input information and determine whether or not the directory is already associated. If already associated, the process proceeds to step 6947 to display a message. If not, the process proceeds to step 6950, the index ID of the index designated in the association information table is searched, and the directory information is substituted in the corresponding portion. Then, the process returns to step 6910.

The case of prioritizing the directory will be described. In step 6960, the association information table 900
To extract the index corresponding to the directory. Next, proceeding to step 6965, it is determined whether there is an index associated with the directory. If there is a corresponding index, step 6970 follows and the corresponding index and its synonyms are displayed.

Next, the user's input information is acquired, the process proceeds to step 6985, the index ID of the designated index in the correspondence information table is searched, and the directory information is substituted in the corresponding portion. Then, in step 6990, Refresh the index. Then, the process returns to step 6910.

At step 6910, the user's input information is acquired again, and it is determined whether the request is an addition request. If it is not an addition request, the process advances to step 6915 to repeat the addition process. When the addition request is acquired, step 6650 (see FIG.
6) and proceeds to step 6685 to determine whether the processing has been successful.

(Details of Index Correspondence Information Deletion Processing)
The process of deleting the association information with the index will be described. Move to step 6670 (see FIG. 70). Step 7010
Then, the input information of the user is acquired, and it is determined whether or not the input information is a deletion request of the association information. If it is a deletion request, the process returns to step 6670. If it is assumed that the request is not a deletion request, then in step 7015, the method of specifying the association information deletion is determined.

The case of index priority will be described. Step 70
At 20, the directory corresponding to the index is extracted with reference to the association information table 900. Then step 702
In step 5, it is determined whether there is a directory associated with the index. If there is no associated directory, step 7055 follows and a message is displayed.
Assuming that there is a directory associated therewith, in step 7030 the directory name is displayed.
Next, the input information of the user is acquired, the process proceeds to step 7040, the directory in which the association information is deleted is identified based on the input information, and the corresponding portion in the association information table is cleared. Next, proceeding to step 7045, the directory name is displayed again, and then returning to step 7010.

The case of prioritizing the directory will be described. In step 7060, the correspondence information table is referred to and the index corresponding to the directory is extracted. Then step 70
Proceeding to 65, it is determined whether or not there is an index associated with the directory. If there is no corresponding index, step 7095 follows and a message is displayed. Assuming that there is a corresponding index, step 7070 displays the corresponding index and its synonyms. Next, the input information of the user is acquired, and the processing proceeds to step 7080 to determine the processing request based on the input information. If a deletion request has been acquired, the flow advances to step 7085 to clear the corresponding part in the association information table.

Next, proceeding to step 7090, the index name is displayed again, and then returning to step 7010. In the same step,
The user's input request is again acquired, and it is determined whether the input information is a deletion request. Step 7 if not a deletion request
The process proceeds to 015 and the deletion process is repeated. When the deletion request is acquired, the process then returns to step 6670 (see FIG. 66) and proceeds to step 6685 to determine whether the processing has been successful.

(Details of Addition Process of Correlation Information with Index)
The process of adding the association information with the index will be described. The process moves to step 6680 (see FIG. 71). Step 7110
Then, the user's input request is acquired, and it is determined whether the input information is a request to add association information. If it is an addition request, the process returns to step 6680, but if not, the process proceeds to step 7115. Assuming no additional request here,
In step 7115, the method of specifying the association is determined.

The case of index priority will be described. Step 71
At 20, the association information table 900 is referred to, and it is determined whether there is a directory already associated with the index. If there is a corresponding directory, the process proceeds to step 7130 to display the directory name. Next, the user input information is acquired, and step 71
In step 40, the directory to be added to the index is identified based on the input information, the index ID of the index is searched in the correspondence information table, and the designated directory information is substituted in the corresponding portion. Next, in step 7145, the directory name is displayed again, and the process returns to step 7110.

The case of prioritizing the directory will be described. In step 7150, it is determined whether the directory already has an associated index. If there is a corresponding index, step 7160 displays the corresponding index and its synonyms. Next, the input information of the user is acquired, the process proceeds to step 7170, the index to which the association information is added is identified based on the input information, the corresponding portion is searched in the association information table, and the instructed directory information is obtained. Is substituted. Then, in step 7175, the index is redisplayed, and the process returns to step 7110.

In step 7110, the user's input information is acquired again, and it is determined whether or not it is a request to add association information. If it is not an addition request, the process proceeds to step 7115 to repeat the addition process. When the addition request is acquired, the process returns to step 6680 (see FIG. 66). Then step 66
Proceed to 85 to determine whether the process was successful.

In step 6685, it is determined whether or not each processing has succeeded. If the processing is successful, the process advances to step 6690 to redisplay the association information. Otherwise, it proceeds to step 6692 and displays a message. Then, the procedure returns to step 6620, the input information of the user is acquired again, and it is determined whether the input information is a request to end the association information change. Step 6630 if not a termination request
Then, the process is repeated. When the end request is acquired, the correspondence information display window is closed and the correspondence information changing process is ended. As described above, various functions of index editing can be executed.

[0184]

According to the present invention, a user can easily browse an electronic document and document information.

[Brief description of drawings]

FIG. 1 is a diagram showing a module configuration of a document management system.

FIG. 2 is a diagram illustrating a system configuration example of a document management system.

FIG. 3 is a diagram showing a schematic example of index classification in an index dictionary.

FIG. 4 is a diagram showing a schematic example of a conventional directory hierarchy.

FIG. 5 is a diagram showing a data structure of an index ID and an index name.

FIG. 6 is a diagram showing a data structure of index classification and the highest index.

FIG. 7 is a diagram showing a data structure of an index classification hierarchy.

FIG. 8 is a diagram showing a data structure of a directory ID and a directory name.

FIG. 9 is a diagram showing a data structure of an index ID and a directory ID.

FIG. 10 is a diagram showing a data structure of an index and a document object ID.

FIG. 11 is a diagram showing a data structure of a document object ID, a document file name, and a file ID.

FIG. 12 is a diagram showing a data structure of index information added to a document object.

FIG. 13 is a diagram showing a data structure for displaying an index.

FIG. 14 is a diagram showing a data structure for displaying an index.

FIG. 15 is a diagram showing a data structure for displaying an index.

FIG. 16 is a diagram showing a data structure for holding route information.

FIG. 17 is a diagram showing a data structure for searching a document object.

FIG. 18 is a diagram showing a data structure of retrieved document object information.

FIG. 19 is a diagram showing a data structure of retrieved document object information.

FIG. 20 is a diagram showing a data structure of retrieved document object information.

FIG. 21 is a diagram showing a data structure for index hierarchy editing.

FIG. 22 is a diagram showing a data structure for editing an index hierarchy.

FIG. 23 is a diagram showing a data structure for index hierarchy editing.

FIG. 24 is a diagram showing a data structure for editing an index hierarchy.

FIG. 25 is a diagram showing a schematic example of index classification in the index dictionary.

FIG. 26: Registration of electronic document, document object search,
It is a figure which shows the process flow of each process of an index edit.

FIG. 27 is a diagram showing a processing flow of registration processing of an electronic document.

FIG. 28 is a diagram showing a processing flow of processing of generating index data to be added to a document in the electronic document registration processing.

FIG. 29 is a diagram showing a processing flow of document object search processing.

FIG. 30 is a diagram showing a processing flow for searching a document object to which an index of switching index information is added in the document object search processing.

FIG. 31 is a diagram showing a processing flow of index display processing.

FIG. 32 is a diagram showing a processing flow of processing for switching to an instructed index classification in the index display processing.

FIG. 33 is a diagram showing an example of index classification display in list format.

FIG. 34 is a diagram showing an example of index classification display by a single index classification display.

FIG. 35 is a diagram showing an example of index classification display by a single index classification display.

FIG. 36 is a diagram showing an example of index classification display by a single index classification display.

FIG. 37 is a diagram showing a process flow of each process of index creation, synonym editing, index name modification, index hierarchy editing, index classification creation, and association information modification in the index editing process.

FIG. 38 is a diagram showing a processing flow of index creation processing.

FIG. 39 is a diagram showing a processing flow of processing for registering an index in the index creation processing.

FIG. 40 is a diagram showing a processing flow of synonym editing processing.

FIG. 41 is a diagram showing a processing flow of processing for deleting synonyms in the synonym editing processing.

FIG. 42 is a diagram showing a processing flow of processing for replacing synonyms in the synonym editing processing.

FIG. 43 is a diagram showing a processing flow of processing for adding synonyms in the synonym editing processing.

FIG. 44 is a diagram showing a processing flow of index name change processing.

FIG. 45 is a diagram showing a processing flow of index classification creation processing.

FIG. 46 is a diagram showing a processing flow of processing for registering an index classification in the index classification creation processing.

FIG. 47 is a diagram showing a processing flow of edit processing of an index hierarchy.

FIG. 48 is a diagram showing a processing flow of processing for deleting a hierarchical relationship in the index hierarchy editing processing.

FIG. 49 is a diagram showing a processing flow of processing of absorbing index classification in the index hierarchy editing processing.

FIG. 50 is a diagram showing a processing flow of processing of moving an index hierarchy in the index hierarchy editing processing.

FIG. 51 is a diagram showing a processing flow of processing for updating the index hierarchy in the index hierarchy movement processing.

FIG. 52 is a diagram showing a processing flow of processing of adding a hierarchical relationship in the index hierarchy editing processing.

FIG. 53 is a diagram showing a processing flow of processing for deleting an index in the index hierarchy editing processing.

FIG. 54 is a diagram showing a processing flow of processing for generating a higher / lower change table in the index deletion processing.

FIG. 55 is a diagram showing a processing flow of processing for changing the vertical relationship with a lower index in the index deletion processing.

FIG. 56 is a diagram showing a processing flow of processing of integrating indexes in the index hierarchy editing processing.

FIG. 57 is a diagram showing a processing flow of processing for setting an integration destination index in the index integration processing.

FIG. 58 is a diagram showing a processing flow of processing for adding a higher-level index to the integration-destination index in the index integration processing.

FIG. 59 is a diagram showing a processing flow of processing of moving a lower index of an integration source index in the index integration processing.

FIG. 60 is a diagram showing a processing flow of processing for integrating synonyms in the index integration processing.

FIG. 61 is a diagram showing an index classification display example when a new index is added.

FIG. 62 is a diagram showing an example of index classification display when a new index is added.

FIG. 63 is a diagram showing a display example for editing synonyms.

FIG. 64 is a diagram showing a display example for editing an index hierarchy.

[Fig. 65] Fig. 65 is a diagram illustrating a display example of selection items when a new index is added.

FIG. 66 is a diagram showing a processing flow of association information change processing.

FIG. 67 is a diagram showing a processing flow of processing of deleting association information corresponding to synonyms in association change processing.

FIG. 68 is a diagram showing a processing flow of processing of changing association information corresponding to synonyms in association change processing.

FIG. 69 is a diagram showing a processing flow of processing of adding association information corresponding to synonyms in association change processing.

FIG. 70 is a diagram showing a processing flow of processing for deleting information associated with an index in the association change processing.

FIG. 71 is a diagram showing a processing flow of processing of adding association information with an index in the association change processing.

FIG. 72 is a diagram showing an index classification display example (list format) by a single index classification display.

FIG. 73 is a diagram showing an example of index classification display by multiple index classification display.

FIG. 74 is a diagram showing an index classification display example (list format) by multiple index classification display.

FIG. 75 is a diagram showing an example of index classification display in list format.

FIG. 76 is a diagram showing an example of index classification display after execution of the lower index display function in FIG. 75;

[Fig. 77] Fig. 77 is a diagram illustrating a display example of an index associated with a directory when an index is added to a digitized document registered in a directory having a directory hierarchy.

[Fig. 78] Fig. 78 is a diagram showing a display example of an index hierarchy and a directory corresponding to the index.

FIG. 79 is a diagram showing a display example of a directory and an index corresponding to the directory.

[Explanation of symbols]

101 ... Keyboard, 102 ... Pointing device, 103 ... Display device, 105 ... CPU, 106 ... Main storage device, 120 ... Shared document database, 140 ... Index dictionary, 210 ... Document management server, 260 ... Client, 265 ... Local document file Group, 500 ... Index table, 501 ... Index ID, 502 ... Index name, 503 ...
Synonyms, 600 ... Index classification table, 601, Index classification ID, 700 ... Index hierarchy table, 800 ... Directory table, 801, Directory ID, 900 ... Correlation information table, 1000 ... Additional index table, 11
00 ... Document object table, 1200 ... Index addition table, 1204 ... Display flag, 1205 ... Index addition flag, 1300 ... Index display table, 1304 ... Subordinate display flag, 1600 ... Route table, 1700 ... Switching index table, 1703 ... Search result Number of cases, 1720 ... Document search table, 1730 ... Additional document table, 180
0 ... Search result table, 1803 ... Refinement flag, 21
00 ... Higher level relationship change table, 2200 ... Higher level / lower level change table, 2300 ... Lower level relationship change table, 240
0 ... Synonym addition table, 3300 ... Index display window (list format), 3310 ... Menu selection area, 33
20 ... Index classification display area, 3330 ... Lower index display area, 3340 ... Index name input area, 3400 ... Index display window (tree format), 3410 ... Menu selection area, 3420 ... Route information display area, 3430 ... Index display area, 3440 ... Index classification selection area, 3450 ... Document display area, 3525 ... Switching symbol, 6300 ... Synonym edit window, 6310 ... Synonym display area, 6320 ... Synonym input area, 6330 ... Function menu button, 6400
... Index hierarchy edit window, 6500 ... Index addition window, 7300 ... Index display window (index classification linked display format), 7330 ... Multiple index classification display area, 7400
… Index display window (multiple list format), 7440…
Condition designation area, 7700 ... Correspondence information registration window, 7
800 ... Corresponding information display window (index priority type), 79
00 ... Correspondence information display window (directory priority type).

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Yoshiki Matsuda 1-280, Higashi Koikeku, Kokubunji, Tokyo Inside the Central Research Laboratory, Hitachi, Ltd. (72) Inventor Tetsuya Hashimoto 1-280, Higashi Koikeku, Kokubunji, Tokyo Hitachi, Ltd. Central Research Institute (72) Inventor Hiromichi Fujisawa 5030 Totsuka-cho, Totsuka-ku, Yokohama-shi, Kanagawa Prefecture Company Hitachi, Ltd. Software Development Division

Claims (10)

[Claims] 1. A method for retrieving a desired document from a plurality of digitized documents stored in association with a plurality of indexes belonging to any of a plurality of index classifications in which an index representing a phrase is hierarchically classified. (A) displaying the plurality of index classifications, (b) allowing the user to select one of the displayed index classifications, and (c) selecting a plurality of indexes belonging to the selected index classification. Hierarchical relationships are explicitly displayed, (d) the user is allowed to select one of the displayed indexes, and (e) a plurality of digitized documents to which the selected index or an index subordinate to the selected index is added. A document is searched from the stored plurality of digitized documents, (f) information for identifying the documents of the retrieved plurality of digitized documents is displayed, and (g) the above (a) is displayed in response to an instruction from the user. From (d)
(H) A document search method in which (e) to (f) are repeated with a plurality of digitized documents previously searched in (e) as search targets after the above repetition. 2. A correspondence table for associating a directory for file management managed in a hierarchical structure with an index in index classification is held in a computer, and a user registers a digitized document in the directory to create a correspondence table. The document search method according to claim 1, wherein a plurality of indexes corresponding to the directory are extracted by referring to the index and the indexes are added as data to the digitized document. 3. The document search method according to claim 1, wherein the index classification including the index last selected by the user is displayed on the screen. 4. The document search method according to claim 3, wherein the index paths of interest to the user are displayed on the screen by distinguishing between the paths of the same index classification and the paths of different index classifications. 5. A user pointing a pointing device to an index in the route displayed on the screen,
5. The document search method according to claim 4, wherein the selected index and the index classification including the selected index are displayed on the screen. 6. The document search method according to claim 1, wherein the index selected by the user and the indexes around the index are displayed on the screen as a virtual hierarchical tree format in the order selected by the user. 7. An index in one index classification and an uppermost index of another index classification are displayed side by side on the same screen, and an index lower than the index in the index classification selected by the user is made into a hierarchical tree format. The document search method according to claim 1, which is displayed on a screen. 8. A user designates an index displayed on a screen with a pointing device, and the digitized document to which the index and a subordinate index are added is ORed to obtain the document of the digitized document. The document search method according to claim 1, wherein the name and the like are displayed on the screen. 9. When a digitized document to which an already selected index is added is displayed on the screen, the user designates an index lower than the index with a pointing device to display the digitized document. 9. The document search method according to claim 8, wherein the index selected by the user of the documents and the digitized document to which the subordinate index is added are ORed and the document name of the digitized document is displayed. 10. When the first digitized document group to which the index in the first index classification is added has already been searched, the user can search the index in the second index classification displayed on the screen. By instructing with a pointing device, the logical sum of the second digitized document to which the index of the second index classification and the subordinate indexes are added, and the first digitized document set already searched is obtained. 2. The document search method according to claim 1, wherein the computerized documents common to the second computerized document set are narrowed down, and the document name of the computerized document is displayed on the screen.