save-buffer / bloomfilter_benchmarksLinks
☆15Updated last year
Alternatives and similar repositories for bloomfilter_benchmarks
Users that are interested in bloomfilter_benchmarks are comparing it to the libraries listed below
Sorting:
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- ☆30Updated 6 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆138Updated last month
- A fast approximate membership query data structure☆12Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- Fast Static Symbol Table (FSST): efficient random-access string compression☆491Updated 2 months ago
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- Plush: A Write-Optimized Persistent Log-Structured Hash-Table☆18Updated 3 years ago
- ☆53Updated last year
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Header-only binary fuse and xor filter library☆422Updated 2 weeks ago
- ☆125Updated 3 years ago
- A Single-Pass Learned Index☆137Updated 2 years ago
- Implementation of Origami: A High-Performance Mergesort Framework☆27Updated last year
- ☆150Updated 2 years ago
- ALP: Adaptive Lossless Floating-Point Compression☆161Updated 3 months ago
- ☆39Updated 5 years ago
- Intel® Query Processing Library (Intel® QPL)☆107Updated last month
- ☆81Updated 4 months ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- Fast integer compression in C using the StreamVByte codec☆413Updated 11 months ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆84Updated 3 years ago
- Key/Value Datastore for Persistent Memory☆404Updated 2 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆446Updated last year
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆127Updated last year
- ☆606Updated 3 weeks ago
- An open-source BzTree implementation☆92Updated 4 years ago