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
☆188Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for wukong
- Grasper: A High Performance Distributed System for OLAP on Property Graphs.☆31Updated 3 years ago
- Out-of-core graph processing on a single machine.☆128Updated 6 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆58Updated 3 years ago
- A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs☆74Updated last year
- A computation-centric distributed graph processing system.☆312Updated 3 years ago
- LiveGraph: a transactional graph storage system with purely sequential adjacency list scans☆50Updated 3 years ago
- Benchmarking framework for index structures on persistent memory☆87Updated last year
- Fast In-memory Transaction Processing using RDMA and HTM☆56Updated 8 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆73Updated 2 years ago
- Fast RDMA-based Ordered Key-Value Store using Remote Learned Cache☆111Updated 3 years ago
- Source code for DPTree: Differential Indexing for Persistent Memory☆61Updated 3 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆50Updated 3 years ago
- ☆51Updated last year
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆152Updated 3 years ago
- RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s☆35Updated 2 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆86Updated last year
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Updated last month
- Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory☆101Updated last month
- Key Value Store based on LevelDB☆110Updated 3 years ago
- ☆98Updated 4 years ago
- ☆71Updated 4 months ago
- Benchmarking In-Memory Index Structures☆26Updated 5 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆80Updated 6 years ago
- ☆43Updated 3 years ago
- ☆58Updated last year
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 3 years ago
- An efficient large-scale graph mining framework.☆62Updated 3 years ago
- ☆15Updated 8 months ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆65Updated 2 years ago
- Key/Value Datastore for Persistent Memory☆27Updated 3 years ago