Alternatives and similar repositories for fastfilter_cpp

Users that are interested in fastfilter_cpp are comparing it to the libraries listed below

• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆116Updated 10 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆50Updated 4 months ago
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆410Updated 2 months ago
• cwida / fsst
  Fast Static Symbol Table (FSST): efficient random-access string compression
  ☆476Updated last month
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆166Updated last year
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 3 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆158Updated 3 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆438Updated 10 months ago
• google / hashtable-benchmarks
  ☆111Updated last year
• wuwuz / Vacuum-Filter
  ☆53Updated 11 months ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆314Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆439Updated 4 months ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆267Updated 3 months ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆107Updated 2 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆87Updated 8 years ago
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆410Updated 9 months ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆316Updated 2 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆244Updated last week