Distributed graph coloring algorithm based on Pregel

A graph coloring and distributed technology, applied in the field of graph coloring algorithms, can solve problems such as the inability to directly apply the Pregel message passing model, achieve the effect of reducing the number of colors and improving performance

Inactive Publication Date: 2018-05-04
TIANJIN UNIV
View PDF1 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

But these methods are all based on the traditional shared memory model, and cannot be directly applied to the Pregel message passing model

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
  • Distributed graph coloring algorithm based on Pregel
  • Distributed graph coloring algorithm based on Pregel
  • Distributed graph coloring algorithm based on Pregel

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0043] The present invention will be further described below in conjunction with the accompanying drawings. In order to make the description concise and intuitive, the algorithm description in this embodiment is embodied in algorithmic sentences.

[0044] See figure 1 , the basic algorithm based on Pregel's distributed graph coloring algorithm in the present invention is the MIS-Pregel algorithm as follows:

[0045] Algorithm 1. MIS-Pregel algorithm.

[0046] Input: RDF graph T;

[0047] Output: Colored interferogram G c

[0048]

[0049] see figure 2 , in the first scheme of the present invention, the algorithm of applying the Pregel model to find the largest independent set is as follows:

[0050] Algorithm 2, based on the Pregel model to find the largest independent set algorithm.

[0051] Input: Interferogram G'=(V',E') with weights;

[0052] Output: The largest independent set S of the input interferograms.

[0053]

[0054]

[0055] see image 3 , the ...

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 distributed graph coloring algorithm based on Pregel. The distributed graph coloring algorithm comprises the following steps that a random number as a weight value is respectively assigned to all points in a graph G; a color value of 1 is assigned to a vertex with a degree of 0, that is, the vertex has no edge to be connected with other vertices; the current color value is initialized to 1; the Pregel model is used for finding an independent set S, and three schemes are included; the current color value is assigned to any vertex v in the independent set; the colored vertices are removed from the graph G, and the color value is increased by 1; the step 4) to the step 6) are executed again until all points in the graph G are colored. The distributed graph coloring algorithm adopts the Pregel model suitable for large-scale graph calculation to improve efficiency of a parallel graph coloring algorithm. Based on an idea of finding the maximum independent set, graphcoloring processing is performed on large-scale graph data, and the purposes for reduction of graph coloring algorithm time and the number of colors required for coloring are achieved by means of introduction of optimization strategies.

Description

technical field [0001] The invention relates to the field of graph coloring algorithms for large-scale graph data, in particular to a distributed graph coloring algorithm based on Pregel. Background technique [0002] Recently, due to the increasing amount of graph data represented by RDF, graph data management has begun to receive more and more attention. How to efficiently load, store and query RDF graph data has become a hot research issue. At present, there have been many works on how to effectively manage RDF graph data, and many effective solutions have been proposed. Among them, DB2RDF is an effective method to store RDF graphs in relational databases. However, due to the continuous growth of RDF graph data scale, the performance of the data loading and storage solutions of the stand-alone version of DB2RDF is limited, so a distributed loading and storage solution is required. Storage schemes to improve the performance of existing schemes. At the same time, DB2RDF ...

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/30G06T11/00
CPCG06F16/9024G06F16/904G06T11/001
Inventor 王鑫甘瀛
Owner TIANJIN UNIV
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