Answering Graph Pattern Queries using Compact Materialized Views

Document Type

Conference Proceeding

Publication Date

1-1-2022

Abstract

We address the problem of evaluating graph pattern queries involving reachability (edge-to-path mapping) and direct (edge-to-edge mapping) relationships under homomorphisms on data graphs using materialized graph pattern views. We propose an original approach for view materialization which materializes views as summary graphs, an approach that records, in a compact way, all the homomorphisms of the view to the data graph. In this context, we characterize view usability in terms of query edge coverage and provide necessary and sufficient conditions for answering queries using views. We design algorithms for deciding whether a query can be answered using a set of views, for generating the summary graph of a query from the view materializations, and for producing a minimal view set capable of answering a query. Our experimental evaluation demonstrates that our approach outperforms, by several orders of magnitude, a state-of-the-art approach which does not use materialized views, and substantially improves upon its scalability.

Identifier

85129141579 (Scopus)

Publication Title

Ceur Workshop Proceedings

ISSN

16130073

First Page

51

Last Page

60

Volume

3130

Grant

61872276

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS