Alternatives and similar repositories for iterlib

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

• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• google / szl
  A compiler and runtime for the Sawzall language
  ☆70Updated 6 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆47Updated 6 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last month
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• phaistos-networks / ConsistentHashing
  Consistent Hashing data structures and algorithms for C++
  ☆39Updated 9 years ago
• daniel-j-h / DistributedSearch
  Distributed search engine in C++14, using nanomsg for communication, bond for serialization.
  ☆67Updated 10 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆54Updated 4 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆75Updated 8 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 9 years ago
• halayli / lthread_cpp
  Lthread C++11 binding
  ☆12Updated 11 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 10 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 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.
  ☆43Updated 9 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 7 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• patrickfrey / strus
  Library implementing the storage and the query evaluation for a text search engine. It uses on a key value store database interface to st…
  ☆47Updated 4 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 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
• yandex / mms
  Memory-mapped storage library
  ☆76Updated 9 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• ademakov / Evenk
  A C++ library for concurrent programming
  ☆71Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 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
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago