CN112214662A - Service relationship query method and device, electronic equipment and storage medium - Google Patents
Service relationship query method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN112214662A CN112214662A CN202011085024.3A CN202011085024A CN112214662A CN 112214662 A CN112214662 A CN 112214662A CN 202011085024 A CN202011085024 A CN 202011085024A CN 112214662 A CN112214662 A CN 112214662A
- Authority
- CN
- China
- Prior art keywords
- service
- services
- relationship
- list
- subsystem
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000004590 computer program Methods 0.000 claims description 5
- 238000012423 maintenance Methods 0.000 claims description 4
- 239000000126 substance Substances 0.000 claims 1
- 238000012360 testing method Methods 0.000 abstract description 15
- 238000005516 engineering process Methods 0.000 abstract description 4
- 230000006870 function Effects 0.000 description 12
- 238000012217 deletion Methods 0.000 description 6
- 230000037430 deletion Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000007726 management method Methods 0.000 description 5
- 238000010276 construction Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000002372 labelling Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9538—Presentation of query results
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Stored Programmes (AREA)
Abstract
The invention relates to the technical field of internet, and discloses a service relation query method, which comprises the following steps: acquiring all services of a subsystem in a system to be maintained, and initializing each service to obtain a plurality of single service sets; merging services in the single service sets to obtain a plurality of multi-service sets; identifying service relationships among all services in the multi-service set to obtain a service relationship list; inquiring service branch nodes in a multi-service set, identifying node relations among the service branch nodes, and generating a service branch node relation list; and constructing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation between services in the system to be maintained based on the service relation tree, and outputting an inquiry result. In addition, the invention also relates to a block chain technology, and the service relation list can be stored in the block chain. The invention can reduce the pressure of upgrading and testing the system.
Description
Technical Field
The present invention relates to the field of internet technologies, and in particular, to a service relationship query method and apparatus, an electronic device, and a computer-readable storage medium.
Background
With the continuous development of information technology, the upgrading and testing of the system become more important. The upgrading and testing of the system can improve the existing loophole of the old system on one hand and can increase the system operation fluency on the other hand. At present, in the process of upgrading and testing a system, each subsystem existing in the system is mainly deployed independently, the services existing in each subsystem are preprocessed through source code construction, packaging, configuration files and the like, and after a test environment is adjusted according to the dependency relationship among the preprocessed services, each subsystem is operated, so that the upgrading and testing of the system are completed.
However, since there are multiple hierarchical relationships among services in each subsystem in the system, when the subsystems are deployed, since the multiple hierarchical relationships among the services in each subsystem are not clear, a large amount of work for repeatedly querying the relationships among the services in each subsystem is required, which results in a great pressure on upgrading and testing the entire system.
Disclosure of Invention
The invention provides a service relationship query method, a service relationship query device, electronic equipment and a computer readable storage medium, and mainly aims to query all relationships among services in a subsystem so as to reduce repeated work of service relationship query in a system and reduce pressure of upgrading and testing the system.
In order to achieve the above object, the present invention provides a service relationship query method, including:
acquiring all services of each subsystem in a system to be maintained, and initializing each service to obtain a plurality of single service sets;
merging the services in the single service sets to obtain a plurality of multi-service sets;
identifying service relationships among all the services in each multi-service set to obtain a service relationship list;
inquiring service branch nodes in each multi-service set, identifying node relations among the service branch nodes, and generating a service branch node relation list;
and constructing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation among the services in the system to be maintained based on the service relation tree, and outputting an inquiry result.
Optionally, the acquiring all services of each subsystem in the system to be maintained includes:
inquiring the configuration file of each subsystem, and acquiring a program operation package corresponding to each subsystem according to the configuration file;
and searching the service in the program operation package by using a preset service query statement.
Optionally, the initializing each service to obtain a single service set includes:
marking each subsystem to obtain a unique identifier of each subsystem, and adding the unique identifier to corresponding services to obtain an initial service set;
extracting the initial service set from the corresponding subsystem to obtain a service list;
and carrying out array marking on the initial service in the service list based on a preset array sequence algorithm to form the plurality of single service sets.
Optionally, the identifying service relationships among all the services in each multi-service set, and obtaining a service relationship list includes:
sequentially selecting two services from the multi-service set randomly through traversal operation;
querying a depth hierarchy for the arbitrary two services;
and identifying the service relationship corresponding to the two services according to the depth hierarchy to obtain a service relationship list.
Optionally, the identifying, according to the depth hierarchy, a service relationship corresponding to two services includes:
if the depth level of one service is greater than or less than that of the other service, the service relationship corresponding to the two services is an inclusion relationship;
if the depth level of one service is equal to the depth level of another service, the service relationship corresponding to the two services is parallel.
Optionally, the constructing a service relationship tree of the system to be maintained according to the service relationship list and the service branch node relationship list includes:
acquiring the service branch node relationship and the number of service branch nodes in the service branch node relationship list, constructing the service branch nodes of the system to be maintained according to the service branch node relationship and the number of service branch nodes, and generating an initial service relationship tree;
and acquiring the service relationships and the service quantity in a service relationship list corresponding to the service branch nodes, and constructing leaf nodes of the service branch nodes according to the service relationships and the service quantity to obtain the service relationship tree.
Optionally, the querying, based on the service relationship tree, a relationship between the services in the system to be maintained, and outputting a query result includes:
receiving any two services in the system to be maintained, searching leaf node positions of the any two services in the service relation tree, identifying the service relation of the any two services according to the leaf node positions, and outputting a query result.
In order to solve the above problem, the present invention further provides a service relationship query apparatus, including:
the system comprises an initialization module, a maintenance module and a maintenance module, wherein the initialization module is used for acquiring all services of each subsystem in a system to be maintained and initializing each service to obtain a plurality of single service sets;
a merging module, configured to merge the services in the multiple single service sets to obtain multiple multi-service sets;
the identification module is used for identifying the service relationship among all the services in each multi-service set to obtain a service relationship list;
the identification module is further configured to query the service branch nodes in each multi-service set, identify the node relationships among the service branch nodes, and generate a service branch node relationship list;
and the output module is used for constructing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation among the services in the system to be maintained based on the service relation tree, and outputting an inquiry result.
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 service relationship query method.
In order to solve the above problem, the present invention further provides a computer-readable storage medium, in which at least one instruction is stored, and the at least one instruction is executed by a processor in an electronic device to implement the service relationship query method described above.
The embodiment of the invention firstly initializes all services of each subsystem in a system to be maintained to obtain a plurality of single service sets, and combines the services in the single service sets to obtain a plurality of multi-service sets, so that the services in the corresponding subsystems can be summarized, and the identification time of the relationship between subsequent services is reduced; identifying the service relationship among all the services in each multi-service set to obtain a service relationship list, and inquiring the relationship between any two services in the corresponding multi-service set and checking the existence quantity of the services in the corresponding multi-service set so as to ensure the calling premise among the services; inquiring service branch nodes in each multi-service set, identifying node relations among the service branch nodes, generating a service branch node relation list, checking the number of the service branch nodes, and identifying that the node relations between any two service branch nodes are parallel relations; and establishing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation among the services in the system to be maintained based on the service relation tree to obtain an inquiry result, checking the hierarchical relation among the services through the service relation tree, and reducing the pressure of upgrading and testing the system to be maintained without carrying out a large amount of repeated inquiry work.
Drawings
Fig. 1 is a schematic flow chart illustrating a service relationship query method according to an embodiment of the present invention;
fig. 2 is a schematic detailed flowchart of service acquisition in step S1 of the service relationship query method provided in fig. 1 according to the first embodiment of the present invention;
fig. 3 is a detailed flowchart illustrating service initialization in step S1 of the service relationship query method provided in fig. 1 according to a first embodiment of the present invention;
fig. 4 is a detailed flowchart illustrating the service relationship query method step S2 provided in fig. 1 according to the first embodiment of the present invention;
fig. 5 is a detailed flowchart illustrating the service relationship query method step S3 provided in fig. 1 according to the first embodiment of the present invention;
fig. 6 is a schematic block diagram of a service relationship query apparatus according to an embodiment of the present invention;
fig. 7 is a schematic internal structural diagram of an electronic device implementing a service relationship query 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 execution subject of the service relationship query method provided by the embodiment of the present application 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 embodiment of the present application. In other words, the service relationship query method may be executed by software or hardware installed in the terminal device or the server device, and the software may be a blockchain 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.
Referring to fig. 1, a flow diagram of a service relationship query method according to an embodiment of the present invention is shown. In the embodiment of the present invention, the service relationship query method includes:
s1, obtaining all services of each subsystem in the system to be maintained, and initializing each service to obtain a plurality of single service sets.
In a preferred embodiment of the present invention, the system to be maintained refers to an application system that needs to be upgraded or tested for vulnerabilities, such as a mall system. The subsystem refers to a system that can operate independently in the system to be maintained, and the system to be maintained is formed by summarizing all subsystems, for example, the mall system may include: a login subsystem, a mall order subsystem, an order payment subsystem, and so on, where the service refers to a service provided by each subsystem, for example, in the mall order subsystem, the service may include: order service, order query service, order logistics service, order delete service, etc., wherein it is stated that each service may contain a plurality of services, for example, the order query service includes: an order type query service, an order price query service, an order list query service, and the like.
In the preferred embodiment of the present invention, referring to fig. 2, the acquiring all services of each subsystem in the system to be maintained includes:
s10, inquiring the configuration file of each subsystem, and acquiring a program operation package corresponding to each subsystem according to the configuration file;
and S11, searching the service in the program operation package by using a preset service query statement.
In an optional embodiment, the configuration file is queried through a window function, such as: a web function () function.
The package refers to a code package or jar package which is run by the subsystem in the server.
In an alternative embodiment, the predetermined service query statement is a main statement.
Furthermore, because the acquired services exist independently and exist in the corresponding program operation packages, which is not beneficial to viewing the service call relationship existing among the services, the embodiment of the present invention forms a single service set by initializing each service, so as to extract the existing services from the program operation packages, thereby improving the query efficiency of the relationship among the services.
It should be noted that each single service set only includes one service, and each single service set corresponds to one subsystem, and since one subsystem may include multiple services, multiple single service sets may correspond to one subsystem.
Preferably, each of the services is initialized in the form of an array structure to form a plurality of single service sets, and based on the form of a data structure, the obtained single service sets can simplify the display manner of each service, for example, the above-mentioned order query service, order logistics service, and order deletion service are initialized in the form of a data structure, and the single service sets in the forms of [1], [2], [3] can be obtained, where [1] represents the order query service, [2] represents the order logistics service, and [3] represents the order deletion service.
In detail, referring to fig. 3, initializing each service to obtain a single service set includes:
s110, marking each subsystem to obtain a unique identifier of each subsystem, and adding the unique identifier to corresponding services to obtain an initial service set;
s111, extracting the initial service set from the corresponding subsystem to obtain a service list;
and S112, carrying out array marking on the initial service in the service list based on a preset array sequence algorithm to form a plurality of single service sets.
In a preferred embodiment, the subsystem mark marks the id of each subsystem through a currently known self-increment sequence algorithm to obtain a unique identifier of each subsystem, so as to distinguish the difference of each subsystem.
The unique identifier is added to a corresponding service to realize a many-to-one correspondence relationship between the service and the subsystem, so as to prevent the occurrence of the same service without knowing which subsystem corresponds to the same service, for example, there are a subsystem a, a subsystem B, and a subsystem C, where the subsystem a includes: service 1, service 2, and service 3, the subsystem B including: service 1, service 2, and service 4, the subsystem C including: the service 2, the service 5 and the service 6 acquire the unique identifier corresponding to each subsystem as follows: A. b, C, adding the unique identifier to the corresponding service to obtain: service a1, service a2, service A3, service B1, service B2, service B4, service C2, service C5, and service C6 implement a many-to-one relationship between services and subsystems.
In a preferred embodiment, the predetermined array sequence algorithm may be a data element labeling method.
Based on the implementation means, all services in each subsystem can be extracted to form a single service set, and the premise of rapid identification of the relationship between the services is ensured.
S2, merging the services in the single service sets to obtain a plurality of multi-service sets.
In a preferred embodiment of the present invention, referring to fig. 4, the S2 includes:
s20, acquiring the unique identifier of the subsystem corresponding to each single service set;
and S21, merging the services in the single service set with the same unique identification to form the multiple multi-service sets.
And the unique identification is obtained according to the many-to-one correspondence between the service and the subsystem.
Further, each service included in one subsystem corresponds to one single-service set, so that the embodiment of the invention combines the services in the single-service sets belonging to the same subsystem to form a plurality of multi-service sets.
It is to be noted that, when the single service sets are merged, if only one single service set exists in one subsystem, the multi-service set generated correspondingly is itself.
Based on the formation of the multi-service set, the services existing in the corresponding subsystems can be summarized, and the identification time of the relationship between the subsequent services is reduced.
S3, identifying the service relationship among all the services in each multi-service set to obtain a service relationship list.
In at least one embodiment of the present invention, because a large number of services exist in one multi-service set, if the service relationship between each service is not cleared, the service relationship between the services cannot be directly invoked, so in the present invention, a recursive hierarchy method is adopted to identify the service relationship between all the services in each multi-service set, and obtain the service relationship list, so that the relationship between each service can be more intuitively displayed, and the rapid invocation between the services can be ensured.
In detail, referring to fig. 5, the S3 includes:
s30, sequentially selecting two services from the multi-service set through traversal operation;
s31, inquiring the depth levels of the arbitrary two services;
and S32, identifying the service relationship corresponding to the two services according to the depth hierarchy to obtain a service relationship list.
In a preferred embodiment, the depth hierarchy of any two services is queried from the corresponding subsystems through db query statements.
In a preferred embodiment, the S32 includes:
if the depth level of one service is greater than or less than that of the other service, the service relationship corresponding to the two services is an inclusion relationship;
if the depth level of one service is equal to the depth level of another service, the service relationship corresponding to the two services is parallel.
Illustratively, take a mall order multi-service set as an example, it includes: the system comprises order service, order query service, order logistics service, order deletion service, order type query service, order price query service, order list query service and the like, wherein two services are arbitrarily selected from the mall order multi-service set: the order query service [ x ] and the order price query service [ y ] are used for obtaining rank [ x ] < rank [ y ] through a db query statement, wherein the depth level rank of the order query service [ x ] is 3, and the depth level rank of the order price query service [ y ] is 4, and then the order query service including the order price query service, namely, the place [ y ] < rank [ y ] can be obtained.
Based on the generation of the service relationship list, the relationship between any two services in the corresponding multi-service set can be inquired, the existence quantity of the services in the corresponding multi-service set can be checked, and the calling premise among the services is guaranteed.
Further, to ensure privacy and security of the service relationship list, the service relationship list may also be stored in a blockchain node.
S4, inquiring the service branch nodes in each multi-service set, identifying the node relationship among the service branch nodes, and generating a service branch node relationship list.
In a preferred embodiment of the present invention, the service branch node is used to describe a service type of each multi-service set, and preferably, each subsystem is used as a service branch node in each multi-service set in the present invention, so that the corresponding service branch node can be obtained by querying the subsystem corresponding to each multi-service set in the present invention, for example, the service branch node of the above mall order subsystem is a mall order.
Further, in the preferred embodiment of the present invention, each subsystem is used as a service branch node, and the relationship between any two subsystems is identified as a parallel relationship, so that the node relationship between any two service branch nodes can be identified as a parallel relationship, thereby generating the service branch node relationship list.
Based on the service branch node relationship list, the number of service branch nodes can be checked, and the node relationship between any two service branch nodes can be identified as a parallel relationship.
S5, constructing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation among the services in the system to be maintained based on the service relation tree, and outputting an inquiry result.
In a preferred embodiment of the present invention, a service relationship tree of the system to be maintained is constructed by using java compilation language according to the service relationship list and the service branch node relationship list, and preferably, the present invention constructs the service relationship tree of the system to be maintained by using the system to be maintained as a root node, each subsystem as a service branch node of the root node, and a service existing in each subsystem as a leaf node of the service branch node.
Specifically, the constructing a service relationship tree of the system to be maintained according to the service relationship list and the service branch node relationship list includes: acquiring the service branch node relationship and the number of service branch nodes in the service branch node relationship list, constructing the service branch nodes of the system to be maintained according to the service branch node relationship and the number of service branch nodes, and generating an initial service relationship tree; and acquiring the service relationship and the service quantity of the service relationship list corresponding to the service branch node, and constructing leaf nodes of the service branch node according to the service relationship and the service quantity to obtain the service relationship tree.
For example, in the present invention, the mall system is taken as an example of a system to be maintained, first, the mall system is taken as a root node of a service relationship tree in the embodiment of the present invention to determine a main architecture of the entire mall system, and then, the embodiment of the present invention determines service branch nodes of the root node by the number of sub-systems in the mall system and the relationship between the sub-systems, that is, each sub-system is taken as a service branch node to form an initial service relationship tree having the root node and the branch nodes; further, in the embodiment of the present invention, leaf nodes of the service branch nodes are determined according to the service relationship and the number of services in the subsystem corresponding to the service branch nodes, that is, all services existing in the subsystem are used as one leaf node, and the position of each leaf node in the service relationship tree is determined according to the service relationship, so as to complete the construction of the service relationship tree, where the relationship between the leaf nodes is the service relationship.
In the preferred embodiment of the invention, based on the service relationship tree, the relationship between the services in the system to be maintained is inquired by using an index inquiry algorithm to obtain an inquiry result.
In detail, the querying, based on the service relationship tree, the relationship between the services in the system to be maintained by using an index query algorithm to obtain a query result, including:
receiving any two services of the service relationship to be inquired, searching leaf node positions of the any two services in the service relationship tree by using the index inquiry algorithm, identifying the service relationship of the any two services according to the leaf node positions, and obtaining the inquiry result.
Based on the service relation tree, the hierarchical relation among all services can be checked, a large amount of repeated inquiry work is not needed, the upgrade pressure of the system to be maintained is reduced, meanwhile, when the system to be maintained is tested, the relation between any two services can be inquired through the service relation tree, so that whether the service corresponding to the test has a leak or not can be quickly checked, and the test pressure of the system to be maintained is reduced.
In summary, in the embodiments of the present invention, all services of each subsystem in a system to be maintained are initialized to obtain a plurality of single service sets, and the services in the plurality of single service sets are merged to obtain a plurality of multi-service sets, so that services existing in corresponding subsystems can be summarized, and the identification time of the relationship between subsequent services is reduced; identifying the service relationship among all the services in each multi-service set to obtain a service relationship list, and inquiring the relationship between any two services in the corresponding multi-service set and checking the existence quantity of the services in the corresponding multi-service set so as to ensure the calling premise among the services; inquiring service branch nodes in each multi-service set, identifying node relations among the service branch nodes, generating a service branch node relation list, checking the number of the service branch nodes, and identifying that the node relations between any two service branch nodes are parallel relations; and establishing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation among the services in the system to be maintained based on the service relation tree to obtain an inquiry result, checking the hierarchical relation among the services through the service relation tree, and reducing the pressure of upgrading and testing the system to be maintained without carrying out a large amount of repeated inquiry work.
Fig. 6 is a functional block diagram of the service relationship query apparatus according to the present invention.
The service relationship query apparatus 100 according to the present invention may be installed in an electronic device. According to the implemented functions, the service relationship query device may include an initialization module 101, a merging module 102, an identification module 103, and an output module 104. A module according to 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 initialization module 101 is configured to acquire all services of each subsystem in the system to be maintained, and initialize each service to obtain a plurality of single service sets.
In a preferred embodiment of the present invention, the system to be maintained refers to an application system that needs to be upgraded or tested for vulnerabilities, such as a mall system. The subsystem refers to a system that can operate independently in the system to be maintained, and the system to be maintained is formed by summarizing all subsystems, for example, the mall system may include: a login subsystem, a mall order subsystem, an order payment subsystem, and so on, where the service refers to a service provided by each subsystem, for example, in the mall order subsystem, the service may include: order service, order query service, order logistics service, order delete service, etc., wherein it is stated that each service may contain a plurality of services, for example, the order query service includes: an order type query service, an order price query service, an order list query service, and the like.
In a preferred embodiment of the present invention, the initialization module 101 obtains all services of each subsystem in the system to be maintained by using the following operations: inquiring the configuration file of each subsystem, and acquiring a program operation package corresponding to each subsystem according to the configuration file; and searching the service in the program operation package by using a preset service query statement.
In an optional embodiment, the configuration file is queried through a window function, such as: a web function () function.
The package refers to a code package or jar package which is run by the subsystem in the server.
In an alternative embodiment, the predetermined service query statement is a main statement.
Furthermore, because the acquired services exist independently and exist in the corresponding program operation packages, which is not beneficial to viewing the service call relationship existing among the services, the embodiment of the present invention forms a single service set by initializing each service, so as to extract the existing services from the program operation packages, thereby improving the query efficiency of the relationship among the services.
It should be noted that each single service set only includes one service, and each single service set corresponds to one subsystem, and since one subsystem may include multiple services, multiple single service sets may correspond to one subsystem.
Preferably, each of the services is initialized in the form of an array structure to form a plurality of single service sets, and based on the form of a data structure, the obtained single service sets can simplify the display manner of each service, for example, the above-mentioned order query service, order logistics service, and order deletion service are initialized in the form of a data structure, and the single service sets in the forms of [1], [2], [3] can be obtained, where [1] represents the order query service, [2] represents the order logistics service, and [3] represents the order deletion service.
In detail, referring to fig. 3, the initialization module 101 initializes each service to obtain a single service set by using the following operations: marking each subsystem to obtain a unique identifier of each subsystem, and adding the unique identifier to corresponding services to obtain an initial service set; extracting the initial service set from the corresponding subsystem to obtain a service list; and carrying out array marking on the initial service in the service list based on a preset array sequence algorithm to form the plurality of single service sets.
In a preferred embodiment, the subsystem mark marks the id of each subsystem through a currently known self-increment sequence algorithm to obtain a unique identifier of each subsystem, so as to distinguish the difference of each subsystem.
The unique identifier is added to a corresponding service to realize a many-to-one correspondence relationship between the service and the subsystem, so as to prevent the occurrence of the same service without knowing which subsystem corresponds to the same service, for example, there are a subsystem a, a subsystem B, and a subsystem C, where the subsystem a includes: service 1, service 2, and service 3, the subsystem B including: service 1, service 2, and service 4, the subsystem C including: the service 2, the service 5 and the service 6 acquire the unique identifier corresponding to each subsystem as follows: A. b, C, adding the unique identifier to the corresponding service to obtain: service a1, service a2, service A3, service B1, service B2, service B4, service C2, service C5, and service C6 implement a many-to-one relationship between services and subsystems.
In a preferred embodiment, the predetermined array sequence algorithm may be a data element labeling method.
Based on the implementation means, all services in each subsystem can be extracted to form a single service set, and the premise of rapid identification of the relationship between the services is ensured.
The merging module 102 is configured to merge the services in the multiple single service sets to obtain multiple multi-service sets.
In a preferred embodiment of the present invention, the merging module 102 merges the services in the plurality of single service sets by: acquiring a unique identifier of a subsystem corresponding to each single service set; and merging the services in the single service set with the same unique identification to form the multiple multi-service sets.
And the unique identification is obtained according to the many-to-one correspondence between the service and the subsystem.
Further, each service included in one subsystem corresponds to one single-service set, so that the embodiment of the invention combines the services in the single-service sets belonging to the same subsystem to form a plurality of multi-service sets.
It is to be noted that, when the single service sets are merged, if only one single service set exists in one subsystem, the multi-service set generated correspondingly is itself.
Based on the formation of the multi-service set, the services existing in the corresponding subsystems can be summarized, and the identification time of the relationship between the subsequent services is reduced.
The identifying module 103 is configured to identify service relationships among all the services in each multi-service set, so as to obtain a service relationship list.
In at least one embodiment of the present invention, because a large number of services exist in one multi-service set, if the service relationship between each service is not cleared, the service relationship between the services cannot be directly invoked, so in the present invention, a recursive hierarchy method is adopted to identify the service relationship between all the services in each multi-service set, and obtain the service relationship list, so that the relationship between each service can be more intuitively displayed, and the rapid invocation between the services can be ensured.
In detail, the identifying module 103 identifies the service relationship between all the services in each of the multi-service sets by: sequentially selecting two services from the multi-service set randomly through traversal operation; querying a depth hierarchy for the arbitrary two services; and identifying the service relationship corresponding to the two services according to the depth hierarchy to obtain a service relationship list.
In a preferred embodiment, the depth hierarchy of any two services is queried from the corresponding subsystems through db query statements.
In a preferred embodiment, the identifying the service relationship corresponding to the two services according to the depth hierarchy, and obtaining the service relationship list includes: if the depth level of one service is greater than or less than that of the other service, the service relationship corresponding to the two services is an inclusion relationship; if the depth level of one service is equal to the depth level of another service, the service relationship corresponding to the two services is parallel.
Illustratively, take a mall order multi-service set as an example, it includes: the system comprises order service, order query service, order logistics service, order deletion service, order type query service, order price query service, order list query service and the like, wherein two services are arbitrarily selected from the mall order multi-service set: the order query service [ x ] and the order price query service [ y ] are used for obtaining rank [ x ] < rank [ y ] through a db query statement, wherein the depth level rank of the order query service [ x ] is 3, and the depth level rank of the order price query service [ y ] is 4, and then the order query service including the order price query service, namely, the place [ y ] < rank [ y ] can be obtained.
Based on the generation of the service relationship list, the relationship between any two services in the corresponding multi-service set can be inquired, the existence quantity of the services in the corresponding multi-service set can be checked, and the calling premise among the services is guaranteed.
Further, to ensure privacy and security of the service relationship list, the service relationship list may also be stored in a blockchain node.
The identifying module 103 is further configured to query the service branch nodes in each multi-service set, identify the node relationships among the service branch nodes, and generate a service branch node relationship list.
In a preferred embodiment of the present invention, the service branch node is used to describe a service type of each multi-service set, and preferably, each subsystem is used as a service branch node in each multi-service set in the present invention, so that the corresponding service branch node can be obtained by querying the subsystem corresponding to each multi-service set in the present invention, for example, the service branch node of the above mall order subsystem is a mall order.
Further, in the preferred embodiment of the present invention, each subsystem is used as a service branch node, and the relationship between any two subsystems is identified as a parallel relationship, so that the node relationship between any two service branch nodes can be identified as a parallel relationship, thereby generating the service branch node relationship list.
Based on the service branch node relationship list, the number of service branch nodes can be checked, and the node relationship between any two service branch nodes can be identified as a parallel relationship.
The output module 104 is configured to construct a service relationship tree of the system to be maintained according to the service relationship list and the service branch node relationship list, query a relationship between services in the system to be maintained based on the service relationship tree, and output a query result.
In a preferred embodiment of the present invention, a service relationship tree of the system to be maintained is constructed by using java compilation language according to the service relationship list and the service branch node relationship list, and preferably, the present invention constructs the service relationship tree of the system to be maintained by using the system to be maintained as a root node, each subsystem as a service branch node of the root node, and a service existing in each subsystem as a leaf node of the service branch node.
Specifically, the constructing a service relationship tree of the system to be maintained according to the service relationship list and the service branch node relationship list includes: acquiring the service branch node relationship and the number of service branch nodes in the service branch node relationship list, constructing the service branch nodes of the system to be maintained according to the service branch node relationship and the number of service branch nodes, and generating an initial service relationship tree; and acquiring the service relationship and the service quantity of the service relationship list corresponding to the service branch node, and constructing leaf nodes of the service branch node according to the service relationship and the service quantity to obtain the service relationship tree.
For example, in the present invention, the mall system is taken as an example of a system to be maintained, first, the mall system is taken as a root node of a service relationship tree in the embodiment of the present invention to determine a main architecture of the entire mall system, and then, the embodiment of the present invention determines service branch nodes of the root node by the number of sub-systems in the mall system and the relationship between the sub-systems, that is, each sub-system is taken as a service branch node to form an initial service relationship tree having the root node and the branch nodes; further, in the embodiment of the present invention, leaf nodes of the service branch nodes are determined according to the service relationship and the number of services in the subsystem corresponding to the service branch nodes, that is, all services existing in the subsystem are used as one leaf node, and the position of each leaf node in the service relationship tree is determined according to the service relationship, so as to complete the construction of the service relationship tree, where the relationship between the leaf nodes is the service relationship.
In the preferred embodiment of the invention, based on the service relationship tree, the relationship between the services in the system to be maintained is inquired by using an index inquiry algorithm to obtain an inquiry result.
In detail, the querying, based on the service relationship tree, the relationship between the services in the system to be maintained by using an index query algorithm to obtain a query result, including:
receiving any two services of the service relationship to be inquired, searching leaf node positions of the any two services in the service relationship tree by using the index inquiry algorithm, identifying the service relationship of the any two services according to the leaf node positions, and obtaining the inquiry result.
Based on the service relation tree, the hierarchical relation among the services can be checked, a large amount of repeated inquiry work is not needed, and the pressure of upgrading and testing the system to be maintained is reduced.
In summary, in the embodiments of the present invention, all services of each subsystem in a system to be maintained are initialized to obtain a plurality of single service sets, and the services in the plurality of single service sets are merged to obtain a plurality of multi-service sets, so that services existing in corresponding subsystems can be summarized, and the identification time of the relationship between subsequent services is reduced; identifying the service relationship among all the services in each multi-service set to obtain a service relationship list, and inquiring the relationship between any two services in the corresponding multi-service set and checking the existence quantity of the services in the corresponding multi-service set so as to ensure the calling premise among the services; inquiring service branch nodes in each multi-service set, identifying node relations among the service branch nodes, generating a service branch node relation list, checking the number of the service branch nodes, and identifying that the node relations between any two service branch nodes are parallel relations; the method comprises the steps of establishing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation between services in the system to be maintained based on the service relation tree to obtain an inquiry result, checking the hierarchical relation between the services through the service relation tree without carrying out a large amount of repeated inquiry work, reducing the upgrading of the system to be maintained, and simultaneously, checking the relation between any two services through the service relation tree when the system to be maintained is tested, so that whether the service corresponding to the test has a leak or not can be quickly checked, and the test pressure of the system to be maintained is reduced. Fig. 7 is a schematic structural diagram of an electronic device implementing the service relationship query method according to the present invention.
The electronic device 1 may comprise a processor 10, a memory 11 and a bus, and may further comprise a computer program, such as a service relation query program 12, stored in the memory 11 and executable on the processor 10.
The memory 11 includes at least one type of readable storage medium, which includes flash memory, removable hard disk, multimedia card, card-type memory (e.g., SD or DX memory, etc.), magnetic memory, magnetic disk, optical disk, etc. The memory 11 may in some embodiments be an internal storage unit of the electronic device 1, such as a removable hard disk of the electronic device 1. The memory 11 may also be an external storage device of the electronic device 1 in other embodiments, such as a plug-in mobile hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the electronic device 1. Further, the memory 11 may also include both an internal storage unit and an external storage device of the electronic device 1. The memory 11 may be used not only to store application software installed in the electronic device 1 and various types of data, such as a code for a service relationship inquiry, etc., but also to temporarily store data that has been output or is to be output.
The processor 10 may be composed of an integrated circuit in some embodiments, for example, a single packaged integrated circuit, or may be composed of a plurality of integrated circuits packaged with the same or different functions, including one or more Central Processing Units (CPUs), microprocessors, digital Processing chips, graphics processors, and combinations of various control chips. The processor 10 is a Control Unit (Control Unit) of the electronic device, connects various components of the electronic device by using various interfaces and lines, and executes various functions and processes data of the electronic device 1 by running or executing programs or modules (e.g., performing service relation queries, etc.) stored in the memory 11 and calling data stored in the memory 11.
The bus may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. The bus is arranged to enable connection communication between the memory 11 and at least one processor 10 or the like.
Fig. 7 only shows an electronic device with components, and it will be understood by a person skilled in the art that the structure shown in fig. 7 does not constitute a limitation of the electronic device 1, and may comprise fewer or more components than shown, or a combination of certain components, 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 service relation query 12 stored by the memory 11 in the electronic device 1 is a combination of instructions that, when executed in the processor 10, may implement:
acquiring all services of each subsystem in a system to be maintained, and initializing each service to obtain a plurality of single service sets;
merging the services in the single service sets to obtain a plurality of multi-service sets;
identifying service relationships among all the services in each multi-service set to obtain a service relationship list;
inquiring service branch nodes in each multi-service set, identifying node relations among the service branch nodes, and generating a service branch node relation list;
and constructing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation among the services in the system to be maintained based on the service relation tree, and outputting an inquiry result.
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 non-volatile computer-readable storage medium. 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).
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, which is used for verifying the validity (anti-counterfeiting) of the information and generating 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 (10)
1. A service relationship query method, the method comprising:
acquiring all services of each subsystem in a system to be maintained, and initializing each service to obtain a plurality of single service sets;
merging the services in the single service sets to obtain a plurality of multi-service sets;
identifying service relationships among all the services in each multi-service set to obtain a service relationship list;
inquiring service branch nodes in each multi-service set, identifying node relations among the service branch nodes, and generating a service branch node relation list;
and constructing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation among the services in the system to be maintained based on the service relation tree, and outputting an inquiry result.
2. The method for querying service relationships according to claim 1, wherein the acquiring all services of each subsystem in the system to be maintained comprises:
inquiring the configuration file of each subsystem, and acquiring a program operation package corresponding to each subsystem according to the configuration file;
and searching the service in the program operation package by using a preset service query statement.
3. The method of claim 2, wherein initializing each of the services to obtain a single service set comprises:
marking each subsystem to obtain a unique identifier of each subsystem, and adding the unique identifier to corresponding services to obtain an initial service set;
extracting the initial service set from the corresponding subsystem to obtain a service list;
and carrying out array marking on the initial service in the service list based on a preset array sequence algorithm to form the plurality of single service sets.
4. The method of claim 1, wherein the identifying the service relationships among all the services in each of the multi-service sets, and obtaining the list of service relationships comprises:
sequentially selecting two services from the multi-service set randomly through traversal operation;
querying a depth hierarchy for the arbitrary two services;
and identifying the service relationship corresponding to the two services according to the depth hierarchy to obtain a service relationship list.
5. The service relationship query method of claim 4, wherein said identifying service relationships corresponding to two services according to the depth hierarchy comprises:
if the depth level of one service is greater than or less than that of the other service, the service relationship corresponding to the two services is an inclusion relationship;
if the depth level of one service is equal to the depth level of another service, the service relationship corresponding to the two services is parallel.
6. The service relationship query method of claim 1, wherein the constructing the service relationship tree of the system to be maintained according to the service relationship list and the service branch node relationship list comprises:
acquiring the service branch node relationship and the number of service branch nodes in the service branch node relationship list, constructing the service branch nodes of the system to be maintained according to the service branch node relationship and the number of service branch nodes, and generating an initial service relationship tree;
and acquiring the service relationships and the service quantity in a service relationship list corresponding to the service branch nodes, and constructing leaf nodes of the service branch nodes according to the service relationships and the service quantity to obtain the service relationship tree.
7. The service relationship query method according to any one of claims 1 to 6, wherein the querying a relationship between the services in the system to be maintained based on the service relationship tree and outputting a query result includes:
receiving any two services in the system to be maintained, searching leaf node positions of the any two services in the service relation tree, identifying the service relation of the any two services according to the leaf node positions, and outputting a query result.
8. A service relationship query apparatus, the apparatus comprising:
the system comprises an initialization module, a maintenance module and a maintenance module, wherein the initialization module is used for acquiring all services of each subsystem in a system to be maintained and initializing each service to obtain a plurality of single service sets;
a merging module, configured to merge the services in the multiple single service sets to obtain multiple multi-service sets;
the identification module is used for identifying the service relationship among all the services in each multi-service set to obtain a service relationship list;
the identification module is further configured to query the service branch nodes in each multi-service set, identify the node relationships among the service branch nodes, and generate a service branch node relationship list;
and the output module is used for constructing a service relation tree of the system to be maintained according to the service relation list and the service branch node relation list, inquiring the relation among the services in the system to be maintained based on the service relation tree, and outputting an inquiry result.
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 content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the service relationship query method of any one of claims 1 to 7.
10. A computer-readable storage medium, storing a computer program, wherein the computer program, when executed by a processor, implements the service relationship query method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011085024.3A CN112214662A (en) | 2020-10-12 | 2020-10-12 | Service relationship query method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011085024.3A CN112214662A (en) | 2020-10-12 | 2020-10-12 | Service relationship query method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112214662A true CN112214662A (en) | 2021-01-12 |
Family
ID=74053281
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011085024.3A Pending CN112214662A (en) | 2020-10-12 | 2020-10-12 | Service relationship query method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112214662A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110093486A1 (en) * | 2009-10-15 | 2011-04-21 | Institute For Information Industry | Data query method, data query system and computer readable and writable recording medium |
| CN102646111A (en) * | 2012-02-16 | 2012-08-22 | 中国测绘科学研究院 | Knowledge base-based fast construction method of common correlation information query tree |
| CN105550241A (en) * | 2015-12-07 | 2016-05-04 | 珠海多玩信息技术有限公司 | Multidimensional database query method and apparatus |
| CN106789984A (en) * | 2016-12-08 | 2017-05-31 | 浙江齐治科技股份有限公司 | A kind of access rights specification and visualization method and system |
| CN106844753A (en) * | 2017-02-16 | 2017-06-13 | 北京天元创新科技有限公司 | A kind of method and device for building network element tree component |
| CN109189787A (en) * | 2018-08-20 | 2019-01-11 | 河南工业大学 | A kind of the digital expression method and application method of Stored Grain Insects retrieval table |
| CN110232063A (en) * | 2019-04-19 | 2019-09-13 | 平安科技（深圳）有限公司 | Hierarchical data querying method, device, computer equipment and storage medium |
| CN110990403A (en) * | 2019-11-26 | 2020-04-10 | 深圳壹账通智能科技有限公司 | Business data storage method, system, computer equipment and storage medium |
| CN111339102A (en) * | 2020-03-12 | 2020-06-26 | 南京审计大学 | Financial record information accurate and trusted storage method based on block chain |
-
2020
- 2020-10-12 CN CN202011085024.3A patent/CN112214662A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110093486A1 (en) * | 2009-10-15 | 2011-04-21 | Institute For Information Industry | Data query method, data query system and computer readable and writable recording medium |
| CN102646111A (en) * | 2012-02-16 | 2012-08-22 | 中国测绘科学研究院 | Knowledge base-based fast construction method of common correlation information query tree |
| CN105550241A (en) * | 2015-12-07 | 2016-05-04 | 珠海多玩信息技术有限公司 | Multidimensional database query method and apparatus |
| CN106789984A (en) * | 2016-12-08 | 2017-05-31 | 浙江齐治科技股份有限公司 | A kind of access rights specification and visualization method and system |
| CN106844753A (en) * | 2017-02-16 | 2017-06-13 | 北京天元创新科技有限公司 | A kind of method and device for building network element tree component |
| CN109189787A (en) * | 2018-08-20 | 2019-01-11 | 河南工业大学 | A kind of the digital expression method and application method of Stored Grain Insects retrieval table |
| CN110232063A (en) * | 2019-04-19 | 2019-09-13 | 平安科技（深圳）有限公司 | Hierarchical data querying method, device, computer equipment and storage medium |
| CN110990403A (en) * | 2019-11-26 | 2020-04-10 | 深圳壹账通智能科技有限公司 | Business data storage method, system, computer equipment and storage medium |
| CN111339102A (en) * | 2020-03-12 | 2020-06-26 | 南京审计大学 | Financial record information accurate and trusted storage method based on block chain |
Non-Patent Citations (2)
| Title |
|---|
| DONGSHENG LI ET AL.: "Efficient Bulk Loading to Accelerate Spatial Keyword Queries", 2013 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, 31 December 2013 (2013-12-31) * |
| 刘安丰等: "基于生成树的Web服务组合模型", 计算机工程, vol. 34, no. 10, 31 May 2008 (2008-05-31) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112134739B (en) | Link state tracking method and device, electronic equipment and computer storage medium | |
| CN112418798A (en) | Information auditing method and device, electronic equipment and storage medium | |
| CN112506779A (en) | Software interface testing method and device, electronic equipment and storage medium | |
| CN112506559A (en) | Gray scale publishing method and device based on gateway, electronic equipment and storage medium | |
| CN112579098A (en) | Software release method and device, electronic equipment and readable storage medium | |
| CN113806434A (en) | Big data processing method, device, equipment and medium | |
| CN113377661A (en) | Interface testing method and device, electronic equipment and storage medium | |
| CN115081016A (en) | Log desensitization method and device, electronic equipment and storage medium | |
| CN115129753A (en) | Data blood relationship analysis method and device, electronic equipment and storage medium | |
| CN113434542B (en) | Data relationship identification method and device, electronic equipment and storage medium | |
| CN113239106B (en) | Excel file export method and device, electronic equipment and storage medium | |
| CN114491646A (en) | Data desensitization method and device, electronic equipment and storage medium | |
| CN114185776A (en) | Big data point burying method, device, equipment and medium for application program | |
| CN115220740A (en) | Database environment deployment method and device, electronic equipment and storage medium | |
| CN114185588A (en) | Incremental package generation method, device, equipment and storage medium | |
| CN112214662A (en) | Service relationship query method and device, electronic equipment and storage medium | |
| CN114547011A (en) | Data extraction method and device, electronic equipment and storage medium | |
| CN114510400A (en) | Task execution method and device, electronic equipment and storage medium | |
| CN112686759A (en) | Account checking monitoring method, device, equipment and medium | |
| CN112527443A (en) | Prompt box display method and device, electronic equipment and computer readable storage medium | |
| CN113064797B (en) | Front-end monitoring method and device, electronic equipment and storage medium | |
| CN114416575A (en) | Method, device and equipment for generating Mock data and storage medium | |
| CN115544488A (en) | Project cloud authority management method and device, electronic equipment and storage medium | |
| CN114968243A (en) | Communication unification method, device, equipment and storage medium for VUE parent-child assembly | |
| CN115033605A (en) | Data query method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |