Alternatives and similar repositories for zipg

Users that are interested in zipg are comparing it to the libraries listed below

• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆90Updated 6 years ago
• yaobaiwei / GTran
  A high-performance distributed graph database based on RDMA.
  ☆18Updated 3 years ago
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆60Updated 5 years ago
• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆37Updated 2 years ago
• rstream-system / RStream
  ☆24Updated 2 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago
• thu-pacman / RisGraph
  RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s
  ☆37Updated 3 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆61Updated 9 months ago
• hyrise / nvm_malloc
  ☆25Updated 9 years ago
• queryproc / optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins
  Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19
  ☆33Updated 9 months ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• xiangyuzhi / GraphStorageExp
  ☆12Updated last year
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆84Updated 3 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 8 years ago
• wheatman / BP-Tree
  ☆16Updated last year
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• thu-pacman / LiveGraph
  LiveGraph: a transactional graph storage system with purely sequential adjacency list scans
  ☆59Updated 4 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• thu-pacman / TriCache
  A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs
  ☆76Updated 2 months ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• tuhhosg / exmap
  ☆50Updated last year
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆122Updated 10 months ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• ldbc / data-sets-surf-repository
  ☆16Updated this week
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago