JP5137562B2 - Information processing apparatus, information processing method, and information processing program - Google Patents

Description

  The present invention relates to an information processing device, an information processing method, and an information processing program, and more particularly, to an information processing device, an information processing method, and an information processing program for transferring management information.

  Conventionally, document management systems have been widely used to electronically manage document information. In the document management system, fundamental files and bibliographic information are basically stored and managed for each document.

  Incidentally, there is a case where it is desired to transfer management information from one document management system to another document management system. Here, when the document information management form (bibliographic information configuration, etc.) is different between the transfer source and the transfer destination, so-called document information conversion work is required.

In general, during the conversion work, the use of the system is restricted not only at the transfer source but also at the transfer destination. This is because the document information cannot be appropriately transferred if the configuration of the document information at the transfer destination is edited during the conversion.
JP 2004-341777 A JP 2006-318285 A

  However, document management systems are often closely related to daily work, and their use may be restricted, which may hinder smooth execution of work.

  The present invention has been made in view of the above points, and provides an information processing apparatus, an information processing method, and an information processing program capable of relaxing the use restriction of the management information when the management information is transferred. Objective.

  In order to solve the above problems, the present invention provides an information transfer means for transferring information managed by the tree structure in the first information management means to the second information management means in order for each node, and in order to transfer the information. Processing target information storage means for storing information on the first node that is currently processed in the process, and parent information storage means for storing information on the parent node of the first node, The information transfer means assigns a node to the second information management means based on the information stored in the parent information storage means when a node corresponding to the parent node does not exist in the second information management means. It is characterized by creating.

  In such an information processing apparatus, it is possible to relax restrictions on the use of the management information when the management information is transferred.

  ADVANTAGE OF THE INVENTION According to this invention, the information processing apparatus, the information processing method, and information processing program which can ease the utilization restriction of the said management information at the time of transfer of management information can be provided.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. FIG. 1 is a diagram illustrating a configuration example of a document information conversion system according to the first embodiment. In FIG. 1, a document management apparatus 10d and a document management apparatus 10s (hereinafter collectively referred to as “document management apparatus 10”) are connected via a network such as a LAN (Local Area Network).

  The document management apparatuses 10d and 10s include a document management system 11d or 11s (hereinafter collectively referred to as “document management system 11”). The document management systems 11d and 11s are software that realizes a so-called database system for managing document information. In the present embodiment, an example will be described in which document information managed in the document management system 11d is transferred (including copying) to the document management system 11s. Note that the document management system 11d and the document management system 11s differ in the management mode of document information, that is, the format or configuration of the document information (hereinafter referred to as “document format”).

  FIG. 2 is a diagram for explaining a difference in document format between the two document management systems. In the drawing, the left side shows the document information (document information S) of the document management system 11s as the transfer source, and the right side shows the document information (document information D) of the document management system 11d as the transfer destination. As shown, document information is managed in a tree structure (hierarchical structure).

  In the document management system 11 s, the tree node type is classified as one of “cabinet”, “folder”, and “document”. The name of each node of the document management system 11d is indicated by an attribute “name”. Each node has the serial number of the node and the serial number of the parent node. The serial number is a unique number for each node type. Therefore, folders and documents having the same serial number can exist, but these are distinguished by the type of node. Note that the child folder has a higher serial number than the parent folder. Among sibling folders, the smaller serial number is called the older brother folder and the larger serial number is called the younger folder.

  The meaning of the type of each node is the same as that in a known document management system, so details are not mentioned here. A plurality of cabinets can be defined in the document management system 11s. That is, a plurality of tree structures can be configured.

  On the other hand, in the document management system 11d, the type of the node of the tree is classified into either “folder node” or “document node”. The name of each node is indicated by an attribute “name”.

  As described above, the two document management systems 11 differ in the definition of node type, the configuration of bibliographic information in each node, and the like. Therefore, the document management apparatus 10d includes a converter 12. The converter 12 performs conversion from a document format (hereinafter referred to as “document format D”) in the document management system 11s to a document format (hereinafter referred to as “document format D”) in the document management system 11d. The document information D in FIG. 2 shows the result of converting the document information D.

  In this embodiment, an example in which the transfer destination (document management apparatus 11d) is provided with the converter 12 will be described. However, the converter 12 may be provided in the transfer source (document management apparatus 11s).

  FIG. 3 is a diagram illustrating a configuration example of the converter according to the first embodiment. In the figure, the function of the converter 12 and information (holding information) held in the converter 12 for realizing the function are shown.

  The function of the converter 12 is realized by a document information acquisition unit 121, a document information conversion unit 122, a document information registration unit 123, a mapping table 124, and the like. The document information acquisition unit 121 acquires document information from the document management system 11s. The document information conversion unit 122 performs conversion from the document format S to the document format D for the acquired document information. The document information registration unit 122 registers the document information converted into the document format D in the document management system 11d. Note that the document information conversion unit 122 refers to (uses) the mapping table 124 when converting the document format.

  FIG. 4 is a diagram illustrating a configuration example of the mapping table. In the figure, as the mapping table 124, an attribute mapping table 124a and a node mapping table 124b are illustrated. In the attribute mapping table 124a, the correspondence relationship between the attribute (bibliographic information) in the transfer source document information and the attribute in the transfer destination document information is registered. In the figure, it is shown that the “name” in the transfer source corresponds to the “name” of the transfer destination. In the node mapping table 124b, the correspondence between the node types of the transfer source and the transfer destination is registered. In the figure, it is shown that the cabinet, folder, and document at the transfer source correspond to the folder node, folder node, and document node at the transfer destination, respectively. That is, various correspondences regarding differences in document formats are registered in the mapping table 124.

  The holding information includes processing target information 125, original parent information 126, destination parent information 127, processing waiting stack 128, and the like, and is physically stored in the memory device 103. The processing target information 125 is a variable for holding information (name, folder or document classification, parent information, etc.) related to the processing target node. The original parent information 126 is a variable for holding information related to a parent node that is a transfer source of a node that is basically a processing target. The pre-parent information 127 is a variable for holding information related to the parent node of the transfer destination of the node that is basically the processing target. The process waiting stack 128 is a stack type variable used in a parent node re-creation process described later.

  The hardware configuration of the document management apparatuses 10d and 10s (document management apparatus 10) will be described. FIG. 5 is a diagram illustrating a hardware configuration example of the document management apparatus according to the embodiment of the present invention. The document management apparatus 10 of FIG. 5 is configured to include a drive device 100, an auxiliary storage device 102, a memory device 103, a CPU 104, and an interface device 105 that are connected to each other by a bus B.

  A program for realizing processing in the document management apparatus 10 is provided by a recording medium 101 such as a CD-ROM. When the recording medium 101 on which the program is recorded is set in the drive device 100, the program is installed from the recording medium 101 to the auxiliary storage device 102 via the drive device 100. The auxiliary storage device 102 stores the installed program and also stores necessary files and data.

  The memory device 103 reads the program from the auxiliary storage device 102 and stores it when there is an instruction to start the program. The CPU 104 executes functions related to the document management apparatus 10 in accordance with a program stored in the memory device 103. The interface device 105 is used as an interface for connecting to a network.

  Hereinafter, a processing procedure executed by the converter 12 will be described. In the present embodiment, it is assumed that the document information of the transfer destination document management system 11d can be edited even during conversion (transfer). In order to facilitate understanding of the processing procedure, in the present embodiment, the following document information managed by the document management system 11s will be described as a conversion (transfer) target.

  FIG. 6 is a diagram showing a configuration of document information to be converted in the description of the processing procedure. In the document information S shown in the figure, there is one folder (folder 1) under the Root cabinet. Under folder 1, there are two folders (folder 2 and folder 3). Under the folder 2, there is one folder (folder 4) and one document (document 1). Under the folder 3, there are two documents (documents 2 and 3). The number added to the end of each name indicates the serial number of the folder or document.

  FIG. 7 is a flowchart for explaining an outline of processing by the converter according to the first embodiment. Here, an example will be described in which all the one cabinet and lower in the document information S are converted. Note that the initial values of the processing target information 125, the original parent information 126, the destination parent information 127, and the processing waiting stack 127 are empty.

  First, a root cabinet in the document management system 11s is created in the document management system 11d (S101). Subsequently, loop processing L1 is executed for all nodes belonging to the Root cabinet. First, a node to be processed is determined, and information (bibliographic information or the like) related to the node is acquired in the processing target information 125 (S102). When the processing target information 125 can be acquired (YES in S103), a node related to the processing target information 125 is created in the document management system 11d (S104). If the node related to the processing target information 125 is a folder (YES in S105), the contents of the processing target information 125 are stored in the original parent information 126 (S106), and the created node information (bibliography) on the document management system 11d side is stored. Information etc.) is stored in the pre-parent information 127 (S107). On the other hand, when the node related to the processing target information 125 is a document (NO in S105), steps S106 and S107 are not executed, and the values of the original parent information 126 and the destination parent information 127 are not updated.

  When the processing is completed for all the nodes belonging to the cabinet, or when an interruption instruction is input midway, the process exits the loop L1. When an interruption instruction is input (YES in S108), an interruption file is created in the auxiliary storage device 102 of the document management apparatus 11d, and information regarding the root cabinet is recorded in the interruption file (S109). Thereby, the user can confirm which cabinet has failed to be converted.

  Next, the cabinet conversion process in step S101 will be described. FIG. 8 is a flowchart for explaining the cabinet conversion processing in the first embodiment.

  In step S151, the document information acquisition unit 121 acquires cabinet information from the document management system 11s (S151), and stores the acquired information in the original parent information 126 (S152). At this time, a value is stored in the original parent information 126 for the first time. Subsequently, the document information conversion unit 122 converts the information stored in the original parent information 126 based on the mapping table 124 (S153). Subsequently, the document information registration unit 123 checks whether or not a node (root folder node) indicating the information after conversion exists in the document management system 11d (S154). This confirmation may be performed by executing a search for the node with respect to the document management system 11d.

  If there is no node after conversion (YES in S154), the document information registration unit 123 registers the node in the document management system 11d (S155), and stores information about the created node in the pre-parent information 127 ( S156).

  On the other hand, when the converted node exists (NO in S154), the document information registration unit 123 acquires information regarding the node from the document management system 11d (S157), and stores the acquired information in the pre-parent information 127. (S158).

  At the time when the process of FIG. 8, ie, step S101 in FIG. 7 is completed, the value of the information held in the converter 12 is as follows. FIG. 9 and FIG. 10 are diagrams illustrating the transition of the transfer destination node and the value of the held information in accordance with the conversion process.

  In the figure, for each node creation completion time point (S101, S104 or S107) and each processing object information acquisition processing end time point (S102), a figure indicating the node created in the transfer destination document management system 11d and the holding information The value of is shown. The point in time when the cabinet is created is indicated by (1) in the figure. That is, a node corresponding to the root cabinet is generated, and information regarding the root node is stored for both the original parent information 126 and the destination parent information 127. The original parent information 126 is stored in step S152 of FIG. The pre-parent information 127 is stored in step S156 or S158 of FIG. At this point, the processing target information 125 is still empty.

  Next, the processing target information acquisition process executed by the document information acquisition unit 121 in step S102 of FIG. 7 will be described. FIG. 11 is a flowchart for explaining processing target information acquisition processing by the document information acquisition unit according to the first embodiment. In this process, the node of the document information S that is the transfer source is searched until the condition of the loop L2 (whether the process target information 125 is acquired or the process target information 125 is empty) is satisfied. Although an example in which depth-first search is employed as an algorithm for searching for nodes is shown here, other algorithms may be employed.

  In step S201, it is determined whether or not a value is stored in the processing target information 125. Since the initial value is empty, the process proceeds to step S202 at first. In step S202, information on the child folder of the node related to the original parent information 126 having the smallest serial number is acquired. Currently, the node related to the original parent information 126 is “Root cabinet” (see FIG. 9A). Therefore, the information of “Folder 1” is acquired (see FIG. 6). If the child folder information can be acquired (YES in S205), the acquired information (here, the information of "Folder 1") is stored in the processing target information 125 (S209). Subsequently, the current original parent information 126 and the previous parent information 127 are added to the processing target information 125 (S210), and the loop L2 is exited. Accordingly, the processing target information 125 stores information on the transfer source and the transfer destination for the parent node along with the information on the node. Note that the holding information and the like at this time are as shown in (2) of FIG.

  Thereafter, when the processes in S104 to S107 in FIG. 7 are executed with the folder 1 as the processing target, the holding information and the like change as shown in FIG. 9 (3). That is, in S104, a folder 1 node is generated under the Root folder node, and the value of the processing target information 125 (folder 1) is stored in the original parent information 126 and the destination parent information 127 (S106, S107). In step S106, the processing target information 125 is stored in the original parent information 126 in order to advance the search in the depth direction.

  A case where the process of FIG. 11 is executed in the state of FIG. 9 (3) (hereinafter referred to as “Case A”) will be described. In this case, since the processing target information 125 is not empty (YES in S201), the process proceeds to step S203. In step S203, the type of the processing target node (the node related to the processing target information 125) is determined. If the node is a folder (here, the node is “folder 1”, which corresponds to this case), the process proceeds to step S204. In step S <b> 204, information on a node having a serial number larger than that of the node related to the processing target information 125 is acquired from the child folder of the node related to the original parent information 126. Currently, the node related to the original parent information 126 is “folder 1” (see FIG. 9 (3)). Therefore, the information of “Folder 2” is acquired (see FIG. 6). That is, when the processing target information 125 and the original parent information 126 indicate the same node, in step S204, information on the child folder of the node related to the processing target information 125 is acquired, and a search is performed in the depth direction.

  Thereafter, through the above-described steps 205, S209, and S210, the information of “Folder 2”, the original parent information 126, and the parent information 127 are stored in the processing target information 125, and the process exits the loop L2. The retained information at this point is as shown in (4) of FIG. Thereafter, by executing steps S104 to S107 in FIG. 7 with the folder 2 as a processing target, the holding information and the like change as shown in FIG. 9 (5). That is, in S104, a folder 2 node is generated under the folder 1 node.

  In this state, when the process of FIG. 11 is executed, the process is executed by the same path as the case A (pass in the flowchart). As a result, the folder 4 that is a child folder of the folder 2 is set as the processing target, and the retention information and the like at the time of exiting the loop L2 are as shown in FIG. Further, by executing steps S104 to S107 in FIG. 7 with the folder 4 as a processing target, the holding information and the like change as shown in FIG. 9 (7). That is, in S104, a folder 4 node is generated under the folder 2 node.

  Next, a case where the process of FIG. 11 is executed in the state of FIG. 9 (7) (hereinafter referred to as “case B”) will be described. In this case, the process is executed by the same path as in the case A from step S201 → S203 → S204 → S205. However, since there is no child folder in the folder 4 that is the node related to the original parent information 126 (here, the same as the processing target information 125) (NO in S205), the process proceeds to step S206. In step S206, the information of the child document having the smallest serial number among the child documents of the node related to the original parent information 126 (processing target information 125) is acquired. That is, since the search for the folder in the depth direction has failed, the document in the depth direction is searched. Currently, the node related to the original parent information 126 is the folder 4 and there is no child document. Therefore, it progresses to step S211 and it is determined whether the node which concerns on the former parent information 126 is Root (cabinet) (S211). Here, since it is not Root, it progresses to step S212 and updates the process target information 125 with the original parent information 126 (S212). Subsequently, the information of the transfer source parent node (folder 2) is acquired from the processing target information 125 (S213). The acquired information is stored in the original parent information 126 (S214). Subsequently, information on the parent node of the transfer destination is acquired from the processing target information 125 (S215), and the acquired information is stored in the parent information 127 (S216). The retained information and the like at this point are as shown in (8) of FIG. That is, steps S212 to S217 are processes for returning the search position to the parent node because the terminal (folder 4) has been reached in the depth direction. Subsequently, the process of FIG. 11 is recursively executed (S217).

  In step S213 and step S215, the information on the parent node of the transfer source or transfer destination can be acquired from the processing target information 125 because the information is always stored in the processing target information 125 (step S215). (See S210). Further, the content of the processing target information 125 in this step is updated by the original parent information 126 in step S212, but the content of the processing target information 125 is copied to the original parent information 126 (see FIG. 7 (see step S106 of FIG. 7), there is no change in this circumstance (the processing target information 125 stores information on the parent node of the transfer source or transfer destination).

  Next, a case where the process of FIG. 11 is recursively called in the state of FIG. 9 (8) (hereinafter referred to as “Case C”) will be described. In this case, the process proceeds to step S203, and the type of the processing target node in the processing target information 125 is determined. Since it is a folder here, the process proceeds to step S204, and an attempt is made to acquire information on the brother folder of the node to be processed. Here, since there is no younger brother folder in folder 4 (NO in S205), the process proceeds to step S206, and information on the child document having the smallest serial number among the child documents of the node (folder 2) related to the original parent information 126 Is acquired (S206). Therefore, the information of document 1 is acquired here. When the information of the child document is acquired (YES in S208), the acquired information of the child document (here, the information of “Document 1”) is stored in the processing target information 125 (S209). Subsequently, step S210 is executed, and the loop L2 is exited. Accordingly, the retained information and the like at this time are as shown in (9) of FIG. Further, when S104 in FIG. 7 is executed with document 1 as a processing target, the node configuration of the transfer destination changes as shown in FIG. 9 (10). That is, in S104, the document 1 node is generated under the folder 2 node.

  Next, a case where the process of FIG. 11 is executed in this state (hereinafter referred to as “case D”) will be described. In this case, the process proceeds to step S207 via steps S201 and S203. In step S207, an attempt is made to acquire information of a document having a serial number larger than that of the document related to the processing target information 125 (that is, a brother document of the processing target document). Here, since there is no younger brother document of document 1 (No in S208), the search position is returned to the parent in steps S212 to S216. Accordingly, the retained information and the like at this point are as shown in (11) of FIG. In this state, the process of FIG. 11 is recursively called (S217).

  Next, a case where the process of FIG. 11 is recursively called in the state of FIG. 9 (11) will be described. In this case, the process proceeds to step S204 via steps S201 and S203, and information on the brother folder (folder 3) of the processing target node (folder 2) is acquired. That is, when the processing target information 125 and the original parent information 126 indicate different nodes, in step S204, information on the brother folder of the node related to the processing target information 125 is acquired, and a search is performed in the width direction.

  Thereafter, through Steps 205, S209, and S210, the information of “Folder 3”, the original parent information 126, and the parent information 127 are stored in the processing target information 125, and the process exits the loop L2. The retained information at this time is as shown in (12) of FIG. Thereafter, when the processes in S104 to S107 in FIG. 7 are executed with the folder 3 as the processing target, the holding information and the like change as shown in FIG. 10 (13). That is, in S104, a folder 3 node is generated under the folder 1 node.

  Next, the case where FIG. 11 is executed in the state of FIG. In this case, through the same path (S201 → S203 → S204 → S205 → S206 → S208 → S209 → S210) as in the case C (the state of FIG. 9 (8)), the document 2 information and the like are stored in the processing target information 125. , Exit the loop L2. Accordingly, the retained information and the like at this point are as shown in (14) of FIG. Further, when S104 in FIG. 7 is executed with document 2 as a processing target, the node configuration of the transfer destination changes as shown in FIG. 10 (15). That is, in S104, the document 2 node is generated under the folder 3 node.

  Next, the case where the process of FIG. 11 is executed in the state of FIG. In this case, the process proceeds to step S207 via steps S201 and S203. In step S207, information on the brother document (document 3) of the document to be processed (document 2) is acquired. Subsequently, steps S209 and S210 are executed, and the loop L2 is exited. Accordingly, the retained information and the like at this point are as shown in FIG. Further, by executing S104 in FIG. 7 with document 3 as a processing target, the node configuration of the transfer destination changes as shown in FIG. 10 (17). That is, in S104, the document 3 node is generated under the folder 3 node.

  Next, the case where the process of FIG. 11 is executed in the state of FIG. In this case, steps S212 to S216 are executed as in case D (the state of FIG. 9 (10)), and the search position is returned to the parent. Accordingly, the retained information and the like are as shown in FIG. 10 (18), and the process of FIG. 11 is recursively called (S217). Also in the recursive call, S212 to S216 are executed, and the search position is returned to the parent. Therefore, the retained information and the like are as shown in FIG. 10 (19), and the processing of FIG. 11 is recursively called (S217).

  Next, a case where the process of FIG. 11 is called in the state of FIG. In this case, the process proceeds to step S211 via S201, S203, S207, and S208. Here, since the original parent information 126 points to Root (NO in S211), the processing target information is emptied (S218), and the loop L2 is exited. Accordingly, the retained information and the like are as shown in FIG. In this case, in the process of FIG. 7, NO is determined in step S103, and further, since all the nodes are completed, the loop L1 is exited.

  Next, the processing target information registration processing in step S104 of FIG. 7 will be described. FIG. 12 is a flowchart for explaining processing object information registration processing according to the first embodiment.

  In step S251, the document information conversion unit 122 converts the information stored in the processing target information 125 based on the mapping table 124. Subsequently, the document information registration unit 123 checks whether or not a node indicating the converted information exists in the document management system 11d (S253). When there is a node after conversion (NO in S252), the document information registration unit 123 acquires information related to the node from the document management system 11d (S253). In this case, the information acquired here is stored in the pre-parent information 127 in step S107 of FIG.

  On the other hand, when the converted node does not exist (YES in S252), the document information registration unit 123 creates the node in the document management system 11d based on the converted information (S254). If the creation is successful (YES in S255), the process ends. In this case, the converted information generated in step S251 is stored in the pre-parent information 127 in step S107 of FIG.

  If creation of the node after conversion fails (NO in S255), the document information registration unit 123 executes processing for recreating the parent node of the node related to the processing target information 125 in the document management system 11d as the transfer destination ( S256). After the parent node is reproduced, the process of FIG. 12 is recursively called for the current process target information 125 again. That is, here, a description will be given assuming that the cause of node creation failure is limited to the absence of a parent node. In the present embodiment, the transfer destination document management system 11d can be edited even during conversion. In the present embodiment, the conversion is performed in order from the parent. Therefore, the parent node that has already been converted may be deleted or moved by the user's editing. Step S256 is executed for the occurrence of such a situation.

  Next, the parent node re-creation process in step S256 of FIG. 12 will be described. Here, a case will be described as an example in which the folder 3 is deleted on the document management system 11d in the state where FIG. 10 (14) (until the creation of the folder 3) is completed.

  FIG. 13 is a diagram for explaining the transition of the transfer destination node and the holding information in the re-creation process of the parent node. In the figure, (14) corresponds to FIG. 10 (14). Here, by deleting the folder 3, the node configuration of the transfer destination is as shown in (15). However, since the deletion of the folder 3 is executed by the document management system 11d based on an input by the user, the information held in the converter 12 is not affected. Therefore, (15) the document information registration unit 123 tries to create a child node of the folder 3 (here, document 2 node), but fails because there is no folder 3 (NO in S255 of FIG. 12). Therefore, a re-creation process (S256) of the parent node (folder 3) is executed.

  FIG. 14 is a flowchart for explaining parent node re-creation processing by the document information registration unit in the first embodiment. The flowchart will be described with reference to FIG. Therefore, the state at the start of the flowchart is as shown in FIG.

  First, the loop L3 is executed. In step S301, the process target information 125 is copied (accumulated) to the process waiting stack 128 (see FIG. 3). Subsequently, the original parent information 126 is copied to the processing target information 125 (S302). At this time, the state of the retained information is as shown in FIG. 13 (16). Subsequently, the information of the parent node (folder 1) of the node (folder 3) related to the processing target information 125 is searched from the document management system 11s of the transfer source (S303). Subsequently, the retrieved information is stored in the original parent information 126 (S304). Subsequently, a node corresponding to the original parent information 126 is searched from the transfer destination document management system 11d (S305). If retrieved, the retrieved information is stored in the pre-parent information 127 (S306), and the loop L3 is exited. If no search is made, the loop L3 is not left and the parent node is further searched. That is, in the loop L3, the process goes back to the remaining ancestors of the nodes that were originally processed. At this time, processing target information 125 at the time of the loop is accumulated in the processing waiting stack 128. Here, the holding information at the time of exiting the loop L3 is as shown in FIG. 13 (17). As is clear from this, the processing target information 125 stores information on nodes that have been deleted.

  Subsequently, the loop L4 is executed until the contents of the process waiting stack 128 become empty. In step S307, a node (folder 3 node) corresponding to the node related to the processing target information 125 is recreated in the document management system 11d. Strictly speaking, a node is generated based on information obtained by converting the processing target information 125 by the document information conversion unit 122. By the re-creation, the node configuration of the transfer destination becomes as shown in FIG.

  Subsequently, the processing target information 125 is stored in the original parent information 126 (S308). Subsequently, the information related to the node recreated in the document information conversion unit 122 is stored in the parent information 127 (S309). Subsequently, the information accumulated from the processing waiting stack 128 is popped (taken out in the reverse order of the accumulation order) (S310), and the extracted information is stored in the processing target information 125 (S311). By repeating the loop L4 until the process waiting stack 128 becomes empty, all the ancestor nodes of the node that was originally processed are reproduced. In addition, about the reproduced folder, you may make it add a predetermined code | symbol to a name so that a user can identify it.

  FIG. 13 (18) is the same as the state before the folder 3 is deleted (FIG. 3 (14)). Therefore, by executing step S257 of FIG. 12 in this state, the node that was the initial processing target is appropriately created.

  By the way, in step S252 of FIG. 12, a case where a node corresponding to the processing target information 125 has already been created is planned. Such a situation occurs, for example, when the node is created at the transfer destination by the user during conversion, or when processing is interrupted and then restarted during conversion. Hereinafter, each case will be described.

  First, a case will be described in which a node to be processed has already been created in accordance with a user operation during conversion. FIG. 15 is a diagram for explaining transition of a transfer destination node and holding information when a processing target node has already been created. Here, a case where a folder 3 node is created on the document management system 11d in the state (12) in FIG. 9 (corresponding to (12) in FIG. 9) will be described as an example. When the folder 3 node is created under the folder 1 based on the user's operation, the node configuration of the transfer destination is as shown in (13). When step S253 in FIG. 12 and steps S106 and S107 in FIG. 7 are executed, the holding information becomes as shown in (14). This state is the same as the state (13) in FIG. Therefore, the conversion can be performed by the processing procedure already described.

Next, a case will be described in which the conversion is resumed after the conversion is interrupted due to an instruction input by the user or a failure. Here, the case where the configuration of the document information to be converted is changed in the document management system 11s as the transfer source after the interruption is also considered. FIG. 16 is a diagram showing the structure of the document information of the transfer source at the time of resuming the conversion. As shown in FIG. 16, folder 1 (see FIG. 6) is replaced with folder 5 in FIG.

  Further, it is assumed that the node configuration of the transfer destination at the time of interruption is as shown in FIG. 9 (9). That is, the creation of folders 1, 2, and 4 has been completed.

  FIG. 17 is a diagram for explaining the transition of the transfer destination node and retained information when the conversion is resumed.

  When the conversion is resumed, the process of FIG. 7 is executed from the beginning. Therefore, the root cabinet creation process (S101, FIG. 8) is executed. Thereby, the information shown in (1) is stored in the former parent information 126 and the former parent information 127 (steps S152 and S158 in FIG. 8).

  Subsequently, by executing step S102 (that is, FIG. 11), information on the folder 5 immediately below the root is stored in the processing target information 125. Accordingly, the retained information and the like at the time of completion of step S102 are as shown in (2).

  Subsequently, the holding information and the like change as shown in (3) by executing S104 to S107 of FIG. That is, in S104, a folder 5 node is generated under the Root folder node, and the value of the processing target information 125 (folder 5) is stored in the original parent information 126 and the destination parent information 127.

  The state (3) corresponds to the folder 1 in the state (3) in FIG. Therefore, the node configuration of the transfer destination is as shown in FIG. 17 (4) by the same processing as the processing executed after the state (3) in FIG. That is, a new node is created separately from the node created before the interruption.

  Next, a second embodiment will be described. FIG. 18 is a diagram illustrating a configuration example of a document information conversion system according to the second embodiment. In FIG. 18, the same parts as those in FIG.

  In FIG. 18, the document management apparatus 10 s that is the transfer source includes an exporter 13. In addition, the document management apparatus 10 d that is the transfer destination includes an importer 14. The exporter 13 is software that outputs the document information of the document management system 11 s to the conversion file 15 and the conversion processing order file 16. The conversion file 15 is created in units of nodes, and bibliographic information after conversion to the document format D is stored for the nodes. The conversion processing order file 16 is a file in which the processing order of the conversion file 15 is recorded. Specifically, the file name of the convert file 13 is described in the order of processing.

  The importer 14 is software that constructs document information (node configuration) exported to the document management system 11 d based on the conversion file 15 and the conversion processing order file 16.

  That is, in the second embodiment, since the conversion is executed through the conversion file 15 or the like, the document management apparatuses 10s and 10d do not necessarily have to be connected via a network. However, the convert file 15 and the like may be transferred via a network.

  FIG. 19 is a diagram illustrating a configuration example of an exporter and an importer according to the second embodiment. In the figure, for each of the exporter 13 and the importer 14, the function and information (holding information) held by each for executing the processing for realizing the function are shown.

  The function of the exporter 13 is realized by a document information acquisition unit 131, a document information conversion unit 132, a conversion file creation unit 133, a mapping table 135, and the like. Among these, the functions of the document information acquisition unit 131, the document information conversion unit 132, and the mapping table 135 are the same as those of the document information acquisition unit 121, the document information conversion unit 122, and the mapping table 125 in FIG. The conversion file creation unit 133 outputs the document information converted into the document format D to the conversion file 15 and the conversion processing order file 16.

  The information held by the exporter 13 includes processing target information 13, original parent information 136, a previous export end date 137, and the like. The roles of the processing target information 13 and the original parent information 136 are the same as those of the processing target information 125 and the original parent information 126 in FIG. The previous export end date and time 137 holds the end date and time of the previous export process. The previous export end date 137 is recorded in a nonvolatile recording medium (for example, the auxiliary storage device 102).

  On the other hand, the function of the importer 14 is realized by the conversion processing order list creation unit 141, the conversion file import unit 142, and the like. The conversion processing order list creation unit 141 analyzes the conversion processing order file 16 and creates information (conversion processing order list) indicating the processing order of the conversion file 15. The convert file import unit 142 creates a node in the document management system 11 d based on the convert file 15.

  The information held by the importer 14 includes a conversion processing order list 143, processing target information 144, parent information 145, processing waiting stack 146, and the like, and is physically stored in the memory device 103. The conversion process order list 143 is a variable for storing the conversion process order list created by the conversion process order list creating unit 141. The roles of the processing target information 144, the parent information 145, and the processing waiting stack 146 are the same as those of the processing target information 125, the parent information 127, and the processing waiting stack 128 in FIG.

  Hereinafter, a processing procedure in the second embodiment will be described. FIG. 20 is a flowchart for explaining an outline of processing by the exporter in the second embodiment.

  First, the convert file 15 of the root cabinet in the document management system 11s is created (S501). Subsequently, loop processing L11 is executed for all nodes belonging to the cabinet. First, a node to be processed is determined, and information regarding the node is acquired in the processing target information 135 (S502). If the processing target information 135 has been acquired (YES in S503), the node conversion file 15 related to the processing target information 135 is created (S504). When the node related to the processing target information 135 is a folder (YES in S505), the contents of the processing target information 135 are stored in the original parent information 136 (S506).

  When processing is completed for all the nodes belonging to the cabinet, or when an interruption instruction is input during the process, the process exits the loop L11. If an interruption instruction is input (YES in S507), an interruption file is created in the auxiliary storage device 102 of the document management apparatus 11d, and information about the root cabinet is recorded in the interruption file (S508). On the other hand, if not interrupted (NO in S507), the current date and time are recorded in the previous export end date and time 137.

  Next, the cabinet conversion file creation processing in step S501 will be described. FIG. 21 is a flowchart for explaining a process of creating a convert file for a cabinet in the second embodiment.

  The document information acquisition unit 131 acquires cabinet information from the document management system 11s (S551), and stores the acquired information in the original parent information 126 (S552). Subsequently, the document information conversion unit 132 converts the information stored in the processing target information 125 based on the mapping table 134 (S553). Subsequently, the conversion file creation unit 133 creates the conversion file 15 and outputs the converted information to the created conversion file 15 (S554). Note that the file name of the convert file 15 may be determined based on the name of the node, for example. Subsequently, the conversion file creation unit 133 writes the file name of the conversion file 15 in the conversion processing order file 16 (S555).

  Next, the processing target information acquisition processing executed by the document information acquisition unit 131 in step S502 of FIG. 20 will be described. FIG. 22 is a flowchart for explaining processing target information acquisition processing by the document information acquisition unit according to the second embodiment. The processing procedure of FIG. 22 is almost the same as the processing procedure of FIG. Accordingly, in FIG. 22, steps corresponding to those in FIG. 11 are denoted by the same step numbers.

  However, FIG. 22 differs in that the processing subject is the document information acquisition unit 131 and that the processing target information 135 and the original parent information 136 are used as retained information. In FIG. 22, steps S215 and S216 are not executed. This is because the exporter 13 does not handle information corresponding to the parent information 127. Similarly, in step S210, only the original parent information 136 is added to the processing target information 135.

  If a value is recorded in the previous export end date and time 137, the nodes to be processed are limited to those created or updated after the previous end date and time.

  Next, the conversion file creation process in step S504 of FIG. 20 will be described. FIG. 23 is a flowchart for explaining a conversion file creation process according to the second embodiment.

  In step S <b> 601, the document information conversion unit 132 converts the information stored in the processing target information 135 based on the mapping table 134. Note that the processing target information 135 includes not only the processing target node but also its parent node information (see S210 in FIG. 22). Therefore, the parent node information is also converted here. Subsequently, the conversion file creation unit 133 creates a new conversion file 15 and outputs the converted information to the created conversion file 15 (S602). Accordingly, not only the processing target node but also the information of the parent node is output to the conversion file 15. Subsequently, the conversion file creation unit 133 adds the file name of the conversion file 15 to the end of the conversion processing order file 16 (S603).

  Next, a processing procedure by the importer 14 will be described. FIG. 24 is a flowchart for explaining the processing procedure by the importer in the second embodiment. The processing shown in FIG. 11 is executed after the conversion file 15 and the conversion processing order file 16 created by the exporter 13 are stored in the auxiliary storage device 102 of the document management apparatus 11d via the recording medium or the network. In the second embodiment, the document management system 11d can edit the document information not only while the process of FIG. 20 is being executed but also while the process of FIG. 24 is being executed. .

  First, the conversion process order list creation unit 141 reads the conversion process order file 16 (S701). A list of file names is stored in the conversion processing order list 143 based on the description order of the file names described in the conversion processing order file 16 (S702).

  Subsequently, the convert file import unit 142 executes a loop L12 for all the file names recorded in the conversion process order list 143. In step S703, the conversion file import unit 142 reads one conversion file 15 according to the order of the conversion processing order list 143, stores the node information related to the conversion file 15 in the processing target information 144, and stores the parent node of the parent node. Information is stored in the pre-parent information 145. Subsequently, the node (parent node) related to the pre-parent information 145 is searched from the document management system 11d (S704). When the parent node is searched (YES in S705), a node related to the processing target information 144 is created under the parent node (S707). When the creation is successful (YES in S708), the next conversion file 15 in the conversion processing order list 143 is the processing target.

  On the other hand, if the node creation has failed (NO in S708), the convert file import unit 142 determines the type of the node (folder node or document node) based on the processing target information 144 (S709). If the type of the node is a document node, the convert file import unit 142 determines whether there is a registration failure document folder in the document management system 11d (S710). Here, the registration failure document folder refers to a folder for storing documents that have failed to be registered, and is created in a predetermined location (for example, directly under the root folder node) on the document management system 11d.

  If there is no registration failure document folder (YES in S710), the convert file import unit 142 creates a registration failure document folder in a predetermined location on the document management system 11d (S711). Subsequently, the convert file import unit 142 generates a document node that has failed to be created (registered) under the registration failure document folder based on the processing target information 145 (S712). In other words, the document node is accompanied by actual data of the document which is an important asset. Therefore, it is not preferable that the document entity is lost due to the failure of the document node. Therefore, the document node that failed to be registered is registered under the registration failure document folder, and the actual document data is registered in the document node.

  On the other hand, if the search of the parent node fails in step S705 (S705), the process proceeds to step S706 except for the case where the processing target is a Root node, and the conversion file import unit 142 executes the parent node re-creation process (S706). ). Thereafter, step S707 and subsequent steps are executed.

  The case where the parent node cannot be searched corresponds to, for example, the case where the parent node is deleted or moved by the user during the import process, as described in the first embodiment.

  Next, the parent node re-creation process in step S706 will be described. FIG. 25 is a flowchart for explaining parent node re-creation processing by the conversion file import unit according to the second embodiment. The processing procedure of FIG. 25 is almost the same as the processing procedure of FIG. Therefore, in FIG. 25, steps corresponding to those in FIG. 14 are denoted by the same step numbers.

  However, FIG. 25 is different in that the processing subject is the convert file import unit 142 and that the processing target information 144, the parent information 145, and the processing waiting stack 146 are used as retained information. In FIG. 25, steps S303, S304, and S308 are not executed. This is because the importer 114 does not handle information corresponding to the original parent information 126. Further, in step S305a, the document management system 11d retrieves information on the parent node of the node related to the processing target information 144. Others may be the same as in FIG.

  As described above, according to the document information conversion system in the present embodiment, in the process of sequentially transferring the nodes of the document information, if there is no parent node or ancestor node of the node to be transferred, the parent information Regenerate the node or ancestor node. Therefore, even when an arbitrary node is deleted or moved at the transfer destination, it is possible to appropriately transfer the document information. If a node that is a transfer target already exists at the transfer destination, the transfer related to the node is skipped and the next node is set as a transfer target. Therefore, even if an arbitrary node is created during the transfer at the transfer destination, the document information can be transferred appropriately. Therefore, even during transfer, the user can be permitted to edit the document information of the transfer destination.

  Note that the present invention can also be applied to transfer that does not involve conversion of document information (document format conversion) (for example, transfer in which each node is copied in order). Further, the present invention may be applied when transferring document information within a single apparatus. Furthermore, information applicable to the present invention is not limited to document information. Any information managed by a tree structure can be applied to various types of information.

  As mentioned above, although the Example of this invention was explained in full detail, this invention is not limited to such specific embodiment, In the range of the summary of this invention described in the claim, various deformation | transformation・ Change is possible.

It is a figure which shows the structural example of the document information conversion system in 1st embodiment. It is a figure for demonstrating the difference of the document format in two document management systems. It is a figure which shows the structural example of the converter in 1st embodiment. It is a figure which shows the structural example of a mapping table. It is a figure which shows the hardware structural example of the document management apparatus in embodiment of this invention. It is a figure which shows the structure of the document information made into conversion object in description of a processing procedure. It is a flowchart for demonstrating the process outline by the converter in 1st embodiment. It is a flowchart for demonstrating the conversion process of the cabinet in 1st embodiment. It is a figure which shows the transition of the value of the node of a transfer destination according to conversion processing, and holding | maintenance information. It is a figure which shows the transition of the value of the node of a transfer destination according to conversion processing, and holding | maintenance information. It is a flowchart for demonstrating the acquisition process of the process target information by the document information acquisition part in 1st embodiment. It is a flowchart for demonstrating the registration process of the process target information in 1st embodiment. It is a figure for demonstrating the transition of the node of a transfer destination in the case of the re-creation process of a parent node, and holding information. It is a flowchart for demonstrating the re-creation process of the parent node by the document information registration part in 1st embodiment. It is a figure for demonstrating the transition of the node of a transfer destination at the time of the node of a process target being created, and holding | maintenance information. It is a figure which shows the structure of the document information of the transfer origin at the time of resumption of conversion. It is a figure for demonstrating the transition of the node of a transfer destination at the time of restarting conversion, and holding | maintenance information. It is a figure which shows the structural example of the document information conversion system in 2nd embodiment. It is a figure which shows the structural example of the exporter and importer in 2nd embodiment. It is a flowchart for demonstrating the process outline | summary by the exporter in 2nd embodiment. It is a flowchart for demonstrating the conversion file creation process of the cabinet in 2nd embodiment. It is a flowchart for demonstrating the acquisition process of the process target information by the document information acquisition part in 2nd embodiment. It is a flowchart for demonstrating the creation process of the conversion file in 2nd embodiment. It is a flowchart for demonstrating the process sequence by the importer in 2nd embodiment. It is a flowchart for demonstrating the re-creation process of the parent node by the convert file import part in 2nd embodiment.

Explanation of symbols

10d, 10s Document management device 11d, 11s Document management system 12 Converter 13 Exporter 14 Importer 100 Drive device 101 Recording medium 102 Auxiliary storage device 103 Memory device 104 CPU
105 Interface Device 121 Document Information Acquisition Unit 122 Document Information Conversion Unit 123 Document Information Registration Unit 131 Document Information Acquisition Unit 132 Document Information Conversion Unit 133 Convert File Creation Unit 135 Mapping Table 141 Conversion Processing Order List Creation Unit 142 Convert File Import Unit B Bus

Claims (9)

Information transfer means for transferring the information managed by the tree structure in the first information management means to the second information management means in order for each node;
Processing target information storage means for storing information about the first node that is currently being processed in the process of being sequentially transferred;
Parent information storage means for storing information about the parent node of the first node;
The information transfer means sends a node to the second information management means based on information stored in the parent information storage means when a node corresponding to the parent node does not exist in the second information management means. An information processing apparatus characterized by creating   The information transfer means, when there is no node corresponding to the parent node of the parent node in the second information management means, the information corresponding to the ancestor node of the parent node, the node corresponding to the ancestor node Obtained from the first information management means until it is searched by the second information management means and stored in the storage means, and the information stored in the storage means is taken out in the reverse order of the storage order, and based on the extracted information The information processing apparatus according to claim 1, wherein a node is created in the second information management unit.   The information transfer means, when the node corresponding to the first node exists in the second information management means before transferring the first node, information stored in the processing target information storage means 3. The information processing apparatus according to claim 1, wherein a node is not created in the second information management unit based on the information. An information processing method executed by a computer,
An information transfer procedure for transferring the information managed by the tree structure in the first information management means to the second information management means in order for each node;
A processing target information storage procedure for storing information about the first node that is currently being processed in the process of being sequentially transferred;
A parent information storage procedure for storing information on a parent node of the first node;
The information transfer procedure is configured such that when the node corresponding to the parent node does not exist in the second information management means, the information is transferred to the second information management means based on the information stored in the parent information storage procedure. An information processing method characterized by creating   In the information transfer procedure, when a node corresponding to the parent node of the parent node does not exist in the second information management means, the information related to the ancestor node of the parent node is transmitted to the node corresponding to the ancestor node. Obtained from the first information management means until it is searched by the second information management means and stored in the storage means, and the information stored in the storage means is taken out in the reverse order of the storage order, and based on the extracted information 5. The information processing method according to claim 4, wherein a node is created in the second information management means.   In the information transfer procedure, when the node corresponding to the first node exists in the second information management means before transferring the first node, the information stored in the processing target information storage procedure 6. The information processing method according to claim 4, wherein a node is not created in the second information management means based on the method. Computer
Information transfer means for transferring the information managed by the tree structure in the first information management means to the second information management means in order for each node;
Processing target information storage means for storing information about the first node that is currently being processed in the process of being sequentially transferred;
Function as a parent information storage means for storing information related to the parent node of the first node;
The information transfer means sends a node to the second information management means based on information stored in the parent information storage means when a node corresponding to the parent node does not exist in the second information management means. An information processing program characterized by creating   The information transfer means, when there is no node corresponding to the parent node of the parent node in the second information management means, the information corresponding to the ancestor node of the parent node, the node corresponding to the ancestor node Obtained from the first information management means until it is searched by the second information management means and stored in the storage means, and the information stored in the storage means is taken out in the reverse order of the storage order, and based on the extracted information 8. The information processing program according to claim 7, wherein a node is created in the second information management means.   The information transfer means, when the node corresponding to the first node exists in the second information management means before transferring the first node, information stored in the processing target information storage means 9. The information processing program according to claim 7, wherein a node is not created in the second information management means based on the information.

Images