Web service combination method based on k2-MDD

A combination method and web service technology, applied in the field of large-scale graph data storage and Web services, can solve the problems of low tree compactness, not involving dynamic graph representation and operation, etc., achieve compact structure, reduce the number of vertices, and query operations concise effect

Active Publication Date: 2017-10-13
GUILIN UNIV OF ELECTRONIC TECH
View PDF5 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] 2)k 2 The tree is only valid for sparse graphs. When the graph becomes dense, since there are fewer 0 vertices that can be compressed in the adjacency matrix, k 2 Tree compactness will also be lower
[0007] 3)k 2 The tree does not involve the representation and operation of dynamic graphs (graphs that need to add or delete vertices, edges, subgraphs, etc.)
[0008] current k 2 The tree graph data compact representation method still lacks the necessary consideration of the structural characteristics of the above graph, and there is still a lot of room for improvement in compactness

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Web service combination method based on k2-MDD

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0044] The present invention is described in further detail below in conjunction with embodiment.

[0045] Multi-valued decision graph MDD (Multi-valuedDecisionDiagram) is a directed acyclic graph with multiple terminal vertices, which describes a discrete multi-valued function with n variables, f:D 1 ×D 2 ×…×D i ×…×D n →S, where:

[0046] 1)D i ={1,2,...,n i} for the multivalued variable x i The finite value range of different variables may be different; S is the finite value range of the multi-valued function f, that is, the value set of the terminal vertices of MDD, which may be Boolean (true and false, or 0 and 1), finite The set of integers or the set of finite real numbers.

[0047] 2) The vertices of MDD include terminal vertices and non-terminal vertices.

[0048] 3) Use x for non-terminal vertices i means, including n i A pointer to other vertices, these pointers correspond to the function f, and the formal description is as follows:

[0049]

[0050] mu...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a Web service combination method based on a k2-MDD. Vertexes of a dependence graph of a Web service combination problem is coded according to rules of a k2 tree, sides are coded according to codes of the vertexes, a multi-valued decision diagram (MDD) structure is constructed according to codes of the sides, the k2-MDD structure is obtained, and logical operations of a symbol decision diagram of the obtained k2-MDD structure are used as basic diagram operations. The relational dependence graph of the Web service combination program is stored and represented effectively and compactly via the k2-MDD structure, the storage space of the vertexes is reduced greatly, and the searching space is reduced.

Description

technical field [0001] The present invention relates to the technical field of large-scale graph data storage and Web services, in particular to a k-based 2 - MDD's approach to Web service composition. Background technique [0002] Web service composition is an effective way to accomplish a complex task by combining multiple simple-function Web services. But in the face of the current large-scale Web services, how to quickly combine Web services that meet the functional needs of users is a challenging problem. In recent years, the problem of Web service composition has gradually become a hot spot in the field of Web service research. The method based on the graph model is one of the main methods to solve the problem of service composition, because the graph model needs a lot of space to represent a large number of possible service combinations, so using a compressed graph to represent the service composition dependency graph is proposed. Multi-valued Decision Diagram (MDD...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/24H04L29/08
CPCH04L41/142H04L41/5041H04L67/02
Inventor 董荣胜武先强古天龙
Owner GUILIN UNIV OF ELECTRONIC TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap