Graph division method and device and computer readable storage medium
A technology for graph partitioning and computing nodes, applied in the field of graph computing, can solve problems such as inaccurate and inappropriate graph partitioning results, improve the efficiency of large graph partitioning and parallel processing, improve partition efficiency, and improve accuracy and effectiveness Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment approach
[0090] As an optional implementation, in order to read the graph data more efficiently, this application also provides an implementation for the step "calling multiple loading threads to read the graph data to be divided in parallel in units of vertices", which may include the following:
[0091] Pre-store the graph to be divided into the storage disk array in the form of an adjacency list; call multiple loading threads to read the data of the graph to be divided in parallel in units of vertices according to the preset data reading order;
[0092] Among them, the preset data reading order is breadth-first order or depth-first order or random order; the i-th loading thread reads the first Line to No. row graph data, i∈[1,k], |V| is the number of vertices of the graph to be divided, k is the total number of loading threads, In order to round down *, |*| is the cardinality of the calculation set, which is used to indicate the number of elements in it. The mathematical opera...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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