Feed-forward Bloom filters
☆53Jun 7, 2011Updated 14 years ago
Alternatives and similar repositories for ffbf
Users that are interested in ffbf are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆214Jan 18, 2016Updated 10 years ago
- A jabber logger and web interface☆12Apr 17, 2026Updated last week
- Shared memory allocator☆21Jun 27, 2016Updated 9 years ago
- Ocaml cross-compiler for Android☆45Oct 10, 2014Updated 11 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.
- SafeInit protects software from uninitialized read vulnerabilities - code released for NDSS 2017☆26May 5, 2021Updated 4 years ago
- large-memory key-value pair store for Python☆50May 26, 2013Updated 12 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆178Mar 22, 2022Updated 4 years ago
- Question Dependent Recurrent Entity Network☆13Sep 21, 2017Updated 8 years ago
- Lthread C++11 binding☆12Nov 8, 2014Updated 11 years ago
- ☆27Mar 23, 2017Updated 9 years ago
- An attempt to split the Raft library out of LogCabin☆37Oct 13, 2017Updated 8 years ago
- 🔬 R package: Analysis of Large Affymetrix Microarray Data Sets☆12Dec 14, 2025Updated 4 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated last year
- 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.
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- ☆12Apr 11, 2017Updated 9 years ago
- ☆628Aug 15, 2021Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆35Jun 8, 2016Updated 9 years ago
- iomux - High performance aynchronous I/O multiplexing and timers☆16Oct 25, 2025Updated 6 months ago
- Display and update sorted information about FoundationDB processes☆16Jul 5, 2018Updated 7 years ago
- An OCaml implementation of the FUSE protocol versions 7.8 and 7.23☆30Jan 25, 2018Updated 8 years ago
- NetBSD cdb (constant database) library☆14May 24, 2019Updated 6 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Nov 10, 2015Updated 10 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- An R package for estimating library complexity☆13Sep 4, 2022Updated 3 years ago
- A very fast scalar implementation for Frame Of Reference integer compression.☆109Nov 5, 2015Updated 10 years ago
- Golang Actor Model☆20Apr 23, 2012Updated 14 years ago
- RLU resizable hash-table☆17Aug 24, 2015Updated 10 years ago
- a quotient filter written in C☆89Aug 26, 2017Updated 8 years ago
- Polygot C implementation of compact approximate quantile estimation large data sets☆18Aug 24, 2025Updated 8 months ago
- Software to trim the ITS region of FASTQ sequences for amplicon sequencing analysis☆17Mar 26, 2025Updated last year
- ☆20Nov 17, 2015Updated 10 years ago
- Constraint solver based on abstract interpretation☆10Dec 20, 2024Updated last year
- 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.
- A high-performance, memory-efficient concurrent hash table☆36Oct 5, 2013Updated 12 years ago
- A library for creating and patching binary diffs. Based on bsdiff.☆11Nov 23, 2014Updated 11 years ago
- ☆1,010Nov 12, 2021Updated 4 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆55Apr 19, 2024Updated 2 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Sep 22, 2014Updated 11 years ago
- MemC3☆157Apr 28, 2017Updated 9 years ago
- lock free modified prefix B+tree append-only database☆116May 19, 2015Updated 10 years ago