Alternatives and similar repositories for libcuckoofilter

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

• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆50Updated 8 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆120Updated 2 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆53Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• rmind / liblpm
  Longest Prefix Match (LPM) library
  ☆46Updated 2 years ago
• stevegt / librabinpoly
  Rabin fingerprinting and deduplication library in C
  ☆28Updated 9 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆86Updated 4 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• jvirkki / libbloom
  A simple and small bloom filter implementation in plain C.
  ☆299Updated 2 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆123Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• DNS-OARC / omg-dns
  Helper library for parsing valid/invalid/broken/malformed DNS packets
  ☆16Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• goldsborough / tssx
  Transparently replace domain sockets with a fast shared memory channel
  ☆69Updated 8 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• barrust / bloom
  Bloom filter implementation
  ☆40Updated 2 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆46Updated 6 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆160Updated 3 years ago
• backtrace-labs / bcd
  Simple out-of-process invoker
  ☆18Updated this week
• ChrisDodd / shm_malloc
  Malloc replacement with support for shared and persistent memory allocation
  ☆33Updated 11 years ago
• divfor / atomic_hash
  A lock-free hash table that eanble multiple threads can concurrently read/write/delete up to 10M ops/s in mordern computer platform
  ☆52Updated last year
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆45Updated last month
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• technicolor-research / cuckoopp
  A high-performance hash-table for network packet-processing applications (compatible with DPDK)
  ☆38Updated 6 years ago