CN112416306A

CN112416306A - Multi-application dependency tree generation method and device, electronic equipment and computer medium

Info

Publication number: CN112416306A
Application number: CN202011321014.5A
Authority: CN
Inventors: 应腾
Original assignee: Ping An Puhui Enterprise Management Co Ltd
Current assignee: Ping An Puhui Enterprise Management Co Ltd
Priority date: 2020-11-23
Filing date: 2020-11-23
Publication date: 2021-02-26

Abstract

The invention relates to a research and development management technology, and discloses a multi-application dependency tree generation method, which comprises the following steps: extracting the dependency relationship in the application data packet to obtain a dependency relationship data set; judging whether target dependency relationship data in a dependency relationship data set exists in a graph database or not; if yes, obtaining a target single application dependency tree corresponding to the target dependency relationship data; collecting other dependency relationship data except the target dependency relationship data in the dependency relationship data set into dependency relationship data to be processed; generating a newly added single application dependency tree of dependency relationship data to be processed; and connecting the generated newly added single application dependency tree with the target single application dependency tree in a dependency relationship to obtain a multi-application dependency tree. The invention also provides a multi-application dependency tree generating device, equipment and a computer readable storage medium. In addition, the invention also relates to a block chain technology, and the application data packet can be stored in the block chain node. The method and the device can realize the quick generation of the dependency relationship among the micro-service applications.

Description

Multi-application dependency tree generation method and device, electronic equipment and computer medium

Technical Field

The present invention relates to the field of research and development management technologies, and in particular, to a method and an apparatus for generating a multi-application dependency tree, an electronic device, and a computer-readable storage medium.

Background

With the rise of the existing microservices, the heavy servers are all split into different microservices, however, at present, the microservices are usually registered and used by a distributed application program coordination service (such as zookeeper), and in the process, the dependency data of the microservices (namely the dependency relationship between the microservices) does not need to be acquired in advance.

However, when the micro-service applications are reported with errors during the use process, the development operation and maintenance personnel need to search and analyze detailed development codes at the bottom layer, query and analyze the bottom layer codes of the micro-service applications to obtain the dependency data of the micro-service applications, and further determine the reasons for the error reporting of the micro-service applications according to the dependency data. This requires a strong code ability for the development and maintenance personnel, and even if the code ability of the development and maintenance personnel is strong, the efficiency of finding and solving the problem is greatly reduced due to the numerous codes. Therefore, how to quickly generate the dependency relationship between the microservice applications becomes a problem to be solved urgently.

Disclosure of Invention

The invention provides a method and a device for generating a multi-application dependency tree, electronic equipment and a computer readable storage medium, and mainly aims to realize the quick generation of dependency relationships among micro-service applications.

In order to achieve the above object, the present invention provides a method for generating a multi-application dependency tree, including:

acquiring application data packets of a plurality of applications, and extracting the dependency relationship of the application data packets to obtain dependency relationship data sets of the applications;

judging whether target dependency relationship data in the dependency relationship data set exist in a pre-constructed graph database or not;

if target dependency relationship data in the dependency relationship data set exist in the graph database, a target single application dependency tree corresponding to the target dependency relationship data is obtained;

collecting other dependency relationship data except the target dependency relationship data in the dependency relationship data set into dependency relationship data to be processed;

generating a newly added single application dependency tree of a target application by using the dependency relationship data to be processed, wherein the target application is an application corresponding to the dependency relationship data to be processed;

and performing dependency relationship connection on the generated newly added single application dependency tree and the target single application dependency tree to obtain a multi-application dependency tree of the plurality of applications.

Optionally, the determining whether target dependency relationship data in the dependency relationship data set exists in a pre-constructed graph database includes:

determining the dependency relationship of any application in the dependency relationship data sets of the plurality of applications as target dependency relationship data;

inquiring a retrieval result field corresponding to the target dependency relationship data in the pre-constructed graph database;

if the retrieval result field is not empty, determining that the target dependency relationship data in the dependency relationship data set does not exist in the graph database;

and if the retrieval result field is empty, determining that the target dependency relationship data in the dependency relationship data set does not exist in the graph database.

Optionally, the obtaining the application data packets of the plurality of applications includes:

acquiring system information of an application platform where the plurality of applications are located;

compiling the system information into an application data calling statement by using a compiler;

and acquiring the application data packets of the plurality of applications from the application platforms where the plurality of applications are located by executing the application data calling statement.

Optionally, before the determining whether the target dependency relationship data in the dependency relationship data set exists in the pre-constructed graph database, the method further includes:

acquiring an application name and application dependency relationship data in the dependency relationship data set;

writing the application name and the application dependency relationship data into a dependency relationship data table, wherein the application name is a primary key of the dependency relationship data table, the value of the application name is a primary key value of the dependency relationship data table, the application dependency relationship data is an affiliated field of the dependency relationship data table, and the value of the application dependency relationship data is an affiliated field value of the dependency relationship data table.

Optionally, the generating a newly added single application dependency tree of the target application by using the dependency relationship data to be processed includes:

acquiring a data transmission request head of an HTTP (hyper text transport protocol) protocol for carrying out data communication with the graphic database;

adding an extension field in the data transmission request header, wherein the extension field comprises a transmission interface state field of the graphic database;

calling a data transmission interface of the graphic database to send a data transmission request by using a data transmission request head after the extension field is added;

receiving a data transmission instruction returned by the graphic database based on the data transmission request;

and uploading the dependency relationship data to be processed to the graph database according to the data transmission instruction so as to generate a newly added single application dependency tree of the target application by utilizing the graph database.

Optionally, the extracting the dependency relationship of the application data packet to obtain a dependency relationship data set includes:

acquiring a training application data set and standard dependency relationship data corresponding to the training application data set;

performing dependency relationship extraction on the training application data set by using a preset dependency relationship extraction model to obtain prediction dependency relationship data;

calculating a difference value between the predicted dependency relationship data and the standard dependency relationship data;

if the difference value is larger than the error threshold value, adjusting the parameters of the dependency extraction model and then extracting the dependency again;

if the difference value is smaller than the error threshold value, generating a trained dependency relationship extraction model;

and performing dependency relationship extraction on the application data packet by using the trained dependency relationship extraction model to obtain a plurality of dependency relationship data.

Optionally, the calculating a difference value between the predicted dependency data and the standard dependency data includes:

calculating a difference value between the predicted dependency data and the standard dependency data using a difference value algorithm

Wherein,

and the prediction dependency relationship data are obtained, Y is the standard dependency relationship data, alpha is a preset constant, and N is the number of the prediction dependency relationship data.

In order to solve the above problem, the present invention further provides a multi-application dependency tree generating apparatus, including:

the relation extraction module is used for acquiring application data packets of a plurality of applications and extracting the dependency relation of the application data packets to obtain dependency relation data sets of the applications;

the judging module is used for judging whether target dependency relationship data in the dependency relationship data set exist in a pre-constructed graph database or not;

the dependency tree obtaining module is used for obtaining a target single application dependency tree corresponding to the target dependency data if the target dependency data in the dependency data set exists in the graph database;

the collection module is used for collecting other dependency relationship data except the target dependency relationship data in the dependency relationship data set into to-be-processed dependency relationship data;

the dependency tree generation module is used for generating a newly added single application dependency tree of a target application by using the dependency relationship data to be processed, wherein the target application is an application corresponding to the dependency relationship data to be processed;

and the relationship connection module is used for performing dependency relationship connection on the generated newly added single application dependency tree and the target single application dependency tree to obtain a multi-application dependency tree of the plurality of applications.

In order to solve the above problem, the present invention also provides an electronic device, including:

a memory storing at least one instruction; and

and the processor executes the instructions stored in the memory to realize the multi-application dependency tree generation method.

In order to solve the above problem, the present invention further provides a computer-readable storage medium, which stores at least one instruction, where the at least one instruction is executed by a processor in an electronic device to implement the multi-application dependency tree generation method described above.

The method comprises the steps of obtaining application data packets of a plurality of applications, extracting dependency relationships of the application data packets to obtain dependency relationship data sets of the plurality of applications, judging whether target dependency relationship data in the dependency relationship data sets exist in a pre-constructed graph database, and if the target dependency relationship data in the dependency relationship data sets exist in the graph database, obtaining a target single-application dependency tree corresponding to the target dependency relationship data without repeatedly generating the dependency tree, so that the overall efficiency of generating the multi-application dependency tree can be improved; collecting other dependency relationship data except the target dependency relationship data in the dependency relationship data set into dependency relationship data to be processed; generating a newly added single application dependency tree of a target application by using the dependency relationship data to be processed, wherein the target application is an application corresponding to the dependency relationship data to be processed; and connecting the generated newly-added single-application dependency tree with the target single-application dependency tree in a dependency relationship manner to obtain a multi-application dependency tree of a plurality of applications, and generating the multi-application dependency tree without performing query analysis on the bottom-layer codes of the applications, so that the efficiency of generating the multi-application dependency tree can be improved. Therefore, the multi-application dependency tree generation method, the multi-application dependency tree generation device and the computer readable storage medium can quickly generate the dependency relationship among the micro-service applications.

Drawings

Fig. 1 is a schematic flowchart of a method for generating a multi-application dependency tree according to an embodiment of the present invention;

fig. 2 is a schematic block diagram of a multi-application dependency tree generation apparatus according to an embodiment of the present invention;

fig. 3 is a schematic internal structural diagram of an electronic device implementing a multi-application dependency tree generation method according to an embodiment of the present invention;

the implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.

Detailed Description

It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

The embodiment of the application provides multi-application dependency tree generation. The execution subject of the multi-application dependency tree generation includes, but is not limited to, at least one of electronic devices such as a server and a terminal that can be configured to execute the method provided by the embodiments of the present application. In other words, the multi-application dependency tree generation may be performed by software installed in the terminal device or the server device or hardware, and the software may be a block chain platform. The server includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like.

Fig. 1 is a schematic diagram illustrating a flow of generating a multi-application dependency tree according to an embodiment of the present invention. In this embodiment, the multi-application dependency tree generation includes:

s1, obtaining application data packages of multiple applications, and extracting the dependency relationship of the application data packages to obtain a dependency relationship data set of the multiple applications.

In the embodiment of the present invention, the application data package is used to store data related to the application, for example, application version information, applicable system information of the application, dependency relationship of the application, and the like.

In detail, the obtaining the application data packets of the plurality of applications includes:

In detail, the application platform is any platform that can provide an application running environment, for example, a ROMA cloud application platform, a Maemo OS application platform, and the like, the application platform includes block link points that are constructed in advance and used for storing application data packets, and the efficiency of acquiring the application data packets can be improved by using the high throughput of the block link points on data.

Specifically, the embodiment of the invention captures the system information of the application platform from the system file of the application platform where the plurality of applications are located through a python statement with a data capture function.

In an optional embodiment of the present invention, the generating an application data call statement according to the system information includes: compiling the starting parameter into an application data calling statement by using a compiler.

Wherein the container is used for storing information of an application. The container is an open source application container engine and is used for storing the application in the application platform, and the container is installed in the application platform.

Preferably, the compiler includes, but is not limited to, Microsoft Visual C + +, Microsoft Visual Studio, DEV C + +.

In specific implementation, the application data of all the applications or part of the application data in the container of the application platform may be acquired by executing the application data call statement.

Because the data structures of different application platforms are different, in order to call application data from different application platforms, a compiler conforming to system information needs to be selected to generate an application data call statement according to the system information of different application platforms, so as to call the application data from the application platforms by using the generated application data call statement.

According to the embodiment of the invention, the application data calling statement applied in the application platform is generated according to the system information of the application platform, so that the usability of the application data calling statement can be improved.

Further, the extracting the dependency relationship of the application data packet to obtain a dependency relationship data set includes:

In detail, the calculating a difference value between the predicted dependency data and the standard dependency data includes:

Wherein,

Preferably, the dependency data set includes a plurality of dependency data corresponding to the applications, for example, the dependency data set includes a plurality of dependency data (a-B, F-C, B-D) indicating that the application a depends on the application B, the application F depends on the application C, and the application B depends on the application D.

And S2, judging whether target dependency relationship data in the dependency relationship data set exist in a pre-constructed graph database.

In this embodiment of the present invention, the determining whether target dependency relationship data in the dependency relationship data set exists in a pre-constructed graph database includes:

Preferably, the graphic database is a neo4j graphic database, and the neo4j graphic database can display the application one-to-many or many-to-many dependency relationships in a visual graphic form.

Further, before the determining whether the target dependency relationship data in the dependency relationship data set exists in the pre-constructed graph database, the method further includes:

The primary key value is a unique data mark determined during data storage in the data table, such as a unique serial number, the auxiliary field corresponding to the primary key value is row data in the same row as the primary key value, the auxiliary field corresponding to the primary key value can be one or more, for example, the primary key value is an application name, the auxiliary field can be defined by developers, and the auxiliary field is beneficial to further explaining the primary key value.

Referring to table 1, table 1 is an exemplary diagram of a dependency data table in an embodiment of the present invention.

Application name	Application dependency data
		Applications A	Application A depends on application 10 and application 20
Application B	Application B depends on application 20 and application 40
		Applications C	Application C depends on application 30, application 40, and application 50
Applications D	Application D depends on application 40 and application 50

TABLE 1

Different application names in table 1 are primary key values, and corresponding applications can be uniquely found according to the application names. The dependency relationship data of different applications are auxiliary fields, and the application dependency relationship data corresponding to the applications can be displayed through the auxiliary fields. For example, if there is an application 1 in table 1, the application dependency data in the dependency data table is the dependent field of the application 1, and the dependent field with the primary key value of the application 1 is used as the application dependency data corresponding to the application 1.

In the embodiment of the invention, after the application name and the application dependency relationship data are written into the dependency relationship data table, the dependency relationship of a single application can be obtained by searching according to the primary key value in the dependency relationship data table.

The embodiment of the invention stores the dependency relationship data set into the dependency relationship data table in a key value pair form, thereby judging whether a single application dependency tree corresponding to the dependency relationship data in the dependency relationship data set exists in a pre-constructed graph database through retrieving the primary key values in the dependency relationship data table, and improving the efficiency of retrieving the data in the dependency relationship data table.

S3, if the target dependency relationship data in the dependency relationship data set exist in the graph database, obtaining a target single application dependency tree corresponding to the target dependency relationship data.

In the embodiment of the present invention, the target single-application dependency tree is a dependency tree generated according to dependency relationship data of a single application, and may be used to represent dependency relationship data included in the single application, where the target single-application dependency tree is stored in a graph database in advance.

For example, the multiple applications include application a, application B, application C, and application D, and after the determination at S2, the target single-application dependency tree corresponding to the dependency relationship data of application C and application D is obtained and already exists in the graph database, and the target single-application dependency tree corresponding to the dependency relationship data of application 1 and application 2 does not exist in the graph database, and then the target single-application dependency tree corresponding to the target dependency relationship data of application C and application D is obtained from the graph database.

And S4, collecting other dependency relationship data except the target dependency relationship data in the dependency relationship data set into to-be-processed dependency relationship data.

For example, if there are application 1, application 2, application 3, and application 4, and the processing in step S2 is performed to obtain that application 3 and application 4 already exist in the graph database, and application 1 and application 2 do not exist in the application database, then the dependency data other than the target dependency data of application 3 and application 4 (i.e., the dependency data of application 1 and application 2) are collected as the dependency data to be processed.

S5, generating a newly added single application dependency tree of a target application by using the dependency relationship data to be processed, wherein the target application is an application corresponding to the dependency relationship data to be processed.

In this embodiment of the present invention, the generating a newly added single application dependency tree of a target application by using the dependency relationship data to be processed includes:

calling a data transmission interface of the graphic database to send a data transmission request by using the data transmission request head part added with the extension field;

and uploading the dependency relationship data to be processed to the graph database according to the data transmission instruction to generate a newly added single application dependency tree of the target application.

According to the embodiment of the invention, the dependency relationship data to be processed is uploaded to the graph database, and the graph database is used for generating the newly added single application dependency tree of the target application, so that the generation efficiency of the newly added single application dependency tree can be improved.

In detail, the transport interface status field of the graphic database is diff-tag, and its value can be represented by boolean value False or True.

And when the graphic database receives a call request of the data transmission request head, judging the state of the current data transmission interface, if the interface state is unavailable, assigning a transmission interface state field diff-tag in the extension field as False, if the interface state is available, assigning the transmission interface state field diff-tag in the extension field as True, and after the assignment of the transmission interface state field diff-tag in the extension field is completed, returning a data transmission instruction containing the transmission interface state field diff-tag in the extension field.

Further, the uploading the to-be-processed dependency relationship data to the graph database according to the data transmission instruction includes:

acquiring the state of the transmission interface state field contained in the data transmission instruction, and if the state of the transmission interface state field is False, uploading the dependency relationship data to be processed to the graph database after waiting for a preset time;

and acquiring the state of the transmission interface state field contained in the data transmission instruction, and immediately uploading the to-be-processed dependency relationship data to the graph database if the state of the transmission interface state field is True.

And S6, performing dependency relationship connection on the generated newly added single application dependency tree and the target single application dependency tree to obtain a multi-application dependency tree of the multiple applications.

Because the target single-application dependency tree and the newly added single-application dependency tree both only show the relationship that the single application depends on other applications, the multi-application dependency tree of the multiple applications is obtained by connecting the generated newly added single-application dependency tree and the target single-application dependency tree in a dependency relationship manner.

For example, application 1 depends on application 10 and application 20, application 2 depends on application 20 and application 40, application 3 depends on application 30, application 40 and application 50, and application 4 depends on application 40 and application 50, and it can be known that there is an overlapping dependency relationship between application 1 and application 2 (both application 1 and application 2 depend on application 20), then the single application dependency tree of application 1 and the single application dependency tree of application 2 are connected at application 20, the single application dependency tree of application 1 and the single application dependency tree of application 2 are connected together to obtain a multi-application dependency tree including application 1 and application 2, and so on, the single application dependency trees of application 1, application 2, application 3 and application 4 are connected according to the above method to obtain a multi-application dependency tree including application 1, application 2, application 3 and application 4.

The method comprises the steps of obtaining application data packets of a plurality of applications, extracting dependency relationships of the application data packets to obtain dependency relationship data sets of the plurality of applications, judging whether target dependency relationship data in the dependency relationship data sets exist in a pre-constructed graph database, and if the target dependency relationship data in the dependency relationship data sets exist in the graph database, obtaining a target single-application dependency tree corresponding to the target dependency relationship data without repeatedly generating the dependency tree, so that the overall efficiency of generating the multi-application dependency tree can be improved; collecting other dependency relationship data except the target dependency relationship data in the dependency relationship data set into dependency relationship data to be processed; generating a newly added single application dependency tree of a target application by using the dependency relationship data to be processed, wherein the target application is an application corresponding to the dependency relationship data to be processed; and connecting the generated newly-added single-application dependency tree with the target single-application dependency tree in a dependency relationship manner to obtain a multi-application dependency tree of a plurality of applications, and generating the multi-application dependency tree without performing query analysis on the bottom-layer codes of the applications, so that the efficiency of generating the multi-application dependency tree can be improved. Therefore, the multi-application dependency tree generation method provided by the invention can quickly generate the dependency relationship among the micro-service applications.

Fig. 2 is a schematic block diagram of the multi-application dependency tree generation apparatus according to the present invention.

The multi-application dependency tree generating apparatus 100 of the present invention may be installed in an electronic device. According to the implemented functions, the multi-application dependency tree generating device may include a relationship extracting module 101, a judging module 102, a dependency tree obtaining module 103, a collecting module 104, a dependency tree generating module 105, and a relationship connecting module 106. The module of the present invention, which may also be referred to as a unit, refers to a series of computer program segments that can be executed by a processor of an electronic device and that can perform a fixed function, and that are stored in a memory of the electronic device.

In the present embodiment, the functions regarding the respective modules/units are as follows:

the relationship extraction module 101 is configured to obtain application data packets of multiple applications, and perform dependency relationship extraction on the application data packets to obtain dependency relationship data sets of the multiple applications;

the judging module 102 is configured to judge whether target dependency relationship data in the dependency relationship data set exists in a pre-constructed graph database;

the dependency tree obtaining module 103 is configured to, if target dependency relationship data in the dependency relationship data set exists in the graph database, obtain a target single application dependency tree corresponding to the target dependency relationship data;

the collection module 104 is configured to collect, as to-be-processed dependency relationship data, dependency relationship data other than the target dependency relationship data in the dependency relationship data set;

the dependency tree generating module 105 is configured to generate a newly added single application dependency tree of a target application by using the dependency relationship data to be processed, where the target application is an application corresponding to the dependency relationship data to be processed;

the relationship connection module 106 is configured to perform dependency relationship connection on the generated newly added single-application dependency tree and the target single-application dependency tree to obtain a multi-application dependency tree of the multiple applications.

In detail, the specific implementation of each module of the multi-application dependency tree generation apparatus is as follows:

the relationship extraction module 101 is configured to obtain application data packets of multiple applications, and perform dependency extraction on the application data packets to obtain dependency data sets of the multiple applications.

In detail, the relationship extraction module 101 is specifically configured to:

acquiring application data packets of the plurality of applications from application platforms where the plurality of applications are located by executing the application data calling statement;

and extracting the dependency relationship of the application data packet to obtain a dependency relationship data set of the plurality of applications.

Wherein,

The judging module 102 is configured to judge whether target dependency relationship data in the dependency relationship data set exists in a pre-constructed graph database.

In this embodiment of the present invention, the determining module 102 is specifically configured to:

Further, the multi-application dependency tree generating apparatus further includes a list module, where the list module is specifically configured to:

TABLE 1

The dependency tree obtaining module 103 is configured to, if target dependency relationship data in the dependency relationship data set exists in the graph database, obtain a target single application dependency tree corresponding to the target dependency relationship data.

The collection module 104 is configured to collect, as to-be-processed dependency data, dependency data other than the target dependency data in the dependency data set.

For example, if there are application 1, application 2, application 3, and application 4, and the processing in step S2 is performed to obtain that application 3 and application 4 already exist in the graph database, and application 1 and application 2 do not exist in the application database, then the dependency data of application 1 and application 2, which is other dependency data than the target dependency data of application 3 and application 4, are collected as the dependency data to be processed.

The dependency tree generating module 105 is configured to generate a newly added single application dependency tree of a target application by using the dependency relationship data to be processed, where the target application is an application corresponding to the dependency relationship data to be processed.

In this embodiment of the present invention, the dependency tree generating module 105 is specifically configured to:

The method comprises the steps of obtaining application data packets of a plurality of applications, extracting dependency relationships of the application data packets to obtain dependency relationship data sets of the plurality of applications, judging whether target dependency relationship data in the dependency relationship data sets exist in a pre-constructed graph database, and if the target dependency relationship data in the dependency relationship data sets exist in the graph database, obtaining a target single-application dependency tree corresponding to the target dependency relationship data without repeatedly generating the dependency tree, so that the overall efficiency of generating the multi-application dependency tree can be improved; collecting other dependency relationship data except the target dependency relationship data in the dependency relationship data set into dependency relationship data to be processed; generating a newly added single application dependency tree of a target application by using the dependency relationship data to be processed, wherein the target application is an application corresponding to the dependency relationship data to be processed; and connecting the generated newly-added single-application dependency tree with the target single-application dependency tree in a dependency relationship manner to obtain a multi-application dependency tree of a plurality of applications, and generating the multi-application dependency tree without performing query analysis on the bottom-layer codes of the applications, so that the efficiency of generating the multi-application dependency tree can be improved. Therefore, the multi-application dependency tree generation device provided by the invention can quickly generate the dependency relationship among the micro-service applications.

Fig. 3 shows only an electronic device with components, and it will be understood by those skilled in the art that the structure shown in fig. 3 does not constitute a limitation of the electronic device 1, and may comprise fewer or more components than those shown, or some components may be combined, or a different arrangement of components.

For example, although not shown, the electronic device 1 may further include a power supply (such as a battery) for supplying power to each component, and preferably, the power supply may be logically connected to the at least one processor 10 through a power management device, so as to implement functions of charge management, discharge management, power consumption management, and the like through the power management device. The power supply may also include any component of one or more dc or ac power sources, recharging devices, power failure detection circuitry, power converters or inverters, power status indicators, and the like. The electronic device 1 may further include various sensors, a bluetooth module, a Wi-Fi module, and the like, which are not described herein again.

Further, the electronic device 1 may further include a network interface, and optionally, the network interface may include a wired interface and/or a wireless interface (such as a WI-FI interface, a bluetooth interface, etc.), which are generally used for establishing a communication connection between the electronic device 1 and other electronic devices.

Optionally, the electronic device 1 may further comprise a user interface, which may be a Display (Display), an input unit (such as a Keyboard), and optionally a standard wired interface, a wireless interface. Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch device, or the like. The display, which may also be referred to as a display screen or display unit, is suitable for displaying information processed in the electronic device 1 and for displaying a visualized user interface, among other things.

It is to be understood that the described embodiments are for purposes of illustration only and that the scope of the appended claims is not limited to such structures.

The electronic seal generating and verifying program 12 stored in the memory 11 of the electronic device 1 is a combination of a plurality of instructions, and when running in the processor 10, can implement:

Specifically, the specific implementation method of the processor 10 for the instruction may refer to the description of the relevant steps in the embodiment corresponding to fig. 1, which is not described herein again.

Further, the integrated modules/units of the electronic device 1, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. The computer readable storage medium may be volatile or non-volatile. For example, the computer-readable medium may include: any entity or device capable of carrying said computer program code, recording medium, U-disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM).

The present invention also provides a computer-readable storage medium, storing a computer program which, when executed by a processor of an electronic device, may implement:

In the embodiments provided in the present invention, it should be understood that the disclosed apparatus, device and method can be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical functional division, and other divisions may be realized in practice.

The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.

In addition, functional modules in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional module.

It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof.

The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference signs in the claims shall not be construed as limiting the claim concerned.

The block chain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product service layer, an application service layer, and the like.

Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the system claims may also be implemented by one unit or means in software or hardware. The terms second, etc. are used to denote names, but not any particular order.

Finally, it should be noted that the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.

Claims

1. A multi-application dependency tree generation method, the method comprising:

2. The method of claim 1, wherein the determining whether the target dependency data in the dependency data set exists in a pre-built graph database comprises:

3. The multi-application dependency tree generation method of claim 1 wherein said obtaining application data packages for a plurality of applications comprises:

4. The method of multi-application dependency tree generation as claimed in claim 1, wherein before said determining whether target dependency data in the dependency data set exists in a pre-built graph database, the method further comprises:

5. The method according to any of claims 1 to 4, wherein the generating a new single-application dependency tree of a target application by using the dependency relationship data to be processed comprises:

6. The method for generating a multi-application dependency tree as claimed in claim 1, wherein said extracting the dependency relationship of the application data package to obtain a dependency relationship data set comprises:

7. The multi-application dependency tree generation method of claim 6, wherein said calculating a difference value between the predicted dependency data and the standard dependency data comprises:

Wherein,

8. An apparatus for multi-application dependency tree generation, the apparatus comprising:

9. An electronic device, characterized in that the electronic device comprises:

at least one processor; and the number of the first and second groups,

a memory communicatively coupled to the at least one processor; wherein,

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the multi-application dependency tree generation method as claimed in any one of claims 1 to 7.

10. A computer-readable storage medium comprising a storage data area storing created data and a storage program area storing a computer program; wherein the computer program when executed by a processor implements the multi-application dependency tree generation method of any one of claims 1 to 7.