Alternatives and similar repositories for triemap

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

• chriso / columnix
  Columnar storage and query engine
  ☆9Updated 7 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• malbrain / ARTful
  ARTful radix tree
  ☆13Updated 8 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆49Updated 3 years ago
• PeterScott / netstring-c
  Netstring parsing in C
  ☆35Updated 4 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• xant / libiomux
  iomux - High performance aynchronous I/O multiplexing and timers
  ☆15Updated 9 years ago
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆24Updated 10 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
• 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
• willemt / linked-list-queue
  A simple queue using a linked list written in C under the BSD license.
  ☆18Updated 8 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆50Updated 8 years ago
• jamwt / rolla
  Rolla - Tiny, fast, crash-safe embedded k/v storage engine
  ☆53Updated 2 years ago
• antirez / siphash
  A modification of SipHash reference implementation to make it more practical for Redis usage
  ☆20Updated 8 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 6 years ago
• Shardcached / libshardcache
  C implementation of a caching and cache-filling library inspired to groupcache
  ☆43Updated 9 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
• willemt / splay-tree
  A splaytree ADT written in C with a BSD license
  ☆18Updated 5 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• aklomp / sse-strings
  SSE string functions for x86-64 Linux
  ☆19Updated 3 years ago
• efficient / ARF
  ☆11Updated 7 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago