Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction

11/12/2021
by   Inju Na, et al.
0

Regular path queries (RPQs) find pairs of vertices of paths satisfying given regular expressions on an edge-labeled, directed multigraph. When evaluating an RPQ, the evaluation of a Kleene closure (i.e., Kleene plus or Kleene star) is very expensive. Furthermore, when multiple RPQs include a Kleene closure as a common sub-query, repeated evaluations of the common sub-query cause serious performance degradation. In this paper, we present a novel concept of RPQ-based graph reduction, which significantly simplifies the original graph through edge-level and vertex-level reductions. Interestingly, RPQ-based graph reduction can replace the evaluation of the Kleene closure on the large original graph to that of the transitive closure to the small reduced graph. We then propose a reduced transitive closure (RTC) as a lightweight structure for efficiently sharing the result of a Kleene closure. We also present an RPQ evaluation algorithm, RTCSharing, which treats each clause in the disjunctive normal form of the given RPQ as a batch unit. If the batch units include a Kleene closure as a common sub-query, we share the lightweight RTC instead of the heavyweight result of the Kleene closure. RPQ-based graph reduction further enables us to formally represent the result of an RPQ including a Kleene closure as a relational algebra expression including the RTC. Through the formal expression, we optimize the evaluation of the batch unit by eliminating useless and redundant operations of the previous method. Experiments show that RTCSharing improves the performance significantly by up to 8.86 times compared with existing methods in terms of query response time.

READ FULL TEXT
research
03/01/2019

A Trichotomy for Regular Trail Queries

Regular path queries (RPQs) are an essential component of graph query la...
research
07/04/2017

Context-Free Path Querying by Matrix Multiplication

Graph data models are widely used in many areas, for example, bioinforma...
research
04/07/2020

An Algorithm for Context-Free Path Queries over Graph Databases

RDF (Resource Description Framework) is a standard language to represent...
research
04/26/2019

Regular Expression Matching on billion-nodes Graphs

In many applications, it is necessary to retrieve pairs of vertices with...
research
02/11/2023

An Evaluation Algorithm for Datalog with Equality

We describe an evaluation algorithm for relational Horn logic (RHL). RHL...
research
03/26/2021

One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries

The Kronecker product-based algorithm for context-free path querying (CF...
research
04/27/2018

Certified Graph View Maintenance with Regular Datalog

We employ the Coq proof assistant to develop a mechanically-certified fr...

Please sign up or login with your details

Forgot password? Click here to reset