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

A Triangle Calculation Method in Large-Scale Graph Based on Pre-filtering

A calculation method and pre-filtering technology, applied in the field of graph algorithms, can solve the problems of hindering the application of the triangle calculation method, high calculation overhead, and huge number, and achieve the effect of reducing intermediate results, reducing output, and improving calculation efficiency.

Active Publication Date: 2020-03-10
WUHAN UNIV
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The number of such wedge structures is usually very large (usually several times or even dozens of times the number of triangles), resulting in a large number of intermediate results generated in the shuffle stage, thus hindering the application of existing triangle calculation methods on large-scale graphs, and cause high computational overhead

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 Triangle Calculation Method in Large-Scale Graph Based on Pre-filtering
  • A Triangle Calculation Method in Large-Scale Graph Based on Pre-filtering
  • A Triangle Calculation Method in Large-Scale Graph Based on Pre-filtering

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The present invention is mainly based on the Bloom filter, combined with the characteristics that the Bloom filter is effective in space and capable of judging the existence of elements in the set, and proposes a large-scale graph triangle calculation method based on the Bloom filter for pre-filtering. This method fully considers the problem of too large intermediate results in the triangle generation process, and greatly reduces the intermediate output results through pre-filtering, thereby improving calculation efficiency. Through the present invention, our calculation of triangles in large-scale graphs will become feasible and more efficient.

[0025] The method provided by the invention can use computer software technology to realize the process. see figure 1 , the embodiment takes the MapReduce platform as an example to carry out a specific elaboration to the flow process of the present invention, as follows:

[0026] Step 1: First, we use the MapReduce platform ...

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 method of triangle computation in large-scale graphs based on prefiltration, aiming to effectively filter invalid wedge structures produced in generation process of triangles. The method of triangle computation in large scale graphs based on prefiltration is to solve problem that the existing triangle computation method can not be applied in large scale graphs because of the too large intermediate results. Prefiltration by the Bloom filter can effectively reduce the amount of intermediate data and improve the computational efficiency. The method of triangle computation in large-scale graphs based on prefiltration optimizes the traditional Boom filter so that the Boom filter can effectively adapt to the distributed environment and can be quickly calculated so as to accelerate the process of triangle calculation.

Description

technical field [0001] The invention belongs to the field of graph algorithms, in particular to a calculation method for triangles in large-scale graphs. Background technique [0002] In the process of abstracting data, the graph structure is a very effective data structure. It has important applications in many fields, for example, it can be used to represent the Internet, social networks, road networks and so on. As the scale of the graph becomes larger and larger, a large number of structure mining problems on the graph need to be solved urgently, which has attracted the attention of many researchers. One of the important basic problems is triangle calculation, which is to find the triplet △(u, v, w) composed of three vertices in the graph, so that any two point pairs (u, v), (v, w) and There is an edge between (w, u). The triangle calculation problem is a basic operation in graph algorithms and plays an important role in many calculation problems on graphs. For examp...

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 Patents(China)
IPC IPC(8): G06F9/50G06F16/901
CPCG06F9/5083G16Z99/00
Inventor 祝园园张颢
Owner WUHAN UNIV
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com