FastFilter / fastfilter_cpp
Fast Approximate Membership Filters (C++)
☆263Updated 10 months ago
Related projects ⓘ
Alternatives and complementary repositories for fastfilter_cpp
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆246Updated 2 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆107Updated 8 months ago
- An adaptive radix tree for efficient indexing in main memory.☆151Updated 8 months ago
- Header-only binary fuse and xor filter library☆349Updated 4 months ago
- The world's first wait-free Software Transactional Memory☆169Updated 4 years ago
- Fast Static Symbol Table (FSST): efficient random-access string compression☆391Updated 3 months ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆400Updated 3 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆130Updated 2 years ago
- HOT - Height Optimized Trie☆140Updated 6 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆126Updated last year
- Comprehensive benchmarks of C++ maps☆300Updated last year
- ☆104Updated 9 months ago
- a high performance cache simulator and library☆96Updated 3 months ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆173Updated 8 years ago
- A fast SIMD parser for CSV files☆146Updated 2 years ago
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆95Updated 2 months ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated last year
- Bloom-filter based minimal perfect hash function library☆252Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆426Updated last year
- Benchmark of common hash functions☆35Updated 5 years ago
- High-performance dictionary coding☆103Updated 7 years ago
- ☆43Updated 3 years ago
- A fast alternative to the modulo reduction☆299Updated 3 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆176Updated 6 years ago
- High-performance multicore-scalable data structures and benchmarks☆138Updated 5 years ago
- ☆130Updated 2 years ago
- a quotient filter written in C☆84Updated 7 years ago
- The Berkeley Container Library☆120Updated last year