oschonrock / binfuseLinks
c++ library for binary fuse filters, including a sharded filter
☆93Updated 8 months ago
Alternatives and similar repositories for binfuse
Users that are interested in binfuse are comparing it to the libraries listed below
Sorting:
- Integer Map Data Structure☆131Updated 2 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆158Updated last month
- The PolymurHash universal hash function.☆357Updated 2 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆32Updated last year
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- A very fast and robust 64-bit PRNG with a minimum 2^64 period.☆148Updated 3 months ago
- B-tree generator for C☆143Updated 4 months ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆74Updated 2 years ago
- Poireau: a sampling allocation debugger☆98Updated 3 years ago
- A fast SIMD parser for CSV files☆156Updated 3 years ago
- ☆293Updated last year
- C++20 idiomatic APIs for the Apache Arrow Columnar Format☆116Updated this week
- A fast binary search that tries to be branchless☆102Updated last year
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Header-only binary fuse and xor filter library☆411Updated last month
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Fast Approximate Membership Filters (C++)☆284Updated last month
- ☆39Updated 4 years ago
- a 64-bit histogram / quantile sketch☆59Updated 8 months ago
- ☆109Updated last year
- Seastar boilerplate project with cmake☆34Updated last year
- Different algorithms for converting binary to decimal floating-point numbers☆124Updated 2 years ago
- Fast In-Memory Data Compression Algorithm (inline C/C++) 480+MB/s compress, 2800+MB/s decompress, ratio% better than LZ4, Snappy, and Zst…☆456Updated last month
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- The fastest ACID-transactional persisted Key-Value store designed as modified LSM-Tree for NVMe block-devices with GPU-acceleration and S…☆74Updated 2 years ago
- Selection and partial sorting algorithms☆137Updated 6 months ago
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆117Updated 2 years ago
- Terminal flame graph☆110Updated 5 years ago
- A benchmark to measure lock overhead and compare mutex performance under varying levels of contention.☆39Updated last year
- Harmonia is an algorithm that allows for the implementation of operations on B+ trees using parallelization. As a part of my GPU project,…☆30Updated 4 years ago