Alternatives and similar repositories for HAT-trie:

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

• naskitis / B-trie
  The B-trie and B-tree, written in C, as described in my PhD thesis.
  ☆27Updated 8 years ago
• tum-db / cachecoherence
  ☆10Updated 3 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 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.
  ☆41Updated 8 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.
  ☆157Updated 3 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆16Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆40Updated 2 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 5 years ago
• blynn / blt
  Crit-bit tree (trie) library
  ☆32Updated 10 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated 10 months ago
• PumpkinDB / rust-spdk
  Rust bindings for SPDK
  ☆19Updated 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 7 years ago
• JerrySievert / judyarray
  Automatically exported from code.google.com/p/judyarray
  ☆17Updated 9 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 9 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• GTkernel / nibble-lsm
  Concurrent Log-Structured Memory for Many-Core Key-Value Stores
  ☆35Updated 4 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆19Updated 7 years ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆37Updated 3 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆33Updated last year
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆65Updated 9 years ago
• ceph / libcrush
  ☆16Updated 4 years ago