JP2008225545A - History display system and method thereof - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a history display system capable of managing a file and a folder, especially, a history display system capable of applying the number of versions to the file and a folder; and to provide a method thereof. <P>SOLUTION: The history display system includes: accepting the instruction of the revision-up of a designated node; finishing the expiration date of the designated node to update the node of a node management and recording means 121; increasing the number of versions of the designated node to prepare the node applied with the identifier of a new node whose expiration period is started; recording it in the node management and recording means 121; finishing the expiration period of a string connected to the designated node to update the string of a string management and recording means 131; starting the expiration date of the string for connecting the prepared node to the master node of the designated node; and recording it in a string management and recording means 131. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a history display system for managing files and folders, and more particularly, to a history display system and method for assigning version numbers to files and folders.

  For managing files and folders, file management software is used. In general file management software, a configuration is adopted in which files are arranged in folders constituting a group of folders having a tree structure. In such file management software, if a file is corrected and saved, it is overwritten, so that the user needs to change the file name if the user wants to keep the file before correction.

  In this way, if the user keeps the past revision file through the user's operation, it becomes difficult for the user to grasp the derivation relationship between the files. In order to solve this problem, an information processing apparatus that displays a derivation relationship between files created by revising and rewriting is disclosed in Patent Document 1 below.

The information processing apparatus of this patent document 1 creates and manages an electronic file, and corresponds to the file path creating means for creating a file path indicating a derivation relationship between the files, and the file and the file path. And a file path holding means for holding in the storage device and a derivation relation display means for displaying the derivation relation on the display device based on the file path.
JP 2005-316815 A

According to the information processing apparatus of Patent Document 1, a file path indicating a derivation relationship between files is created, the file is associated with the file path, and the derivation relationship is displayed on the display device based on the file path. The visual recognition degree of the derivation relationship between them can be improved.
However, since the information processing apparatus of Patent Document 1 is configured as described above, there is a problem that only the derivation relationship between files is displayed and the derivation relationship of folders cannot be shown.

  Accordingly, the present invention has been made to solve the above-described problems, and an object of the present invention is to provide an information processing apparatus and a method for indicating a derivation relationship between files and folders.

  FIG. 1 is a diagram for explaining the principle of the history display system of the present invention (revision up and display at a specified revision). An example is shown in which the user revisions the folder “yyyy0001” of the version number “3” in the tree display of FIG. When the user designates the folder “yyyy0001” and instructs the revision up, a window for prompting a comment of a new version number is displayed (FIG. 1 (2)). The history display system creates a node with the version number incremented by 1 at the designated node. In addition to the version number, the node holds a comment and a creation date (FIG. 1 (3)). Here, only the version number of the designated node is incremented by 1, and even if the designated node has a lower node, the version number does not increase. Next, when the user selects an arbitrary node and instructs to display the history, a list of revisions of the node selected by the user is displayed in a list (FIG. 1 (4)), and the user can also select a revision in the list. Is specified. When a revision is designated, revision nodes including the designated node in the designated revision and nodes below this node are displayed as a tree (FIG. 1 (5)). In this way, the revision node at the specified revision can be displayed as a part of the latest tree display.

  FIG. 2 is a diagram for explaining the principle of the present invention (copying a specified revision node and creating a link). FIG. 2A shows a revision node at a revision already designated by the user. The node specified at the time of the history display instruction is “yyyyy0001”. In the tree display state of FIG. 2A, the user gives an instruction to copy “yyyyyy0001”. Here, it is assumed that “JJJyyyyyy0001” is designated as the copy destination and the copy of “yyyyyy0001” as the copy source is instructed. Then, as shown in FIG. 2 (2), the revision node “yyyyyy0001” of the copy source is copied. Here, not the latest revision node is copied, but the revision node is copied with the contents of the revision displayed in the history display. This avoids the inconvenient task of displaying the entire tree of the old revision separately in another window, copying the revision node of the specified node from it, and pasting it to the copy destination in the original window Can do. In addition to reducing the work of the user, it is possible to perform a copy operation within one tree display, so that the operation can be performed with high visibility. The copied revision node and the copied revision node have no dependency, and even when the node constituting one revision node is deleted, the node constituting the other revision node is not deleted in conjunction ( (See FIG. 2 (3)). Next, it is assumed that the user instructs link creation instead of the copy instruction. Similarly, it is assumed that “JJJJyyyyyy0001” is designated as the link source and the link creation of the link destination “yyyyyy0001” is instructed. Then, as shown in FIG. 2 (4), the link of the revision node “yyyyyy0001” of the link destination is created. Here, it is not the latest revision node that is linked, but a revision node is created with the contents of the revision displayed in the history display. Similarly, it is possible for the user to easily perform a link creation instruction with high visibility. There is a dependency relationship between the revision node that is created and the revision node that created the link, and by creating the node that constitutes the revision node that is created, the link of the corresponding node that constitutes the revision node that created the link is linked. Will be deleted.

(1) Revision Upgrade A history display system according to the present invention connects a node management recording means for recording a node having a node identifier, a node name, a node version number, and a node expiration date, and a parent node and a child node. A history display system including a string management recording unit that records a string for including the expiration date of a string, and a control unit that reads a specified node and a string connected to the node and displays the string as display information, Receiving an instruction to upgrade the specified node, updating the node of the node management recording means by terminating the expiration date of the specified node, increasing the version number of the specified node, and increasing the node expiration date Create a node with the identifier of the new node that was started, record it in the node management recording means, and the validity period of the string connected to the specified node The string is updated by updating the string in the string management recording means, and the string for connecting the created node and the parent node of the designated node starts the expiration date and is recorded in the string management recording means. is there.

  As described above, in the present invention, the node before the revision up and the string connected to the node are not deleted and retained, and the node after the revision up and the string related to the node are newly recorded. Therefore, there is an effect that the information of the configuration tree of any revision of any node can be acquired.

(2) Revision list In the history display system according to the present invention, the node has a node management record having, as an original node identifier, an identifier of a node having a version number one version earlier than its own version number as necessary. Means to receive the instruction of the revision list of the designated node, obtain the identifier of the designated node, obtain the original node identifier of the node that is the identifier of the obtained node, The node having the node identifier as the node identifier is acquired from the node management recording means, and the original node identifier of the acquired node is acquired.

  Thus, in the present invention, a node has not only a version number but also an original node identifier, and a node having the original node identifier as a node identifier is obtained from the original node identifier of the designated node. After that, nodes with version numbers earlier than the specified node are acquired repeatedly until a node with the initial version number is acquired, so it is possible to perform a revision list using all the acquired nodes It has the effect. Further, by specifying a node having the designated node as the original node identifier from the node management recording means, it is also possible to obtain a node having a version number later than the designated node. It is possible to determine whether the version is the first version based on whether the version number of the node is the initial value, and whether it is the latest version based on whether the expiration date of the node includes the current version. A list of revisions from the first version to the latest version can be obtained for the node.

(3) Configuration Display at Instructed Revision The history display system according to the present invention accepts a configuration display instruction at the designated revision of the designated node as necessary, and designates at the designated revision. The acquired node is acquired, a node satisfying the expiration date of the acquired node is specified from the string management recording unit as a lower node with respect to the acquired node, and the specified lower node is acquired from the node management recording unit.

As described above, in the present invention, not only the node specified by the designated revision is acquired, but also the lower level node that satisfies the expiration date of the acquired node is used among the lower level nodes of the acquired node. Thus, since the specified lower node is acquired, it is possible to acquire information for displaying the history configuration tree at the specified revision of the designated node.
In particular, it is desirable to specify the revision by displaying the revision list in a selectable manner for the user.

  The node satisfying the expiration date of the acquired node corresponds to a node having an expiration date including the expiration date start time of the acquired node in the embodiment described later, but only the expiration date start time of the acquired node. Any time within the validity period of the acquired node (expiration time end time, validity period intermediate time, etc.) may be used.

In the history display system according to the present invention, the expiration date of the designated node includes the present.
As described above, since the expiration date of the designated node includes the current time, the information for displaying the latest history configuration tree can be obtained. In particular, when the designated node is the root node, it is possible to acquire information for displaying the latest information for all nodes.
The history display system according to the present invention uses the acquired specified node acquired, the lower node of the specified node, and the string used for specifying the lower node as display information as necessary. It is.

(4) Deletion of node The history display system according to the present invention accepts an instruction to delete a designated node as necessary, and manages a string including the designated node as a child node and an expiration date including the present. It is specified from the recording means, the expiration date of the specified string is ended, and the string management recording means is updated.
As described above, in the present invention, since the expiration date of the latest string having the specified node as a child node is terminated instead of deleting the node from the node management recording means, the node of the specified node is deleted even after the node is deleted. This has the effect that the configuration can be displayed at the specified revision.

The history display system according to the present invention records, as necessary, a deletion node as a parent node, a node designated at the time of the deletion instruction of the node as a child node, and a string whose expiration date has started in the string management recording means Is.
As described above, in the present invention, since the deleted node is connected to the deleted node by the string, there is an effect that the deleted node can be easily specified.

(5) Copying a node The history display system according to the present invention receives a copy instruction by specifying a copy source node and a copy destination node as needed, and copies the copy source node and lower nodes. The node identifier is set as a new identifier, the expiration date of the node is started, the version number of the node is set as an initial value, the node is recorded in the node management recording unit, and the specified node and the lower order of the specified node are recorded. Starts the expiration date of the string for connecting the copied node based on the string for connecting the node, records it in the string management recording means, and sets the copy destination node as the parent node, corresponding to the specified node The string with the copied node as a child node is recorded in the string management recording means by starting the expiration date.

  As described above, the present invention has an effect that copying can be performed while maintaining the configuration of the copy source node and the lower nodes of the node. In particular, when the information of the history configuration tree at the designated revision is acquired for the designated node using the configuration display at the designated revision (3), the designated node is used as the copy source. When a copy instruction is received, a revision node of a past version number can be copied.

(6) Link of node The history display system according to the present invention records the string as a link management recording means having a link flag indicating the presence / absence of a link node, and links the link destination node and the link as necessary. A link instruction is received by specifying an original node, the link source node is a parent node, the link destination node is a child node, and a string with the link flag is started to expire and string management records It is recorded on the means.

  As described above, the present invention has an effect that copying can be performed while maintaining the configuration of the link destination node and the nodes below the node. In particular, when the information of the history configuration tree at the designated revision is acquired for the designated node using the configuration display at the designated revision (3), the designated node is set as the link destination. When a link instruction is received, a link can be created for a revision node of a past version number.

(7) Movement of Node The history display system according to the present invention receives an instruction to move to a node as a movement destination of a node as a designated movement source as necessary, and uses the movement source node as a child node. , Updating the string management recording means by ending the expiration date of the string having the parent node of the movement source as the parent node,
A string having the move destination node as a parent node and the move source node as a child node starts an expiration date and is recorded in the string management recording means.

  As described above, the present invention has an effect that it is possible to move the source node and the subordinate nodes of the node while maintaining the configuration. In particular, when the information of the history configuration tree at the designated revision is acquired for the designated node by using the configuration display at the designated revision (3), the designated node is set as the movement source. When a move instruction is received, it is possible to move to a revision node of a past version number.

Although the inventions (1) to (7) have been described as a history display system, it can be understood as a history display method as will be apparent to those skilled in the art.
These outlines of the invention do not enumerate the features essential to the present invention, and a sub-combination of these features can also be an invention.

(First embodiment of the present invention)
[1. System configuration]
FIG. 3 is a system configuration diagram and a computer hardware configuration diagram of the history display system according to the present embodiment.
The history display system according to the present embodiment includes a history display server 100 and a history display client 400. The history display server 100 is constructed on the computer 10, while the history display client 400 is constructed on the computer 40. The computer 10 and the computer 40 can communicate with each other via a LAN (Local Area Network). The LAN here is an example, and it is apparent to those skilled in the art that a network configuration other than that shown in FIG. 3 can be adopted.

  As shown in FIG. 3, the computer 10 in which the history display server 100 is constructed includes a CPU (Central Processing Unit) 11, a RAM (Random Access Memory) 12, a ROM (Read Only Memory) 13, and an HDD (Hard Disk Drive) 14. , A CD-ROM drive (Compact Disk Read Only Memory Drive) 15, a mouse 21, a keyboard 22, a display 23, a speaker 24, and a LAN interface 31, and adopts a general computer configuration by well-known and conventional techniques. The computer of FIG. 3 is exemplary. The computer 40 on which the history display client 400 is constructed also has a hardware configuration similar to that of the computer 10, for example.

  The history display server 100 is constructed by installing a history display server program in the computer 10 and is activated by loading the history display server program. The history display client 400 is also constructed by installing a history display client program in the computer 40, and is activated by loading the history display client program. However, the history display client 400 can be realized by, for example, a general-purpose browser (WWW browser) function. In this case, it is not necessary to install a history display client program. Note that the history display system according to the present embodiment is realized regardless of the configuration of the client server system that does not use the WWW system, the configuration of the WWW system, or the configuration of the client server system that uses the WWW system. Can do.

FIG. 4 is a block diagram of the history display system according to this embodiment.
[1.1 History display server]
The history display server 100 includes server control means 110, node management means 120, node management table information 121, string management means 130, string management table information 131, reception means 140, transmission means 150, and current display information 160.
The server control unit 110 receives various user requests sent from the history display client 400 via the receiving unit 140, and operates the node management table information 121 using the node management unit 120 in response to the various user requests. In addition, the string management table information 131 is operated using the string management means 130, the current display information is updated as necessary, and the updated current display information is transmitted to the history display client 400 via the transmission means 150. It is a function.

  The server control unit 110 includes a creation unit 111, a deletion unit 112, a movement unit 113, a copy unit 114, a link unit 115, a revision upgrade unit 116, a revision list unit 117, and a designated revision display unit 118. The creation unit 111 is a function for performing processing for creating a node designated by the user. The deletion unit 112 has a function of deleting a node designated by the user. The moving unit 113 has a function of moving a node designated by the user to a designated destination. The copy unit 114 has a function of copying a node designated by the user to a designated copy destination. The link means 115 is a function for creating a link of a node designated by the user at the link source. The revision up means 116 is a function for updating the revision of the node designated by the user. The revision list means 117 is a function for listing all revisions of the node designated by the user. The designated revision display means 118 is a function for displaying the configuration at the designated revision of the designated node.

  The node management unit 120 performs data operations (search, insert, update, delete) on the node management table information 121. The node management table information 121 stores node information for representing files and folders.

  The string management means 130 performs data operations (search, insert, update, delete) for the string management table information 131. The string management table information 131 stores string information for connecting nodes. Although only the node can be read by using the node management table information 121, the interrelationship with other nodes becomes unclear when only the node is used. Therefore, a tree display is realized by using a string indicating the mutual relationship between nodes.

  The node management table information 121 and the string management table information 131 are usually configured by a database. Since the general technical description of the data manipulation is a conventional technique in the technical field of databases, the details are omitted.

  The receiving unit 140 has a function of receiving information from the history display client 400. The transmission unit 150 has a function of transmitting information to the history display client 400.

  The current display information 160 is information for displaying a tree display displayed on the current history display client 400. The current display information 160 includes a node read from the node management table information 121 via the node management unit 120 and a string read from the string management table information 131 read via the string management unit 130.

[1.2 History display client]
The history display client 400 includes an input unit 410, a client control unit 420, a display unit 430, a transmission unit 440 and a reception unit 450.
The input unit 410 is a function that receives an instruction from a user via an input device such as a mouse or a keyboard.
The client control unit 420 transmits the instruction from the user to the history display server 100 using the transmission unit 440 in order to realize the instruction from the user via the input unit 410, and the processing result from the history display server 100. Is received via the receiving means 450, the current display information 460 is updated with the received processing result, the updated current display information 460 is converted into display information and sent to the display means 430.
The display unit 430 converts the display information from the client control unit 420 into an electrical signal that matches the display specifications and outputs the electrical signal.

[1.3 Management table]
FIG. 5 shows a data model of the management table according to this embodiment.
The node management table information 121 has fields of identifier, name, type, version number, version number comment, original node identifier, expiration date start date and expiration date end date. The identifier is an identifier for identifying a node. The name is the name of the node. The node type indicates a file or a folder. The version number is the revision of the node. The version comment is a comment from the user when updating to the revision of the node. The original node identifier is an identifier of a node having a version number one before the self version number. The expiration date / time and the expiration date / time indicate the period of the expiration date. Indicates how long the node is valid.

  The string management table information 131 includes fields for a parent node identifier, a child node identifier, an expiration date / time, an expiration date / time, and a reference flag. A string connecting nodes connects a parent node and a child node. The reference flag is not set by default, and is set when the parent node connects to the link node.

  When a plurality of users use it, the node management table information 121, the string management table information 131, and the current display information 160 need to be identifiable for each user. For example, user identification information is added to each record of the node management table information 121, the string management table information 131, and the current display information 160.

[2. Operation]
[2.1 Node creation]
FIG. 6 is a flowchart of node creation using the management table according to the present embodiment.
The user gives an instruction to the history display client 400 via an input device such as a mouse or a keyboard of the computer 40 in which the history display client 400 is constructed. The input unit 410 receives an instruction from the user via the input device.
In general, the user uses the history display client 400 after authentication, but the authentication process uses a well-known / conventional technique, and thus the description thereof is omitted.

  After the authentication, the history display client 400 displays a tree of the latest folder / file. Details will be described later in [2.4 Partial History Display at Specified Revision]. In the tree display state of the latest folder / file, when the user designates a parent node, a node type, and a node name of a node to newly create a node, the input unit 410 creates the node. The instruction is accepted. If the node is a file, a physical file is usually specified. As a general rule, a file has a physical file in principle, but in a PDM (Product Data Management) system or the like, a part that does not have a physical file is registered in order to register a part corresponding to a file without product information. This is because it may be created on the tree display.

  The client control unit 420 takes in a parent node, a node type, and a node name of a newly created node from the input unit 410, and sends a node creation request including the existing node, the node type, and the node name to the history display server 100. It transmits via the transmission means 440. If a physical file is specified in this node creation request, the physical file is also included.

  The history display server 100 receives a node creation request including a parent node, a node type, and a node name of a newly created node via the receiving unit 140.

The creation unit 111 of the server control unit 110 acquires the current time as the operation time (step S110).
The creation unit 111 determines whether or not the type of node related to the node creation request is a folder (step S115).

  If it is determined that the node type is not a folder, the creating unit 111 creates a new node whose node type is a file via the node managing unit 120, assuming that the node type is a file (step S120). . Here, the identifier of the new node is a value given by automatic numbering. The name is a node name related to the node creation request. The expiration date / time is the operation time acquired in step S110. The expiration date is the time representing the latest version number. In the present embodiment, the time representing the latest version number is set to a time “9999/12/31 — 23:59:59” that is difficult for the system to acquire as the current time in the future. By setting such a time, it can be identified as an acquirable time, and the expiration date is not scheduled to end. Since it is a new node, the version number is 1. When a new node is created in this way, the version number is 1. Therefore, the original node identifier is a value assigned by automatic numbering, which is its own identifier. The original node identifier is the identifier of the node of the previous version number, but the version number is 1 and there is no node of the previous version number. Since the node identifier is the same, it is used as its own identifier because it is possible to determine that it is the first edition.

  Next, the creation unit 111 creates a new string for connecting the node of the newly created file and the node of the parent folder via the string management unit 130 (step S125). Since this new string is a string for connecting to the parent node for the newly created file node, it becomes a higher string. Here, the identifier of the parent node of the newly created node related to the node creation request is set as the identifier of the parent node. The identifier of the child node is the identifier of the created new node. The expiration date is the operation time acquired in step S110. The expiration date is a time representing the latest version number.

Next, the creating unit 111 determines whether a physical file exists in the node creation request (step S130).
If it is determined that the physical file exists, the creation unit 111 copies the corresponding physical file, stores it in the node management table information 121 via the node management unit 120 (step S135), and ends. If the node management table information 121 is associated with the corresponding node record, the node management table 121 can be recorded.
If it is determined in step S130 that no physical file exists, the process ends.

  If it is determined in step S115 that the node type is a folder, the creation unit 111 creates a new node whose node type is a folder via the node management unit 120 (step S140). Here, since each field value of the node record stored in the node management table information 121 is the same as that in step S120, the description is omitted.

  Next, the creation unit 111 creates a new string for connecting the newly created folder node and the parent folder node via the string management unit 130 (step S145). Here, since each field value of the record stored in the string management table information 131 is the same as that in step S125, the description is omitted.

  Next, the creating unit 111 determines whether or not there is a child node in the parent folder node of the folder to be newly created according to the node creation request (step S150). A child node is a node immediately below the node. The presence / absence of a child node can be determined by the presence / absence of a string record that uses the identifier of the node of the parent folder as the identifier of the parent node.

  If it is determined that the child node is in the parent folder of the newly created folder, the creation unit 111 updates the string record using the corresponding child node as the child node identifier via the string management unit 130. (Step S155). Here, the expiration date of the string record to be updated is set as the operation time acquired in step S110. As a result, the old configuration of the parent node and the child node having no new node before the operation time is saved.

  Next, the creation unit 111 creates a new string for connecting the node of the folder newly created via the string management unit 130 and the node that was a child node of the parent node (step S160). Here, the identifier of the newly created node is the identifier of the parent node. The identifier of the child node is the identifier of the corresponding child node. The expiration date is the operation time acquired in step S110. The expiration date is the time representing the latest version number.

  Next, it is determined whether or not the creation unit 111 has processed steps S155 and S160 for all the child nodes of the parent node related to the node creation request. If not, the process returns to step S155. If so, exit.

  When the processing of the flowchart of FIG. 6 ends, the server control unit 110 updates the current display information 160 with the node record of the node management table information 121 and the string record of the string management table information 131 that have been inserted and updated. Next, the server control unit 110 transmits the update of the current display information 160 as a processing result to the history display client 400 via the transmission unit 150. The client control unit 420 of the history display client 400 updates the current display information 460 with the received processing result, and maintains the sameness as the current display information 160 of the history display server 100. The client control unit 420 creates display information based on the updated current display information and sends it to the display unit 430. The display means 430 outputs the captured display information as an electrical signal that meets the specifications of the display. The display is displayed according to the output electrical signal. Up to this point, the details of the operation of the client server system have been described for the creation of the node. However, in the process of subsequent revisions, etc., the user uses the history display client 400 to instruct and request the history display server 100. Are the same as the operation until the reception of the processing result in the history display client 400 after the processing according to the request in the history display server 100 is performed until the processing result is received and displayed. Omitted except when taking

  7 and 8 are examples of folder creation using the management table according to the present embodiment. FIG. 7A illustrates an example in which the user instructs creation of a folder “FolderA” to a virtual node “FakeNode” serving as a root. In accordance with step S140, a new node record is inserted into the node management table information 121. Further, according to step S145, a new string record is inserted into the string management table information 131. FIG. 7B is an example when the user instructs the creation of the folder “FolderB” immediately below the folder “FolderA” created earlier. Similarly, a new node record is inserted into the node management table information 121 according to step S140. Further, according to step S145, a new string record is inserted into the string management table information 131. FIG. 8 is an example when the user instructs the creation of the folder “FolderC” between the created folders “Folder A” and “Folder B”. In accordance with step S140, a new node record is inserted into the node management table information 121 (“insert 1” in FIG. 8). Further, according to step S145, a new string record is inserted into the string management table information 131 (“insert 2” in FIG. 8). Furthermore, according to step S155, the string record of the string management table information 131 is updated ("update 3" in FIG. 8). Furthermore, according to step S160, a new string record is inserted into the string management table information 131 (“insert 4” in FIG. 8).

  FIG. 9 is an example of file creation using the management table according to the present embodiment. FIG. 9A is an example when the user instructs creation of the file “DocA” immediately below the folder “FolderC” created earlier. In accordance with step S120, a new node record is inserted into the node management table information 121. Further, according to step S125, a new string record is inserted into the string management table information 131. FIG. 9B is an example when the user instructs the creation of “DocB”, which is a file, in “FolderC”, which is a folder in which “DocA”, which is the file created earlier, is stored. Similarly, records are inserted into the node management table information 121 and the string management table information 131 in accordance with step S120 and step S125.

[2.2 Revision upgrade]
FIG. 10 is an example of a user revision-up instruction in the history display client according to the present embodiment.
In the current folder / file tree display state, the user issues a revision-up instruction by designating the node and type of node to be revised. As shown in FIG. 10, a pop-up menu is displayed by designating a folder as a pointer in a window displaying a folder / file tree and right-clicking the mouse. By clicking “upgrade version” (left) on the displayed pop-up menu, the user designates the revision target node and the node type for revision up to the history display client 400 and instructs the revision up. Become. As shown in FIG. 10, the user can also input a comment for revision up when the revision up instruction is given. If the node is a file and there is a physical file, the physical file is also specified.

  The history display server 100 receives a revision upgrade request specifying a node and a node type to be revised from the user via the history display client 400. If the node is a file and there is a physical file, the physical file is also accepted.

FIG. 11 is a flowchart of node revision upgrade according to this embodiment.
The creation unit 111 of the server control unit 110 acquires the current time as the operation time (step S210).
The creation unit 111 determines whether or not the node type related to the revision upgrade request is a folder (step S215).
If it is determined that the node type is not a folder, the revision upgrade unit 116 updates the node record of the node to be upgraded through the node management unit 120, assuming that the node type is a file (step S220). The expiration date of this node record is the operation date and time of step S210.

  Next, the revision upgrading means 116 acquires the version number as the current version number from the node record of the node to be upgraded in the node management table information 121 (step S225). This version number may be acquired from the current display information 460 or from the current display information 160 via the history display client 400 instructed by the user to update the revision directly.

  Next, the revision upgrade unit 116 creates a new node record whose node type is a file via the node management unit 120 (step S230). Here, the identifier of the new record is a value obtained by automatic numbering. The names are the same by referring to the record of the node management table information 121 updated in step S220. The expiration date / time is the operation time acquired in step S210. The expiration date is the time representing the latest version number. The version number is a value obtained by incrementing the version number acquired in step S230 by one. The original node identifier is the identifier of the node record updated in step S220. As a result, it is possible to easily identify the record of the version number before the record currently created.

  Next, the revision up means 116 identifies the string record including the time representing the latest version number using the identifier of the node record updated in step S220 via the string management means 130 as the child node identifier, and the identified record Is updated (step S235). Here, the field to be updated is the expiration date and time, and is the operation time acquired in step S210. As a result, the connection relationship between the node that is the latest revision-up target before the revision upgrade and a node that uses this node as a child node is saved.

  Next, the revision upgrade unit 116 creates a new string for connecting the node of the newly created file and the parent folder via the string management unit 130 (step S240). Here, the identifier of the parent node of the new string record is the same as the identifier of the parent node of the record in step S235. The child node identifier is the identifier of the new node created in step S230. The expiration date / time is the operation time acquired in step S210. The expiration date / time is the time representing the latest version number. The reference flag is “FALSE”.

Next, the revision upgrade unit 116 determines whether a physical file exists in the revision upgrade request (step S245).
If it is determined that the physical file exists, the revision upgrade unit 111 copies the corresponding physical file, stores it in the node record of the newly created node via the node management unit 120 (step S250), and ends. .
If it is determined in step S245 that no physical file exists, the process ends.

  If it is determined in step S215 that the node type is a folder, the revision upgrade unit 116 updates the node management table information 121 for the node to be upgraded via the node management unit 120 (step S255). . Next, the revision upgrading means 116 acquires the version number as the current version number from the node record of the node to be upgraded in the node management table information 121 (step S260). Next, the revision upgrade unit 116 creates a new node record whose node type is a folder via the node management unit 120 (step S265). Since the processing in step S255, step S260, and step S265 corresponds to step S220, step S225, and step S230 when the node type is a file, description of the field value of the record is omitted. This is because the node types are the same as the file and folder except that the file does not have a node immediately below, but the folder has a node immediately below. The processing based on the difference is processing of a string record that connects a newly created folder and a node that is a child node of the parent folder. In other words, not only the upper string of the processing target folder but also the lower string. It is also necessary to process for. In step 235 and step S240, the node type is a file and the upper string is updated and created, but here the lower string is also updated and created. Specifically, step S270 and step S275 described below are executed. Here, the update of the string is saving of the connection relationship between the parent node and the child node.

  The revision upgrade means 116 provides an upper string for connecting the parent folder and the node to be upgraded via the string management means 130 and a lower string for connecting the node to be revised and the child node. Update (step S270). The update of the upper string is a time when the node record identifier updated by the revision upgrade unit 116 via the string management unit 130 is used as the child node identifier, and the expiration date and time represents the latest version number. This is done by specifying the string record and updating the specified string record. Here, the field to be updated is the expiration date and time, and is the operation time acquired in step S210. The update of the lower string is performed by using the identifier of the node record updated by the revision upgrade unit 116 in step S255 via the string management unit 130 as the identifier of the parent node, and the expiration date and time indicating the latest version number. This is done by specifying a string record that is and updating the specified string record. Here, the field to be updated is the expiration date and time, and is the operation time acquired in step S210. By these processes, the upper string connecting the node to be upgraded and the parent node of this node, and the lower string connecting the node to be upgraded and the child node of this node are stored.

  Next, the revision string created by the revision upgrade means 116 via the string management means 130 is connected to the higher string and revision folder for connecting the parent folder of this folder and the child node of this folder. A lower string is created for this purpose (step S275). Here, the identifier of the parent record in the new higher string record is the same as the identifier of the parent node in the updated higher string record in step S270. The child identifier is the identifier of the new node created in step S265. The expiration date / time is the operation time acquired in step S210. The expiration date / time is the time representing the latest version number. The reference flag is “FALSE”. The identifier of the child record in the new lower string record is the same as the child node identifier in the updated lower string string record in step 270. The parent identifier is the identifier of the new node created in step S265. The expiration date / time is the operation time acquired in step S210. The expiration date / time is the time representing the latest version number. The reference flag is “FALSE”. When step S275 is processed, the process ends.

  FIG. 12 is an example of revision up (folder) using the management table according to the present embodiment. FIG. 12A is an example when the user instructs to update the revision of “FolderB” which is a folder on the tree. In accordance with step S255, the node record of the node to be upgraded in the node management table information 121 is updated. Further, in accordance with step S265, a node in which the revision target node of the node management table information 121 is upgraded is inserted. Further, in accordance with step S270, the string record for connecting the revision target node of the string management table information 131 and its parent node, and the string record for connecting the revision target node and its child node are updated. (Updating the upper string is update 1 in FIG. 12, and updating the lower string is update 2 in FIG. 12). Furthermore, in accordance with step 275, the node of the string management table information 131 whose revision is to be updated is connected to the higher string string record for connecting the node and the parent node, and the revised node and child node are connected. A string record of a lower string is inserted (the insertion of the upper string is insertion 3 in FIG. 12, and the insertion of the lower string is insertion 4 in FIG. 12). FIG. 12B is an example when the user instructs further revision of “FolderB” that has been revised up. Similar to the example of FIG. 12A, the node record and the string record are updated and inserted.

  FIG. 13 is an example of revision up (file) using the management table according to the present embodiment. FIG. 12B is an example when the user instructs to update the revision of “DocA” which is a file immediately under “FolderC” which is a folder on the tree. In accordance with step S220, the node record of the node whose revision is to be updated in the node management table information 121 has been updated. Further, in accordance with step S230, the node record of the node whose revision is updated in the node management table information 121 is inserted. Furthermore, in accordance with step S235, the string record of the upper string for connecting the parent node and the node to be upgraded in the string management table information 131 is updated. Furthermore, in accordance with step S240, a string record for connecting a parent node and a node whose revision target is updated in the string management table information 131 is inserted. FIG. 13B is an example when the user instructs further revision of “DocA” that has been revised up earlier. Similarly to the example of FIG. 13A, the node record and the string record are updated and inserted.

  FIG. 10 shows an example of the user's revision-up instruction in the history display client 400. In response to the instruction from the user, the history display server 100 performs processing, and the history display client 400 reflects the processing result. FIG. 14 shows the displayed state. FIG. 14 shows the version number obtained by incrementing the version number of the node of the folder designated in FIG. 10 by one.

[2.3 Revision list display]
The user issues a revision list display instruction by designating a node in the current folder / file tree display state.
The history display server 100 receives a revision list display request specifying a node from a user via the history display client 400.

FIG. 15 is a flowchart of the revision list display of the designated node according to the present embodiment.
The revision list unit 117 of the server control unit 110 acquires the identifier of the node that is the target of the revision list display request (step S310). If the node that is the target of the revision list display request is specified by an identifier, that identifier is used. Further, when the node that is the target of the revision list display request is specified by identification information such as a name, the current display information 160 and node management table information 121 of the history display server 100 are used using the identification information of the node. Alternatively, it is acquired from the current display information 460 of the history display client 400.

Next, the revision list means 117 acquires the original node identifier from the node record of the corresponding node based on the specified node identifier acquired via the node management means 120 (step S315).
Next, the revision list unit 117 acquires from the node management table information 121 a node record of a node having the original node identifier acquired via the node management unit 120 as an identifier (step S320).
Next, the revision list means 117 determines whether or not the identifier of the node record of the acquired node is equal to the original node identifier (step S325).

  If it is determined in step S325 that they are not equal, the process returns to step S320, and the node record of the node having the identifier of the original node identifier in the node record of the node acquired in step S320 is acquired.

  FIG. 16 shows an example of folder / file revision list display using management table information according to the present embodiment. FIG. 16A is an example of a case where an instruction to display a revision list of “FolderB” having a version number “3” which is a folder on the tree is shown. According to step 320, the node record of the node which is the previous version of the node designated by the user is acquired. By processing step S320 recursively in accordance with step S325, it is possible to acquire from the node record of the node of the latest version number to the node record of the node whose version number is “1”. Necessary information can be extracted from the records of all revisions of the acquired designated folder, and the revision list in the lower left part of FIG. 16A can be displayed. Here, the name and version number of the folder are acquired from each acquired node record and displayed in a list. The lower window in FIG. 14 is a revision list window. FIG. 16 (2) is an example when the revision list display of “DocA” of version “3” which is a file on the tree is instructed, and the node type is a file as compared to FIG. 16 (1). The description is omitted because it is only different.

[2.4 Partial history display at specified revision]
FIG. 17 shows an example of a configuration display instruction at the revision of the node designated by the user in the history display client according to the present embodiment.
In the same window as in Fig. 10, specify the node in the same procedure to display the pop-up menu, and click (history version) (left) for the specified node.

The processing of [2.3 revision list display] is performed, and the revision list window at the bottom right of FIG. 17 is displayed. When the user selects a revision of wear of the designated node and presses the “OK” button, a partial history display at the designated revision is instructed.
The history display server 100 receives a configuration display request specifying a node and revision from the user via the history display client 400.

FIG. 18 is a flowchart of the configuration display at the specified revision of the specified node according to the present embodiment.
The designated revision display means 118 of the server control means 110 acquires the identifier of the designated node that is the target of the configuration display request (step S410). An example of acquiring the identifier of this node is the same as that described in step S310.
The designated revision display unit 118 acquires the expiration date / time from the node record of the corresponding node based on the identifier of the specified node acquired through the node management unit 120 (step S415).

  The specified revision display means 118 has a validity period including the validity period start date and time acquired in step S415, in which the identifier of the parent node is the identifier of the node acquired in step S410 via the string management means 130 Is acquired (step S420).

  The designated revision display means 118 determines whether or not the corresponding node has a child node (step S425). Specifically, if the string record can be acquired in step S420, the corresponding node has a child node.

  When the designated revision display unit 118 determines that the corresponding node has a child node, the identifier of the child node is acquired from the node record of the node acquired in step S420 (step S435).

  Next, the designated revision display means 118 sets the acquired identifier of the child node as the corresponding node, and returns to step S415. By doing so, the following processing is performed as the identifier of the child node that has acquired its own identifier. However, the expiration date / time of step S415 is not changed.

  If it is determined in step S425 that there is no child node in the corresponding node, the designated revision display means 118 has not extracted the child node identifier in step S435 from the string record acquired in step S420. It is determined whether or not there is a string record (step S430). If it is determined that there is no string record that has not been extracted, the process ends. If it is determined that there is a record that has not been extracted, the process returns to step S435. By repeatedly performing the processing in this way, it is possible to acquire a lower node without giving any hierarchical structure in the lower direction from the node that is the target of the configuration display request.

  FIG. 19 is a history structure tree display of folders / files at the revision specified by the user using the management table information according to the present embodiment. FIG. 19 shows an example in which the structure display is instructed with the version number “2” of the folder “FolderB” on the tree. In step S420, a string record that satisfies the above condition is specified. The node of “FolderC” having the identifier “3”, which is the node that is the identifier of the child node in the identified string record, is acquired in accordance with step S415. In step S420 again, the string record including the expiration date and time is specified with “FolderC” of this identifier “3” as the parent node. The node of “DocA” with the identifier “4”, which is the node that is the identifier of the child node in the identified string record, is acquired according to step S415. According to step S420 again, the string record including the expiration date and time is specified with “DocA” having the identifier “4” as the parent node. However, there is no such string record, and it is determined in step S425 that there is no child node, and the process proceeds to step S430. In step S430, the string record of “DocB” with the identifier “5” is unprocessed. Steps S435 to S415 are executed, and similarly, the record of the node “DocB” with the identifier “5” is acquired. Through step S420 and step S425, it is determined that there is no child node in “DocB” with the identifier “5”, and in step S430, there is no unprocessed string record and the process ends.

  It is an expiration date including the records of the nodes with identifiers “6”, “3”, “4”, and “5” acquired so far, and the expiration date and time of the expiration date of the node that is the target of the configuration display request. "FolderB" with version number "2", "FolderC" with version number "1", "DocA" with version number "1", and version number " The configuration display composed of “DocB” of “1” is incorporated into the tree display of the folder / file when the configuration display is requested.

  FIG. 20 is an example of the configuration display at the revision of the node designated by the user in the history display client according to the present embodiment. As shown in FIG. 17, when the version number “4” of the node “fff444” is designated and the user issues a configuration display instruction, the configuration display in FIG. 20 is updated. The revision of the folder “fff444”, which is the node designated by the user, has changed from the version number “6” to the version number “4”.

  The configuration display at the specified revision of the specified node has been described above, but the latest tree display can be performed by the same procedure. However, the revision specified by the user at the time of the configuration display request is not specified, and in principle, “FakeNode”, which is a virtual node serving as the root node, becomes the designated node. In addition, the expiration date and time of the expiration date in step S415 is “9999/12/31 — 23:59:59”, which is the time representing the latest version number. By doing so, the latest node records and string records of all the nodes can be acquired from the root node. Although the designated node is the root node, if only the lower-level configuration including the node designated by the user is to be updated, this can be realized by making the node designated by the user the designated node. .

  21 and 22 show examples of the latest folder / file tree display using the management table information according to the present embodiment. In order to perform the tree display located at the left end of FIG. 21, in step S420, the identifier of the parent node is used as the identifier of the root node, and the string record that is the expiration date including the time representing the latest version number is specified. A node record is acquired about the child node in this string record through step S425, step S435, step S440, and step S415. Furthermore, the identifier of the record acquired in step S420 is used as the identifier of the parent node, and the string record that is the expiration date including the time representing the latest version number is specified. Thereafter, similarly, step S425, step S435, step S440, step S415, and step S420 are repeatedly processed to obtain all the latest node records and string records in the order of string record, node record,. By performing tree display using the acquired node record and string record, the tree display located at the left end of FIG. 21 can be realized. FIG. 21A shows that a string record including a root node (identifier “0”) is acquired, and a node record of a child node (identifier “1”) in the acquired string record is acquired. In FIG. 21 (2), a string record including the node record of the node (identifier “1”) acquired in FIG. 21 (1) is acquired, and a node record (identifier “6”) of the child node in the acquired string record is acquired. It shows that In FIG. 22 (3), the string record including the node (identifier “6”) acquired in FIG. 21 (2) is acquired, and the node record (identifier “3”) of the child node in the acquired string record is acquired. Show. 22 (4), a string record including the node (identifier “3”) acquired in FIG. 22 (3) is acquired, and node records (identifiers “4” and “5”) of child nodes in the acquired string record are acquired. It shows that The latest tree display can be executed by using the obtained node record and string record.

[2.5 Delete node]
The user issues a deletion instruction by designating a node in the current folder / file tree display state.
The history display server 100 receives a deletion request specifying a node from the user via the history display client 400.

FIG. 23 is a flowchart of node deletion using the management table according to this embodiment.
The deletion unit 112 of the server control unit 110 acquires the current time as the operation time (step S510).
The deletion management unit 112 uses the identifier of the node that is the target of the deletion request via the string management unit 130 as a child node identifier, and records the string record whose expiration date is the latest version number in the string management table information. The expiration date and time of the specified string record specified from 131 is updated as the operation time acquired in step S510 (step S515).

  The deletion unit 112 creates a new string record for connecting the deletion target node to the deletion target node via the string management unit 130 (step S520). Here, the identifier of the parent node is set as the identifier of the deleted node. Similarly to the root node, the deleted node is a virtually prepared node, and the deleted node can be specified by associating the deleted node with a string record. The identifier of the child node is the identifier of the node that is the target of the deletion request. The expiration date / time is the operation time in step S510. The expiration date / time is the time representing the latest version number. The reference flag is “FALSE”.

  FIG. 24 shows an example of file deletion using the management table according to this embodiment. FIG. 24 shows an example when the user gives an instruction to delete “DocA”, which is a file on the tree display. In accordance with step S515, the string record for the latest “DocA” node in the string management table information 131 is updated. In accordance with step S520, a new string record is inserted into the string management table information 131, and the parent node for the latest “DocA” node becomes the deletion node, which is in the deletion state. Since the latest “DocA” node does not have a node other than the deleted node as a parent node, the latest “DocA” is not displayed in the latest tree display.

  FIG. 25 is an example of folder deletion using the management table according to the present embodiment. FIG. 25 shows an example when the user gives an instruction to delete “FolderB” which is a folder on the tree display. In accordance with step S515, the string record for the latest “FolderB” node in the string management table information 131 is updated. In accordance with step S520, a new string record is inserted into the string management table information 131, and the parent node for the latest “FolderB” node becomes the deletion node, which is in the deletion state. Since the latest “FolderB” node does not have a node other than the deleted node as a parent node, the latest “FolderB” is not displayed in the latest tree display, and the latest “FolderB” is a lower node that is a higher node. Neither node is displayed.

[2.6 Copy node]
FIG. 26 shows a configuration (revision node) including a specified node and a lower tree while displaying the configuration at the revision of the node specified by the user in the history display client according to the present embodiment. It is the example copied to. When the user drags and drops the configuration including this node as a selected state, selection of copy, link, or movement is accepted. Here, it is assumed that a copy instruction is received from the user.

FIG. 27 is a flowchart for copying a revision node according to this embodiment to another node.
The copy means 114 of the history display server 100 receives a copy instruction from the user via the history display client 400, including the specification of the revision node to be copied and the copy destination node.

The copy unit 114 acquires the current time as the operation time (step S610).
The copy unit 114 acquires node records (node records of constituent nodes) of all the nodes of the revision node that is the copy source (step S615). The string record to be acquired is a string record whose constituent node is a parent node.
The copy unit 114 copies all the node records and string records of the acquired configuration nodes (step S620).

  The copy unit 114 inserts the copied node record and string record of the constituent node via the node management unit 120 (step S625). Here, all the expiration date start dates are set as operation times. Let the expiration date and time be the time representing the latest version number. The version number is “1”. An identifier is assigned by automatic numbering. The correspondence between the identifiers assigned by automatic numbering and the identifiers assigned by automatic numbering is temporarily held.

  The copy unit 114 creates a string record for connecting the top node of the copied component node and the copy destination node (processing 1 in step S630). The identifier of the parent node is set as the identifier of the copy destination node. The identifier of the child node is set to the identifier assigned by the automatic numbering in step S625. Let the expiration date and time be the operation time. Let the expiration date and time be the time representing the latest version number. In step S630, as the processing 2, the identifier before assignment in the string record of the copied component node is determined based on the correspondence between the identifier assigned by automatic number assignment and the identifier assigned by automatic number assignment. Is replaced with the identifier after giving, and a string record in which the identifier of the child node is replaced is inserted. As will be described later, step S630 is repeatedly processed via step S645, but process 1 is processed only when the top node of the configuration node is processed, and the nodes below the top node of the configuration node are processed. If so, only process 2 is performed.

  The copy unit 114 determines whether the node to be processed is a file and whether there is a physical file (step S635), and if it is a file and has a physical file, copies the physical file (step S640). .

  The copying unit 114 determines whether or not all of the copied configuration nodes have been processed when it is determined that it is not so at Step S635 and when Step S640 is processed. If not completed, the process returns to step S625.

  When the user instructs copying, the revision node is copied to the designated copy destination as shown in FIG. When the copy source revision is specified and displayed, the copy is made with the specified revision. However, as shown in FIG. 26 (2), the display specifying the revision is temporary, and the tree of the latest revision can be obtained by selecting “Update Tree” from the pop-up menu to display the latest tree. Return to display. Here, the contents of the copied revision node are not changed. For example, in FIG. 26A, the folder “ffff444” is designated by the version number “4” to display a partial history, and the folder “ffff444” of this revision is copied below the folder “eeee”. At this time, when the latest tree display is performed, the version number of the folder “ffff444” is “6” which is the latest version number, and the contents of the folder “ffff444” copied under the folder “eeee” are the version number “4”. "".

  28 and 29 are examples of copying using management table information according to the present embodiment. FIG. 28 shows an example in which the user designates “DocA” as a file and instructs another node “AnotherNode” to copy. In this case, the configuration node is only “DocA”, and the node record of the configuration node is acquired and copied. Then, the copied node record is inserted into the node management table information 121, and a string record for connecting the copied node “AnotherNode” and the copied node is also inserted. By operating in this way, the tree display in the lower left of FIG. 28 is obtained. FIG. 29 shows an example in which the user designates a folder “FolderB” and instructs another node “AnotherNode” to copy. In this case, the configuration nodes are “FolderB”, “FolderC”, “DocA”, and “DocB”. The node record and string record of this constituent node are acquired and copied. First, the copied node record of “FolderB” is inserted into the node management table information 121, a string record for connecting the copied node “AnotherNode” and the copied node is created, and “FolderB” is set as the parent node. Is replaced with a newly assigned identifier. Next, the copied node record of “FolderA” is inserted into the node management table information 121, the string record having “FolderA” as a parent node or a child node is replaced with a newly assigned identifier, and “FolderA” is replaced with “FolderA”. A string record as a child node is inserted. Next, the copied node record of “DocA” is inserted into the node management table information 121, the string record having “DocA” as a parent node or a child node is replaced with a newly assigned identifier, and “DocA” is replaced with “DocA”. A string record as a child node is inserted. Next, the copied node record of “DocB” is inserted into the node management table information 121, the string record having “DocB” as a parent node or a child node is replaced with a newly assigned identifier, and “DocB” is replaced with “DocB”. A string record as a child node is inserted. By operating in this way, the tree display in the lower left of FIG. 29 is obtained.

[2.7 Node links]
FIG. 30 is a flowchart of link execution of a revision node according to this embodiment to another node.
FIG. 26 illustrates a case where the user selects a link instead of a copy. The link means 115 of the history display server 100 receives the link instruction from the user via the history display client 400, including the designation of the link destination node and the link source node. For example, a link destination node is dragged and dropped onto a link source node to indicate a link.

The linking means 115 acquires the current time as the operation time (step S710).
The link means 115 acquires the identifier of the link destination node (step S715). The method for obtaining the identifier of the specified node has already been explained.
The linking means 115 acquires the identifier of the link source node (step S720).

  The link means 115 creates a string record for connecting the link destination node and the link source node (step S725). Here, the identifier of the parent node is the identifier of the link source node. The identifier of the child node is the identifier of the link destination node. The expiration date and time is the operation time. Let the expiration date and time be the time representing the latest version number. Set the link flag to “TRUE”. With this link flag, it is possible to identify whether it is an actual node or a node indicating a link.

  31 and 32 are examples of file link creation using the management table according to the present embodiment. FIG. 31 shows an example in which the user instructs the folder “AnotherNode” to create a link for the file “DocA”. There is no change in the node management table 121. A string node having a reference flag “TRUE” with the identifier of the link source node “AnotherNode” as the identifier of the parent node and the identifier of the link destination node “DocA” as the identifier of the child node is created. When the reference flag is “TRUE”, the system can recognize that it is a node for the link. By operating in this way, the tree display in the lower left of FIG. 31 is obtained. Here, it is desirable to reveal that the node is a link node by changing an icon or the like. FIG. 32 illustrates an example in which the user instructs the folder “AnotherNode” to create a link of the revision node of the folder “FolderB”. There is no change in the node management table 121. A string node having a reference flag “TRUE” with the identifier of the link source node “AnotherNode” as the identifier of the parent node and the identifier of the link destination node “FolderB” as the child node is created. By operating in this way, the tree display in the lower left of FIG. 32 is obtained. Here, it is desirable to reveal that the node is a link node by changing an icon or the like.

[2.8 Move node]
FIG. 33 is a flowchart of execution of movement of a revision node according to this embodiment to another node.
FIG. 26 illustrates a case where the user selects not a copy but a move. The movement means 113 of the history display server 100 receives a movement instruction from the user via the history display client 400, including designation of a node as a movement source and a node as a movement destination.
The moving unit 113 acquires the current time as the operation time (step S810).
The moving unit 113 acquires the identifier of the source node (step S815).
The moving unit 113 acquires the identifier of the destination node (step S820).
The moving unit 113 specifies and updates the string record for connecting the child node that is the movement source and the parent node before the movement (step S825). Here, let the expiration date and time be the operation time.

  The moving unit 113 creates a string record for connecting the destination node and the source node (step S830). Here, the identifier of the parent node is used as the identifier of the destination node. Let the identifier of the child node be the identifier of the source node. The expiration date and time is the operation time. Let the expiration date and time be the time representing the latest version number.

  FIG. 34 and FIG. 35 are examples of file movement using the management table according to this embodiment. FIG. 31 shows an example when the user gives an instruction to move the file “DocA” to the folder “AnotherNode”. There is no change in the node management table 121. The string record for connecting the parent folder “FolderC” before movement and the file “DocA” to be moved is updated. A string node is created with the identifier of the destination node “AnotherNode” as the identifier of the parent node and the identifier of the source node “DocA” as the identifier of the child node. By operating in this way, the tree display in the lower left of FIG. 34 is obtained. FIG. 35 shows an example when the user gives an instruction to move the revision node of the folder “FolderB” to the folder “AnotherNode”. There is no change in the node management table 121. The string record for connecting the parent folder “FolderA” before movement and the file “FolderB” to be moved is updated. A string node is created with the identifier of the destination node “AnotherNode” as the identifier of the parent node and the identifier of the source node “FolderB” as the identifier of the child node. By operating in this way, the tree display in the lower left of FIG. 35 is obtained.

(Other embodiments)
[Stand-alone configuration instead of server-client configuration]
In the first embodiment, the history display system is constructed by the client server system. However, the history display system can be constructed by stand-alone. FIG. 36 shows an example in which a history display system is constructed in a stand-alone manner. The same number is given to the component already demonstrated. The control unit 510 has the functions of the server control unit 110 and the client control unit 420. However, since it is a stand-alone, the receiving unit 140, the transmitting unit 150, the transmitting unit 440, and the receiving unit 450 are unnecessary, and it is not necessary to control the receiving unit 140, the transmitting unit 150, the transmitting unit 440, and the receiving unit 450.

  Although the present invention has been described with the above embodiments, the technical scope of the present invention is not limited to the scope described in the embodiments, and various modifications or improvements can be added to these embodiments. . And embodiment which added such a change or improvement is also contained in the technical scope of the present invention. This is apparent from the claims and the means for solving the problems.

The following additional notes will be made regarding each of the embodiments.
(Appendix)
(Supplementary note 1) Node management recording means for recording a node having a node identifier, a node name, a node version number, and a node expiration date, a string for connecting a parent node and a child node, and a string expiration date A history display system including a string management recording means for recording, and a control means for reading out a designated node and a string connected to this node to display information;
Receiving an instruction to upgrade the specified node, updating the node of the node management recording means by terminating the expiration date of the specified node, increasing the version number of the specified node, and increasing the node expiration date Create a node with the identifier of the new node that was started, record it in the node management recording means, end the expiration date of the string connected to the specified node, and update the string in the string management recording means And a history display system that starts a validity period and records the string for connecting the created node and the parent node of the designated node in a string management recording unit.

    (Supplementary note 2) The node has an identifier of the node of the version number one version earlier than its own version number as the original node identifier, is recorded in the node management recording means, and indicates the revision list of the designated node The node management record means obtains the identifier of the designated node, obtains the original node identifier of the node which is the identifier of the obtained node, and sets the node having the obtained original node identifier as the node identifier. The history display system according to claim 1, wherein the original node identifier of the acquired node is acquired.

  (Supplementary Note 3) An instruction to display the configuration of the designated node at the designated revision is received, the designated node at the designated revision is acquired, and the node of the obtained node is obtained as a lower node with respect to the obtained node. The history display system according to appendix 1 or 2, wherein a node that satisfies the expiration date is specified from the string management recording unit, and the specified lower node is acquired from the node management recording unit.

    (Supplementary note 4) The history display system according to supplementary note 3, wherein an expiration date of the designated node includes the present.

    (Supplementary Note 5) The history display according to Supplementary Note 3 or 4, wherein the acquired designated node, the lower node of the designated node, and the string used to identify the lower node are used as display information. system.

(Appendix 6) Accepts an instruction to delete the specified node, identifies the specified node as a child node, identifies a string whose expiration date includes the present from the string management recording means, and terminates the specified string expiration date The history display system according to any one of appendices 1 to 5, wherein the string management recording means is updated.
(Supplementary note 7) The history display system according to supplementary note 6, wherein the deletion node is a parent node, the node designated at the time of the deletion instruction of the node is a child node, and the string whose expiration date has started is recorded in the string management recording unit .

(Supplementary note 8) A copy source node and a copy destination node are specified, a copy instruction is accepted, the copy source node and lower nodes are copied, the node identifier is set as a new identifier, and the expiration date of the node is set. Start, record the node in the node management recording means with the node version number as the initial value, and connect the copied node based on the string for connecting the specified node and the node below the specified node The expiration date of the string to be recorded is recorded in the string management recording means, and the expiration date of the string having the copied node as the parent node and the copied node corresponding to the specified node as the child node is started. The history display system according to any one of appendices 1 to 7, wherein the history display system records the information in a string management recording unit.

    (Additional remark 9) The said string has a link flag which shows the presence or absence of the node of a link, is recorded on a string management recording means, the link destination node and the link origin node are designated, the instruction | indication of a link is received, the said link 9. The appendix 1 to 8, wherein the original node is a parent node, the link destination node is a child node, and a string with the link flag set is started in an expiration date and recorded in a string management recording unit. History display system.

    (Supplementary Note 10) Accepts an instruction to move a node as a movement destination to a node as a movement destination of a designated movement source, and validates a string having the movement source node as a child node and the movement source parent node as a parent node. The supplementary note that updates the string management recording unit after expiration of the deadline, starts the expiration date of the string having the destination node as a parent node and the source node as a child node and records it in the string management recording unit The history display system according to any one of 1 to 9.

    (Supplementary Note 11) Node management recording means for recording a node having a node identifier, a node name, a node version number, and a node expiration date, a string for connecting a parent node and a child node, and a string expiration date A history display method that uses a string management recording means to record and reads a designated node and a string connected to this node to display information, and receiving a revision upgrade instruction for the designated node; , Updating the node of the node management recording means after the expiration date of the designated node, and adding the identifier of the new node that has started the expiration date of the node by increasing the version number of the designated node Creating a registered node and recording it in the node management recording means, and managing the string by ending the expiration date of the string connected to the specified node Step a history display method for recording the start to string management record means expiration cord for connecting the parent node of the created node and the designated node to update the string of the recording means.

FIG. 3 is an explanatory diagram of the principle of the present invention (revise up and display at a specified revision). FIG. 3 is an explanatory diagram of the principle of the present invention (copying a specified revision node and creating a link). 1 is a system configuration diagram of a history display system and a hardware configuration diagram of a computer according to a first embodiment of the present invention. 1 is a block configuration diagram of a history display system according to a first embodiment of the present invention. It is a data model of the management table which concerns on the 1st Embodiment of this invention. It is a flowchart of node creation using the management table which concerns on the 1st Embodiment of this invention. It is folder creation using the management table which concerns on the 1st Embodiment of this invention. It is folder creation using the management table which concerns on the 1st Embodiment of this invention. It is file creation using the management table which concerns on the 1st Embodiment of this invention. It is an illustration of the user's revision up instruction in the history display client according to the first embodiment of the present invention. It is a flowchart of the revision up of the node which concerns on the 1st Embodiment of this invention. It is the update of the management table information by revision up (folder) which concerns on the 1st Embodiment of this invention. It is the update of the management table information by revision up (file) which concerns on the 1st Embodiment of this invention. It is an illustration of the display of revision up in the history display client concerning a 1st embodiment of the present invention. It is a flowchart of the revision list display of the designated node which concerns on the 1st Embodiment of this invention. It is an example of folder / file revision list display (at the time of search) using the management table information according to the first embodiment of the present invention. It is an example of the instruction | indication of the structure display in the revision of the node designated by the user in the log | history display client which concerns on the 1st Embodiment of this invention. It is a flowchart of the structure display in the designated revision of the designated node which concerns on the 1st Embodiment of this invention. It is a history structure tree display (at the time of search) of the folder / file of the version number designated by the user using the management table information according to the first embodiment of the present invention. It is an example of the structure display in the revision of the node designated by the user in the history display client according to the first embodiment of the present invention. It is a tree display (at the time of a search) of the newest folder / file using the management table information which concerns on the 1st Embodiment of this invention. It is a tree display (at the time of a search) of the newest folder / file using the management table information which concerns on the 1st Embodiment of this invention. It is a flowchart of the node deletion using the management table which concerns on the 1st Embodiment of this invention. This is file deletion using management table information according to the first embodiment of the present invention. It is deletion of a folder using management table information concerning a 1st embodiment of the present invention. While displaying the configuration at the revision of the node specified by the user in the history display client according to the first embodiment of the present invention, the configuration including the specified node and the lower tree (revision node) is changed to another folder. It is the example copied to the lower order of. It is a flowchart of the copy to the other node of the revision node which concerns on the 1st Embodiment of this invention. It is a copy of the file using the management table information which concerns on the 1st Embodiment of this invention. It is a copy of the folder using the management table information which concerns on the 1st Embodiment of this invention. It is a flowchart of the link execution to the other node of the revision node which concerns on the 1st Embodiment of this invention. It is file link creation using the management table information according to the first embodiment of the present invention. It is folder creation using the management table information which concerns on the 1st Embodiment of this invention. It is a flowchart of execution of movement of the revision node according to the first embodiment of the present invention to another node. It is the movement of the file using the management table information which concerns on the 1st Embodiment of this invention. It is the movement of the folder using the management table information which concerns on the 1st Embodiment of this invention. It is a block block diagram of the log | history display system which concerns on other embodiment of this invention.

Explanation of symbols

10 Computer (server is built) 11 CPU
12 RAM
13 ROM
14 HDD
15 CD-ROM drive 21 Mouse 22 Keyboard 23 Display 24 Speaker 31 LAN interface 40 Computer (client is constructed) 100 History display server 110 Server control means 111 Creation means 112 Deletion means 113 Movement means 114 Copy means 115 Link means 116 Revision Upload means 117 Revision list means 118 Designated revision display means 120 Node management means 121 Node management table information 130 String management means 131 String management table information 140 Reception means 150 Transmission means 160 Current display information 400 History display client 410 Input means 420 Client control means 430 Display means 440 Transmission means 450 Reception means 460 Current display information 510 Control means

Claims (5)

Node management recording means for recording a node having a node identifier, a node name, a node version number, and a node expiration date, and a string for connecting the parent node and the child node, including the string expiration date A history display system including a string management recording unit, and a control unit that reads a designated node and a string connected to the node to display information,
Accepts an instruction to upgrade the specified node,
Update the node of the node management recording means by ending the expiration date of the specified node,
Create a node to which the identifier of the new node that has started the expiration date of the node by increasing the version number of the specified node is created and recorded in the node management recording means,
End the expiration date of the string connected to the specified node and update the string of the string management recording means,
A history display system in which a string for connecting the created node and a parent node of the designated node starts an expiration date and is recorded in a string management recording unit. Accepts a configuration display instruction at the specified revision of the specified node,
Get the specified node at the indicated revision
Identify from the string management recording means a node that satisfies the expiration date of the acquired node in a lower node for the acquired node,
The history display system according to claim 1, wherein the identified lower node is acquired from the node management recording unit. Specify the copy source node and the copy destination node, accept the copy instruction,
Copy the source node and the lower-level node, set the node identifier as a new identifier, start the expiration date of the node, record the node version as the initial value in the node management recording means,
Record the string for connecting the copied node based on the string for connecting the specified node and the lower node of the specified node to the string management recording means by starting the expiration date,
The history according to claim 1 or 2, wherein a string having a copy destination node as a parent node and a copy node corresponding to the designated node as a child node starts an expiration date and is recorded in a string management recording unit. Display system. The string has a link flag indicating the presence / absence of a link node and is recorded in the string management recording means,
The link destination node and link source node are specified and the link instruction is accepted,
The link source node is a parent node, the link destination node is a child node, and a string with the link flag set is started in an expiration date and recorded in a string management recording unit. The history display system described in. Node management recording means for recording a node having a node identifier, a node name, a node version number, and a node expiration date, and a string for connecting the parent node and the child node, including the string expiration date A history display method that uses a string management recording means to read out a designated node and a string connected to this node to display information,
Receiving a revision upgrade instruction for the specified node;
Updating the node of the node management recording means by ending the expiration date of the designated node;
Increasing the version number of the designated node and creating a node assigned with an identifier of a new node that has started the expiration date of the node, and recording it in the node management recording means;
Ending the expiration date of the string connected to the specified node and updating the string of the string management recording means;
A history display method for starting a validity period of a string for connecting the created node and a parent node of the designated node and recording the string in a string management recording unit.

Images