# Extracting and Analyzing Hidden Graphs from Relational Databases

## TL;DR

This paper introduces a declarative system for extracting and analyzing large graphs from relational databases, using a novel condensed in-memory representation and deduplication algorithms to enable efficient, large-scale graph analytics.

## Contribution

It presents a new declarative language and a condensed in-memory graph representation with deduplication techniques, allowing scalable graph analysis directly from relational data.

## Key findings

- The system enables analysis of graphs larger than memory capacity.
- The condensed representation significantly reduces memory usage.
- Deduplication algorithms improve accuracy and efficiency.

## Abstract

Analyzing interconnection structures among underlying entities or objects in a dataset through the use of graph analytics has been shown to provide tremendous value in many application domains. However, graphs are not the primary representation choice for storing most data today, and in order to have access to these analyses, users are forced to extract data from their data stores, construct the requisite graphs, and then load them into some graph engine in order to execute their graph analysis task. Moreover, these graphs can be significantly larger than the initial input stored in the database, making it infeasible to construct or analyze such graphs in memory. In this paper we address both of these challenges by building a system that enables users to declaratively specify graph extraction tasks over a relational database schema and then execute graph algorithms on the extracted graphs. We propose a declarative domain-specific language for this purpose, and pair it up with a novel condensed, in-memory representation that significantly reduces the memory footprint of these graphs, permitting analysis of larger-than-memory graphs. We present a general algorithm for creating this condensed representation for a large class of graph extraction queries against arbitrary schemas. We observe that the condensed representation suffers from a duplication issue, that results in inaccuracies for most graph algorithms. We then present a suite of in-memory representations that handle this duplication in different ways and allow trading off the memory required and the computational cost for executing different graph algorithms. We introduce novel deduplication algorithms for removing this duplication in the graph, which are of independent interest for graph compression, and provide a comprehensive experimental evaluation over several real-world and synthetic datasets illustrating these trade-offs.