EAGr: Supporting Continuous Ego-centric Aggregate Queries over Large Dynamic Graphs

TL;DR

EAGr is a system designed to efficiently support continuous ego-centric aggregate queries on large, dynamic graphs by using a pre-compiled overlay graph structure that enables sharing and pre-computation, achieving high throughput and low latency.

Contribution

The paper introduces EAGr, a novel in-memory framework with an overlay graph structure for scalable, low-latency continuous aggregate queries on large dynamic graphs, including algorithms for construction and adaptation.

Findings

Supports graphs with up to 320 million nodes and edges

Achieves over 500,000 updates/queries per second on a single machine

Provides scalable, low-latency processing for dynamic, large-scale graphs

Abstract

In this work, we present EAGr, a system for supporting large numbers of continuous neighborhood-based ("ego-centric") aggregate queries over large, highly dynamic, and rapidly evolving graphs. Examples of such queries include computation of personalized, tailored trends in social networks, anomaly/event detection in financial transaction networks, local search and alerts in spatio-temporal networks, to name a few. Key challenges in supporting such continuous queries include high update rates typically seen in these situations, large numbers of queries that need to be executed simultaneously, and stringent low latency requirements. We propose a flexible, general, and extensible in-memory framework for executing different types of ego-centric aggregate queries over large dynamic graphs with low latencies. Our framework is built around the notion of an aggregation overlay graph, a pre-compiled data structure that encodes the computations to be performed when an update/query is received. The overlay graph enables sharing of partial aggregates across multiple ego-centric queries (corresponding to the nodes in the graph), and also allows partial pre-computation of the aggregates to minimize the query latencies. We present several highly scalable techniques for constructing an overlay graph given an aggregation function, and also design incremental algorithms for handling structural changes to the underlying graph. We also present an optimal, polynomial-time algorithm for making the pre-computation decisions given an overlay graph, and evaluate an approach to incrementally adapt those decisions as the workload changes. Although our approach is naturally parallelizable, we focus on a single-machine deployment and show that our techniques can easily handle graphs of size up to 320 million nodes and edges, and achieve update/query throughputs of over 500K/s using a single, powerful machine.