"Efficient In-Memory Evaluation of Reachability Graph Pattern Queries o" by Xiaoying Wu, Dimitri Theodoratos et al.
 

Efficient In-Memory Evaluation of Reachability Graph Pattern Queries on Data Graphs

Document Type

Conference Proceeding

Publication Date

1-1-2022

Abstract

Graphs are a widely used data model in modern data-intensive applications. Graph pattern matching is a fundamental operation for the exploration and analysis of large data graphs. In this paper, we present a novel approach for efficiently finding homomorphic matches of graph pattern queries, where pattern edges denote reachability relationships between nodes in the data graph. We first propose the concept of query reachability graph to compactly encode all the possible homomorphisms from a query pattern to the data graph. Then, we design a graph traversal-based filtering method to prune nodes from the data graph which violate reachability conditions induced by the pattern edges. We use the pruned data graph to generate a refined query reachability graph which serves as a compact search space for the pattern query answer. Finally, we design a multiway join algorithm to enumerate answer tuples from the query reachability graph without generating an excessive number of redundant intermediate results (a drawback of previous approaches). We experimentally verify the efficiency of our approach and demonstrate that it outperforms by far existing approaches and a recent graph DBMS on evaluating reachability graph pattern queries.

Identifier

85129868314 (Scopus)

ISBN

[9783031001222]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/978-3-031-00123-9_4

e-ISSN

16113349

ISSN

03029743

First Page

55

Last Page

71

Volume

13245 LNCS

Grant

61872276

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS