CN114925060A

CN114925060A - Processing method and device for network relationship of index system

Info

Publication number: CN114925060A
Application number: CN202111188644.4A
Authority: CN
Inventors: 韩立; 袁建军
Original assignee: Beijing Jingdong Century Trading Co Ltd; Beijing Wodong Tianjun Information Technology Co Ltd
Current assignee: Beijing Jingdong Century Trading Co Ltd; Beijing Wodong Tianjun Information Technology Co Ltd
Priority date: 2021-10-12
Filing date: 2021-10-12
Publication date: 2022-08-19

Abstract

The invention discloses a method and a device for processing a network relation of an index system, and relates to the technical field of computers. One embodiment of the method comprises: acquiring a two-dimensional data structure for describing the network relationship of the index system, wherein the two-dimensional data structure comprises the following fields: the system comprises an index relation group, index names and a dependency relation, wherein the dependency relation represents the dependency relation among indexes in the index relation group; determining indexes related to the network relation of the index system according to the field values corresponding to the index name fields; determining the relevant indexes of each index according to the index relation group to which each index belongs, and generating a network structure chart according to each index and the relevant indexes of each index; and pruning the network structure diagram according to the field values corresponding to the dependency relationship fields to generate an index system network relationship diagram. The implementation mode is easy to realize, simple to maintain and high in flexibility, index relation information is convenient to extract, and follow-up analysis on the influence degree among indexes is convenient.

Description

Method and device for processing network relation of index system

Technical Field

The invention relates to the technical field of computers, in particular to a method and a device for processing network relations of an index system.

Background

In the business analysis of enterprises, indexes are very important strategic places and performance assessment tools, and the management and strategic formulation of the enterprises cannot be supported by the indexes. The quality of a certain index of an enterprise is often influenced by one or more other indexes, and an intricate network relationship is formed among the indexes, so that the network relationship among a plurality of indexes with the association relationship in an index system needs to be described so as to perform index analysis better. The network relation model among the indexes in the index system can partially use the storage model of the graph object in computer science, and at present, there are three types: 1) an adjacency matrix; 2) an adjacency linked list; 3) a cross-linked list.

In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:

the three models are used for constructing the index system network relationship, when an index system network relationship graph is generated, no logic rule of a system exists, and the three models are complex in implementation mode, difficult to maintain and poor in flexibility.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method and an apparatus for processing an index system network relationship, which can describe an index system network relationship based on a two-dimensional data structure, and generate an index system network relationship diagram based on the two-dimensional data structure, where the two-dimensional data structure is easy to implement, simple to maintain, and strong in flexibility, and is convenient to extract index relationship information stored in the data structure, and facilitate subsequent analysis of influence degrees between indexes.

To achieve the above object, according to an aspect of the embodiments of the present invention, a method for processing a network relationship of an index system is provided.

A processing method of an index system network relationship comprises the following steps:

obtaining a two-dimensional data structure for describing a network relationship of an index architecture, the two-dimensional data structure comprising the following fields: the index relation group comprises an index relation group, index names and a dependency relation, wherein the dependency relation represents the dependency relation among indexes in the index relation group;

determining indexes related to the index system network relation according to the field values corresponding to the index name fields;

determining the related index of each index according to the index relation group to which each index belongs, and generating a network structure chart according to each index and the related index of each index;

and pruning the network structure diagram according to the field values corresponding to the dependency relationship fields to generate an index system network relationship diagram.

Optionally, determining the index related to the index system network relationship according to the field value corresponding to the index name field includes:

and carrying out duplicate removal processing on the field value corresponding to the index name field to obtain the index related to the index system network relationship.

Optionally, determining the relevant index of each index according to the index relationship group to which each index belongs, and generating the network structure diagram according to each index and the relevant index of each index includes:

for each index, acquiring an index relation group to which the index belongs according to the two-dimensional data structure;

respectively obtaining the index name included in each index relation group to which the index belongs to obtain the related index of the index in each index relation group;

and connecting every two indexes belonging to the same index relation group to generate a network structure diagram, wherein all the indexes comprise the indexes and the related indexes.

Optionally, pruning the network structure diagram according to the field value corresponding to the dependency relationship field includes:

and deleting the connecting lines between the indexes without the dependency relationship according to the field values corresponding to the dependency relationship fields so as to prune the network structure diagram.

Optionally, the method further comprises:

and under the condition that the network relationship of the index system needs to be added, deleted or modified, correspondingly processing the field value records in the two-dimensional data structure, and regenerating an index system network relationship graph.

Optionally, the two-dimensional data structure further includes an index relationship field, where the index relationship represents a calculation manner of each index included in the index relationship group, and a field value of the index relationship field includes addition, subtraction, multiplication, and division;

the method further comprises the following steps:

and determining the calculation mode of each index in the index relation group according to the field value corresponding to the index relation field and the index name.

Optionally, the field value of the dependency relationship field includes independence and dependency, and if only an independent value exists in the field value of the dependency relationship field of an index, the index is an independent variable index;

the method further comprises the following steps:

for a specified index, determining an influence path of the specified index by the following steps:

acquiring an index relation group to which the specified index belongs;

acquiring a dependency index of the specified index from each index relation group;

regarding an independent variable index in the dependency indexes, taking a path from the dependency index to the specified index as an influence path;

for a non-independent variable index in the dependent indexes, acquiring an index relation group to which the non-independent variable index belongs, acquiring the dependent index of the non-independent variable index from each index relation group, and if the dependent index of the non-independent variable index is the non-independent variable index, taking the dependent index of the non-independent variable index as the non-independent variable index and repeatedly executing the step until the independent variable index is found;

and taking a path from the independent variable index to the specified index as an influence path.

According to another aspect of the embodiments of the present invention, a device for processing a network relationship of an index system is provided.

An apparatus for processing network relationships in an index architecture, comprising:

a data obtaining module, configured to obtain a two-dimensional data structure for describing a network relationship of a pointer system, where the two-dimensional data structure includes the following fields: the index relation group comprises an index relation group, index names and dependency relations, wherein the dependency relations represent the dependency relations among the indexes in the index relation group;

the index determining module is used for determining indexes related to the index system network relation according to the field values corresponding to the index name fields;

the network diagram generating module is used for determining the related indexes of each index according to the index relation group to which each index belongs and generating a network structure diagram according to each index and the related indexes of each index;

and the network diagram processing module is used for pruning the network structure diagram according to the field values corresponding to the dependency relationship fields so as to generate an index system network relationship diagram.

According to another aspect of the embodiments of the present invention, an electronic device for processing network relationships in an index hierarchy is provided.

An electronic device for processing index architecture network relationships, comprising: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors implement the method for processing the index system network relationship provided by the embodiment of the invention.

According to yet another aspect of an embodiment of the present invention, a computer-readable medium is provided.

A computer readable medium, on which a computer program is stored, the program, when executed by a processor, implements a method for processing a network relationship of an index system according to an embodiment of the present invention.

One embodiment of the above invention has the following advantages or benefits: acquiring a two-dimensional data structure for describing a network relation of an index system; determining indexes related to the network relation of the index system according to the field values corresponding to the index name fields; determining the related index of each index according to the index relation group to which each index belongs, and generating a network structure chart according to each index and the related index of each index; the technical scheme is that a network structure chart is pruned according to field values corresponding to dependency relationship fields to generate an index system network relationship chart, a two-dimensional data structure is provided to describe the index system network relationship, and the index system network relationship chart is generated based on the two-dimensional data structure.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

FIG. 1 is a schematic diagram of the main steps of a processing method of index system network relationship according to an embodiment of the present invention;

FIG. 2 is a diagram illustrating equivalence relations between a network relationship graph and a two-dimensional data structure in an index system according to an embodiment of the present invention;

FIG. 3 is a schematic diagram illustrating an implementation of metrics involved in determining a network relationship of a metric hierarchy according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of an implementation principle of generating a network structure diagram according to an embodiment of the present invention;

FIG. 5 is a schematic diagram illustrating an implementation principle of changing network relationships of an index system according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of an implementation of a home packet to determine an indication according to one embodiment of the invention;

FIG. 7 is a diagram illustrating an index architecture network impact relationship, in accordance with an embodiment of the present invention;

FIG. 8 is a schematic diagram of the main modules of a processing device for index architecture network relationships according to an embodiment of the present invention;

FIG. 9 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

fig. 10 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server according to an embodiment of the present invention.

Detailed Description

Exemplary embodiments of the invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

The network relation model among the indexes in the index system can partially use for reference the storage model of the graph object in computer science, and at present, three types are mainly used: 1) adjacency matrix: representing the graph by a vertex one-dimensional array and an edge two-dimensional array; 2) adjacency linked list: representing the diagram by a vertex one-dimensional array and a forward and reverse linked list; 3) cross linked list: the improvement of the adjacency linked list respectively represents the forward and reverse links of the index through two pointers.

The inventor analyzes the several models and finds that the several models respectively have some insurmountable disadvantages: 1) the adjacent matrix is the most intuitive storage model, however, for an index system with more indexes and less index relation, the model can generate a very huge sparse matrix, thereby greatly wasting the storage space and greatly increasing the calculation overhead; 2) the adjacent linked list uses the pointer to point to the next index element through the linked list data structure, so that the defect is overcome, but the positive and negative index dependency relations need to be maintained at the same time, and an additional data structure is needed for supplement when the index calculation relation is stored; 3) the cross linked list integrates two dependency relations of adjacent linked lists, two pointers are used for tracking forward and backward dependency at the same time, index calculation relations can be stored in the same data structure, and no logic rule of a system exists when an index system network relation graph is generated.

Meanwhile, the following problems are faced when the three models are used for constructing the network relationship of the index system: 1) the implementation mode is complex, and even a special program needs to be written to solve a simple index relation calculation problem; 2) difficult maintenance, need personnel with professional knowledge background to maintain specially; 3) all indexes cannot be directly grouped, and the indexes cannot be managed according to groups and the calculation relationship among the indexes in the group can not be displayed; 4) lack of flexibility in representing paths where metrics influence each other, and so on.

In order to solve the technical problem, the invention realizes a general method for storing, modifying and analyzing the enterprise index relationship and provides a method for visualizing the index relationship. Specifically, the method for processing the network relationship of the index system provides a two-dimensional data structure model of the complex network relationship in the index system and a logic rule corresponding to the network relationship of the index system, and solves the problems of the three models in practical application. The enterprise can grasp the development condition of the enterprise as a whole according to the complex network relation among various indexes, and make correct and optimal strategic decisions.

Fig. 1 is a schematic diagram of main steps of a processing method of an index system network relationship according to an embodiment of the present invention. As shown in fig. 1, the processing method of the index system network relationship according to the embodiment of the present invention mainly includes the following steps S101 to S104.

Step S101: acquiring a two-dimensional data structure for describing the network relationship of the index system, wherein the two-dimensional data structure comprises the following fields: the index relation group comprises an index relation group, index names and dependency relations, wherein the dependency relations represent the dependency relations among the indexes in the index relation group. In an embodiment of the present invention, the two-dimensional data structure may further include an index relation field, the index relation indicating a calculation manner of each index included in the index relation group, and a field value of the index relation field includes addition, subtraction, multiplication, and division.

Fig. 2 is a schematic diagram of an equivalence relation between an index system network relation diagram and a two-dimensional data structure according to an embodiment of the present invention. As shown in fig. 2, the index system network relationship shown in the left diagram of fig. 2 is an index network relationship actually existing in company operation, but cannot be directly stored, managed and maintained, so that the implementation, operation, analysis, and the like of the index system network need to be mapped into a data structure and a corresponding logic analysis rule.

The invention uses the two-dimensional data structure of the right graph in FIG. 2 to describe the network relationship of the index system shown in the left graph, and uses the two-dimensional data structure of the right graph to describe the network relationship of any index system, and an equivalence relationship is formed between the two. The two-dimensional data structure of the right diagram comprises four field columns and a plurality of initialization row data, wherein each field is defined as follows: 1) the index relation group is a group of indexes which are mutually associated to determine one index, and represents a group of indexes related to a complete calculation formula, taking group a as an example, index 1 is index 2+ index 3+ index 4, and the 4 indexes form a complete index relation group: group A; 2) an index name indicating a specific index name; 3) the index relation represents the specific calculation logic of the index in the group, the field value of the index relation field comprises addition, subtraction, multiplication and division, and each index in the group can be calculated according to the index name and the index relation field value; 4) the dependency relationship indicates whether a certain index in a group depends on other indexes, taking index 1 as index 2+ index 3+ index 4 as an example, index 1 is a dependent index and is calculated from other indexes in the group, and

indexes

2, 3 and 4 are independent indexes.

Step S102: and determining indexes related to the network relationship of the index system according to the field values corresponding to the index name fields. Specifically, the field value corresponding to the index name field may be subjected to deduplication processing to obtain an index related to the index system network relationship.

Fig. 3 is a schematic diagram illustrating an implementation principle of determining indexes involved in the index architecture network relationship according to an embodiment of the present invention. As shown in fig. 3, information such as all indexes and the number of indexes related to the index system network relationship can be obtained by removing the duplicate of the values in the index name column of the two-dimensional data structure in the left diagram in fig. 3. In this embodiment, there are 18 total indices of the index system, and as shown in the right diagram of fig. 3.

Step S103: and determining the related index of each index according to the index relation group to which each index belongs, and generating a network structure chart according to each index and the related index of each index.

According to an embodiment of the present invention, the step S103, when executed, may be executed according to the following steps:

for each index, acquiring an index relation group to which the index belongs according to a two-dimensional data structure;

respectively obtaining the index name included in each index relation group to which the index belongs, and obtaining the related index of the index in each index relation group;

and connecting all indexes belonging to the same index relation group pairwise to generate a network structure chart, wherein all indexes comprise the index and related indexes.

Fig. 4 is a schematic diagram of an implementation principle of generating a network structure diagram according to an embodiment of the present invention. When generating the network structure diagram, a part of the network structure diagram corresponding to each index needs to be generated for each index, and then the part of the network structure diagrams corresponding to all the indexes are fused to obtain the network structure diagram corresponding to the index system. Taking the index 3 in the index name column in the two-dimensional data structure in fig. 1 as an example, the index relationships where the index names are located can be extracted through the two-dimensional data structure and grouped to obtain a group a and a group C, as shown in the two-dimensional data structure in fig. 4; then, extracting all index names in the group A and the group C to obtain the relation between the index 3 and the

indexes

1, 2, 4, 7 and 8; then, connecting the indexes belonging to the same index relation group pairwise to obtain the mesh structure diagram in fig. 4, that is: and the partial mesh structure diagram corresponding to the index 3. And finally, circularly traversing all indexes, generating partial mesh structure diagrams corresponding to the indexes, and fusing the partial mesh structure diagrams corresponding to the indexes to obtain the integral network structure diagram of the index system.

Step S104: and pruning the network structure diagram according to the field values corresponding to the dependency relationship fields to generate an index system network relationship diagram. Specifically, when performing pruning, the connecting lines between the indexes without dependency relationship may be deleted according to the field values corresponding to the dependency relationship fields, so as to perform pruning on the network structure diagram. In the real-time stream of the present invention, the two-dimensional data structure includes a dependency relationship field, which represents the dependency relationship between each index in the index relationship group.

In the embodiment shown in fig. 4, taking group a as an example, group a contains 4 indexes, where index 1 is a summary index and is obtained by adding

indexes

2, 3, and 4, and therefore index 1 is affected by the rise or fall of index 2, or index 1 depends on index 2. Similarly, index 1 can be obtained depending on index 3 and index 4. The dependency relationship among the indexes is determined by the dependency relationship series of the two-dimensional data structure. For the indexes having no dependency relationship with each other, it is necessary to perform pruning processing on the network configuration diagram generated in step S103. In this embodiment, the index 3 and the

indexes

2 and 4, the index 2 and the index 4, and the index 7 and the index 8 are independent, as shown by the dotted line in the network structure diagram of fig. 4, and represent the index relationship that requires pruning. The network relationship diagram of the index system can be obtained by pruning the network structure diagram, such as the network relationship of the index system shown in the left diagram of fig. 2.

According to the steps from S101 to S104, a two-dimensional data structure is provided to describe the network relationship of the index system, and an index system network relationship diagram is generated based on the two-dimensional data structure, the two-dimensional data structure is easy to implement, and index relationship information stored in the data structure can be extracted by using programming languages such as C, Java, python and the like, even Structured Query Language (SQL), so that the subsequent analysis of the influence degree among the indexes is facilitated, and an enterprise can grasp the development condition of the enterprise as a whole according to the complex network relationship among the indexes to make a correct and optimal strategic decision.

In an actual application scene, the performance indexes of an organization or a department are often adjusted along with the overall strategy and business development condition of a company and are reflected in an index system model, and four operations of adding, deleting, modifying and checking the index relation can be summarized. In an embodiment of the present invention, under the condition that the index system network relationship needs to be added, deleted or modified, corresponding processing is performed on the field value records in the two-dimensional data structure, and an index system network relationship diagram is regenerated.

Fig. 5 is a schematic diagram illustrating an implementation principle of changing a network relationship of the index system according to an embodiment of the present invention. Wherein, changing the index system network relationship comprises adding, deleting and modifying the index system network relationship. When the index system network relationship needs to be added, the corresponding field in the two-dimensional data structure needs to be perfected, a record of a corresponding index relationship group is newly added at the end of the two-dimensional data structure, for example, a record of an index relationship group G (including

indexes

15, 17, and 18) is newly added in fig. 5, and then the steps S101 to S104 are executed again, so that the updated index system network relationship diagram can be obtained. When the index system network relationship needs to be deleted, deleting the record of the corresponding index relationship group in the two-dimensional data structure, for example, deleting the record of the index relationship group E (including the

indexes

7, 11, 12, and 13) in fig. 5, and then re-executing according to the foregoing steps S101 to S104, so as to obtain the updated index system network relationship diagram. When the index system network relationship needs to be modified, the records of the index relationship group are modified correspondingly according to actual needs in the two-dimensional data structure, for example, the record corresponding to the index relationship group C is modified in fig. 5, the modified index 3 depends on the

indexes

7, 8, and 19, and then the steps S101 to S104 are executed again, so that the updated index system network relationship diagram can be obtained.

According to the embodiment of the invention, the network relationship of the index system can be searched. When the relation between any index and other indexes needs to be checked, the method can be executed by the following steps: 1) finding an index relation group corresponding to the index in the index name column; 2) finding all indexes related to the indexes according to the index relation group to which the indexes belong; 3) and executing all the obtained indexes according to the steps from the step S101 to the step S104 to obtain the network relation graph related to the indexes.

The two-dimensional data structure of the invention is used for describing the network relationship of the index system, thus simplifying the operations of adding, deleting, modifying, checking and the like of the index network relationship in the index system and greatly reducing the maintenance cost. Meanwhile, index analysis can be carried out more comprehensively and conveniently, enterprise operation analysts can be helped, the development condition of the enterprise can be grasped on the whole, and corresponding strategies can be formulated.

In addition, the two-dimensional data structure of the invention can also manage the index relation in groups. When the index relation is managed in groups, the attribution group of a certain index can be determined, and the calculation relation of the index in the group can be determined.

Fig. 6 is a schematic diagram illustrating the implementation principle of determining the designated home packet according to an embodiment of the present invention. As shown in fig. 6, when determining the attribution group of a certain index, first, the index name is searched from the two-dimensional data structure to obtain an index relationship group corresponding to the index, and then all indexes of all index relationship groups are selected to obtain all index relationships corresponding to the index. As shown in fig. 6, it can be seen that index 3 belongs to group a and group C, and a network relationship diagram of index 3 is displayed at the same time.

When determining the calculation relationship of the indexes in the group, the calculation mode of each index in the index relationship group can be determined according to the field value corresponding to the index relationship field and the index name. In practical cases, the relationship between the indexes is only the addition and subtraction and multiplication and division operation relationship, and other operation relationships such as power or exponential pairs do not exist.

When determining the addition-subtraction relationship between the indicators, as in group a in the two-dimensional data structure of fig. 2, the indicator relationship of indicator 1 is "+", the indicator relationship of

indicators

2, 3, 4 is "-", the indicator relationship is placed before the indicator value, and the identity is established to obtain: "index 1-index 2-index 3-index 4 ═ 0", and index 1 is a dependency index, and the transition can be: by "index 1 is equal to index 2+ index 3+ index 4", the arithmetic relationship of all indexes in the index relationship group can be obtained by term shift.

When determining the multiplication-division relationship between indexes, such as group B in the two-dimensional data structure of fig. 2, the index relationship of index 2 is "/", and the index relationships of index 5 and index 6 are "+", the identity is established as follows: "index 5 × index 6 is index 2", and index 6 is a dependent index, and the transition is obtained as follows: by "index 6" is index 2/index 5 ", all index calculation relationships in the index relationship group can be obtained by the term shift.

The two-dimensional data structure of the invention is used for describing the network relationship of the index system, provides grouping management for the index relationship and is beneficial to displaying the calculation relationship in the index relationship group. Index analysis can be carried out more comprehensively and conveniently, enterprise operation analysis personnel can be helped, the development condition of the enterprise can be mastered on the whole, and corresponding strategies can be formulated.

In addition, the two-dimensional data structure of the invention can also manage the path of the index. The indices may be divided into independent and non-independent indices according to the value of the dependency field in the two-dimensional data structure. In the whole index system, the independent variable index is an index which is not influenced by the operation relation of other indexes in the system, and meanwhile, the rising or falling of the index can influence one or more indexes in the whole system. Specifically, in the two-dimensional data structure, the field values of the dependency relationship fields include independence and dependency, and if only an independent value exists in the field values of the dependency relationship fields of an index, the index is an independent variable index. If the field value of the dependency relationship field of an index has a dependency value, the index is not an independent index no matter whether the field value of the dependency relationship field of the index has an independent value or not.

As in the two-dimensional data structure in fig. 2, taking index 2 as an example, the dependency series of index 2 in the two-dimensional data structure only has independent values, so that it can be determined that the index belongs to the independent variable index; taking index 8 as an example, index 8 has an independent value and a dependent value, so index 8 is not an independent variable index and belongs to indexes influenced by other indexes in an index system.

As described above, since the change of the independent variable index is not dependent on other indexes, but the change of the non-independent variable index is influenced by the independent variable index, when analyzing the indexes in practice, it is necessary to consider the degree of influence of each independent variable index on the specified index under study, and the selection of a possible path from any index to the independent variable index is particularly important. In the embodiment of the present invention, the path from the argument index to the specified index is taken as the influence path of the specified index.

According to one embodiment of the invention, for a specified index, an influence path of the specified index is determined by the following steps:

acquiring an index relation group to which the specified index belongs;

How to determine the influence path of a given index is described below with reference to the two-dimensional data structure in fig. 2. Taking index 1 as an example, if the index relationship group to which it belongs is group a, then: 1) firstly, selecting a dependency index which has a dependency relationship with the index 1 in the group A to obtain the dependency index comprising indexes 2, 3 and 4, wherein the index 2 is an independent variable index, so that an influence path is obtained: index 2 → index 1; 2) index 3 and index 4 in step 1) are non-independent variable indexes, so that the downward search is continued, taking index 3 as an example, and index 3 has a dependency relationship with index 7 and index 8; 3) continuing to analyze index 7, which has a dependency relationship with indexes 11, 12 and 13, and all three indexes are independent variable indexes, a possible influence path is obtained: index 11 → index 7 → index 3 → index 1, index 12 → index 7 → index 3 → index 1 and index 13 → index 7 → index 3 → index 1; 4) analyzing the index 8, and obtaining an influence path in the same way as the step 3): index 14 → index 8 → index 3 → index 1, index 15 → index 8 → index 3 → index 1 and index 16 → index 8 → index 3 → index 1; 5) returning to the step 2), analyzing the index 4, and obtaining an influence path in the same way: index 9 → index 4 → index 1, index 10 → index 4 → index 1. At this point, all paths are obtained for which the argument indicators have an effect on indicator 1. FIG. 7 is a diagram of an index architecture network impact relationship, in accordance with an embodiment of the present invention. Fig. 7 shows a plurality of influence paths corresponding to index 1, where

indexes

5 and 6 at the upper left corner and

indexes

17 and 18 at the lower right corner have no influence on index 1, and the respective variable indexes represented by dark backgrounds have influence on index 1.

The two-dimensional data structure of the invention is used for describing the network relationship of the index system, provides a path management function, is convenient for showing the possible influence path from any index to the independent variable index, can more comprehensively and conveniently analyze the index, can help enterprise operation analysts to grasp the development condition of the enterprise as a whole, and makes a corresponding strategy.

Fig. 8 is a schematic diagram of main modules of a processing device for index architecture network relationship according to an embodiment of the present invention. As shown in fig. 8, a processing apparatus 800 for an index system network relationship according to an embodiment of the present invention mainly includes a data obtaining module 801, an index determining module 802, a network diagram generating module 803, and a network diagram processing module 804.

A data obtaining module 801, configured to obtain a two-dimensional data structure for describing a network relationship of an index system, where the two-dimensional data structure includes the following fields: the index relation group comprises an index relation group, index names and dependency relations, wherein the dependency relations represent the dependency relations among the indexes in the index relation group;

an index determining module 802, configured to determine an index related to the index system network relationship according to a field value corresponding to the index name field;

a network map generating module 803, configured to determine a relevant index of each index according to an index relationship group to which each index belongs, and generate a network structure map according to each index and the relevant index of each index;

and the network diagram processing module 804 is configured to prune the network structure diagram according to the field value corresponding to the dependency relationship field to generate an index system network relationship diagram.

According to an embodiment of the invention, the index determination module 802 may be further configured to:

and carrying out duplicate removal processing on the field value corresponding to the index name field to obtain the index related to the index system network relation.

According to another embodiment of the present invention, the network map generating module 803 may further be configured to:

According to yet another embodiment of the invention, the network map processing module 804 may be further configured to:

According to another embodiment of the present invention, the apparatus 800 for processing index architecture network relationship further includes a network relationship update module (not shown in the figure) configured to:

under the condition that the network relationship of the index system needs to be added, deleted or modified, corresponding processing is carried out on the field value records in the two-dimensional data structure, and an index system network relationship graph is generated again.

According to still another embodiment of the present invention, the two-dimensional data structure further includes an index relation field, the index relation indicating a manner of calculation of each index included in the index relation group, a field value of the index relation field including addition, subtraction, multiplication, and division;

the apparatus 800 for processing network relationship of index system further includes an index calculation module (not shown in the figure) for:

According to another embodiment of the present invention, the field values of the dependency fields include independent and dependent, and if only an independent value exists in the field value of the dependency field of an index, the index is an independent variable index;

the processing apparatus 800 for indexing system network relationships further comprises an influence path analysis module (not shown in the figure) for:

for a specified index, determining an influence path of the specified index through the following steps:

acquiring an index relation group to which the specified index belongs;

According to the technical scheme of the embodiment of the invention, a two-dimensional data structure for describing the network relationship of an index system is obtained; determining indexes related to the network relation of the index system according to the field values corresponding to the index name fields; determining the relevant indexes of each index according to the index relation group to which each index belongs, and generating a network structure chart according to each index and the relevant indexes of each index; the technical scheme is that a network structure chart is pruned according to field values corresponding to dependency relationship fields to generate an index system network relationship chart, a two-dimensional data structure is provided to describe the index system network relationship, and the index system network relationship chart is generated based on the two-dimensional data structure.

Fig. 9 shows an exemplary system architecture 900 of a method for processing a pointer architecture network relationship or a device for processing a pointer architecture network relationship to which an embodiment of the present invention may be applied.

As shown in fig. 9, the system architecture 900 may include

end devices

901, 902, 903, a network 904, and a server 905. Network 904 is the medium used to provide communication links between

terminal devices

901, 902, 903 and server 905. The network 904 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

A user may use the

terminal devices

901, 902, 903 to interact with a server 905 over a network 904 to receive or send messages and the like. The

terminal devices

901, 902, 903 may have various client applications installed thereon, such as a data structure type application, a web browser application, a search type application, an index analysis tool, social platform software, etc. (by way of example only).

The

terminal devices

901, 902, 903 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 905 may be a server providing various services, such as a backend management server (for example only) providing support for index analysis websites browsed by users using the

terminal devices

901, 902, 903. The background management server can acquire a two-dimensional data structure for describing the network relationship of the index system from the received data such as the index system network relationship analysis request and the like; determining indexes related to the index system network relation according to the field values corresponding to the index name fields; determining the related index of each index according to the index relation group to which each index belongs, and generating a network structure chart according to each index and the related index of each index; and performing pruning processing and the like on the network structure diagram according to the field values corresponding to the dependency relationship fields, and feeding back a processing result (such as an index system network relationship diagram-only an example) to the terminal equipment.

It should be noted that, the method for processing the index system network relationship provided in the embodiment of the present invention is generally executed by the server 905, and accordingly, the processing apparatus for the index system network relationship is generally disposed in the server 905.

It should be understood that the number of terminal devices, networks, and servers in fig. 9 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for an implementation.

Referring now to FIG. 10, shown is a block diagram of a computer system 1000 suitable for use with a terminal device or server implementing embodiments of the present invention. The terminal device or the server shown in fig. 10 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 10, the computer system 1000 includes a Central Processing Unit (CPU)1001 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)1002 or a program loaded from a storage section 1008 into a Random Access Memory (RAM) 1003. In the RAM 1003, various programs and data necessary for the operation of the system 1000 are also stored. The CPU 1001, ROM 1002, and RAM 1003 are connected to each other via a bus 1004. An input/output (I/O) interface 1005 is also connected to bus 1004.

The following components are connected to the I/O interface 1005: an input portion 1006 including a keyboard, a mouse, and the like; an output portion 1007 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 1008 including a hard disk and the like; and a communication section 1009 including a network interface card such as a LAN card, a modem, or the like. The communication section 1009 performs communication processing via a network such as the internet. The driver 1010 is also connected to the I/O interface 1005 as necessary. A removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1010 as necessary, so that a computer program read out therefrom is mounted into the storage section 1008 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer-readable medium, the computer program comprising program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication part 1009 and/or installed from the removable medium 1011. The computer program performs the above-described functions defined in the system of the present invention when executed by a Central Processing Unit (CPU) 1001.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present invention, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units or modules described in the embodiments of the present invention may be implemented by software or hardware. The described units or modules may also be provided in a processor, and may be described as: a processor comprises a data acquisition module, an index determination module, a network map generation module and a network map processing module. The names of these units or modules do not in some cases constitute a limitation to the units or modules themselves, and for example, the data acquisition module may also be described as a "module for acquiring a two-dimensional data structure for describing a network relationship of the index system".

As another aspect, the present invention also provides a computer-readable medium, which may be contained in the apparatus described in the above embodiments; or may be separate and not assembled into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: obtaining a two-dimensional data structure for describing a network relationship of a pointing system, the two-dimensional data structure comprising the following fields: the index relation group comprises an index relation group, index names and dependency relations, wherein the dependency relations represent the dependency relations among the indexes in the index relation group; determining indexes related to the index system network relation according to field values corresponding to the index name fields; determining the relevant indexes of each index according to the index relation group to which each index belongs, and generating a network structure chart according to each index and the relevant indexes of each index; and pruning the network structure diagram according to the field values corresponding to the dependency relationship fields to generate an index system network relationship diagram.

According to the technical scheme of the embodiment of the invention, a two-dimensional data structure for describing the network relationship of an index system is obtained; determining indexes related to the network relationship of the index system according to field values corresponding to the index name fields; determining the relevant indexes of each index according to the index relation group to which each index belongs, and generating a network structure chart according to each index and the relevant indexes of each index; the technical scheme is that a network structure chart is pruned according to field values corresponding to dependency relationship fields to generate an index system network relationship chart, a two-dimensional data structure is provided to describe the index system network relationship, and the index system network relationship chart is generated based on the two-dimensional data structure.

The above-described embodiments should not be construed as limiting the scope of the invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A processing method for network relationship of index system is characterized by comprising the following steps:

obtaining a two-dimensional data structure for describing a network relationship of a pointing system, the two-dimensional data structure comprising the following fields: the index relation group comprises an index relation group, index names and dependency relations, wherein the dependency relations represent the dependency relations among the indexes in the index relation group;

determining the relevant indexes of each index according to the index relation group to which each index belongs, and generating a network structure chart according to each index and the relevant indexes of each index;

2. The method according to claim 1, wherein determining the index related to the index architecture network relationship according to the field value corresponding to the index name field comprises:

3. The method of claim 1, wherein determining a relevant index of each index according to an index relation group to which the index belongs, and generating a network structure diagram according to each index and the relevant index of each index comprises:

4. The method according to claim 1, wherein pruning the network structure diagram according to the field value corresponding to the dependency field comprises:

5. The method of claim 1, further comprising:

6. The method according to claim 1, wherein the two-dimensional data structure further includes an index relation field, the index relation representing a manner of calculation of each index included in the index relation group, a field value of the index relation field including addition, subtraction, multiplication, and division;

the method further comprises the following steps:

7. The method of claim 1, wherein the field values of the dependency fields include independent and dependent, and if only an independent value exists in the field value of the dependency field of an index, the index is an independent variable index;

the method further comprises the following steps:

acquiring an index relation group to which the specified index belongs;

8. An apparatus for processing index architecture network relationships, comprising:

a data obtaining module, configured to obtain a two-dimensional data structure for describing a network relationship of an index system, where the two-dimensional data structure includes the following fields: the index relation group comprises an index relation group, index names and dependency relations, wherein the dependency relations represent the dependency relations among the indexes in the index relation group;

9. An electronic device for handling pointer architecture network relationships, comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.

10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.