Alternatives and similar repositories for blt

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

• fanf2 / qp
  qp tries and crit-bit tries
  ☆123Updated 3 years ago
• cota / chanfd
  Tiny C library for inter-thread/process communication via channels. Linux-only.
  ☆12Updated 9 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆26Updated 7 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆79Updated 3 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆53Updated 7 years ago
• NuxiNL / argdata
  A binary serialisation format inspired by YAML, MessagePack and nvlists.
  ☆33Updated 5 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 6 years ago
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆113Updated 6 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆25Updated 11 years ago
• troydhanson / kvspool
  A library to support streaming data applications
  ☆24Updated 4 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 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
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• fredrikwidlund / libdynamic
  High performance utility library for C
  ☆97Updated 6 months ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 10 years ago
• wbhart / bsdnt
  BSD Licensed Bignum Library
  ☆232Updated last year
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 10 years ago
• felix-lang / judy
  A C library for creating and accessing dynamic arrays with near O(log-base-256) scalability into the peta-element range
  ☆33Updated 15 years ago
• andrewchambers / qc
  quick c
  ☆35Updated 3 years ago
• dhobsd / sbst
  Benchmark various data structures / algorithms for string searching.
  ☆15Updated 10 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 7 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(…
  ☆50Updated last year
• sustrik / dsock
  An obsolete project
  ☆83Updated 7 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆54Updated 5 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆164Updated 10 years ago
• ned14 / uthash
  A GIT clone of uthash.sourceforge.net, a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any stru…
  ☆37Updated 12 years ago
• dankamongmen / libtorque
  A threaded, continuations-based I/O event library for manycore NUMA machines
  ☆76Updated 4 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 10 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago