Distributed temporal graph reachability query processing method based on Blogel

A processing method and reachability technology, which is applied in the field of blogel-based distributed temporal graph reachability query processing, can solve problems such as low query efficiency, large index scale, and low construction efficiency

Inactive Publication Date: 2019-10-25
ZHEJIANG UNIV +1
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The scale of the transformation graph obtained by this method is tens or even hundreds of times that of the temporal graph, which leads to a large scale index built based on ordinary graphs, low construction efficiency, and low query efficiency

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
  • Distributed temporal graph reachability query processing method based on Blogel
  • Distributed temporal graph reachability query processing method based on Blogel
  • Distributed temporal graph reachability query processing method based on Blogel

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] Now in conjunction with accompanying drawing and concrete implementation technical scheme of the present invention is described further:

[0050] Such as figure 1 Shown, the specific implementation process and working principle of the present invention are as follows:

[0051] Step (1): Assign a unique importance value ρ(v) to each vertex v in the temporal graph. Specific steps are as follows:

[0052] A temporal graph is represented by G=(V, E), where V is a set of vertices and E is a set of temporal edges. In the temporal graph, there are multiple temporal edges between two vertices u and v. Let S(u, v) represent the set of all temporal edges between u and v, and |S(u, v)| represent the number of temporal edges between u and v. It should be noted that, for specific application scenarios, the temporal graph can be a traffic road network dispatch graph, a communication network graph, a social network graph, and so on.

[0053] In-degree D of vertex v in (v) can be...

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 distributed temporal graph reachability query processing method based on a Block. According to the method, three tense graph accessibility queries are provided, 1. querying common tense graph accessibility; 2, querying at the shortest time interval; and 3, querying the earliest arrival time. According to the method, based on a Blogel distributed computing framework, tenseinformation and a graph topological structure of a tense graph are effectively organized by utilizing a tense vertex label index TVL; the batch and parallel technologies are utilized to improve the construction efficiency of the TVL index; and an index judgment method and a pruning technology are utilized to reduce the graph search space and improve the query efficiency. The method comprises thefollowing steps of calculating a reachable standard vertex label set Lout and a reachable standard vertex label set Lin for each vertex in a TVL index construction stage; then, in the query stage, thepruning technology is used for effectively reducing the query search space, and the query result is quickly returned according to the index judgment method. According to the method, the accessibilityquery processing efficiency is greatly improved, and the optimal performance is provided.

Description

technical field [0001] The invention relates to graph reachability query processing technology in the computer database field, in particular to a distributed temporal graph reachability query processing method based on Blogel. Background technique [0002] Graph data is used to model relationships between entities. Scholars at home and abroad have done a lot of work on the reachability query method on ordinary graphs. Ordinary graph models ignore temporal information during queries to simplify computation. However, real-world graphs often come with temporal information, and the relationship between vertices occurs at a certain moment and continues for a period of time. This type of graph is called a temporal graph. For example, in a telephone communication network, users make multiple calls in different time periods. In social networks, friends choose to meet at different times. In a traffic dispatch network, a train (or plane) travels from an origin to a destination wit...

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): G06F16/901G06F16/903
CPCG06F16/9024G06F16/903
Inventor 高云君张天明陈刚浦世亮
Owner ZHEJIANG UNIV
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