Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A sequence chart data processing method based on a kd tree and a multi-valued decision diagram (MDD)

A multi-value decision-making and data processing technology, which is applied in the direction of electrical digital data processing, special data processing applications, still image data retrieval, etc., can solve the problem of insufficient compact structure, and achieve the effect of compact structure and simple query operation

Inactive Publication Date: 2017-09-15
GUILIN UNIV OF ELECTRONIC TECH
View PDF3 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] What the present invention is to solve is the existing k d The tree and its optimization method are not compact enough when storing large-scale sequence graph data, providing a k-based d Timing graph data processing methods for trees and multi-valued decision graphs to achieve more compact and efficient representation and manipulation of large-scale timing graph data

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
  • A sequence chart data processing method based on a kd tree and a multi-valued decision diagram (MDD)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

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

[0037] 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 MDD terminal node, which may be Boolean (true and false, or 0 and 1), limited The set of integers or the set of finite real numbers.

[0038] 2) The nodes of MDD include terminal nodes and non-terminal nodes.

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

[0040] f xi=c =f(x 1 ,x 2 ,...,x i-1 ,c,...

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 provides a sequence chart data processing method based on a kd tree and a multi-valued decision diagram (MDD). An adjacent matrix is divided by using the rules of a kd tree and a multi-valued decision diagram is used for storing graph data, so that a large quantity of identical sub-matrixes, namely isomorphic sub-trees in the kd tree, which are generated when the adjacent matrix is divided by using the kd tree, can be combined naturally; the finally-genreated kd-MDD structure is more compact than a kd tree storage structure. The sub-matrixes in the kd-MDD, 0 value or 1 value will be combined as long as the sub-matrixes are isomorphic, so that the number of kd-MDD nodes will reduce when a dense graph is represented and the structure can be more compact; after the kd-MDD stores graph data, relevant basic operation of graphs can be converted to logic operation of a logic decision diagram, so that high-efficiency operation of dynamic graph data is possible and query operation based on the kd-MDD is more concise than that based on the kd tree.

Description

technical field [0001] The invention relates to the technical field of sequence diagram data processing, in particular to a k-based d Time-series graph data processing methods for trees and multivalued decision graphs. Background technique [0002] With the development of computer technology and the popularization of Internet applications, the data available in various fields is showing an explosive growth trend. In the process of big data analysis, graph, as a data structure that can effectively describe big data, has been fully applied in social network analysis, recommendation network analysis, Internet analysis and other fields. Efficient and compact representation and compression of graph data containing hundreds of millions of nodes and edges is the basis for large-scale graph data analysis and processing. [0003] A sequential graph is a graph in which the connectivity between vertices changes over time (ie, edges can appear and disappear). Sequence diagrams are ve...

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): G06F17/30
CPCG06F16/2237G06F16/51
Inventor 董荣胜申会强古天龙
Owner GUILIN UNIV OF ELECTRONIC TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products