External memory access method of a graph computing system based on index positioning

An access method and indexing technology, applied in the direction of still image data indexing, still image data retrieval, etc., can solve the problems of random access times and high time overhead, etc., to reduce the number of random access times, facilitate reading, and reduce I/O data volume effect

Active Publication Date: 2019-03-26
HUAZHONG UNIV OF SCI & TECH
View PDF3 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Aiming at the defects of the prior art, the purpose of the present invention is to solve the technical prob...

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
  • External memory access method of a graph computing system based on index positioning
  • External memory access method of a graph computing system based on index positioning
  • External memory access method of a graph computing system based on index positioning

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] In order to make the purpose, technical method 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.

[0038] The present invention provides a method for accessing external memory of a graph computing system based on index positioning, the method comprising the following steps:

[0039] S0. Divide the complete graph data into multiple subgraphs that can be accommodated in the memory;

[0040] S1. Sorting the edges of each subgraph according to the source vertex number and the target vertex number;

[0041] S2. Write the sorted subgraphs into the external storage file, and respectively establish indexes for the source vertex number and the target vertex number;

[0042] S3. Select the optimal loadin...

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 an external memory access method of a graph computing system based on index positioning, which comprises the following steps: dividing complete graph data into a plurality of sub-graphs; sorting The edges of each subgraph according to the source vertex number and the target vertex number respectively. Writing The sorted sub-graphs into the external storage file and indexedfor the source vertex number and the target vertex number respectively. Choosing the best loading mode from the loading mode of index positioning and the loading mode of accessing complete data; Loading the subgraphs in the external memory into memory in an optimal load manner. The invention redesigns the external storage data structure, improves the data loading mode, enables the system to analyze the effective data in the external storage before loading, and remarkably reduces the I/O data quantity and the random access times. This paper analyzes the time cost of accessing complete data andindex positioning, dynamically determines the optimal data loading mode of the system, and reduces the time cost of data loading.

Description

technical field [0001] The invention belongs to the field of graph computing based on external memory, and more particularly relates to an external memory access method of a graph computing system based on index positioning. Background technique [0002] Graph computations are performed by iteratively executing update functions. A common approach used by external memory-based graph computing systems is to organize graph data into multiple subgraph data files on disk so that each subgraph file can fit into memory. Each subgraph contains vertex information for computing updates, and a complete iterative process will process all subgraph data. The key point is how to manage the calculation state of all subgraphs to ensure the correctness of the processing results, including loading graph data from external storage to internal memory, and writing intermediate results back to external storage, so that subsequent calculations can get updated results . Therefore, a large amount ...

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): G06F16/51
Inventor 王芳冯丹陈静蒋子威王子毅刘上杨蕾杨文鑫陈硕曹孟媛戴凯航施展
Owner HUAZHONG UNIV OF SCI & TECH
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