wuxb45 / lsm-trieView external linksLinks
LSM-trie
☆114Mar 22, 2021Updated 4 years ago
Alternatives and similar repositories for lsm-trie
Users that are interested in lsm-trie are comparing it to the libraries listed below
Sorting:
- 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 12 years ago
- The PebblesDB write-optimized key-value store (SOSP 17)☆522Apr 16, 2024Updated last year
- A key/value database based on SkimpyStash.☆13Jun 11, 2015Updated 10 years ago
- ☆44Aug 19, 2021Updated 4 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆178Mar 22, 2022Updated 3 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated last year
- ☆11Dec 22, 2022Updated 3 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 3 years ago
- ☆11Apr 19, 2018Updated 7 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
- A simple, reference implementation of a B^e-tree☆163Mar 25, 2019Updated 6 years ago
- qp tries and crit-bit tries☆124Jul 12, 2022Updated 3 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Mar 17, 2025Updated 10 months ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11May 2, 2017Updated 8 years ago
- Low memory multithreaded hash table☆24Mar 23, 2015Updated 10 years ago
- Interpolation search☆12Oct 15, 2021Updated 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 12 years ago
- Fast decoder for VByte-compressed integers☆127Nov 15, 2025Updated 3 months ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆94Apr 12, 2023Updated 2 years ago
- ☆28Jul 9, 2018Updated 7 years ago
- Cache-Sensitive Skip List.☆22Mar 9, 2018Updated 7 years ago
- Time-series database for Internet of Things Analytics with a rich graph data model☆19Oct 25, 2017Updated 8 years ago
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆56Oct 1, 2020Updated 5 years ago
- A system for maintaining replicated state machines☆116Apr 26, 2017Updated 8 years ago
- Beta release of Masstree.☆457Oct 15, 2023Updated 2 years ago
- Adaptive Radix Trees implemented in C☆819Mar 21, 2022Updated 3 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…☆49Mar 29, 2019Updated 6 years ago
- ARTful radix tree☆13Feb 10, 2017Updated 9 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Jul 24, 2025Updated 6 months ago
- Read- and latency-optimized log structured merge tree☆175Apr 2, 2012Updated 13 years ago
- Experiments with array layouts for comparison-based searching☆86Jan 5, 2024Updated 2 years ago
- Webscale™ Document Store for Go using PostgreSQL JSONB☆15Mar 1, 2015Updated 10 years ago
- XL-mHG: A Semiparametric Test for Enrichment in Ranked Lists.☆13Jan 19, 2023Updated 3 years ago
- Key Value Store based on LevelDB☆117Oct 17, 2021Updated 4 years ago
- ☆150Mar 11, 2023Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆274Jul 16, 2025Updated 7 months ago
- lock free modified prefix B+tree append-only database☆116May 19, 2015Updated 10 years ago
- A C++ library for integer array compression☆30Mar 18, 2022Updated 3 years ago
- A pipeline to assess the quantification of transcripts.☆19Jun 6, 2022Updated 3 years ago