Sortledton: a Universal Graph Data Structure

Per Fuchs, Domagoj Margan, Jana Giceva · ACM SIGMOD Record · 2023

Despite the wide adoption of graph processing across many different application domains, there is no underlying data structure that can serve a variety of graph workloads (analytics, traversals, and pattern matching) on dynamic graphs with single edge updates updates.

Read the paper · More papers on PaperTik