LSM-trie
☆114Mar 22, 2021Updated 5 years ago
Alternatives and similar repositories for lsm-trie
Users that are interested in lsm-trie are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆45Aug 19, 2021Updated 4 years ago
- The PebblesDB write-optimized key-value store (SOSP 17)☆522Apr 16, 2024Updated 2 years ago
- A key/value database based on SkimpyStash.☆13Jun 11, 2015Updated 10 years ago
- ☆11Dec 22, 2022Updated 3 years ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12May 9, 2013Updated 13 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆95Apr 12, 2023Updated 3 years ago
- ☆13Feb 6, 2026Updated 3 months ago
- Code for "Building an Efficient Key-Value Store in a Flexible Address Space" (EuroSys '22)☆24Mar 17, 2025Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated 2 years ago
- Cache-Sensitive Skip List.☆22Mar 9, 2018Updated 8 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆178Mar 22, 2022Updated 4 years ago
- Key Value Store based on LevelDB☆117Oct 17, 2021Updated 4 years ago
- ☆27May 27, 2022Updated 4 years ago
- SUPBUB is a tool that, in linear time, finds out superbubbles(special graph-structures) in a directed graph.☆12Sep 19, 2019Updated 6 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Low memory multithreaded hash table☆24Mar 23, 2015Updated 11 years ago
- A simple, reference implementation of a B^e-tree☆165Mar 25, 2019Updated 7 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 4 years ago
- fork of file_parda from bitbucket☆11Jun 27, 2015Updated 10 years ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11May 2, 2017Updated 9 years ago
- Time-series database for Internet of Things Analytics with a rich graph data model☆19Oct 25, 2017Updated 8 years ago
- Beta release of Masstree.☆458Oct 15, 2023Updated 2 years ago
- NoveLSM☆40Dec 6, 2018Updated 7 years ago
- ☆11Apr 19, 2018Updated 8 years ago
- Open source password manager - Proton Pass • AdSecurely store, share, and autofill your credentials with Proton Pass, the end-to-end encrypted password manager trusted by millions.
- The BTL C/C++ Common bloom filters for bioinformatics projects, as well as any APIs created for other programming languages.☆18Feb 26, 2022Updated 4 years ago
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆169Apr 7, 2021Updated 5 years ago
- BFT-Store is a Byzantine fault-tolerant storage engine☆14Sep 9, 2022Updated 3 years ago
- NVM key-value store API lIbrary repository.☆91Mar 14, 2014Updated 12 years ago
- L2SM (Log-assisted LSM tree) is built based on LevelDB, which is a prototype propesed to adopt a SST log structure to isolate selected ke…☆11Jan 17, 2022Updated 4 years ago
- qp tries and crit-bit tries☆124Jul 12, 2022Updated 3 years ago
- Adaptive Radix Trees implemented in C☆831Mar 21, 2022Updated 4 years ago
- Finding all the circuits of a directed graph with self-arcs and multiple-arcs by K.A. Hawick and H.A. James☆19Apr 11, 2013Updated 13 years ago
- Facebook Graph Benchmark☆21Dec 20, 2015Updated 10 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Log-Structured Merge-Tree (LSM-Tree)☆90Mar 17, 2017Updated 9 years ago
- ☆16Sep 27, 2018Updated 7 years ago
- A version of RocksDB that uses persistent memory☆93Nov 4, 2024Updated last year
- Simple and fast MinHash implementation in C with Python wrapper☆13Jul 24, 2025Updated 10 months ago
- Interpolation search☆12Oct 15, 2021Updated 4 years ago
- Perseus is a set of scripts (docker+javascript) to investigate a distributed database's responsiveness when one of its three nodes is iso…☆48Mar 29, 2019Updated 7 years ago
- Fast decoder for VByte-compressed integers☆128Nov 15, 2025Updated 6 months ago