Browse by author
Lookup NU author(s): Dr Giacomo BergamiORCiD
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Despite the growing popularity of techniques related to graph summarization, a general operator for joining graphs on both the vertices and the edges is still missing. Current languages such as Cypher and SPARQL express binary joins through the non-scalable and inefficient composition of multiple traversal and graph creation operations. In this paper, we propose an efficient equi-join algorithm that is able to perform vertex and path joins over a secondary memory indexed graph, also the resulting graph is serialised in secondary memory. The results show that the implementation of the proposed model outperforms solutions based on graphs, such as Neo4J and Virtuoso, and the relational model, such as PostgreSQL. Moreover, we propose two ways how edges can be combined, namely the conjunctive and disjunctive semantics, Preliminary experiments on the graph conjunctive join are also carried out with incremental updates, thus suggesting that our solution outperforms materialized views over PostgreSQL.
Author(s): Bergami G
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: IDEAS 2021: 25th International Database Engineering & Applications Symposium
Year of Conference: 2021
Online publication date: 14/07/2021
Acceptance date: 18/06/2004
Library holdings: Search Newcastle University Library for this item
Series Title: International Conference Proceeding Series (ICPS)