Alternatives and similar repositories for dictionary

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

• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆124Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆86Updated 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
• ot / succinct
  A collection of succinct data structures
  ☆205Updated last year
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 4 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆86Updated 4 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆46Updated 6 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 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
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆155Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• fast-pack / simdcomp
  A simple C library for compressing lists of integers using binary packing
  ☆505Updated last year
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• mozafari / vprofiler
  A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications
  ☆95Updated 7 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
• fclaude / libcds
  Compact Data Structures Library
  ☆127Updated 10 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆406Updated 5 months ago
• fast-pack / LittleIntPacker
  C library to pack and unpack short arrays of integers as fast as possible
  ☆90Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 years ago