coyorkdow / wisckeyView external linksLinks
WiscKey is a highly SSD optimized key-value storage based on LevelDB.
☆32Dec 25, 2021Updated 4 years ago
Alternatives and similar repositories for wisckey
Users that are interested in wisckey are comparing it to the libraries listed below
Sorting:
- ☆27May 27, 2022Updated 3 years ago
- ☆19Mar 13, 2016Updated 9 years ago
- Key Value Store based on LevelDB☆117Oct 17, 2021Updated 4 years ago
- wisckey implementation using RocksDB☆12Jan 14, 2023Updated 3 years ago
- ☆10Dec 20, 2013Updated 12 years ago
- [Deprecated] Magic of modern c++. Run time type info, reflection, and other fantasic features.☆11Jun 27, 2023Updated 2 years ago
- ☆15Oct 22, 2021Updated 4 years ago
- ☆60Apr 13, 2023Updated 2 years ago
- ☆15Apr 8, 2025Updated 10 months ago
- A simple cassandra like kv store using gossip protocol☆16Sep 19, 2020Updated 5 years ago
- A high-performance, pure C library for reading and writing Apache Parquet files☆51Feb 7, 2026Updated last week
- LeanStore is a B-tree based key-value storage library with high throughput and full ACID transactions.☆48Updated this week
- sqlite的阅读笔记☆24Jan 1, 2023Updated 3 years ago
- YCSB-C for HWDB!☆18May 30, 2020Updated 5 years ago
- Fast key-value DB in Go.☆17Feb 22, 2022Updated 3 years ago
- ☆16Jul 24, 2023Updated 2 years ago
- ☆12Jun 26, 2022Updated 3 years ago
- ZNS Append-only based LSM key-value store☆21Sep 22, 2023Updated 2 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆213Aug 2, 2023Updated 2 years ago
- An implementation of learned index structures for bloom filters.☆23Sep 4, 2018Updated 7 years ago
- 2019 Database System Project at Sun Yat-sen University , a simple implementation of SIGMOD, 2016 “FPTree: A Hybrid SCM-DRAM Persistent an…☆24Jul 14, 2019Updated 6 years ago
- ☆25Oct 21, 2021Updated 4 years ago
- Embedded InnoDB based on v5.1☆35Oct 1, 2025Updated 4 months ago
- Build your own VectorDB with C++☆36Dec 10, 2024Updated last year
- Source code for CCLBTree-EuroSys'24☆44Dec 27, 2023Updated 2 years ago
- Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index☆87Sep 25, 2024Updated last year
- A music composer and player with MATLAB☆11Mar 14, 2020Updated 5 years ago
- ☆36Jan 7, 2023Updated 3 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Jan 8, 2018Updated 8 years ago
- Raft consensus alogorithm implemented in Rust. Rust 实现 Raft 共识算法☆34Feb 23, 2023Updated 2 years ago
- Your SQL database for learning purpose☆78Sep 13, 2025Updated 5 months ago
- Storage algorithms.☆38Feb 10, 2021Updated 5 years ago
- MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM☆76Aug 7, 2020Updated 5 years ago
- Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…☆48Jun 21, 2025Updated 7 months ago
- CrankDB is an ultra fast, extreme lightweight Key Value based Document Store.☆32Jul 30, 2021Updated 4 years ago
- Bloom filter implementation☆43Dec 6, 2025Updated 2 months ago
- ☆30May 5, 2014Updated 11 years ago
- Rust remote log viewer experiment☆14Feb 23, 2022Updated 3 years ago
- graph neural network for neutrino physics event reconstruction☆13Updated this week