Alternatives and similar repositories for HAT-trie

Users that are interested in HAT-trie are comparing it to the libraries listed below

• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆22Updated 4 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆66Updated 9 years ago
• naskitis / B-trie
  The B-trie and B-tree, written in C, as described in my PhD thesis.
  ☆28Updated 8 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 6 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• bitslab / ffwd
  This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
  ☆79Updated 7 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
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• waywardgeek / datadraw
  ☆42Updated 2 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆34Updated 2 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year