Computer-readable storage medium storing file derivation relationship determination program and file derivation relationship determination system
By recording and calculating the number of intersection and union types of identifier sets when saving files, the problem of difficulty in determining the derivation relationship between files is solved, the accurate parent-child relationship between files is determined, and the efficiency of file management is improved.
Patent Information
- Application Number
- CN202310370214.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2022-04-11
- Filing Date
- 2023-04-10
- Publication Date
- 2026-02-17
- Estimated Expiration
- 2043-04-10
AI Technical Summary
In existing technologies, the derivation relationship between files is difficult to determine clearly, especially when files are not explicitly assigned version information, making it impossible to effectively manage the derivation relationship between files.
By appending different identifiers when saving files, and calculating similarity based on the number of types of the intersection and union of the identifier sets, the derivation relationship between files is determined; when a part of the identifier set is deleted, the parent-child relationship is determined by similarity and inclusion relationship.
It enables accurate determination of the derivation relationship between files, easily identifies the parent-child relationship between files, and improves the efficiency and accuracy of file management.
Smart Images

Figure CN116894009B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to a computer-readable storage medium containing a file derivation determination program and a file derivation determination system. Background Technology
[0002] Files stored on computer storage devices are often saved with new names after their content has been edited, appended, or deleted. Users sometimes add the save date to the end of the filename to indicate the relationship between the newly saved file and the original file. However, this does not indicate a true relationship between the two files.
[0003] Patent document 1 describes an invention for managing resources between versions by using different meaningful derivation relationships such as continuation and branching.
[0004] Prior art literature
[0005] Patent documents
[0006] Patent Document 1: Japanese Patent Application Publication No. 11-327980 Summary of the Invention
[0007] The problem that the invention aims to solve
[0008] Patent document 1 assumes the existence of version information for resources. For example, when a document is not explicitly assigned version information, there is no record of how to determine and manage the derivation relationships between documents.
[0009] Therefore, the objective of this invention is to identify multiple documents with a derivation relationship or to easily determine the derivation relationship between documents.
[0010] Methods for solving problems
[0011] The first aspect of the present invention is a document derivation relationship determination procedure for achieving the above-mentioned objective, which enables a computer to perform the following process: accepting a plurality of document files for which different identifiers are appended each time a given application is saved; and determining that the second document file has a derivation relationship with the first document file based on a similarity calculated according to the number of types of identifiers in the intersection of a first set of identifiers collected from a first document file and a second set of identifiers collected from a second document file, and the number of types of identifiers in the union of the first set and the second set.
[0012] A second aspect of the present invention is a computer-readable storage medium storing a file derivation relationship determination program, the file derivation relationship determination program being used to cause a computer to perform the following process: accepting a plurality of document files for which identifiers are appended each time a given application is saved; determining that the second document file has a derivation relationship with the first document file based on a first similarity calculated from the number of types of identifiers in the intersection of a first set of identifiers collected from a first document file and a second set of identifiers collected from a second document file, and the number of types of identifiers in the union of the first set and the second set, and a second similarity calculated from a first word string recorded in the first document file and a second word string recorded in the second document file.
[0013] The third aspect of the present invention is a computer-readable storage medium storing a file derivation relationship determination program, the file derivation relationship determination program being used to cause a computer to perform the following process: accepting a constructed document file in which different identifiers are appended and recorded each time a given application is saved, and a portion of the set of said identifiers is deleted; and determining the case where a portion of said identifiers is deleted.
[0014] The process of determining multiple documents with a derivation relationship based on the similarity of the sets of identifiers possessed by each document when a portion of the set of identifiers is deleted; the process of determining which document a document is derived from based on the inclusion relationship of the sets of identifiers possessed by each document when a portion of the set of identifiers is not deleted; and the process of determining the parent-child relationship of multiple documents with a derivation relationship.
[0015] The fourth aspect of the present invention is a file derivation relationship determination system, characterized by comprising: a receiving unit that receives document files constructed such that different identifiers are appended and recorded each time a given application is saved, and a portion of the set of said identifiers is deleted; an identifier deletion determination unit that determines if a portion of the set of said identifiers has been deleted; and a determination unit that, if a portion of the set of said identifiers has been deleted, determines multiple document files with a derivation relationship based on the similarity of the sets of said identifiers possessed by each of the document files, and if a portion of the set of said identifiers has not been deleted, determines from which document file the document file is derived based on the inclusion relationship of the sets of said identifiers possessed by each of the document files, and determines the parent-child relationship of the multiple document files with a derivation relationship.
[0016] The fifth aspect of the present invention is a document derivation relationship determination system, characterized by comprising: a receiving unit that receives multiple document files for which different identifiers are appended each time a given application is saved; and a determining unit that determines the second document file as having a derivation relationship with the first document file based on a similarity calculated according to the number of types of identifiers in the intersection of a first set of identifiers collected from a first document file and a second set of identifiers collected from a second document file, and the number of types of identifiers in the union of the first set and the second set.
[0017] The sixth aspect of the present invention is a document derivation relationship determination system, characterized by comprising: a receiving unit that receives multiple document files for which different identifiers are appended each time a given application is saved; and a determining unit that determines the second document file as having a derivation relationship with the first document file based on a first similarity calculated from the intersection of a first set of identifiers collected from a first document file and a second set of identifiers collected from a second document file, and the number of identifiers in the union of the first set and the second set, and a second similarity calculated from a word string recorded in the first document file and a word string recorded in the second document file.
[0018] Invention Effects
[0019] According to the present invention, it is possible to identify multiple documents with a derivative relationship, or to easily determine the derivative relationship between documents. Attached Figure Description
[0020] Figure 1 This is an explanatory diagram illustrating the main structure of the computer involved in this embodiment.
[0021] Figure 2 This is a functional block diagram of the computer in this embodiment.
[0022] Figure 3 It is a diagram representing the derivation relationships of document files that store a set of identifiers.
[0023] Figure 4 It is a graph representing a set of identifiers stored in a document file.
[0024] Figure 5 This is a diagram representing the case where, although the w:rsids tag element exists, any one of the identifiers in the set is deleted.
[0025] Figure 6 This is a diagram illustrating the styles tag elements of a document.
[0026] Figure 7 This is a diagram illustrating the update history of the explanatory documents.
[0027] Figure 8 This is a flowchart of the saving process based on a document editing program.
[0028] Figure 9 This is a flowchart of the document derivation relationship determination process in the first embodiment.
[0029] Figure 10 This is a flowchart of the document derivation relationship determination process in the second embodiment.
[0030] Figure 11 It is a diagram that displays the derivation relationship of document files. Detailed Implementation
[0031] Hereinafter, the method for implementing the present invention will be described in detail with reference to the accompanying drawings. Furthermore, the determination of the so-called derivation relationship between documents involves not only determining whether they are direct relatives as known from inclusion relationships, but also determining whether they are in the same tree containing parent-child / sibling relationships.
[0032] Figure 1 This is an explanatory diagram illustrating the main structure of the computer 1 involved in this embodiment.
[0033] Computer 1 is implemented, for example, by a personal computer that functions as a document creation aid (word processor) and a document reading aid. Furthermore, the document reading aid possesses the document creation functions (word processing software) of the document creation aid. In addition, in the following description, the same symbols are used to represent the same structures, and explanations are omitted where appropriate.
[0034] The computer 1 is configured to include a CPU (Central Processing Unit) 11, a storage unit 12, a ROM (Read Only Memory) 13, a RAM (Random Access Memory) 14, an operation unit 15, and a display unit 16.
[0035] CPU 11 is a central processing unit that executes the file management program 121 and the document editing program 122 stored in the storage unit 12.
[0036] Here, the document editing program 122 is a given application used to enable the CPU 11 of computer 1 to create and edit document files, such as Microsoft Word. Document files 2a to 2d are created by the document editing program 122.
[0037] The file management program 121 is a program used to enable the CPU 11 of computer 1 to determine the derivation relationship of document files and manage these document files.
[0038] CPU11 achieves this by executing file management program 121. Figure 2 The shown components are the receiving unit 110, the derivation determination unit 111, the display control unit 112, and the identifier deletion determination unit 113. Furthermore, regarding the various functional units implemented by the CPU 11, in... Figure 2 A detailed explanation will follow.
[0039] Storage unit 12 is a high-capacity storage device, such as a hard disk drive or non-volatile memory. For example, storage unit 12 stores a file management program 121 and a document editing program 122.
[0040] RAM14 functions as a temporary storage area for various programs, input data, output data, and parameters that can be executed by CPU11.
[0041] The operation unit 15 is configured to include: a keyboard with cursor keys, numeric input keys, and various function keys; and a pointing device such as a mouse. The operation unit 15 outputs key press signals (from the keyboard) and mouse operation signals as input signals to the CPU 11. The CPU 11 performs various processes based on the operation signals from the operation unit 15.
[0042] The display unit 16 is configured, for example, to be a monitor display such as an LCD (Liquid Crystal Display). The display unit 16 displays various images based on display signals input from the CPU 11. Furthermore, both the display unit 16 and the operation unit 15 can be touch panel displays.
[0043] Figure 2 This is a functional block diagram of computer 1 in this embodiment.
[0044] In computer 1, it is implemented as a receiving unit 110, a derivation determination unit 111, a display control unit 112, and an identifier deletion determination unit 113.
[0045] The receiving department 110 receives one or more documents 2a to 2d, etc. These documents 2a to 2d are generated by the document editing program 122 and have a structure that appends different identifiers each time they are saved.
[0046] The derivation determination unit 111 determines multiple documents with a derivation relationship based on the inclusion relationship or similarity of the sets of identifiers possessed by each document. The derivation determination unit 111 also determines the parent-child relationship of the multiple documents with a derivation relationship based on any one of the inclusion relationship of the sets of identifiers of the documents with a derivation relationship, the update history of the documents, the date and time when the documents were appended to the operating system installed on the computer 1, and the filename.
[0047] The display control unit 112 obtains a set of identifiers consisting of multiple identifiers of document files and a root identifier, and displays the document file group selected by filtering through the root identifier as a file tree on the display unit 16.
[0048] The identifier deletion determination unit 113 determines whether a portion of the set of identifiers has been deleted. Additionally, sometimes, through a part of an application, either an identifier or the root identifier is deleted from a document. Therefore, it determines whether either the identifier or the root identifier has been deleted.
[0049] Figure 3 It is a diagram representing the derivation relationships of document files 2a to 2d that store a set of identifiers.
[0050] In documents 2a to 2d, in addition to article 21, root identifier 22 and identifier 23a are also stored. The arrows in the diagram indicate the derivation relationships between the documents.
[0051] Document 2a is the first of these documents to be created. Document 2b is a document derived from document 2a. The set of identifiers in document 2b contains the set of identifiers contained in document 2a.
[0052] Documents 2c and 2d are derived from document 2b. That is, documents 2c and 2d are derived from document 2a through document 2b. The set of identifiers in documents 2c and 2d includes the set of identifiers contained in document 2b, and also includes the set of identifiers contained in document 2a.
[0053] Document file 2a contains root identifier 22, but not any identifier. Document file 2b contains root identifier 22 and identifier 23a. Document file 2c contains root identifier 22 and identifiers 23a and 23b. Document file 2d contains root identifier 22 and identifiers 23a and 23c.
[0054] Figure 4 It is a diagram representing the document files 2b and 2c and the set of identifiers stored therein.
[0055] Documents 2b and 2c are, for example, text files recorded in XML (eXtended Markup Language) format. The root identifier 22 and identifier 23a are stored in the w:val attribute of the w:rsids tag element. Documents are not limited to XML-formatted Word files, but include all document formats that use XML, such as Excel files and PowerPoint files.
[0056] Within the w:rsids tag element of document 2b, there is a w:rsidRoot tag element storing the root identifier 22, and a w:rsid tag element representing the identifier. Here, the root identifier 22 is "00464813" of the w:val attribute. Identifier 23a is "00464813" of the w:val attribute.
[0057] Within the w:rsids tag element of document 2c, there are a w:rsidRoot tag element representing the root identifier 22 and a w:rsid tag element representing the identifier. Here, the root identifier 22 is the w:val attribute "00464813". Identifier 23a is the w:val attribute "00464813".
[0058] In addition, the following describes the method for determining whether a set of identifiers has been deleted from document 2c.
[0059] If the w:rsids tag element is deleted from a document, the identifier deletion determination unit 113 determines that the identifier has been deleted from the document.
[0060] The derivation determination unit 111 determines multiple documents with a derivation relationship based on the inclusion or similar relationships of the sets of identifiers possessed by each document. That is, for example, if the derivation determination unit 111 determines that the set of identifiers of document 2a is contained in the set of identifiers of document 2b, or similarly, then it determines that documents 2a and 2b have a derivation relationship. Furthermore, the derivation determination unit 111 determines that document 2a is the parent document of document 2b.
[0061] Figure 5 This is a diagram illustrating the situation where the w:rsids tag element exists, but the identifier is also deleted.
[0062] Figure 5The second line indicates that one of the tag elements existing in the document, namely the w:p tag element, has identifier information set in its w:rsidR, w:rsidRPr, w:rsidRDefault, and w:rsidP attributes. These w:rsidP, w:rsidR, w:rsidRPr, and w:rsidRDefault attributes are called the attributes that retain the identifier.
[0063] Additionally, sometimes the tag element itself contains identifier information that is not an attribute of the tag element in the document. Furthermore, tag elements can also be tag elements other than w:p.
[0064] The identifier deletion determination unit 113 investigates whether the tag elements existing in the document have the attribute to retain identifiers and collects the identifiers. If there is an identifier in the collection of these collected identifiers that does not exist in the w:rsid tag element of the w:rsids tag element, the identifier is determined to be deleted. For example, if the identifier 00455AAB stored in the w:rsidRPr attribute of the w:p tag element in the text does not exist in the w:rsids tag element, the identifier 00455AAB is determined to be deleted.
[0065] Alternatively, to speed up the process, instead of checking if all identifiers exist in the w:rsids tag element, we can focus only on identifiers in a subset of tag elements, such as the style tag element. If an identifier does not exist in the w:rsids tag element, it is determined that a subset of the identifiers is deleted.
[0066] In calculating similarity, the derivation determination unit 111 uses one or more similarity calculation methods.
[0067] The following section explains the first similarity of sets that use identifiers.
[0068] The derivation determination unit 111 first extracts a set of identifiers. As mentioned above, there are cases where identifiers are deleted. In such cases, to prevent extreme changes in similarity, the derivation determination unit 111 collects identifiers from tag elements other than the rsids tag elements in the document. Specifically, the derivation determination unit 111 collects the parts of the tag elements in the document that are associated with the identifiers, such as the rsid attribute or rsidP attribute. The derivation determination unit 111 may also delete unnecessary identifiers depending on the situation. For example, an identifier that is known to appear only when a new document is saved may appear in the determined tag elements. Therefore, the derivation determination unit 111 may also exclude this identifier from the collection. Furthermore, identifiers appearing in tags such as styles rarely change due to document changes. The derivation determination unit 111 may also exclude these identifiers that are irrelevant to the similarity calculation from the collection.
[0069] Next, the derivation determination unit 111 uses the collected set of identifiers of document A and document B to calculate the similarity by dividing the number of types of identifiers in the common set of the two documents A and B by the number of types of identifiers in the union of the two documents A and B.
[0070] For example, if the number of types of identifiers appearing in both documents A and B is 3, and the number of types of identifiers appearing once in one of documents A and B is 10, the derivation determination unit 111 calculates the similarity as 3 ÷ 10 = 0.3. The method of similarity calculation performed by the derivation determination unit 111 is not limited to this; any method can be used as long as it uses the calculation of both the union and intersection.
[0071] Furthermore, the second similarity measure using statement segmentation is explained.
[0072] In Microsoft Word, text in a document is displayed using the following segmentation method. For example, the text in document A is as follows.
[0073] Today's weather is sunny.
[0074] The text of document B, which has been edited, has changed as follows.
[0075] The sky is clear today.
[0076] At this point, the word string 'a' in document A becomes [today's, weather, is, sunny]. The word string 'b' in document B becomes [today's, sky, appearance, is, sunny].
[0077] The derivation determination unit 111 sets the value to +1 if the words in these word strings a and b are the same, and -1 if they are not, so as to arrange them neatly in a way that becomes the maximum value. As an algorithm, it is the same as the existing DNA (Deoxyribonucleic acid) alignment.
[0078] In the case of word strings a and b, the words "today," "sunny," and "is" are consistent. The word "weather" in word string a is inconsistent with the word "sky" in word string b, and the word "appearance" in word string b is inconsistent. Therefore, the derivation determination unit 111 calculates the second similarity as +1. Furthermore, it is not limited to this; the derivation determination unit 111 only needs to calculate the scores corresponding to consistency and inconsistency when arranged neatly, and set the maximum score when properly arranged as the similarity, without limitation.
[0079] The derivation determination unit 111 uses the first similarity or the second similarity alone for the final similarity, or calculates the similarity that is closest to the actual state by multiplying the first similarity by the second similarity.
[0080] In addition, when the identifier is not a random string but a numerical value such as time or number of times it is saved, similarity can be calculated using methods such as cosine similarity, Euclidean distance, Pearson's product-moment correlation coefficient, and Jaccard coefficient. It does not have to be a pure set consistency.
[0081] In addition to similarity calculation, there is also the inference of parent-child relationship.
[0082] When tag information associated with an identifier is deleted, the document's update time is sometimes also deleted. Since it is difficult to determine which is the parent in the tree based solely on similarity, the parent-child relationship is determined by the order of the update date and time recorded in the file, the filename, and the date and time appended to the operating system installed on the computer.
[0083] Figure 7 It is a graph representing the update history in a file.
[0084] The `w:ins` tag element is assigned the `w:date` attribute, which records the file's update date and time. The `w:ins` tag element represents the update history. If a `w:ins` tag element remains, the latest update history record is set as the last update date and time.
[0085] If there are no remnants of update history, and the date and time appended to the operating system is reliable, then that date and time will be used. Here, "reliable" means appending the file to the operating system in real time. For example, continuously monitoring document files within the computer and saving the document's save date and time in the operating system simultaneously with the document's save.
[0086] As an unreliable scenario, there are cases where files appended to the computer are subsequently saved to the operating system after a period of time. In such cases, because they are all appended to the operating system at the same time, most files will have the same append date and time.
[0087] Filenames are also used to presume parent-child relationships. Since editing dates are frequently included in filenames, the first or last four digits are used to infer parent-child relationships. For example, "Contract0501.docx" presumes it was edited on May 1st, and "Contract0510.docx" presumes it was edited on May 10th, thus establishing a parent-child relationship. Parent-child relationships are then constructed based on this presumed information. By performing these checks sequentially, the parent-child relationships of files can be appropriately presumed.
[0088] Furthermore, the identifier deletion determination unit 113 is an arbitrary functional element, and a system may not include the identifier deletion determination unit 113 if it can be guaranteed that the identifier will not be deleted.
[0089] Figure 8 This is a flowchart of the saving process of a document editing program 122 (e.g., Microsoft Word).
[0090] Through the execution of the document editing program 122, the CPU 11 opens a document file or a new document (step S10) and randomly generates different identifiers (step S11).
[0091] Then, CPU 11 accepts user input (step S12) and determines whether a document saving instruction has been given (step S13). In addition, the document saving instruction is not limited to instructions based on manual operation, but also includes automatic saving performed by the document editing program 122 itself.
[0092] If the input is other than document saving (No), then as input to the document, CPU11 assigns a tag element to the document, sets the identifier information in its attributes (step S14), and then returns to step S12. In step S13, if the input is a document saving instruction (Yes), then CPU11 proceeds to step S15.
[0093] CPU11 determines whether rsidRoot exists as the root identifier (step S15). The absence of rsidRoot refers to the saving of a new file or the deletion of rsidRoot. Since some applications may delete the root identifier, this scenario is considered.
[0094] In step S15, if there is an rsidRoot as the root identifier (yes), then CPU11 sets the identifier information in the rsidRoot attribute and rsid attribute of the rsid tag element in the newly saved document (step S16).
[0095] In step S15, if there is no rsidRoot as the root identifier (No), then CPU11 sets the identifier information in the rsid attribute of the rsid tag element of the document (step S17). In step S18, after CPU11 saves the document, the process ends. Figure 8 The saving process.
[0096] Figure 9 This is a flowchart of the document derivation relationship determination process when the identifier deletion determination unit 113 of the first embodiment exists. This determination process is the process when the CPU 11 executes the file management program 121.
[0097] The receiving unit 110 accepts the input of multiple documents (step S20) and obtains multiple identifiers and root identifiers of the documents (step S21).
[0098] The derivation determination unit 111 filters the root identifiers stored in each document file to identify the documents involved in a specific document tree (step S22). Furthermore, the selection based on root identifiers is for efficiency. The derivation determination unit 111 may also choose not to perform selection based on root identifiers. If no root identifier exists, the derivation determination unit 111 may select based on existing identifiers, or it may choose not to perform selection at all.
[0099] Then, the identifier deletion determination unit 113 determines whether the identifier has been deleted from the document (step S23). If the identifier has not been deleted from the document (No), the identifier deletion determination unit 113 proceeds to step S24. If the identifier has been deleted from the document (Yes), the identifier deletion determination unit 113 proceeds to step S26. Alternatively, in cases where it can be guaranteed that the identifier has not been deleted, an implementation may be possible that does not include the identifier deletion determination unit 113.
[0100] In step S24, the derivation determination unit 111 determines all files containing the set of identifiers of a certain file as files derived from that file. Then, if there are files containing a partial set of the set of identifiers of a certain file, the derivation determination unit 111 determines that a certain file is derived from that file (step S25) and proceeds to step S28. In steps S24 and S25, the derivation determination unit 111 determines which document file the document file is derived from based on the inclusion relationship of the sets of identifiers of the documents. In addition, the derivation determination unit 111 determines whether the set of identifiers of the first document is included in the set of identifiers of the second document.
[0101] In step S26, the derivation determination unit 111 determines files with a set of identifiers similar to the identifiers of a certain file as files with a derivation relationship. Then, the derivation determination unit 111 uses the update history of the files with the derivation relationship to estimate the parent-child relationship of these file groups (step S27) and proceeds to step S28. Furthermore, the method for determining the parent-child relationship of file groups is not limited to the file update history; it can also be a method using date and time appended to the operating system, or a method using filenames. Step S27 is an optional function and may not be performed.
[0102] In step S28, after the display control unit 112 displays the specific file tree on the display unit 16, the process ends. Figure 9 The processing. Regarding the display of a specific file tree, in Figure 11 A detailed explanation will follow.
[0103] As explained herein, the file management program of the embodiments of the present invention causes a computer to perform the following processes: accepting a document constructed as having a set of identifiers appended and recorded each time the document editing program 122 is saved, and having a portion of the set of identifiers deleted; determining the case where a portion of the set of identifiers has been deleted; determining multiple document files with a derivation relationship based on the similarity of the sets of identifiers possessed by each document file; and determining the parent-child relationship between the multiple document files with a derivation relationship. Thus, the derivation relationship between documents can be easily determined.
[0104] Furthermore, the file management program enables the computer to perform the following processes: accepting multiple document files for which different identifiers are appended each time the document editing program 122 is saved; and determining from which document a document file is derived based on the inclusion relationship of the sets of identifiers possessed by each document file. Thus, the derivation relationship between documents can be easily determined.
[0105] Figure 10This is a flowchart of the document derivation relationship determination process in the second embodiment. This determination process is the process performed when the CPU 11 executes the file management program 121, and it is in the case where the identifier deletion determination unit 113 does not exist.
[0106] The receiving unit 110 accepts the input of multiple documents (step S30) and obtains multiple identifiers and root identifiers of the documents (step S31).
[0107] The derivation determination unit 111 identifies multiple documents as files involved in a specific file tree by filtering the root identifiers stored in each document (step S32). Alternatively, this process can be omitted for efficiency purposes.
[0108] In step S33, the derivation determination unit 111 determines files with a set of identifiers similar to the identifiers of a certain file as files with a derivation relationship. Then, the derivation determination unit 111 uses the update history of the files with the derivation relationship to estimate the parent-child relationship of these multiple file documents (step S34). Furthermore, the method for determining the parent-child relationship of multiple file documents is not limited to the update history; it can also be a method using the date and time appended to the operating system installed on computer 1, or a method using filenames. Moreover, the processing in step S34 is an optional function, and step S34 may not be performed.
[0109] In step S35, after the display control unit 112 displays the specific file tree on the display unit 16, the process ends. Figure 10 The processing. Regarding the display of a specific file tree, in Figure 11 A detailed explanation will follow.
[0110] As explained herein, the file management program of the present invention causes a computer to perform the following processes: accepting multiple document files for which different identifiers are appended each time the document editing program 122 is saved; determining multiple document files with a derivation relationship based on the similarity of the sets of identifiers possessed by each document file; and determining the parent-child relationship between the multiple document files with a derivation relationship. Thus, the derivation relationship between documents can be easily determined.
[0111] Figure 11 This is a diagram showing the derivation relationship in window 3.
[0112] The derivation relationship display window 3 is a window used to display a specific file tree, and it is displayed on the display section 16. In the derivation relationship display window 3, document icons 31a to 31d are displayed in a tree structure.
[0113] Document icon 31a represents Figure 3The icon for document 2a has the filename "Contract 0301" written below it. Document icon 31b represents... Figure 3 The icon for document 2b has the filename "Contract 0302" written below it. Document icon 31c indicates... Figure 3 The icon for document 2c has the filename "Contract 0303" written below it. Document icon 31d represents... Figure 3 The document is represented by a 2D icon, with the filename "Contract 0304" written below it.
[0114] An arrow is drawn from document icon 31a toward document icon 31b. This arrow indicates that document 2b, shown by document icon 31b, is derived from document 2a, shown by document icon 31a.
[0115] Furthermore, arrows are drawn from document icon 31b toward document icons 31c and 31d. These arrows indicate that documents 2c and 2d, represented by document icons 31c and 31d, are derived from document 2b, represented by document icon 31b.
[0116] (Modified Example)
[0117] The present invention is not limited to the above-described embodiments. Modifications can be made without departing from the spirit of the present invention. For example, there are embodiments such as (a) to (f).
[0118] (a) The method of displaying file derivation relationships is not limited to tree display.
[0119] (b) The identifiers assigned to documents need to be different for each document, and need not be randomized every time they are saved.
[0120] (c) The root identifier of the document is not required, as long as a different identifier is saved each time.
[0121] (d) Multiple documents with a derivation relationship can be determined by either the inclusion relationship of the set of document identifiers or the similarity of the set of document identifiers, or by combining the two methods.
[0122] (e) The identifier deletion determination unit is an optional feature. Implementations may also be available without an identifier deletion determination unit.
[0123] (f) The function of delineating documents based on their root identifiers is optional. It is also possible to omit this function.
[0124] Symbol Explanation
[0125] 1 Computer
[0126] 11 CPU
[0127] 110 Service Department
[0128] 111 Derivative Determination Section (Determination Section)
[0129] 112 Display Control Unit
[0130] 113 Identifier Deletion Decision Unit
[0131] 12 Storage Units
[0132] 121 Document Management Program
[0133] 122. Document editing program (given application)
[0134] 13ROM
[0135] 14 RAM
[0136] 15 Operations Department
[0137] 16 Display Section
[0138] Documents 2a-2d
[0139] 21 articles
[0140] 22 root identifiers
[0141] Identifiers 23a to 23c
[0142] 3 Derivation Relationship Display Window
[0143] Document icons from 31a to 31d.
Claims
1. A computer-readable storage medium storing a file derivation relationship determining program, wherein the file derivation relationship determining program is for causing a computer to execute processes of: accepting a plurality of documents each of which records a different identifier every time a given application program is saved; and determining a second document as having a derivation relationship with a first document based on a similarity degree calculated from a number of kinds of identifiers in an intersection of a first set of identifiers collected from the first document and a second set of identifiers collected from the second document, and a number of kinds of identifiers in a union of the first set and the second set, wherein the identifiers in the union of the first set and the second set include identifiers in at least one of a w:rsid tag element, a w:rsidRoot tag element, and a w:p tag element.
2. The computer-readable storage medium storing the file derivation relationship determining program according to claim 1, wherein the file derivation relationship determining program is for causing the computer to execute a process of: determining a parent-child relationship of a plurality of documents having a derivation relationship using date and time information each of which the plurality of documents having the derivation relationship is appended to an operating system installed in the computer.
3. The computer-readable storage medium storing the file derivation relationship determining program according to claim 1, wherein the file derivation relationship determining program is for causing the computer to execute a process of: determining a parent-child relationship of a plurality of documents having a derivation relationship using file names each of which the plurality of documents having the derivation relationship.
4. A computer-readable storage medium storing a file derivation relationship determining program, wherein the file derivation relationship determining program is for causing a computer to execute processes of: accepting a plurality of documents each of which records an identifier every time a given application program is saved; and determining a second document as having a derivation relationship with a first document based on a first similarity degree calculated from a number of kinds of identifiers in an intersection of a first set of identifiers collected from the first document and a second set of identifiers collected from the second document, and a number of kinds of identifiers in a union of the first set and the second set, and a second similarity degree calculated from a first word string recorded in the first document and a second word string recorded in the second document, wherein the identifiers in the union of the first set and the second set include identifiers in at least one of a w:rsid tag element, a w:rsidRoot tag element, and a w:p tag element.
5. The computer-readable storage medium storing the file derivation relationship determining program according to any one of claims 1 to 4, wherein the file derivation relationship determining program is for causing the computer to further execute a process of: displaying a file tree indicating from which document a document is derived in a display section. 6. The computer-readable storage medium storing the file derivation relationship determining program according to any one of claims 1 to 4, wherein the file derivation relationship determining program causes the computer to further execute a process of: circumscribing a document file by screening with a root identifier given at the time of newly saving a document file by the given application program, among the plurality of identifiers of the document file.
7. A computer-readable storage medium storing a file derivation relationship determining program, wherein the file derivation relationship determining program causes the computer to execute a process of: accepting a document file of a configuration in which a different identifier is additionally recorded each time saving of a given application program is performed, and a part of the set of identifiers is deleted; determining whether a part of the set of identifiers is deleted; determining a plurality of document files having a derivation relationship based on similarity of the set of identifiers possessed by each of the document files, in a case where a part of the set of identifiers is deleted; determining from which document file a document file is derived based on inclusion relationship of the set of identifiers possessed by each of the document files, in a case where a part of the set of identifiers is not deleted; determining parent-child relationship of a plurality of document files having a derivation relationship; wherein the identifier includes an identifier in at least one of a w:rsid tag element, a w:rsidRoot tag element, and a w:p tag element.
8. A file derivation relationship determining system characterized by comprising: provided with: an accepting section that accepts a document file of a configuration in which a different identifier is additionally recorded each time saving of a given application program is performed, and a part of the set of identifiers is deleted; an identifier deletion determining section that determines whether a part of the set of identifiers is deleted; and a determining section that determines a plurality of document files having a derivation relationship based on similarity of the set of identifiers possessed by each of the document files, in a case where a part of the set of identifiers is deleted, determines from which document file a document file is derived based on inclusion relationship of the set of identifiers possessed by each of the document files, in a case where a part of the set of identifiers is not deleted, and determines parent-child relationship of a plurality of document files having a derivation relationship; wherein the identifier includes an identifier in at least one of a w:rsid tag element, a w:rsidRoot tag element, and a w:p tag element.
9. A file derivation relationship determination system characterized by comprising: provided with: an accepting section that accepts a plurality of document files each of which a different identifier is additionally recorded each time saving of a given application program is performed; and a determining section that determines a second document file as having a derivation relationship with a first document file based on similarity calculated from a number of kinds of identifiers of an intersection of a first set of identifiers collected from the first document file and a second set of identifiers collected from the second document file, and a number of kinds of identifiers of a union set of the first set and the second set; The identifiers of the union of the first set and the second set include identifiers in at least one of a w:rsid tag element, a w:rsidRoot tag element, and a w:p tag element.
10. A file derivation relationship determining system characterized by comprising: Possessing: An acceptance unit that accepts a plurality of documents each having a different identifier recorded each time a given application program is saved; And A determination unit that determines a second document file to have a derivation relationship with a first document file based on a first similarity calculated from the number of types of identifiers of the intersection of a first set of identifiers collected from the first document file and a second set of identifiers collected from the second document file, and the number of types of identifiers of the union of the first set and the second set, and a second similarity calculated from a word string recorded in the first document file and a word string recorded in the second document file; The identifiers of the union of the first set and the second set include identifiers in at least one of a w:rsid tag element, a w:rsidRoot tag element, and a w:p tag element.
Citation Information
Patent Citations
Version management device
JP1999327980A
Information processor, information processing method, program, and recording medium
JP2005316815A
Information processing system, information processor and program
JP2008181350A