JP2006209730A - Data file management device, data file management method and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To visually restrict a number wherein association can be performed by a tree structure to perform display or the like without allowing a user to be conscious of the number wherein the association can be performed. <P>SOLUTION: In a step S1101, information about a display-related code temporarily stored in a RAM is taken out. In a step S1103, loop processing is performed only by an arrangement number. In a step S1104, information positioned in an index is acquired from arrangement. In a step S1105, it is decided whether an image kind is an 'associating point' or not. It is transferred to step a S1106 when the image kind is the 'associating point', and it is transferred to the other process when not the 'associating point'. In the step S1106, the number of associatable children and the number of associatable hierarchies stored in an external memory are acquired, and set to a temporary area of the RAM. In a step S1107, a contract SEQ number is acquired from the information acquired in the step S1104, and information about a contract with the contract SEQ number as a parent is acquired. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a data file management device, a data file management method, and a program. More specifically, the present invention relates to a data file management device, a data file management method, and a data file management method for managing a data file that is electronic data on a management server via a network. Regarding the program.

  The problem of how to efficiently manage a large amount of documents generated in business has been studied and discussed in many situations. In particular, in recent years, the capacity of hard disks has increased and the price has been reduced. Furthermore, documents such as documents have been scanned due to advances in data compression technology, etc., and can be stored and managed as data files by converting them into PDF data. To be done.

  In the management of data files, there are meanings between files regarding the contents of the files (for example, basic contracts and individual contracts and memorandums). In file management, how to connect and manage such relationships This is very important.

  Conventionally, several mechanisms have been provided for managing data files while visually showing the relationship between the files. For example, in an OS such as Windows (registered trademark), folders for storing data files are displayed hierarchically by directory management, etc., and the relationship between each folder is made visually easy to understand. It has a mechanism that can display the location of the.

  Further, a file management system having a mechanism for displaying a tree where the searched file exists is disclosed (for example, see Patent Document 1).

  In addition, the input file used to generate a specific file and the file that can be managed by associating the output file output from the specific file with the specific file and generating the related diagram A management system is disclosed (for example, see Patent Document 2).

JP 2001-043331 A JP-A-9-185660

  However, the file management system described in Patent Document 1 having a mechanism for displaying a tree where the searched file exists is for hierarchically displaying and managing the storage location where the file exists. It was unclear what kind of connection the files had.

  As for the tree display method, “+” is displayed and “+” is designated when a storage location (eg, folder) in a lower hierarchy is included in a storage location (eg, cabinet) in a certain upper hierarchy. And the lower-level storage location names included in the list are displayed in the same hierarchy to display a tree structure, and cannot be displayed in association with files.

  Furthermore, although the conventional file search result is shown in a tree display, it is generated from the path information in which the file itself exists, and the display data cannot be changed by dynamically generating a tree.

  In addition, in the file relation diagram output method disclosed in Patent Document 2, it is possible to display the files in association with each other. In this method, however, an upper file and a lower level file centered on the designated file are displayed. To output the related chart. Accordingly, when a plurality of files are managed hierarchically, it is impossible to display a tree of all related files including the specified file when an unknown file is specified in which hierarchy the specified file is located.

  Furthermore, in other viewpoints, Patent Document 1 and Patent Document 2 do not assume a case where the present invention is applied to a Web system. Therefore, it is necessary to generate HTML data in order to display a tree structure. It is necessary to combine image files such as GIF and JPEG, but the above-described conventional technology does not disclose generation of such an HTML file for display.

  As mentioned above, making the entire related file tree visible is very useful for managing data files. However, for example, when a contract is digitized and filed, the hierarchy may be too deep in each relationship. There can be situations where the relationship is difficult to understand. For example, despite the fact that the entire tree relationship is a huge tree, if the part that can be displayed is a part of it, rather than giving a system constraint, another tree structure was created and managed In some cases, the relationship between data files may be easier to understand. Therefore, it may be better to limit the expansion of the tree structure systematically.

  The conventional technology does not restrict the data that can be expressed in the tree structure. Therefore, if the restriction is imposed, the tree structure is always conscious of how many tree structures the administrator can perform. It had the disadvantage that it was necessary to prevent it from spreading too much.

  The present invention has been made in view of the above problems, and an object of the present invention is to provide a data file management apparatus, method, and program capable of visually understanding the relationship between data files.

  The present invention also provides a data file management device that makes it unnecessary to be aware of how many associations can be made to the tree structure by controlling and visually expressing the association when it is desired to limit the tree structure. Aimed at methods and programs.

  An object of the present invention is to solve the above-described problems, and a data file management device according to the present invention is associated with a database including association information for associating a plurality of data files and each of the plurality of data files with the association information. A two-dimensional arrangement of a data file information display section that displays data file information for each data file in the group of data files and a relation display section that displays the relationship between the displayed data file information and each adjacent data file Display pattern storage means for storing the display pattern, data file arrangement determining means for determining a position for displaying the data file information of each data file of the data file group associated with each other using the association information, and Association between adjacent data files in position A relation display determination means for determining a relation display to be displayed on the relation display section using the connection information, and a data file is arranged between two adjacent data files using the association information between the adjacent data files at the determined position. If it is possible to arrange, if it is possible to arrange, if the number of data files associated with the arrangement does not exceed a predetermined limit, it is determined that the data file can be added. And the data file information of each data file is arranged at the position determined by the data file arrangement determining means of the two-dimensional display pattern read from the display pattern storage means, and the relation display determined by the relation display determining means is When it is determined that it can be added to the dimension display pattern and added by the association addition determination means Characterized in that an information image generation means for generating an image for displaying information associated with a plurality of data files with additional position display images are arranged in a two-dimensional display pattern.

  Further, the data file management device of the present invention combines a second data file group having another tree structure with a predetermined position of the first data file group having a tree structure to create a new tree structure. A receiving unit that receives input of combined position information indicating a predetermined position to generate a third data file group having a database, a database including association information that associates each of the plurality of data files and the plurality of data files, and association A data file relation data generating means for generating data file relation data indicating a relation between data files constituting a data file group having a tree structure using the information, and the first data file and the first data file based on the coupling position information; Data file that generates a third data file group that combines the two data file groups The number of data files associated in the third data file group is determined from the combining means, the combined position information, and the data file related data related to the data files included in the first data file group and the second data file group. The combination determination unit for determining whether the limit value is not exceeded and the data file group combination unit are configured to determine whether the data determination unit determines that the number of data files associated with the combination determination unit exceeds a predetermined limit value. It is characterized by operating so as not to perform the group joining process.

  According to the present invention, it is determined whether or not a data file can be arranged between two adjacent data files using the association information between the adjacent data files at the determined position. When the number of data files associated with the placement does not exceed the predetermined limit, it is equipped with an association addition judgment unit that judges that data files can be added. Display can be performed without being aware of the number of users that can be associated.

  According to another aspect of the present invention, it is determined whether or not the combined data files exceed the limit when combining a plurality of data file groups, and the combining operation is not performed when the limit is exceeded. By doing so, the spread of the data file tree can be suppressed.

Hereinafter, an image processing method according to the present invention will be described with reference to the drawings.
In this embodiment, a contract file management system is taken as an example. Data such as an image of a contract is an object of a data file. In general, an association such as a basic contract and a memorandum is made between contracts. In this embodiment, the association is processed so as to be expressed by various tables (association processing), and is used for managing data files. The data file of the contract is read from the contract by a scanner or the like and stored in the database in a format such as PDF. Association can also be set at this time (new registration process).

  Data files are managed using the association information set in this way. First, based on the association information between the data files, a group of data files associated with the association is generated (associated data files). Group generation). Thereafter, a display image is generated so that the data file group is visualized and displayed so that the association between the data files becomes clear (generation of a related diagram display file). The display image thus obtained is transmitted to the user's personal computer or the like and displayed on the screen.

  In particular, the best mode of the present invention assumes a case where a tree display is performed using an HTML file so as to enable browsing on a Web system. In other words, a relation display for representing a tree relation (for example, a straight line connecting the files and a T-shaped notation) is generated in advance as a JPEG or GIF file, and which relation display is dynamically determined based on the relationship between the files. By deciding whether or not to arrange at the position, an HTML file is configured to enable display in a general-purpose browser.

(System configuration of this embodiment)
FIG. 1 is a diagram showing the configuration of a data file management system according to an embodiment of the present invention. Note that the configuration of various terminals connected to the network 100 in FIG. 1 is an example, and it goes without saying that there are various configuration examples depending on applications and purposes. The network 100 is configured by a LAN having an environment in which communication is possible using a TCP / IP protocol. The data file management server 110 stores electronic data files and management data for managing bibliographic information of each data file and association data between data files. In addition, the management server 110 has a function as a Web server, and has a structure capable of performing a response process with respect to an access performed by the http protocol using a general-purpose browser from the PC 130 as a client device. Further, the management server 110 receives electronic data from the multifunction device 120 having an electronic data generation function such as reading a printed matter or a photograph with a scanner and generating image data, or a network transmission function, and stores the data in a predetermined storage location. It is possible to use it in the place. The management server 110 also has a function for converting a received PDF file into a display JPEG image used when generating display data as the above-described Web server after receiving a PDF file or the like. .

  The MFP 120 has a document scanning function, a PDF file creation function for scanned data, a file transfer function using SMB (Server Message Block), etc., and scans the document according to the instructions of the operator and digitizes it. At the same time, a file such as a PDF file is generated, and a series of processes such as transferring the file to a preset storage location (folder) is executed.

  The PC 130 is a general-purpose PC used by a user, has a communication function capable of bidirectional communication with the management server 110 and a general-purpose browser application, and can communicate with the management server 110 using the http protocol. The general-purpose browser has functions such as transmission of CGI parameter information for bidirectional communication.

  Next, the hardware configuration of the management server 110 and the PC 130 of the present invention described with reference to FIG. 1 will be described with reference to FIG. FIG. 2 is a diagram illustrating a hardware configuration of the management server device 110 according to the embodiment of this invention. In FIG. 2, the CPU 201 comprehensively controls each device connected to the system bus 204. The ROM 203 or the external memory 111 stores an operating system (OS) that is a control program of the CPU 201 and programs for realizing various functions described later of each server or each client.

  The RAM 202 is used as a main memory, work area, temporary save area, and the like for the CPU 201. The input controller 205 controls input from the input unit 209. Examples of the input unit 209 include pointing devices such as a keyboard and a mouse in devices such as a server and a client. In the printing apparatus such as the multifunction machine 120, a touch panel, a button, a switch, and the like can be given.

  The video controller 206 controls display on the display unit 210. Examples of the display unit 210 include a CRT and a liquid crystal. An external memory controller (MC) 207 controls access to the external memory 111 that stores a boot program, various applications, font data, user files, edit files, printer drivers, and the like. In addition, it can also be said that it has a database function for storing various tables and parameters including association data for realizing various functions of each server or each client. Examples of the external memory 111 include a hard disk (HD), a floppy (registered trademark) disk (FD), a compact flash (registered trademark) connected to a PCMCIA card slot via an adapter, and smart media.

  The communication I / F controller 208 executes communication control processing with an external device via the network 100. Specifically, data is transmitted to a partner device via a network, or data from another device connected to the network is received.

  A control program for realizing the present invention is stored in the external memory 111, loaded into the RAM 202 as necessary, and executed by the CPU 201. Further, a data file 213 and various information tables 214 used in the control program 212 according to the present invention are also stored in the external memory 111 in the same manner. Detailed descriptions of these data files and tables will be described later.

  As described above, the PC 130, which is a general-purpose personal computer, is not particularly described because the basic configuration is the same as that of the management server, but basically has a general-purpose browser. The object of the present invention can be achieved if an image is displayed by communicating with the management server 110 via the NIC and an instruction input mouse or keyboard is provided.

  Next, a basic processing flow of an embodiment of the data file management system of the present invention will be described with reference to FIGS. In this embodiment, a data file such as PDF data generated by scanning or the like in the MFP 120 is stored in advance in a specific management location of the management server 110, and the image conversion function of the management server 110 for each data file is stored. Thus, the display JPEG image (thumbnail image as data file information, etc.) is associated and saved.

  In addition, the management target in this embodiment is a contract, and the data file is image data of the contract. The contracts to be dealt with here are contracts for contracts in which a plurality of contracts exist such as real estate related contracts and their relations are complicated. Therefore, when managing, it manages based on the correlation of the data files which are the electronic data of a contract. The contract of this embodiment has a “basic contract” and “individual contract” and “memorandum” associated with the basic contract in operation, but the purpose of the present invention is how each is related. It is to manage visually.

(Description of each table)
Before describing the processing flow in detail, first, an outline of each information table necessary for the description of the processing flow and its relationship diagram will be described with reference to FIG. FIG. 5 is a conceptual diagram of an association table for associating contracts according to the present embodiment.

  In FIG. 5, items marked with ● are the primary keys of each table. Here, “501” is a “document table” created when each data file is first stored in the management server 110. The items are a document SEQ number which is a sequence number, and the name of the data file itself. Contains the file name. The PDF data that is a data file and the display JPEG that is display data when displaying the data file are internally associated with each other so that the same document SEQ number is assigned and distinguished by the extension.

  The table 502 is a “bibliographic information table” for each data file. Tables 502-a and 502-b show bibliographic information records for different data files, and are managed using the contract SEQ number as the primary key. The table 503 is a “bibliographic_document-related table” in which respective primary keys are associated with each other in order to associate the “document table” 501 with the “bibliographic information table” 502. The table 504 is a “contract document related table” that indicates a parent-child relationship by describing correspondence between primary keys of bibliographic information in order to associate each contract document and memorandum. The item is composed of a contract SEQ number and its parent contract SEQ number. If the parent contract SEQ number is NULL, it is like a basic contract with no further hierarchy, and the data file of the contract SEQ number is displayed only on the top hierarchy of the related diagram as shown in FIG. 13, for example. It should be. Since the contract association table 504 includes only the information for specifying the data data file on the first layer as the association information, the amount of information can be smaller than the file path information as seen in other systems. Therefore, the amount of data can be suppressed.

  Hereinafter, each step is stored as a control program in the external memory 111 of the management server 110, and the CPU 201 loads the program into the RAM 202 and executes it. First, the user receives a login screen (not shown) from the management server by accessing the URL set in the management server 110 on the PC 130, and displays the contents by the browser. Next, an authentication request using a user ID and a password is made from the PC 130 to the management server 110.

  In step S <b> 301, the management server 110 determines whether authentication has been completed using a user master table (not shown) (stores the user ID and password of each user). If the authentication is successful, the process proceeds to S302. In step S302, the main menu screen shown in FIG. The PC 130 displays the main menu in FIG. 7 on the browser.

  In the main menu of FIG. 7, there are an output menu, an input menu, and function buttons that can be maintained, but only the “registration association registration” button 701 of the input menu related to the present invention will be described. A “contract association registration” button 701 is used for association. This is for data files that have already been registered with various information such as bibliographic information related to the data file and that are not associated yet, or that are still associated with other data files. Used when changing associations.

  Returning to the description of the processing flow, the CPU 201 of the management server 110 determines whether or not the “contract / memorandum association” button 701 is pressed in S303. Here, the button press information is determined based on the received content of CGI (URL information). If button press information is not received in step S303 (if No), other processing is performed.

(Association process)
If the “registration association registration” button 701 is pressed in step S303, a search condition input screen for searching for a contract to be associated as shown in FIG. The data is transmitted via the communication I / F controller 208. After that, when the information that the search condition of the data file and the search instruction button 1401 are pressed is received in step S305, the data corresponding to the data file stored in the external memory 111 is received in step S306 according to the input search condition. Perform a search. In step S307, a search result screen is generated and an association data search list (for example, the result list shown in FIG. 12) is transmitted to the PC. In FIG. 12, buttons 1201 to 1203 are selection buttons for selecting a data file to be associated.

  Next, in step S308, the CPU 201 analyzes information received from the PC 130 to determine whether or not a selection instruction is input, and thereby determines a target data file to be associated. That is, if there is a selection instruction in step S308, it is determined which data file has been selected based on the CGI parameter. Here, it is assumed that the CGI parameters are associated with the buttons 1201 to 1203 of the image data generated in step S307 described above.

  Next, in this state, in step S309, a screen (for example, a search screen shown in FIG. 14) for inputting a search condition for searching for an associated data file is transmitted. In step S310, it is determined whether or not the input information input in each input field of FIG. 14 and the information for instructing the search are input. If input (in the case of Yes), in step S311 the same as S306. Perform a data search. Thereafter, a search result image is generated in the list format shown in FIG. 12 and transmitted to the PC 130 (step S312).

  In step S313, it is determined whether there is an instruction to select a data file to be associated in the same process as in S308. If there is a selection instruction (in the case of Yes), the process proceeds to step S314. Next, in step S314, a display file for displaying a related diagram relating to the data file selected in step S313 is generated. The related diagram display file generation processing will be described later with reference to the processing flow of FIG.

  The association diagram display file generated and transmitted in step S314 is received by the PC 130 and displayed on the screen (for example, association position information of FIG. 13), and the user shows the position for association while viewing this image. Enter information. In step S315, the association data is determined. If there is an input, the information is used to update the information in the contract related table 504 as shown in FIG. 5, for example.

(Generation of associated data files)
Next, generation of an associated data file group is described in step S314 of FIG. 3 using the processing flow of FIG. 4, and then generation of a related diagram display file and transmission processing are described in detail.

  First, in step S401, the contract / memorandum data file selected in step S313 described above is set as a search target in the temporary storage area of the RAM 202. In step S402, it is determined whether there is a parent contract for the data file to be searched with reference to the contract related table 504 in FIG. Here, when the parent data file (one level up) exists (in the case of Yes), the search target is changed to the parent data file (step S403) and the process is repeated.

  If there is no parent contract in step S402 (in the case of No), the process proceeds to step S404. Here, the case where there is no parent contract means that the parent contract SEQ number in the contract related table 504 is NULL, that is, the basic contract that is the data file that is the center of the topmost hierarchy, that is, the root data file group. Means books.

  In step S404, the current search target data file is saved as display data, and a searched flag is set. This means that the top data file has been searched as display data. Next, in step S405, the contract SEQ number in which the data file to be searched is set in the parent contract SEQ number is searched from the contract related table 504. Here, if it exists (in the case of Yes), the contract SEQ numbers of all detected data files are stored as display data (step S406). An example of the display data is shown in FIG. The display data is temporary data generated on the RAM 202. The “searched flag” indicates that the determination in step S405 has been completed for the data file as a search target. Here, the flag “1” means the end, and when all the flags are “1”, the data file group is completely generated.

  Here, it is determined from the searched flag in the display data of FIG. 15 whether or not the determination of S405 has been completed for all display data (step S407), and if there is still an unsearched target (flag “0”), the search target Then, the CPU 201 operates to set the flag (step S408) and perform the determination of S405.

(Generation of related diagram display file)
If all data files that can become display data have been searched in step S407 (in the case of Yes), a display relation code is generated from the information in the display file table shown in FIG. 15 and set in the temporary storage area of the RAM 202 ( Step S409).

  FIG. 16 is a display file relation data table showing the relation among a display data file having a predetermined contract SEQ number, a display relation code, the number of elements in the horizontal direction, and a number (own number) when the child is a child. FIG. The display file relation data table is used to arrange image data of each data file and related parts display when generating a display image of a data file group having a tree structure as shown in FIG. Further, the data included in the table of FIG. 16 is generated based on the parent-child relationship information that is the information on the association between the data files described in FIG. 5, and means the relationship of the data file that is the configuration information of the data tree. It is data. In this embodiment, as shown in FIG. 16, the display relationship code is composed of a character string. The display relationship code of only “1” means the parent contract, and is information for displaying a reduced image in which the cover of the parent contract is stored as a JPEG file. “1-1” refers to the display data of the contract that should be displayed immediately after the contract of “1”. “1-1-1” is displayed immediately behind “1-1” as a parent. The number of characters in the character string (“1-1” is 3 characters including hyphen) means a column in the template described in FIG. 6 described later. The number of elements in the horizontal direction is composed of a character string. This is information indicating in which hierarchy the contract is located. In the example of the contract with the display relation code “1-1” in FIG. 16, the value is “2” because it is a child of the contract SEQ number 1. The number when you are a child (your number) consists of a character string. In other words, when the contract is in a parent-child relationship, this is information indicating the child number of the child contract. In FIG. 16, the contract with the display relationship code “1-1-2” will be described as an example. The parent of this contract is the contract SEQ2 and its child is the contract SEQ4 consisting of the contract SEQ3 and the contract SEQ4. Since it becomes a child, the value of its own number is “2”.

  By generating the display relationship code, it is possible to eliminate the calculation process to check the parent-child relationship of the data file each time processing is performed even when generating a related diagram showing the tree structure of the data file, thereby improving the overall processing speed. Can do. This is especially effective when the number of files increases. After creating the display relationship code, data of a two-dimensional array as shown in FIG. 8 is created. First, the size of the two-dimensional array can be calculated as shown in FIG. There are two types of data set in the two-dimensional array: contract display data and related parts display data. In the case of contract display data, information includes data type, contract SEQ number, and ID for identifying a thumbnail image. In the case of related component display data, information includes a data type, an image type, a parent contract SEQ number, and a child contract SEQ number. The created two-dimensional array is set in a temporary storage area of the RAM 202. FIG. 10 shows two-dimensional array data set in the actual case of FIG.

  In addition, when it is desired to set a limit on the number of hierarchical levels of association or the number of children that can be associated at the time of association, if the place where the tie point (for example, 607 in FIG. 6) is originally set exceeds the limit value, It is also necessary to replace with an image other than the attachment point. The flowchart shown in FIG. 11 shows processing when creating a two-dimensional array as shown in FIG. Note that FIG. 11 of the present embodiment will be described with a focus on processing when setting a linking point image. First, in step S1101, the information of the display data file related data table shown in FIG. In step S1102, it is determined whether or not the image type set in the two-dimensional array is a “linking point”. In FIG. 6, the position of the array for setting “linking point” as the image type is, for example, (1, 3), (1, 5), (3, 3), (3, 5), or the like. If the image type is “linking point”, the process proceeds to step S1103. If the image type is not “linking point”, the process proceeds to “other processing”. In step S1103, the number of associateable hierarchies in the external memory 111 and the number of associateable children are acquired and set in the temporary area of the RAM 202.

  In step S1104, the contract SEQ number that is the parent of the linking point is acquired. In step S1105, information (one-dimensional array) of the contract with the contract SEQ number acquired in step 1104 as a parent is acquired. In step S1106, it is determined whether or not the location is a location where the image type is a linking point and “n” is entered in the child contract SEQ number. If it is a place where “n” is entered, the process proceeds to step S1107. If it is not “n”, the process proceeds to step S1108. In step S1107, it is determined whether the number of arrays acquired in step S1107 is greater than one. If it is greater than 1, there is a possibility that a linking point may be set, so that the process proceeds to step S1109. If it is less than 1, the linking point is not set, and the process proceeds to “other processing”.

  In step S1108, it is determined whether the image type is a linking point and “” ”” is added to the child contract SEQ number. The place where “” ”is inserted is a place that is set when there is no child contract. If it is a place where "" "" is entered, the process proceeds to step S1115. If it is not a place where "" "" is entered, the process proceeds to step S1109. In step S1109, information is acquired one by one from the child array acquired in step S1105, and contract information (one-dimensional array) having the contract SEQ number as a parent therein is acquired. In step S1110, it is determined whether the number of arrays acquired in step S1109 is 1 or more. In the case of 1 or more, it can be determined that there is still a child contract, so in order to obtain information from the child contract information, go to step S1109. If it is smaller than 1, there is no child contract. Since it can be determined, the process proceeds to step S1111.

  In step S1111, the number of elements in the horizontal direction of the contract in the information acquired in step S1109 is acquired. In step S1112, it is determined whether the number of hierarchies exceeds the limit value. When the number of hierarchies exceeds the limit value, the process proceeds to step S1114, and when it does not exceed the limit value, the process proceeds to step S1113. In step S1113, “linking point” is set as the image type. In step S1114, an image type other than “linking point” is set.

  In step S1115, the maximum value of “own number” is acquired from the array acquired in step 1105. In step S1116, it is determined whether the number of children exceeds the limit value (number of children that can be associated) acquired in step S1106. If the number of children exceeds the limit value, the process proceeds to S1114. If the number does not exceed the limit value, the process proceeds to Step S1113.

  As shown in FIGS. 6, 8, and 9, the contract JPEG file and the related component display group are alternately arranged to generate an HTML data file for display, that is, a two-dimensional display pattern. The display data of the book is arranged in a predetermined column. Also, the difference between “1-1-1” and “1-1-2” is that both are displayed with “1-1” as the parent and displayed in the same column (column). “1-1-2” is lower than “1-1”, and is displayed in a row (row) below a row in which a linking point image as a title or related component display is arranged.

  Further, in the “other processing” shown in FIG. 11, a process or data file for specifically arranging the related component displays 601 to 608 shown in FIG. 6 from the information about the data file shown in FIG. 16 when creating the data of the two-dimensional array. The arrangement of itself is performed. For example, six small related component displays are arranged between the contract document SEQ1 and the contract document SEQ2, as can be seen in FIGS. At this time, for example, if there is a data file of “1-2” other than the relationship display code “1-1” of the contract document SEQ2, a T-shaped related component display of 601 is arranged in the array (1, 4). Will be. If there is a limit on the number of data files in the horizontal direction, if the limit value has already been reached, “horizontal bar” of 602 is set as the image type in the array (1, 3) in which the “linking points” are arranged. It is what is done. Incidentally, the contract data file is arranged in (1 + 2m, 1) or (1, 1 + 6n) in the array. However, m and n are integers of 1 or more.

  What is finally displayed using the relationship table shown in FIG. 16 is an image example as shown in FIG. As the arrangement rule of each contract file, when there is a file at the position “1-1-2” indicated by 4 in FIG. 7, the file of “1-2” is not the same row as 4 and Displayed in a row. However, if “1-1-3” exists, it becomes a lower row (“row”), and “1-2” is changed depending on whether or not there are other items displayed in the lower row (row). The row to be displayed is different.

  Returning to the description of FIG. 4, in step S410, display data of a relationship diagram as shown in FIG. 17 is generated by using the display relationship code shown in FIG. 16 and the template and the related component display shown in FIG. Then, the relationship diagram display data is transmitted to the user's PC terminal, and the process ends.

  FIG. 18 is a diagram showing a detailed processing flowchart of step S410 in FIG. In step S1901 in FIG. 18, the two-dimensional array created in S409 is used to determine the layout position of the template in FIG. Here, the template of FIG. 6 is for displaying contract document display data and related component display data alternately in the column direction, and changes in the column and row directions depending on the tree structure to be displayed. The template in FIG. 6 is an example, and any template may be used as long as the position where the display file is arranged and the position of the related component display can be determined by a matrix or coordinates. In the template of FIG. 6 described in the present embodiment, rows and columns are described in a fixed manner for the sake of explanation, but as will be apparent from the following flowchart, it is variable depending on the number of display files and the relationship between display files. This is a possible configuration. However, the templates can be arranged as long as the number of display files is small even if the number of rows and columns is limited in advance, and it goes without saying that the template is within the scope of the present invention.

  First, in step S1901, “1” is set for the X-axis and Y-axis indices of the two-dimensional array. In step S1902, it is determined whether the value of m exceeds the maximum value of the X axis of the two-dimensional array. If the maximum value is exceeded, the process ends because there is no data to set. If it does not exceed the maximum value, the process proceeds to step S1904. In step S1904, it is determined whether the maximum value of the Y axis of the two-dimensional array is exceeded. If it exceeds the maximum value, the process proceeds to step S1905 if it does not exceed step S1910.

  In step S1910, “1” is set to n, and “1” is added to m. This is performed to initialize the Y axis and acquire the data after shifting the X axis by one because the maximum value of the Y axis has already been exceeded, and then the process proceeds to S1902.

  In step S1905, the “data type” information shown in FIG. 8 in the two-dimensional array (m, n) is acquired. In step S1906, it is determined whether or not the “data type” acquired in step S1905 is a contract. If it is a contract, the process proceeds to S1907. If it is not a contract, the process proceeds to S1911.

  In step S1907, since the contract data can be specified, the “thumbnail image ID” shown in FIG. 8 is acquired. In step S1908, a thumbnail image is acquired using the “thumbnail image ID” acquired in step S1907.

  Thus, since it is possible to identify the related component display data, the “image type” shown in FIG. 8 is acquired in step S1911. In step S1908, an image file is acquired using the “image type” acquired in step S1907.

  In step S1909, since a thumbnail image or an image file has been acquired, “1” is added to n. Then, the process proceeds to step S1904, and finally, thumbnail images or image files of all information in the two-dimensional array are acquired.

  As described above, according to the present embodiment, it is possible to visually express and display the relationship between data files, and for example, which data file information should be referred to for a predetermined data file. It becomes easy to understand. Furthermore, since it is possible to display locations that can be registered when associating data files with each other, a new associating position can also be found when newly associating a large number of data files already associated. There is an advantage that it is clear and easy to understand at which position it is registered and at what position it should be registered. Also, if there is a limit value, if there is a possibility of exceeding the limit value, the linking point image will not be displayed in advance, so it is clear that the user can only associate with the location where the linking point is displayed There is an advantage that it is easy to understand.

(Other modified embodiments)
In the above-described embodiment, when the data file tree of the association destination is displayed, the linking point (for example, 607 in FIG. 6) is originally limited due to the restriction made up of the set number of association layers and the number of children that can be associated. ) Was replaced with an image other than the linking point. Next, the outline of another modified embodiment will be described with reference to FIG.

  The associated data file may be composed of a plurality of already associated data files as in the contract related figure column 2001. That is, in the above embodiment, the data file selected in S308 of FIG. 3 is already associated with another data file, and the related diagram display data generation of FIG. 4 is not limited to the data file tree of the association destination. It is also assumed that the data file to be associated is also performed, and the “contract related diagram” on the right side of FIG. 13 also displays a data file group having a tree structure. In this case, even if the linking point is displayed in the data file tree display of the related contract agreement related figure column 2002, if the linking position information instruction (hereinafter referred to as linking instruction) specifying the linking point is performed, the restriction is performed. It may exceed the number. In this modified embodiment, control is performed so as to warn that the limit number has been exceeded in the association instruction.

  Hereinafter, with reference to the flowchart of FIG. 21, an operation of a warning process executed by the CPU 201 when the association instruction is exceeded when the limit including the set number of associated hierarchies and the number of children that can be associated is exceeded will be described. In this processing, a case where it is determined whether or not the limit on the number of layers is exceeded will be described as an example.

  FIG. 21 is a modification of the process of FIG. 3 and will be described in detail with a focus on differences from FIG. First, in the present modified embodiment, in step S314 of FIG. 3 described in the above-described embodiment, display data having two data file trees composed of an “associated contract related diagram” and a “contract related diagram”. Is transmitted to the PC 130 (state shown in FIG. 20). At this time, in step S409 of FIG. 4, two display data file related data tables (FIG. 16) and two-dimensional array data of FIG. 10 are created for "related contract related figure" and "contract related figure". Will be used. These are temporarily stored in the RAM 202.

  Thereafter, when it is determined in step S315 that there is an association instruction, processing for determining whether or not the limit is exceeded (steps S317 to S321) is executed next. In this step S315, information on the association position specifying the linking point is acquired and stored in the RAM 202.

  In step S317, the limit value is acquired from the external memory 111. Here, the number of layers is used as the limit value.

  Next, in step S318, the number of hierarchies of the two data file trees is determined using the two display data file relation data tables for the “relation destination contract related chart” and the “contract related chart” stored in the RAM 202. get. This is the number of elements in the horizontal direction obtained in step S1111 of FIG.

  In step S319, a new number of hierarchies when two data file trees are associated with the designated position information is calculated and acquired from the associated position information acquired in step S315 and the number of hierarchies acquired in step S318. Since the number of hierarchies may change depending on the associated position, the position is taken into consideration. In addition, by generating a new display data file relationship data table and acquiring a new number of layers when the data file name existing in the two display data file relationship data tables is associated with the designated association position, realizable.

  In step S320, the new number of hierarchies is compared with the number of hierarchies that is the limit value acquired in step S317. If the new number of hierarchies exceeds the limit value (NO), an error message as shown in FIG. 22 is transmitted to the PC 130 in step S321. If the new number of hierarchies does not exceed the limit value in step S320 (Yes), the information in the contract related table is updated in step S316.

  Although the number of hierarchies has been described in this manner, for example, the limit value can be set to the number of data files associated with the limit value. In this case, in step S318, “own number” is acquired from the display data file related data table of FIG. In step S319, a new “own number” is calculated and acquired in consideration of the association position. Further, in step S320, the operation similarly compares with the limit value.

  Although the embodiments have been described in detail above, the present invention can take an embodiment as, for example, a system, apparatus, method, program, or storage medium, and specifically includes a plurality of devices. The present invention may be applied to a system including a single device.

It is a figure which shows the structure of the data file management system of one Embodiment in this invention. It is a figure which shows the hardware constitutions of the management server apparatus of embodiment of this invention. It is a figure which shows the flowchart for describing one Embodiment of this invention. It is a figure which shows the flowchart for describing one Embodiment of this invention. It is a conceptual diagram of the various related tables for performing the correlation between the contract documents concerning this embodiment. It is a figure which shows the HTML data file for a display by arrange | positioning alternately the JPEG file of a contract in this embodiment, and a related component display. It is a figure which shows the main menu displayed on the browser of a user's PC in this embodiment. It is a figure which shows the data definition which enters into the two-dimensional arrangement | sequence for display by arrange | positioning the JPEG file of a contract document and related component display alternately by this embodiment. It is a figure which shows the information which calculates | requires the magnitude | size of the two-dimensional arrangement | sequence for a display by arrange | positioning alternately the JPEG file of a contract document and a related component display in this embodiment. It is a figure which shows the data which enter into the two-dimensional arrangement | sequence for a display by arranging the JPEG file of a contract in this embodiment, and a related component display alternately. It is a figure which shows the flowchart for describing one Embodiment of this invention. It is a figure which shows the example of the correlation destination data search list screen in this embodiment. It is a figure which shows the example of the related position information of one Embodiment of this invention. It is a figure which shows the example of the search condition input screen in this embodiment. It is a figure which shows the example of the data for a display in this embodiment. It is a figure which shows the relationship between the display data file which has a predetermined contract document SEQ number, and a display relation code. It is a figure which shows the example of the display data of the relationship diagram in this embodiment. It is a figure which shows the flowchart for describing one Embodiment of this invention. It is a figure which shows the example of the data for a display when the number of hierarchy in this embodiment is restrict | limited to three. It is a figure which shows the example of the display data of the relational diagram in this deformation | transformation embodiment. It is a figure which shows the flowchart for describing one Embodiment of this invention. It is a figure which shows the example of a display of the error in this deformation | transformation embodiment.

Explanation of symbols

100 LAN
110 File management server 111 External memory 112 Module structure 120 Multifunction machine 130 PC
201 CPU
202 ROM
203 RAM
204 System bus 205 Input controller 206 Video controller 207 Memory controller 208 Communication interface controller 209 KB
210 CRT
501 to 504 Tables 601 to 609 Related parts display 701 Buttons 1201 to 1203 Data file display 1401 Search condition and search instruction buttons

Claims (11)

A database including a plurality of data files and association information associating each of the plurality of data files;
The relationship between the data file information display unit that displays the data file information for each data file of the data file group that is mutually associated by the association information and each adjacent data file of the displayed data file information is displayed. Display pattern storage means for storing a two-dimensional display pattern for arranging the relationship display unit;
Data file arrangement determining means for determining a position for displaying data file information of each data file of the data file group associated with each other using the association information;
Relationship display determination means for determining a relationship display to be displayed on the relationship display unit using association information between the data files adjacent to each other at the determined position;
It is determined whether or not a data file can be arranged between the two adjacent data files by using the association information between the adjacent data files at the determined position. Association addition determination means for determining that the data file can be added when the number of data files associated with the data file does not exceed a predetermined limit;
The data file information of each data file is arranged at the position determined by the data file arrangement determining means of the two-dimensional display pattern read from the display pattern storage means, and the relation display determined by the relation display determining means is displayed. When it is determined that it is arranged in the two-dimensional display pattern and can be added by the association addition determination means, an additional position display image is arranged in the two-dimensional display pattern and information related to the plurality of data files is displayed. An information image generating means for generating an image to be displayed.   The data file management apparatus according to claim 1, wherein the two-dimensional display pattern includes the data file information display unit and the relationship display unit alternately arranged. The information image generation means generates an image that displays information related to the plurality of data files in a format that can be displayed on a browser in a client device,
The data file management apparatus according to claim 1, wherein the data file information is a JPEG file. The association information includes information of data files that are hierarchically positioned for each of the plurality of data files that are hierarchically related,
A central file determining unit that determines a data file that is a center of the association including the predetermined data file using the association information;
The association addition determining unit determines that the data file cannot be added when a data file exists beyond a predetermined number of hierarchies from the central data file. Or the data file management device according to 3; The association information includes information of data files that are hierarchically positioned for each of the plurality of data files that are hierarchically related,
The association addition determination unit determines that the data file cannot be added when the number of the associated data files existing in a hierarchy immediately below any one of the data files exceeds a predetermined number. The data file management apparatus according to claim 1, 2, or 3.   6. The data file management apparatus according to claim 1, further comprising determination condition storage means for storing a condition for determining that the data file can be added in the association addition determination means. . To combine a second data file group having another tree structure with a predetermined position of the first data file group having a tree structure to generate a third data file group having a new tree structure Accepting means for accepting input of combined position information indicating the predetermined position;
A database including a plurality of data files and association information associating each of the plurality of data files;
Using the association information, data file relationship data generating means for generating data file relationship data indicating a relationship between data files constituting a data file group having a tree structure;
Data file group combining means for generating the third data file group obtained by combining the first data file and the second data file group using the combination position information;
The number of data files associated in the third data file group is determined from the combination position information and the data file related data related to the data files included in the first data file group and the second data file group. A determination unit for determining whether or not the limit value is exceeded, and the data file group combination unit is determined by the combination determination unit that the number of associated data files exceeds the predetermined limit value. In this case, the data file management apparatus operates so as not to perform the data file group combining process. Storing a plurality of data files and association information associating each of the plurality of data files in a database;
A data file information display section for displaying data file information for each data file of the data file group associated with each other by the association information on the display pattern storage means, and each adjacent data file of the displayed data file information Storing a two-dimensional display pattern for arranging a relationship display unit for displaying a relationship with
A data file placement determining unit for determining a position for displaying data file information of each data file of the data file group associated with each other using the association information; and
A relationship display determining step for determining a relationship display to be displayed on the relationship display unit by using association information between the adjacent data files at the determined position by the relationship display determining means;
The association addition determination means determines whether or not a data file can be arranged between the two adjacent data files using the association information between the adjacent data files at the determined position, and can be arranged. If there is an association addition determination step for determining that the data file can be added when the number of data files associated with the placement does not exceed a predetermined limit;
The information image generation means arranges the data file information of each data file at the position determined in the data file arrangement determination step of the two-dimensional display pattern read from the display pattern storage means, and in the relation display determination step The determined relationship display is arranged in the two-dimensional display pattern, and when it is determined that the addition can be added in the association addition determination step, an additional position display image is arranged in the two-dimensional display pattern and the plurality of data A data file management method comprising: an information image generation step for generating an image for displaying information related to a file. To combine a second data file group having another tree structure with a predetermined position of the first data file group having a tree structure to generate a third data file group having a new tree structure An accepting step of accepting input of combined position information indicating the predetermined position;
Storing association information associating a plurality of data files and each of the plurality of data files in a database;
A data file relation data generation step for generating data file relation data indicating a relation of data files constituting a data file group having a tree structure using the association information;
A data file group combining step for generating a third data file group by combining the first and second data file groups using the combination position information;
The number of data files associated in the third data file group is determined from the combination position information and the data file related data related to the data files included in the first data file group and the second data file group. A combination determination step for determining whether or not the limit value is exceeded, wherein the data file group combination step is determined by the combination determination step that the number of the associated data files exceeds the predetermined limit value. In this case, the data file management method is a step that operates so as not to perform the data file group combining process. A program to be executed by a data file device,
Storing a plurality of data files and association information associating each of the plurality of data files in a database;
A data file information display section for displaying data file information for each data file of the data file group associated with each other by the association information on the display pattern storage means, and each adjacent data file of the displayed data file information Storing a two-dimensional display pattern for arranging a relationship display unit for displaying a relationship with
A data file placement determining unit for determining a position for displaying data file information of each data file of the data file group associated with each other using the association information; and
A relationship display determining step for determining a relationship display to be displayed on the relationship display unit by using association information between the adjacent data files at the determined position by the relationship display determining means;
The association addition determination means determines whether or not a data file can be arranged between the two adjacent data files using the association information between the adjacent data files at the determined position, and can be arranged. If there is an association addition determination step for determining that the data file can be added when the number of data files associated with the placement does not exceed a predetermined limit;
The information image generation means arranges the data file information of each data file at the position determined in the data file arrangement determination step of the two-dimensional display pattern read from the display pattern storage means, and in the relation display determination step The determined relationship display is arranged in the two-dimensional display pattern, and when it is determined that the addition can be added in the association addition determination step, an additional position display image is arranged in the two-dimensional display pattern and the plurality of data An information image generation step of generating an image for displaying information related to a file. A program to be executed by a data file device,
To combine a second data file group having another tree structure with a predetermined position of the first data file group having a tree structure to generate a third data file group having a new tree structure An accepting step of accepting input of combined position information indicating the predetermined position;
Storing association information associating a plurality of data files and each of the plurality of data files in a database;
A data file relation data generation step for generating data file relation data indicating a relation of data files constituting a data file group having a tree structure using the association information;
A data file group combining step for generating a third data file group by combining the first and second data file groups using the combination position information;
The number of data files associated in the third data file group is determined from the combination position information and the data file related data related to the data files included in the first data file group and the second data file group. A combination determination step for determining whether or not a limit value is exceeded, and the data file group combination step is determined by the combination determination step to determine that the number of associated data files exceeds the predetermined limit value. In this case, the data file group is not combined.

Images