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

Method for searching strongly connected component in large-scale graph data on the basis of disk

A technology for connecting components and graph data. It is used in electrical digital data processing, resource allocation, multi-programming devices, etc. It can solve the problem of not being able to find strong connected components, avoid wasting disk reading and writing, reduce disk reading and writing, and improve performance effect

Active Publication Date: 2016-08-31
HUAZHONG UNIV OF SCI & TECH
View PDF5 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] Aiming at the defects or improvement of the existing technology, the present invention provides a method for finding strongly connected components in large-scale disk-based graph data, with the purpose of designing a disk-based search method that supports efficient graph structure changes and task-level processing The method of strongly connected components aims to solve the shortcomings of existing methods that cannot efficiently find strongly connected components in large-scale graphs

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
  • Method for searching strongly connected component in large-scale graph data on the basis of disk
  • Method for searching strongly connected component in large-scale graph data on the basis of disk
  • Method for searching strongly connected component in large-scale graph data on the basis of disk

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below may be combined with each other as long as they do not constitute a conflict with each other.

[0035] figure 1 Shown is a frame diagram of a method for finding strongly connected components in large-scale disk-based graph data according to the present invention, including: an algorithm module, a graph structure modification module, and a task processing module. The algorithm module provides an interface for users to implement algorithms and filter functions for finding strongly connected...

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 for searching a strongly connected component in large-scale graph data on the basis of a disk, and belongs to the technical field of the graphic calculation and processing of a big-data field. The method adopts the main measure that a task level package is used to organize a whole calculation flow, and each task uses different algorithms to process one part of data so as to maximize the advantages and the integral calculation speed of each algorithm. The invention puts forward a method for processing graph structure change on the basis of the disk, provides independent data for each task, and improves disk access efficiency. The problem that the strongly connected component in the graph data can not be searched at high aging under a situation that a graph data scale exceeds the volume of available memory can be solved.

Description

technical field [0001] The invention belongs to the technical field of graph computing for big data processing, and more specifically relates to a method for finding strongly connected components in large-scale graph data based on disks. Background technique [0002] Finding strongly connected components in real-world graphs has many applications, including graph structure analysis, graph data mining, network security, and prevention of virus transmission. With the advent of the era of big data and the vigorous development of information technology, the scale of real-world graphs such as social networks, biological information networks, and Internet topology is rapidly increasing. The huge amount of data poses a huge challenge to the field of graph computing. Efficiently finding strongly connected components in large-scale real-world graphs has become an urgent problem to be solved. [0003] Existing large-scale graph processing methods mainly include using a distributed pl...

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
IPC IPC(8): G06F9/50
CPCG06F9/5038
Inventor 金海邵志远吕辉明
Owner HUAZHONG UNIV OF SCI & 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

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