BYO
from BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers (VLDB ‘24).

CPMA
from CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers (PPoPP ‘24).

BP-tree
from BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-Trees (VLDB ‘23).

Terrace
from Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs (SIGMOD ‘21).

Parallel Packed Compressed Sparse Row
from A Parallel Packed Memory Array to Store Dynamic Graphs (ALENEX ‘21).

Packed Compressed Sparse Row
from Packed Compressed Sparse Row: A Dynamic Graph Representation (HPEC ‘18).