Alternatives and similar repositories for packed-memory-array

Users that are interested in packed-memory-array are comparing it to the libraries listed below

• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆59Updated 4 years ago
• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆89Updated 6 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆28Updated 2 years ago
• wheatman / Packed-Memory-Array
  ☆25Updated 10 months ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆120Updated 7 months ago
• realstolz / polymer
  A NUMA-aware Graph-structured Analytics Framework
  ☆44Updated 7 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago
• xiangyuzhi / GraphStorageExp
  ☆12Updated last year
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 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 6 months ago
• goatdb / llama
  LLAMA Graph Analytics Engine
  ☆41Updated 8 years ago
• jmalicevic / EverythingGraph
  A platform to evaluate techniques used in multicore graph processing.
  ☆37Updated 7 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆213Updated 2 months ago
• LLNL / havoqgt
  ☆28Updated 5 months ago
• amplab / zipg
  A Memory-efficient Graph Store for Interactive Queries
  ☆13Updated 4 years ago
• rstream-system / RStream
  ☆25Updated 2 years ago
• bindscha / chaos
  Chaos: Scale-out Graph Processing from Secondary Storage
  ☆50Updated 9 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆180Updated 7 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 7 years ago
• Xtra-Computing / ForkGraph
  ☆17Updated 3 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• cwida / gfe_driver
  C++ driver to evaluate updates in dynamic structural graphs
  ☆18Updated 3 years ago