A Logical Model for joining Property Graphs

TL;DR

This paper enhances the logical model for property graph views, providing complexity proofs that support a new graph equi-join algorithm to improve query processing in graph databases.

Contribution

It upgrades the logical model for property graph views and offers complexity proofs for a new graph equi-join algorithm, advancing graph query optimization.

Findings

Enhanced logical model for property graph views

Complexity proofs for a graph equi-join algorithm

Strengthened theoretical foundation for graph query processing

Abstract

The present paper upgrades the logical model required to exploit materialized views over property graphs as intended in the seminal paper "A Join Operator for Property Graphs". Furthermore, we provide some computational complexity proofs strengthening the contribution of a forthcoming graph equi-join algorithm proposed in a recently accepted paper.