Information processing device and program

Abstract

To provide an information processing device and program capable of improving usability related to a KPI tree.SOLUTION: A server device in a business support system is provided with a name identification processing part including acquisition means for acquiring node names and node types of nodes from tree data obtained by gradually setting relations showing nodes showing management goals and nodes showing measures for achieving the goals in a tree structure state, extraction means for extracting a reference node name of a set similar to sets of the node names and the node types acquired by the acquisition means from a first storage part for storing sets of reference node names and node types to be a name identification reference, and registration means for associating the node name and the node type acquired by the acquisition means with the reference node name extracted by the extraction means to register them in a second storage part, and executes processing relating to name identification of the node names of the nodes included in a KPI tree by cooperating with a GUI provision part and a design support part.SELECTED DRAWING: Figure 11

Description

[Technical field]

[0001] An embodiment of the present invention relates to an information processing device and a program. [Background technology]

[0002] At stores and other work sites, various business services (hereinafter, also referred to as services) are provided. At such work sites, the processing procedures of each element related to the implementation of the service may be designed as a business flow by using methods such as the Key Performance Indicator (KPI) tree method and Business Process Model and Notation (BPMN). For example, a technology has been proposed that can automatically create a business flow so that the input / output relationships between adjacent work are continuous.

[0003] By the way, a KPI tree represents various elements as nodes, and by arranging the nodes in a tree-like structure and visualizing them, it is used to see the relationships between elements and to identify elements. In addition, a KPI tree allows users to set any item (hereinafter also referred to as a node name) to the node.

[0004] However, in the KPI tree described above, if there is variation in node names between nodes intended to have similar content, the KPI tree cannot be integrated and processed when analyzing or utilizing it, and accurate processing results may not be obtained. Summary of the Invention [Problem to be solved by the invention]

[0005] The problem to be solved by the present invention is to provide an information processing device and a program capable of improving the usability related to a KPI tree. [Means for solving the problem]

[0006] An information processing device of an embodiment includes an acquisition means for acquiring a node name and a node type of a node from tree data in which the relationship between a node indicating a business goal and a node indicating a measure for achieving the goal is set in a step-by-step manner in a tree structure, an extraction means for extracting a reference node name of a set similar to the set of node name and node type acquired by the acquisition means from a first memory unit that stores sets of reference node names and node types that serve as the basis for name matching, and a registration means for associating the node name and the node type acquired by the acquisition means with the reference node name extracted by the extraction means and registering them in a second memory unit. [Brief description of the drawings]

[0007] [Figure 1] FIG. 1 is a diagram illustrating an example of a configuration of a task support system according to an embodiment. [Diagram 2] FIG. 2 is a diagram illustrating an example of a hardware configuration of the terminal device according to the embodiment. [Diagram 3] FIG. 3 is a diagram illustrating an example of a hardware configuration of the server device according to the embodiment. [Figure 4] FIG. 4 is a diagram illustrating an example of a data configuration of a KPI tree DB according to the embodiment. [Diagram 5] FIG. 5 is a diagram illustrating an example of a visualized KPI tree according to the embodiment. [Figure 6] FIG. 6 is a diagram illustrating an example of a data configuration of the business flow DB according to the embodiment. [Figure 7] FIG. 7 is a diagram illustrating an example of a visualized business flow according to the embodiment. [Figure 8] FIG. 8 is a diagram illustrating an example of a data configuration of the provisional registration table according to the embodiment. [Figure 9] FIG. 9 is a diagram illustrating an example of a data configuration of the item master data according to the embodiment. [Figure 10] FIG. 10 is a diagram illustrating an example of a data configuration of the name identification master according to the embodiment. [Figure 11]FIG. 11 is a diagram illustrating an example of a functional configuration of a terminal device and a server device according to the embodiment. [Figure 12] FIG. 12 is a diagram illustrating an example of a screen provided by the server device according to the embodiment. [Figure 13] FIG. 13 is a diagram illustrating an example of a screen provided by the server device according to the embodiment. [Figure 14] FIG. 14 is a diagram illustrating an example of a screen provided by the server device according to the embodiment. [Figure 15] FIG. 15 is a flowchart illustrating an example of a process executed by the server device according to the embodiment. [Figure 16] FIG. 16 is a flowchart illustrating an example of a process executed by the server device according to the embodiment. [Figure 17] FIG. 17 is a flowchart illustrating an example of a process executed by the server device according to the embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0008] Hereinafter, the embodiments will be described in detail with reference to the drawings. Note that the present invention is not limited to the embodiments described below.

[0009] Fig. 1 is a diagram showing a configuration example of a business support system according to an embodiment. As shown in Fig. 1, the business support system 1 includes a terminal device 10 and a server device 20. The terminal device 10 and the server device 20 are communicatively connected via a network N such as a LAN (Local Area network).

[0010] The terminal device 10 is a terminal device used by a user of the business support system 1. The terminal device 10 executes various processes in response to operations by the user. For example, the user operates the terminal device 10 to access the server device 20, thereby utilizing various functions provided by the server device 20. The terminal device 10 can be realized by a stationary terminal device such as a PC (Personal Computer), or a portable terminal device such as a notebook PC, a tablet terminal, or a smartphone.

[0011] The server device 20 is an example of an information processing device. The server device 20 provides various functions to the terminal device 10. For example, the server device 20 provides a function for creating and viewing a KPI tree and a business flow, which will be described later.

[0012] In this embodiment, the server device 20 is realized by a single information processing device, but the present invention is not limited to this. For example, the server device 20 may be realized by a plurality of information processing devices using a technology such as cloud computing.

[0013] Next, the configurations of the above-mentioned terminal device 10 and server device 20 will be described.

[0014] Fig. 2 is a diagram showing an example of a hardware configuration of the terminal device 10. As shown in Fig. 2, the terminal device 10 includes a computer configuration including a CPU (Central Processing Unit) 11, a ROM (Read Only Memory) 12, and a RAM (Random Access Memory) 13.

[0015] The CPU 11 is an example of a processor, and performs overall control of each unit of the terminal device 10. The ROM 12 stores various programs. The RAM 13 is a workspace in which programs and various data are expanded.

[0016] The terminal device 10 also includes a display unit 14 , an operation unit 15 , a storage unit 16 , and a communication unit 17 .

[0017] The display unit 14 is composed of a display device such as an LCD (Liquid Crystal Display). The display unit 14 displays various information under the control of the CPU 11. The operation unit 15 has a keyboard, a pointing device, etc. The operation unit 15 outputs the operation content received from the user to the CPU 11. The operation unit 15 may be a touch panel provided on the display screen of the display unit 14.

[0018] The storage unit 16 is composed of a storage medium such as a hard disk drive (HDD) or a flash memory, and maintains the stored contents even when the power is cut off. The storage unit 16 stores programs that can be executed by the CPU 11 and various setting information. For example, the storage unit 16 stores application programs such as a web browser that can utilize various functions provided by the server device 20.

[0019] The CPU 11 executes various types of processing by operating according to programs stored in the ROM 12 or the storage unit 16 and expanded in the RAM 13 .

[0020] The communication unit 17 is a communication interface that can be connected to the network N. The communication unit 17 communicates with an external device such as a server device 20 via the network N.

[0021] Fig. 3 is a diagram showing an example of a hardware configuration of the server device 20. As shown in Fig. 3, the server device 20 includes a computer configuration including a CPU 21, a ROM 22, and a RAM 23.

[0022] The CPU 21 is an example of a processor, and performs overall control of each unit of the server device 20. The ROM 22 stores various programs. The RAM 23 is a workspace in which programs and various data are expanded.

[0023] The server device 20 also includes a display unit 24, an operation unit 25, a storage unit 26, and a communication unit 27.

[0024] The display unit 24 is composed of a display device such as an LCD. The display unit 24 displays various information under the control of the CPU 21. The operation unit 25 has a keyboard, a pointing device, etc. The operation unit 25 outputs the operation content received from the user to the CPU 11. The operation unit 25 may be a touch panel provided on the display screen of the display unit 24.

[0025] The storage unit 26 is composed of a storage medium such as a HDD or a flash memory, and maintains the stored contents even when the power is cut off. The storage unit 26 stores programs that the CPU 21 can execute and various setting information. For example, the storage unit 26 stores web application programs that can provide various functions to the terminal device 10. The CPU 21 executes various processes by operating according to the programs stored in the ROM 22 or the storage unit 26 and expanded in the RAM 23.

[0026] Furthermore, the storage unit 26 stores a KPI tree DB 261, a business flow DB 262, a provisional registration table 263, an item master 264, and a name matching master 265, etc.

[0027] The KPI tree DB 261 is a table or database for storing and managing KPI trees. Here, a KPI tree is tree data in a tree structure in which the relationship between the business objectives of an organization or company (final objectives, which will be described later) and the measures for achieving the objectives (intermediate objectives, factors, solutions, services, etc., which will be described later) is set in a step-by-step manner by nodes.

[0028] Fig. 4 is a diagram showing an example of the data configuration of the KPI tree DB 261. As shown in Fig. 4, the KPI tree DB 261 stores customer names, KPI trees, etc. by associating the KPI trees with identifiable tree IDs.

[0029] The customer name field is used to register information that can identify the customer to which the KPI tree is applied. The KPI tree field is used to register the actual data of the KPI tree (hereinafter also referred to as a data file) or the address of the storage location of the data file.

[0030] The KPI tree is created using a method such as KPI (Key Performance Indicator) etc. The KPI tree can be displayed in a visualized state, for example, as shown in FIG.

[0031] Fig. 5 is a diagram showing an example of a visualized KPI tree. Fig. 5 shows a visualized KPI tree applied to the customer name "ABC Supermarket" shown in Fig. 4.

[0032] As shown in Fig. 5, the KPI tree is composed of multiple nodes connected in a tree structure. Here, the final goal node A, which is the root node, is a node for setting the goal to be achieved. The final goal node A corresponds to, for example, a KGI (Key Goal Indicator). For example, if the final goal is to increase the sales of a store, a node name such as "Sales" indicating the target content is set in the final goal node A.

[0033] One or more intermediate goal nodes B are connected to the final goal node A. One or more intermediate goal nodes B can also be connected to the intermediate goal node B. A node name is set in the intermediate goal node B to indicate an intermediate goal for achieving the goal (final goal or intermediate goal) set in the node immediately above. The intermediate goal node B corresponds to, for example, KPIs (Key Performance Indicators).

[0034] 5 shows an example in which intermediate goal node Ba, in which an increase in the number of customers visiting the store is set as the target content of the intermediate goal, and intermediate goal node Bb, in which an increase in the average customer spending is set as the target content of the intermediate goal, are placed below final goal node A. Also, an example is shown in which intermediate goal node Bc, in which a node name representing an increase in the number of sales points is set as the target content of the intermediate goal, and intermediate goal node Bd, in which a node name representing an increase in the unit price of one item are set as the target content of the intermediate goal, are placed below intermediate goal node Bb.

[0035] In addition, in the KPI tree, it is possible to place a factor node C, which indicates a factor for achieving the intermediate goal set in the intermediate goal node B, under the intermediate goal node B. The factor node C corresponds to, for example, a KSF (Key Success Factor).

[0036] FIG. 5 shows an example in which factor nodes Ca to Cd with the node names "improved quality," "product lineup," "sales floor," and "advertising" are placed under intermediate goal node Ba as factors for increasing the number of customers. Also, an example is shown in which factor nodes Ce and Cf with the node names "sales promotion" and "impulse buying" are placed under intermediate goal node Bc as factors for increasing the number of sales. Also, an example is shown in which factor node Cg with the node name "improved customer understanding" is placed under intermediate goal node Bb as a factor for increasing the average customer spending.

[0037] In addition, in the KPI tree, it is possible to place a solution node D, which represents a solution method for achieving (solving) the intermediate objective or factor set in the node immediately above, under an intermediate goal node B or factor node C.

[0038] FIG. 5 shows an example in which solution nodes Da and Db, to which the node names "store information visualization" and "product lineup optimization" are set, are placed under factor nodes Ca to Cc. Also, an example is shown in which solution nodes Dc to De, to which the node names "coupon issuance," "points management," and "POP creation" are set, are placed under factor node Ce. Also, an example is shown in which solution node Df, to which the node name "CRM (Customer Relationship Management)" is set, is placed under factor node Cg.

[0039] In addition, in the KPI tree, it is possible to place a service node E, which represents a specific service for realizing the cause or solution set in the immediately upper node, under a factor node C or a solution node D. Here, the service node E is located at the end of the tree structure, and is a specific measure for realizing the cause or solution set in the immediately upper node.

[0040] FIG. 5 shows an example in which a service node Ea with a node name of "Service A" is placed below a solution node Dc.

[0041] Each node constituting the KPI tree is assigned a node ID for identifying it. Information about the corresponding node is stored in association with the node ID. For example, a service node E is associated with a business flow related to the implementation of a service, verification items related to the verification of the effectiveness of the service, and the like.

[0042] The above-mentioned KPI tree is saved in, for example, JSON (JavaScript Object Notation) format. Note that the format in which the KPI tree is saved is not limited to JSON, and it may be saved in other data formats such as XML (Extensible Markup Language).

[0043] Returning to Fig. 3, the business flow DB 262 is a table or database for storing and managing business flows. A business flow is a data file in which each element related to the performance of a business and the execution contents executed by the element are described as a series of procedures. Specifically, the business flow describes, for each element related to the implementation of a service, the execution contents and procedures executed by the element.

[0044] Fig. 6 is a diagram showing an example of the data configuration of the business flow DB 262. As shown in Fig. 6, the business flow DB 262 stores a target service, a flow ID, a business flow name, and a data file in association with each other.

[0045] The target service field is used to register information specifying the service corresponding to the business process for which the business flow is described. Specifically, the node ID of the service node E specified as the target service, the tree ID of the KPI tree to which the service node E belongs, etc. are registered. Note that the method of specifying the target service is not limited to this.

[0046] The flow ID field stores a flow ID that can identify the business flow. The business flow name field stores information indicating the name of the business flow. For example, the business flow name is set to the name of the service implemented by the business flow (the node name of service node E). The data file field stores the data file of the business flow or an address indicating the storage location of the data file.

[0047] Business flows are created using techniques such as flowcharts and BPMN (Business Process Modeling Notation). Business flows are created according to the service content, but if the service content is the same or similar, it is possible to use the same business flow even if the KPI trees are different. Figure 6 shows an example in which a business flow with a flow ID of "F01" is used in service node Ea, which is included in each of the KPI trees with tree IDs T01 and T02.

[0048] The business flow is created using techniques such as flowcharts, BPMN (Business Process Modeling Notation), etc. The business flow can be represented in a visualized form, for example as shown in Figure 7.

[0049] 7 is a diagram showing an example of a visualized business flow, which is an example of a business flow related to the service node Ea (service A) of the KPI tree shown in FIG.

[0050] As shown in Figure 7, in the business flow, between a start event ST and an end event EN, a series of operations (or processing) related to the implementation of service A is described for each element that performs the operation. The business flow in Figure 7 shows an example in which the elements are a "customer" who visits a store, a "surveillance camera" and a "payment system" installed in the store, and a "store clerk" who works in the store.

[0051] Here, "surveillance cameras" are an example of hardware resources, and may be installed in multiple locations in a store, for example. Also, a "payment system" is an example of software resources, and is realized by the cooperation of multiple PCs (Personal Computers) such as POS and applications installed on the PCs. Note that, for example, additional services provided in conjunction with payment (e.g., point services) may also be included in the business flow. Hereinafter, the hardware resources, software resources, and additional services related to the implementation of the target service are collectively referred to as "elements."

[0052] The business flow in Figure 7 first describes the flow of a "customer" coming to the store (step Qa), selecting a product to purchase (step Qb), and proceeding to the cash register (step Qc). The flow of a "surveillance camera" installed in the store describes how the "customer" is photographed as he approaches the cash register (step Qd) and the photographed data is sent to a payment system installed in the store (step Qe). The flow of the "payment system" describes how the photographed data is received from the "surveillance camera" (step Qf), and customer information such as the "customer's" attributes derived from the photographed data is displayed on a display device (step Qg).

[0053] The flow of the "clerk" operating the cash register is described as follows: the "payment system" checks the customer information displayed by the "payment" system (step Qh), and performs the cash register operation for the items brought in by the "customer" (step Qi). The flow is also described as follows: the "payment system" executes "payment processing" (step Qj) in conjunction with the "clerk" performing the cash register operation.

[0054] It also describes that the "customer" pays for the product according to the "payment processing" of the "payment system" (step Qk) and leaves the store (step Ql). It also describes that the "payment system" saves data showing the details of the transaction upon payment (step Qm).

[0055] When a coupon service is implemented, for example, the payment system issues coupons that provide discounts or reductions depending on the amount of the product or price purchased in the payment process, and stores the number of coupons issued on a daily basis. Also, for example, the payment system provides discounts or reductions from the price of the product depending on the coupons presented during the payment process, and stores the number of coupons used on a daily basis.

[0056] Furthermore, when implementing a point service, for example, the payment system identifies the membership number of the "customer" shown in the photographed data by comparing the photographed data received in step Qf with the face images of each member registered in advance. The payment system then accumulatively stores the points issued according to the purchase amount in association with the identified membership number.

[0057] The above-described business flow is saved in, for example, JSON format. Note that the format in which the business flow is saved is not limited to JSON, and the business flow may be saved in another data format such as XML.

[0058] Furthermore, in this embodiment, the KPI tree and the business flow may be created in advance, or may be created via the terminal device 10 or the like with support for creation by the server device 20. In the latter case, for example, the server device 20 provides the terminal device 10 with a screen (GUI (Graphical User Interface)) for supporting viewing, creation, and editing of the KPI tree and the business flow.

[0059] Specifically, the server device 20 provides the terminal device 10 with a screen on which the KPI tree can be created and edited in a state in which various nodes and relationships between the nodes are visualized. Then, when the server device 20 completes the creation or editing of the KPI tree, it stores the KPI tree in the KPI tree DB 261.

[0060] Furthermore, when any of the service nodes E included in the KPI tree is selected, the server device 20 provides a screen on which a business flow and a checklist can be created and edited for the service corresponding to the service node E. Then, when either the business flow or the checklist is created, the server device 20 stores it in the corresponding DB in association with the node ID and tree ID of the service node E.

[0061] 3, the provisional registration table 263 is a table or database for storing and managing, among the nodes included in the KPI tree, pairs of node name and node type that are not registered in either the item master 264 or the name identification master 265. The provisional registration table 263 has, for example, the data configuration shown in FIG.

[0062] Fig. 8 is a diagram showing an example of a data configuration of the provisional registration table 263. As shown in Fig. 8, the provisional registration table 263 stores node names, node types, KPI tree links, data creation dates, and the like in association with each other.

[0063] In the node name and node type fields, the node name and node type of a node that is to be registered in the provisional registration table 263 (hereinafter, also referred to as a target node) are registered.

[0064] Figure 8 shows an example where a combination of node name "Sales" and node type "KGI" is registered. Similarly, examples are shown where a combination of candidate node name "Average customer price" and node type "KPI" is registered, a combination of candidate node name "Attractive product lineup" and node type "Factor (KSF)" is registered, and a combination of candidate node name "Inventory turnover" and node type "KPI" is registered.

[0065] In the KPI tree link, information capable of identifying the KPI tree to which the target node belongs is registered. For example, the tree ID of the KPI tree is registered in the KPI tree link. In addition, in the KPI tree link, information capable of identifying the target node (for example, a node ID) may be registered together with the tree ID to which the target node belongs. In the data creation date, data indicating the date of registration in the provisional registration table 263 is stored.

[0066] 3, the item master 264 is an example of a first storage unit. The item master 264 is a table or database for storing and managing reference node names that serve as a basis for name matching. The item master 264 has, for example, the data configuration shown in FIG.

[0067] Fig. 9 is a diagram showing an example of the data configuration of the item master 264. As shown in Fig. 9, the item master 264 stores a reference node name, a node type, a KPI tree link, a data creation date, and the like in association with each other.

[0068] The reference node name is a node name that is used as a reference for name matching (hereinafter also referred to as the reference node name). The node type is a node type of a node that corresponds to the reference node name (hereinafter also referred to as the reference node).

[0069] 9 shows an example where a combination of the reference node name "Sales" and the node type "KGI" is registered. Similarly, examples are shown where a combination of the reference node name "Number of customers visiting" and the node type "KPI", a combination of the reference node name "Average customer spending" and the node type "KSI", and a combination of the reference node name "Product lineup" and the node type "Factor" are registered.

[0070] In the KPI tree link, information capable of identifying the KPI tree to which the reference node belongs is registered. For example, the tree ID of the KPI tree is registered in the KPI tree link. In addition, in the KPI tree link, information capable of identifying the reference node (for example, a node ID) may be registered together with the tree ID of the KPI tree to which the reference node belongs. Data indicating the date registered in the item master 264 is stored in the data creation date.

[0071] 3, the name matching master 265 is an example of a second storage unit. The name matching master 265 is a table or database for storing and managing the correspondence between the node name of the name matching source and the node name of the name matching destination. The name matching master 265 has, for example, the data configuration shown in FIG.

[0072] Fig. 10 is a diagram showing an example of the data configuration of the name identification master 265. As shown in Fig. 10, the name identification master 265 stores a node name, a node type, a reference node name, a data creation date, and the like in association with each other.

[0073] The node name of the name matching source is registered in the node name. The reference node name of the name matching destination is registered in the reference node name. The node type is registered with the node type to be matched. The data creation date stores data indicating the date registered in the name matching master 265.

[0074] Here, the set of the node name, the node type, and the reference node name functions as name matching information that defines the name matching rule. Specifically, the name matching information defines that the name of the source node is matched (hereinafter, also referred to as conversion) with the reference node name of the destination node under the condition of the defined node type.

[0075] FIG. 10 shows an example in which a node with a node type of "KGI" and a node name of "sales" is set to be converted to the node name "sales". Similarly, examples are shown in which a node with a node type of "KPI" and a node name of "average customer price" is set to be converted to the node name "customer price", a node with a node type of "Factor" and a node name of "attractive product lineup" is set to be converted to the node name "product lineup", and a node with a node type of "KGI" and a node name of "sales" is set to be converted to the node name "sales". This allows, for example, nodes with the node names "sales" and "sales" to be treated as the same type of node as a node with the node name "sales".

[0076] The name matching information is not limited to one-way conversion from the name matching source to the name matching target, but may also specify a reverse conversion of node names from the name matching target to the name matching source. In this case, for example, a node with a node type of "KGI" and a node name of "Sales" is reverse converted to node names of "Sales Amount" and "Sales". In other words, nodes with node names of "Sales", "Sales Amount", and "Sales" can be treated as the same type of node.

[0077] 3, the communication unit 27 is a communication interface connectable to the network N. The communication unit 27 communicates with an external device such as the terminal device 10 via the network N.

[0078] Next, the functional configuration of the terminal device 10 and the server device 20 will be described with reference to Fig. 11. Fig. 11 is a diagram showing an example of the functional configuration of the terminal device 10 and the server device 20.

[0079] As shown in FIG. 11, the terminal device 10 includes a display control unit 111 and an operation receiving unit 112 as functional units.

[0080] A part or all of the functional units of the terminal device 10 may be a software configuration realized by cooperation between a processor (e.g., CPU 11) of the terminal device 10 and a program stored in a memory (e.g., ROM 12, storage unit 16). Also, a part or all of the functional units of the terminal device 10 may be a hardware configuration realized by a dedicated circuit or the like mounted on the terminal device 10.

[0081] The display control unit 111 of the terminal device 10 controls the display unit 14 to display various screens on the display unit 14. For example, the display control unit 111 causes the display unit 14 to display various operation screens based on information provided from the server device 20.

[0082] The operation acceptance unit 112 of the terminal device 10 accepts a user operation via the operation unit 15. For example, when the operation acceptance unit 112 accepts an operation on a screen displayed on the display unit 14, the operation acceptance unit 112 notifies the server device 20 of the content of the operation.

[0083] On the other hand, the server device 20 includes a GUI providing unit 211, a design support unit 212, a name identification processing unit 213, a display control unit 214, an operation receiving unit 215, and a data analysis unit 216 as functional units.

[0084] A part or all of the functional units of the server device 20 may be a software configuration realized by cooperation between a processor (e.g., CPU 21) of the server device 20 and a program stored in a memory (e.g., ROM 22, storage unit 26). Also, a part or all of the functional units of the server device 20 may be a hardware configuration realized by a dedicated circuit or the like mounted on the server device 20.

[0085] The GUI providing unit 211 cooperates with other functional units to provide the terminal device 10 with information capable of displaying various operation screens (hereinafter also simply referred to as screens). Here, the GUI providing unit 211 may provide data representing the screens, or may provide various content data related to the display of the screens. Hereinafter, the provision of information related to the display of a screen by the GUI providing unit 211 to the terminal device 10 is also expressed as "providing" the screen or "displaying" the screen.

[0086] The design support unit 212 cooperates with the GUI provision unit 211 to provide a screen for supporting the creation of a KPI tree and a business flow.

[0087] For example, the design support unit 212 provides a screen on which a KPI tree can be created by arranging various nodes, edges, and the like as drawing parts. On such a screen, a user can create or edit a tree-shaped KPI tree by arranging various nodes on the screen and arranging links that connect the nodes. When a KPI tree is created or edited, the design support unit 212 generates a data file representing the KPI tree and stores it in the KPI tree DB 261.

[0088] Furthermore, the design support unit 212 provides a screen on which a KPI tree to be viewed or edited can be selected based on the KPI tree DB 261. When a KPI tree is selected, the design support unit 212 reads out the data file of that KPI tree from the KPI tree DB 261, and provides a screen on which the KPI tree is visualized.

[0089] Furthermore, the design support unit 212 provides a screen on which a business flow can be created, in which drawing parts and the like corresponding to the notation rules of BPMN are arranged. For example, when the design support unit 212 receives an operation to instruct the generation of a business flow (flow ID) for a service node E included in the KPI tree, it provides a screen for creating a business flow. Then, when the design support unit 212 receives an operation to complete the creation or editing of the business flow, it generates a data file representing the business flow, associates it with the target service, and stores it in the business flow DB 262.

[0090] Furthermore, the design support unit 212 displays a business flow in response to a user operation. For example, when a service node E of the KPI tree is selected, the design support unit 212 visualizes a data file associated with the service node E, thereby displaying the business flow.

[0091] The name matching processing unit 213 is an example of an acquisition unit, an extraction unit, and a registration unit. The name matching processing unit 213 cooperates with the GUI provision unit 211 and the design support unit 212 to execute processing related to the name matching of node names included in the KPI tree.

[0092] Specifically, when a KPI tree is created (or edited) with the support of the design support unit 212, the name identification processor 213 obtains node names and node types from the nodes included in the KPI tree, and registers them in the provisional registration table 263.

[0093] More specifically, the name matching processor 213 compares the pair of node name and node type of each node included in the KPI tree with the pair of node name and node type registered in the item master 264 and the name matching master 265. Next, the name matching processor 213 extracts, from the nodes of the KPI tree, a node having a pair of node name and node type that is not registered in the item master 264 and the name matching master 265 as a target node. Then, the name matching processor 213 acquires the node name and node type from the target node, and registers them in the provisional registration table 263 together with the KPI tree link of the KPI tree to which the target node belongs. Hereinafter, for convenience of explanation, the pair of node name and node type registered in the provisional registration table 263 will also be referred to as a target node.

[0094] Here, the name matching processor 213 may limit the node types of target nodes extracted from the KPI tree to node types related to the identification of services such as KGI, KPI, KSF, etc. This makes it possible to exclude solution nodes and service nodes whose node names are expressed in a variety of ways from the targets of name matching, thereby preventing name matching from being performed inadvertently.

[0095] The timing of extracting the target node and registering it in the provisional registration table 263 is not particularly limited and can be set arbitrarily. For example, the name matching processor 213 may extract the target node from the KPI tree and register it in the provisional registration table 263 at the timing when the created (or edited) KPI tree is stored in the KPI tree DB 261. Also, for example, the name matching processor 213 may be configured to extract the target node from the KPI tree stored in the KPI tree DB 261 and register it in the provisional registration table 263 by batch processing, such as once a day. Also, for example, the name matching processor 213 may be configured to extract the target node and register it in the provisional registration table 263 in response to an instruction from a data manager.

[0096] Furthermore, the name identification processing unit 213 displays, at a predetermined timing, a screen (hereinafter also referred to as a provisional registration list screen) showing the registration status of the provisional registration table 263. For example, the design support unit 212 displays the provisional registration list screen in response to an instruction from the data manager.

[0097] 12 is a diagram showing an example of a screen provided by server device 20, and shows an example of a provisional registration list screen. As shown in FIG. 12, provisional registration list screen 30 has a display area 31 for displaying a list of pairs of node names and node types registered in provisional registration table 263.

[0098] The display area 31 has an ID, a node name, and a node type as data items. The ID is an identifier for managing each target node registered in the temporary registration table 263. For example, the ID is an ascending number assigned in the order of registration in the temporary registration table 263. The node name and node type display the node name and node type of the target node registered in the temporary registration table 263. The temporary registration list screen 30 in FIG. 12 shows the registration status of the temporary registration table 263 described in FIG. 8.

[0099] The provisional registration list screen 30 is also provided with a registration button 32. The registration button 32 is an operator for instructing registration in the item master 264 or the name matching master 265. When a specific ID is selected from the display area 31 and then the name matching processor 213 accepts an operation of the registration button 32, it displays a screen (hereinafter also referred to as a registration screen) for registering the node name and node type of the target node corresponding to the selected ID in the item master 264 or the name matching master 265.

[0100] 13 is a diagram showing an example of a screen provided by the server device 20, and shows an example of a registration screen. As shown in FIG. 13, the registration screen 40 has a first display area 41 and a second display area .

[0101] The first display area 41 displays information about the target node selected on the temporary registration list screen 30. Specifically, the first display area 41 displays the node name and node type of the target node.

[0102] Furthermore, the first display area 41 is provided with a first display button 411 for instructing the display of a KPI tree. When the name matching processor 213 accepts an operation of the first display button 411, it reads out the KPI tree to which the target node belongs from the KPI tree DB 261, based on the KPI tree link of the target node selected on the provisional registration list screen 30. Then, the name matching processor 213 works in cooperation with the design support unit 212 etc. to display a screen showing the read KPI tree.

[0103] For example, the name matching processor 213 displays the KPI tree in a screen configuration similar to that of Fig. 5. The name matching processor 213 may also display the target nodes included in the KPI tree in an emphasized manner so that the nodes can be distinguished from other nodes. The screen showing the KPI tree may be displayed by switching to the registration screen 40, or may be displayed together with the registration screen 40.

[0104] Information about the node names that are candidates for name matching is displayed in the second display area 42. Specifically, the second display area 42 displays the reference node names of the candidates for name matching extracted from the item master 264 based on the node name and node type of the target node selected on the provisional registration list screen 30.

[0105] Here, the name matching processor 213 extracts reference node names of matching candidates from the item master 264 based on the node type of the target node and the character string constituting the node name of the target node. Specifically, the name matching processor 213 extracts reference node names that have the same node type as the target node and have character strings similar to the node name of the target node from the item master 264. For example, the name matching processor 213 extracts reference node names as matching candidates whose similarity between character strings is equal to or greater than a threshold value (e.g., 80%). There is no particular limit to the method of calculating the similarity between character strings, and for example, a known morphological analysis technique can be used.

[0106] In the above example, the extraction requirements for matching candidates are that the node types are the same and that the character strings of the node names are similar, but the extraction requirements are not limited to this.

[0107] For example, the extraction requirement may be the structural similarity between the KPI tree to which the target node belongs and the KPI tree to which the reference node belongs. As an example, the name matching processor 213 may calculate the similarity between the characteristics of other nodes connected to the target node and the characteristics of other nodes connected to the reference node, and extract the reference node name of the reference node whose similarity is equal to or greater than a threshold as a name matching candidate. Here, the characteristics of the other nodes may be either the node name or the node type, or both. Furthermore, the other nodes may be nodes connected to either the target node or the reference node before or after the reference node, or both.

[0108] As another example, the name matching processing unit 213 may calculate the similarity between the characteristics of other nodes existing from the target node to the KGI node and the characteristics of other nodes existing from the reference node to the KGI node, and extract the reference node names whose similarity is above a threshold as name matching candidates.

[0109] As another example, the name matching processing unit 213 may calculate the structural similarity between the entire KPI tree including the target node and the entire KPI tree including the reference node, and extract the reference node name of the KPI tree for which the similarity is equal to or greater than a threshold value as a name matching candidate.

[0110] In this way, by including the structural similarity of the KPI trees in the extraction requirements, it is possible to extract as matching candidates reference node names that have similar roles in the KPI trees. This makes it possible to improve the accuracy of the matching candidates. The above-mentioned extraction requirements may be applied individually or in combination. For example, the structural similarity of the KPI trees may be used as an extraction requirement to extract reference node names in addition to the notation (character string) similarity.

[0111] 13 shows an example in which a reference node name "Sales" is extracted as a matching candidate for a target node with a node name of "Sales" and a node type of "KGI". When the name matching processor 213 extracts multiple reference node names as matching candidates, the name matching processor 213 displays the reference node names in a selectable list. When there is no reference node name that corresponds to a matching candidate, the name matching processor 213 leaves the second display area 42 blank as shown in FIG.

[0112] 14 is a diagram showing an example of a screen provided by the server device 20, and shows another example of the registration screen. The registration screen 40 in FIG. 14 shows a display example in which no matching candidate exists for the node name "inventory turnover" and node type "KPI" of the target node.

[0113] Furthermore, when a reference node name corresponding to a matching candidate is extracted, a second display button 421 for instructing the display of a KPI tree is provided in the second display area 42. When the matching processor 213 accepts an operation of the second display button 421, it reads out the KPI tree to which the reference node belongs from the KPI tree DB 261, based on the KPI tree link associated with the reference node name of the matching candidate and stored in the item master 264. Then, the matching processor 213 works in cooperation with the design support unit 212 etc. to display a screen showing the read KPI tree.

[0114] For example, the name matching processor 213 displays the KPI tree in a screen configuration similar to that of Fig. 5. The name matching processor 213 may also display the reference nodes included in the KPI tree in an emphasized manner so that they can be distinguished from other nodes. The screen showing the KPI tree may be displayed by switching to the registration screen 40, or may be displayed together with the registration screen 40. The KPI tree may also be displayed in a manner that allows comparison with the KPI tree of the target node.

[0115] In this way, the registration screen 40 not only presents the reference node names of the matching candidates, but also has controls for displaying the KPI tree of the target node and the KPI tree of the matching candidates. This allows, for example, a user of the terminal device 10 to determine a more appropriate reference node name as a matching target while comparing and checking the structures of the KPI tree of the target node and the KPI tree of the matching candidates.

[0116] The registration screen 40 also has a pull-down menu 43 for selecting a registration destination, and an execution button 44 for instructing execution of registration. The pull-down menu 43 has an item master 264 and a name matching master 265 as options, and is an operator that can select either one of the masters.

[0117] When the execute button 44 is operated while the item master 264 is selected from the pull-down menu 43, the name matching processor 213 registers the node name, node type, and KPI tree link of the target node in the item master 264. As a result, the node name of the target node is registered as a reference node name in the item master 264. For example, when a user assigns a new node name to the target node, the user can use the reference node name as a candidate for name matching by registering the node name as a reference node name in the item master 264.

[0118] Furthermore, when the name matching processor 213 accepts an operation of the execute button 44 with the name matching master 265 selected from the pull-down menu 43, it registers the node name and node type of the target node in the name matching master 265 in association with the reference node name of the matching candidate. Specifically, the name matching processor 213 generates name matching information in which the node name of the target node is the node name of the source and the reference node name of the matching candidate is the reference node name of the destination. Then, the name matching processor 213 registers the generated name matching information in the name matching master 265. Note that when there are multiple name matching candidates, the name matching processor 213 generates the name matching information using the reference node name of one of the name matching candidates selected by the user.

[0119] Here, the name identification information registered in the name identification master 265 is used, for example, when analyzing a KPI tree based on node names. That is, in this embodiment, the node names set for each node in the KPI tree are maintained as they are, and the conversion of the node names based on the name identification information is performed by internal processing. Therefore, in this embodiment, it is possible to eliminate fluctuations in the node names set in the KPI tree while maintaining the display form of the created KPI tree.

[0120] In the above description, the master of the registration destination can be selected via the pull-down menu 43, but for example, if there is no name matching candidate (see FIG. 14), it is not possible to register in the name matching master 265. Therefore, if there is no name matching candidate, the registration destination selectable via the pull-down menu 43 may be only the item master 264.

[0121] 11, the display control unit 214 controls the display unit 24 to display various screens on the display unit 24. For example, the display control unit 214 causes the display unit 24 to display various screens provided by the GUI providing unit 211.

[0122] The operation acceptance unit 215 accepts a user operation via the operation unit 25. For example, when the operation acceptance unit 215 accepts an operation on various operation support screens displayed on the display unit 24, the operation acceptance unit 215 outputs the content of the operation to the CPU 21.

[0123] The data analysis unit 216 is an example of an analysis means. The data analysis unit 216 performs various analysis processes based on the KPI tree stored in the KPI tree DB 261.

[0124] For example, when a node name and node type are specified by the user, the data analysis unit 216 searches the KPI tree DB 261 for a KPI tree including the specified node name and node type pair, and tallies the number of KPI trees found (hereinafter also referred to as the number of trees). Specifically, when a node name and node type pair is specified, the data analysis unit 216 refers to the name matching master 265 and determines whether or not there is name matching information in which the specified node name and node type pair is set.

[0125] Here, if there is name matching information related to a pair of the specified node name and node type, and the specified node name is set in the name matching destination, the data analysis unit 216 reads out the corresponding node name of the name matching source from the name matching information. Next, the data analysis unit 216 expands the node names to be searched by using the specified node name and the node name read out from the name matching information as search conditions. Next, the data analysis unit 216 searches the KPI tree DB 261 for KPI trees that include any of the expanded node names and include nodes of the specified node type. Then, the data analysis unit 216 derives the tree ID and the number of trees of the searched KPI tree as the analysis result. For example, the data analysis unit 216 cooperates with the GUI provision unit 211 to display a screen showing the analysis result.

[0126] Furthermore, when there is name matching information in which the specified combination is set and the specified node name is set as the name matching source, the data analysis unit 216 reads out the corresponding node name of the name matching destination from the name matching information. Furthermore, when there is other name matching information including the combination of the specified node type and the name matching destination node name, the data analysis unit 216 reads out the node name of the name matching source set in the other name matching information, that is, the other node name associated with the same reference node name. Next, the data analysis unit 216 expands the node names to be searched by using the specified node name and the node name read out from the name matching information as search conditions. Next, the data analysis unit 216 searches the KPI tree DB 261 for KPI trees that include any of the expanded node names and include a node of the specified node type. Then, the data analysis unit 216 derives the tree ID and the number of trees of the searched KPI tree as analysis results.

[0127] In this way, even if there is variation in the node names, the data analysis unit 216 can analyze the KPI tree using the corresponding node names set in the name matching information of the name matching master 265, and therefore can obtain analysis results with the node name variation eliminated.

[0128] The analysis process performed by the data analysis unit 216 is not limited to the above example. However, when performing the analysis process based on the node name and the node type, the data analysis unit 216 performs the analysis process using the corresponding node names based on the name matching information in the name matching master 265.

[0129] An example of the operation of the above-mentioned server device 20 will be described below with reference to Fig. 15 to Fig. 17. Fig. 15 to Fig. 17 are flowcharts showing an example of the process executed by the server device 20.

[0130] First, an example of the first registration process for registering a node name in the provisional registration table 263 will be described with reference to FIG.

[0131] When a KPI tree is created (or edited) by the user (step S11), the design support unit 212 stores the KPI tree in the KPI tree DB 261 (step S12).

[0132] Next, the name matching processor 213 compares the combinations of node name and node type of the nodes included in the KPI tree stored in the KPI tree DB 261 with the combinations of node name and node type registered in the item master 264 and the name matching master 265. Next, the name matching processor 213 extracts, from the nodes included in the KPI tree, nodes having a combination of node name and node type that is not registered in the item master 264 and the name matching master 265 as target nodes (step S13).

[0133] Next, the name matching processing unit 213 acquires the node name and node type from the target node (step S14), and registers the acquired information in the provisional registration table 263 together with the KPI tree link of the KPI tree to which the target node belongs (step S15), and terminates this processing.

[0134] Next, an example of a second registration process for registering a node name registered in the provisional registration table 263 in the item master 264 or the name identification master 265 will be described with reference to FIG.

[0135] The name identification processor 213 refers to the provisional registration table 263 in response to an instruction from the data manager or the like (step S21), and determines whether or not the node name is registered in the provisional registration table 263 (step S22).

[0136] If the node name of the target node is registered in the temporary registration table 263 (step S22; Yes), the name matching processor 213 displays the temporary registration list screen 30 showing the registration status of the temporary registration table 263 (step S23). Next, the name matching processor 213 waits until the registration button 32 is operated for any one of the target nodes on the temporary registration list screen 30 (step S24; No).

[0137] When the name matching processor 213 accepts the operation of the registration button 32 (step S24; Yes), it extracts a reference node name that is a candidate for name matching from the item master 264 based on the node name and node type of the selected target node (step S25). Next, the name matching processor 213 displays the registration screen 40 including the extraction result of step S25 (step S26).

[0138] Next, the name matching processor 213 determines whether or not an instruction to register in the item master 264 has been accepted via the pull-down menu 43, the execute button 44, etc. (step S27). If an instruction to register in the item master 264 has been accepted (step S27; Yes), the name matching processor 213 registers the node name, node type, and KPI tree link of the selected target node in the item master 264 (step S28), and proceeds to step S33.

[0139] Furthermore, when the name matching processor 213 does not accept an instruction to register in the item master 264 (step S27; No), it judges whether or not an instruction to register in the name matching master 265 has been accepted (step S29). When an instruction to register in the name matching master 265 has been accepted (step S29; Yes), the name matching processor 213 associates the node name and node type of the selected target node with the reference node name of the name matching candidate extracted in step S25, and registers them in the name matching master 265 (step S30), and proceeds to step S33. Note that when there are multiple name matching candidates, the name matching processor 213 registers the reference node name of the selected name matching candidate in the name matching master 265.

[0140] Furthermore, when the name matching processor 213 does not accept an instruction to register in the name matching master 265 (step S29; No), it determines whether or not an instruction to display a KPI tree has been given via the first display button 411 or the second display button 421, etc. (step S31). When an instruction to display a KPI tree has been given (step S31; Yes), the name matching processor 213 displays the corresponding KPI tree based on the KPI tree link related to the specified node (step S32).

[0141] Next, when the user instructs the name matching processor 213 to stop displaying the KPI tree, the name matching processor 213 closes the display screen of the KPI tree and returns the process to step S27. Note that in a configuration in which the registration screen 40 and the display screen of the KPI tree are displayed simultaneously, the name matching processor 213 may return the process to step S27 without waiting for an instruction to stop displaying the KPI tree. Also, the name matching processor 213 returns the process to step S27 if the display of the KPI tree is not instructed in step S31 (step S31; No).

[0142] In the next step S33, the name matching processor 213 deletes the data entry related to the target node registered in step S28 or step S30 from the provisional registration table 263 (step S33). Next, the name matching processor 213 returns the process to step S22 to determine whether or not the node name is registered in the provisional registration table 263. Then, when the name matching processor 213 determines that the node name is not registered in the provisional registration table 263 (step S22; No), it ends this process.

[0143] Through the above process, the node name and node type of the target node registered in the provisional registration table 263 are registered in the item master 264 or the name identification master 265.

[0144] Next, an example of the analysis process of a KPI tree will be described with reference to Fig. 17. Note that in this process, an example will be described in which the number of KPI trees that include a specified node is output as the analysis result, but the content of the analysis process is not limited to this.

[0145] The data analysis unit 216 receives a designation of a node to be analyzed from a user (step S41). For example, when a KPI tree is displayed and any one of the nodes included in the KPI tree is designated as an analysis target, the data analysis unit 216 receives the designation of the node.

[0146] Next, the data analysis unit 216 acquires the node name and node type from the designated node (hereinafter also referred to as the designated node) (step S42). Next, the data analysis unit 216 reads out the name identification information in which the acquired node name and node type pair is set from the name identification master 265 (step S43).

[0147] Next, the data analysis unit 216 expands the search condition for the node name based on the alias of the specified node (the node name of the source or destination) set in the name identification information (step S44). Next, the data analysis unit 216 searches the KPI tree DB 261 for a KPI tree including a node that satisfies the condition based on the expanded node name and the node type of the specified node (step S45).

[0148] Then, the data analysis unit 216 outputs the number of KPI trees found in step S45 as the analysis result (step S46), and ends this process.

[0149] As described above, the server device 20 of this embodiment acquires the node name set for a node and the node type of the node from the KPI tree, and extracts a reference node name similar to the acquired pair of node name and node type from the item master 264 that stores pairs of reference node names and node types that serve as the basis for name matching. The server device 20 then generates name matching information that associates the node name and node type acquired from the KPI tree with the reference node name extracted from the item master 264, and registers the name matching information in the name matching master 265.

[0150] As a result, the server device 20 can collate the node names of the nodes included in the KPI tree based on the collation information stored in the collation master 265. As a result, even if there is variation in the node names between nodes intended to have similar content, the server device 20 can analyze the KPI tree in a state where the variation is eliminated, and therefore accurate analysis results can be obtained. Therefore, the server device 20 can improve the usability related to the KPI tree.

[0151] Furthermore, the server device 20 extracts, as target nodes, from among the nodes included in the KPI tree, nodes having a pair of a node name and a node type that is not registered in the item master 264 and the name matching master 265, and acquires the node name and the node type from the target node. This allows the server device 20 to hold existing settings registered as the reference node name and the node name of the name matching source, and also prevents duplicate registration, thereby enabling efficient generation of name matching information. Therefore, the server device 20 can improve the usability of the KPI tree.

[0152] Furthermore, the server device 20 registers in the item master 264 a combination of a node name and a node type selected by a user operation from among the combinations of the node name and the node type acquired from the KPI tree. This allows the server device 20 to add a reference node name in response to an instruction from the user, thereby improving user convenience. Therefore, the server device 20 can improve the usability related to the KPI tree.

[0153] Furthermore, the server device 20 extracts from the item master 264 a reference node name that is the same as the node type of the target node acquired from the KPI tree and has a character string similar to that of the node name of the target node. This allows the server device 20 to extract a reference node name intended to have the same content as the target node, thereby improving the accuracy of name matching. Therefore, the server device 20 can improve the usability of the KPI tree.

[0154] Furthermore, the server device 20 compares the structure of the KPI tree to which the target node belongs with the structure of the KPI tree to which the node corresponding to the reference node name belongs, and extracts the reference node name related to the KPI tree with a similar structure. This allows the server device 20 to extract the reference node name of a node whose role in the KPI tree is similar to that of the target node, thereby improving the accuracy of name matching. Therefore, the server device 20 can improve the usability related to the KPI tree.

[0155] The above-described embodiment can be modified as appropriate by changing a part of the configuration or function of each of the above-described devices. Therefore, some modified examples of the above-described embodiment will be described below as other embodiments. Note that the following mainly describes the differences from the above-described embodiment, and a detailed description of the common points with the contents already described will be omitted. The modified examples described below may be implemented individually or in appropriate combination.

[0156] (Variation 1) In the above-described embodiment, an example was shown in which the terminal device 10 and the server device 20 work together to display various screens provided by the server device 20 on the terminal device 10, but this is not limited to the above, and the terminal device 10 may display the screens alone.

[0157] In this case, the terminal device 10 can display various screens relating to the creation and editing of checklists, various screens relating to the name matching of node names, and various screens relating to the analysis of KPI trees by including functional units such as the above-mentioned GUI providing unit 211, design support unit 212, name matching processing unit 213, and data analysis unit 216. Note that the terminal device 10 is in a state in which it can read and write various DBs or tables held by the server device 20.

[0158] In this case, some or all of the KPI tree DB 261, business flow DB 262, provisional registration table 263, item master 264, and name matching master 265 may be held by the terminal device 10, or may be held by another device (or cloud) accessible to the terminal device 10.

[0159] (Variation 2) In the above-described embodiment, the server device 20 is configured to maintain the node names of the nodes included in the KPI tree, but this is not limited to the above, and the server device 20 may be configured to actually change the node names based on the name matching information registered in the name matching master 265.

[0160] In this case, for example, the name matching processor 213, in cooperation with the design support unit 212, matches (changes) the name of the node to the name of the node in the name matching destination when a node that meets the conditions of the node name and node type of the name matching information is set during the process of creating a KPI tree. Note that it is preferable that the name matching processor 213 displays a screen for confirming that the name is to be changed to the node name of the node in the name matching destination, and changes the node name only after obtaining the user's consent.

[0161] As a result, the server device 20 can change the node name based on the name matching information in the process in which the user creates a KPI tree. Therefore, the server device 20 can suppress fluctuation in the node name and can support the creation of the KPI tree. In addition, the server device 20 can change the node name after confirming with the user, thereby improving the user's convenience in determining the node name.

[0162] The timing for changing the node name is not limited to when the KPI tree is created, and may be other timing. For example, the node names of the KPI tree stored in the KPI tree DB 261 may be automatically changed by batch processing, such as once a day. Also, for example, the node name change may be started manually in response to an instruction from a data administrator.

[0163] The programs executed by each device of the above-described embodiments are provided in a state where they are pre-installed in a ROM, a storage unit, etc. The programs executed by each device of the above-described embodiments may be provided by being recorded in a computer-readable recording medium such as a CD-ROM, a flexible disk (FD), a CD-R, or a digital versatile disk (DVD) in the form of an installable or executable file.

[0164] Furthermore, the programs executed by each device of the above-described embodiments may be stored on a computer connected to a network such as the Internet and provided by being downloaded via the network. Also, the programs executed by each device of the above-described embodiments may be provided or distributed via a network such as the Internet.

[0165] Although the embodiment of the present invention has been described above, this embodiment is presented as an example and is not intended to limit the scope of the invention. These new embodiments and their modifications can be implemented in various other forms, and various omissions, substitutions, and modifications can be made without departing from the gist of the invention. These embodiments and their modifications are included in the scope and gist of the invention, and are included in the scope of the invention and its equivalents described in the claims. [Explanation of symbols]

[0166] 1. Business Support System 10 Terminal Equipment 20 Server device 111 Display control unit 112 Operation reception section 211 GUI provision department 212 Design Support Department 213 Name matching processing unit 214 Display control unit 215 Operation reception section 216 Data Analysis Department 261 KPI Tree DB 262 Business flow DB 263 Temporary Registration Table 264 Item Master 265 Name Master [Prior art documents] [Patent documents]

[0167] [Patent Document 1] JP 2014-235470 A

Claims

1. An acquisition means for acquiring a node name and a node type of a node from tree data in which a relationship between a node indicating a business goal and a node indicating a measure for achieving the goal is set in a stepwise manner in a tree structure; an extracting means for extracting, from a first storage unit that stores a set of a reference node name and a node type serving as a reference for name matching, a reference node name of a set similar to the set of the node name and the node type acquired by the acquiring means; a registering means for registering the node name and the node type acquired by the acquiring means in a second storage unit in association with the reference node name extracted by the extracting means; An information processing device comprising:

2. the acquiring means acquires, from among the nodes set in the tree data, a node name and a node type that have a pair of the node name and the node type that are not registered in the first storage unit and the second storage unit; The information processing device according to claim 1 .

3. the registration means registers, in the first storage unit, a combination selected by a user from among the combinations of the node name and the node type acquired by the acquisition means; The information processing device according to claim 2 .

4. the extraction means extracts a reference node name that is the same as the node type acquired by the acquisition means and has a character string similar to the node name acquired by the acquisition means. The information processing device according to claim 1 .

5. 5. The information processing device according to claim 1, wherein the extraction means compares the structure of tree data to which a node corresponding to the node name acquired by the acquisition means belongs with the structure of tree data to which a node corresponding to the reference node name belongs, and extracts a reference node name related to tree data having a similar structure.

6. The computer of the information processing device, An acquisition means for acquiring a node name and a node type of a node from tree data in which a relationship between a node indicating a business goal and a node indicating a measure for achieving the goal is set in a stepwise manner in a tree structure; an extraction means for extracting, from a first storage unit that stores a set of a reference node name and a node type serving as a basis for name matching, a reference node name of a set similar to the set of the node name and the node type acquired by the acquisition means; a registering means for registering the node name and the node type acquired by the acquiring means in a second storage unit in association with the reference node name extracted by the extracting means; A program to make it function as such.

Images