SJTU-IPADS / wukong
A graph-based distributed in-memory store that leverages efficient graph exploration to provide highly concurrent and low-latency queries over big linked data
☆189Updated 2 years ago
Alternatives and similar repositories for wukong:
Users that are interested in wukong are comparing it to the libraries listed below
- Grasper: A High Performance Distributed System for OLAP on Property Graphs.☆31Updated 3 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆58Updated 4 years ago
- Fast RDMA-based Ordered Key-Value Store using Remote Learned Cache☆116Updated 4 years ago
- A computation-centric distributed graph processing system.☆320Updated 3 years ago
- Out-of-core graph processing on a single machine.☆128Updated 6 years ago
- Source code for DPTree: Differential Indexing for Persistent Memory☆61Updated 3 years ago
- Fast In-memory Transaction Processing using RDMA and HTM☆57Updated 9 years ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs☆74Updated last year
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)☆200Updated 4 years ago
- ☆52Updated last year
- Benchmarking framework for index structures on persistent memory☆89Updated last year
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆157Updated 3 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆74Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 4 months ago
- A NUMA-aware Graph-structured Analytics Framework☆42Updated 6 years ago
- LiveGraph: a transactional graph storage system with purely sequential adjacency list scans☆52Updated 3 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 3 years ago
- ☆43Updated 3 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆113Updated last year
- ☆58Updated last year
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆50Updated 3 years ago
- Source code for our OSDI 2016 paper☆111Updated 6 years ago
- Key/Value Datastore for Persistent Memory☆27Updated 3 years ago
- LB+-Tree implementation☆47Updated 3 years ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆65Updated 2 years ago
- Fast In-memory Transaction Processing using Hybrid RDMA Primitives☆67Updated 6 years ago
- ☆120Updated 3 years ago
- Edge-centric Graph Processing System using Streaming Partitions☆81Updated 7 years ago