Tegra: Efficient Ad-Hoc Analytics on Time-Evolving Graphs. Several emerging evolving graph application workloads de- mand support for efficient ad-hoc analytics—the ability to perform ad-hoc queries on arbitrary time windows of the graph. Existing systems face limitations when used for such tasks. We present Tegra, a system that enables efficient ad- hoc window operations on evolving graphs. Tegra enables efficient access to the state of the graph at arbitrary windows, and significantly accelerates ad-hoc window queries by us- ing a compact in-memory representation for both graph and intermediate computation state. For this, it leverages per- sistent datastructures to build a versioned, distributed graph state store, and couples it with an incremental computation model which can leverage these compact states. For users, it exposes these compact states using Timelapse, a natural abstraction. We extensively evaluate Tegra against existing evolving graph analysis techniques, and show that it signifi- cantly outperforms other systems (by up to 30×) for ad-hoc window operation workloads.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Siddhartha Sahu, Semih Salihoglu: Graphsurge: Graph Analytics on View Collections Using Differential Computation (2020) arXiv