Alternatives and similar repositories for index-cpp

Users that are interested in index-cpp are comparing it to the libraries listed below

• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 10 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆53Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆53Updated 7 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆214Updated 2 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆73Updated 10 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated last year
• mpictor / judy-template
  An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …
  ☆42Updated 10 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆59Updated 6 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 4 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 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
• phaistos-networks / ConsistentHashing
  Consistent Hashing data structures and algorithms for C++
  ☆39Updated 8 years ago
• mintomic / samples
  [deprecated] Data structures and sample applications using Mintomic
  ☆93Updated 9 years ago
• yandex / mms
  Memory-mapped storage library
  ☆76Updated 9 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆113Updated last month
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆36Updated 5 years ago