jonahharris / libcuckoofilter

Related projects ⓘ

Alternatives and complementary repositories for libcuckoofilter

• fanf2 / qp
  qp tries and crit-bit tries
  ☆119Updated 2 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆46Updated 7 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆115Updated 7 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆46Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆53Updated 3 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆89Updated last year
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆44Updated 5 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 5 months ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• vmg / libewok
  EWAH Compressed Bitmaps
  ☆25Updated 4 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 8 years ago
• TheHolyJoker / Comparing-Filters
  Benchmarking Bloom, Cuckoo, Morton, and PD based filter.
  ☆14Updated 2 years ago
• efficient / cuckooswitch
  A software-based Ethernet switch design built around a memory-efficient, high-performance, and highly-concurrent hash table for compact a…
  ☆34Updated 9 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆115Updated 9 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• gstrauss / mcdb
  mcdb - fast, reliable, simple code to create and read constant databases
  ☆109Updated last year
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• lemire / fasthashing
  A Variable-Length String Hashing Library in C++
  ☆43Updated 5 years ago
• technicolor-research / cuckoopp
  A high-performance hash-table for network packet-processing applications (compatible with DPDK)
  ☆36Updated 6 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆16Updated 6 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆252Updated 3 years ago
• DNS-OARC / omg-dns
  Helper library for parsing valid/invalid/broken/malformed DNS packets
  ☆16Updated 3 years ago
• lemire / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆117Updated 6 months ago
• fusiyuan2010 / cuttdb
  a hash-based key-value database for persistent storing massive small records
  ☆41Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• kroki / Cuckoo-hash
  C library implementing cuckoo hash
  ☆50Updated 11 years ago