Quick retrieval method based on graph data structure

A technology of graph data and basic data, applied in the field of big data retrieval, can solve the problems of difficult query and retrieval of big data, slow real-time update and retrieval, and cumbersome operation, so as to simplify data management work, save costs, and achieve efficient system services. Effect

Pending Publication Date: 2018-05-25
CHINA CHANGFENG SCI TECH IND GROUPCORP
View PDF4 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] In the information age, persisting data into a relational database is a very traditional way of persisting data. However, with the advent of the era of big data, this data storage method brings great challenges to the query and retrieval of big data. Difficulties, mainly reflected in cumbersome operation, slow speed, slow real-time update retrieval, etc.

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
  • Quick retrieval method based on graph data structure
  • Quick retrieval method based on graph data structure
  • Quick retrieval method based on graph data structure

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0014] According to attached figure 1 The data source acquisition system shown, figure 2 The memory graph datastore shown and image 3 Real-time retrieval and query of graph data shown to build a distributed parallel query computing framework, setting configuration files for caching mechanism settings and graph structure storage methods, and setting distributed heartbeat mechanism settings for communication and fault-tolerant processing mechanisms can be realized based on Construction of a fast retrieval system for graph data structures.

[0015] Specifically include the following steps:

[0016] (1) Data source collection:

[0017] like figure 1 As shown, data source acquisition includes basic data entry and real-time data update.

[0018] Basic data entry: The basic structure of the graph is formed in the memory through artificial import, and the cache is set to ensure that the basic graph data structure is resident in the memory and realize real-time reading and retri...

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 quick retrieval method based on a graph data structure. The method comprises the following steps that: (1) data source collection: through manual importing, forming the basicstructure of a graph in memory, monitoring a plurality of data collection systems in real time through distributed message middleware, and when a data collection system receives a data source updatechange request, feeding back the information to a distributed system for real-time update; (2) retrieval request query: monitoring a graph data query request generated by the query system in real timeby the distributed message middleware, and when the request is received, distributing the request to a plurality of distributed nodes to be executed in parallel, and quickly returning to the query system; (3) graph data retrieval: according to the request of the message middleware, carrying out parallel computing retrieval by each distributed node; and (4) retrieval result sending: carrying out integration on the result of the distributed nodes on the basis of memory parallel query retrieval, and sending query results to message requesters through multiple threads.

Description

technical field [0001] The invention relates to the technical field of big data retrieval, in particular to a fast retrieval method based on a graph data structure. Background technique [0002] In the information age, persisting data into a relational database is a very traditional way of persisting data. However, with the advent of the era of big data, this data storage method brings great challenges to the query and retrieval of big data. The difficulties are mainly reflected in cumbersome operation, slow speed, slow real-time update retrieval, etc. In order to solve this problem, the applicant provides a technical solution, which realizes the storage and association of multi-source data through the connected graph structure, and realizes the distributed storage and parallel retrieval query of graph data with the help of distributed parallel computing technology, and Updating the data source only needs to re-change the structure and connection attributes of the graph dat...

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/30G06F9/54
CPCG06F9/546G06F16/25G06F16/284G06F2209/547
Inventor 张伯轩
Owner CHINA CHANGFENG SCI TECH IND GROUPCORP
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