Alternatives and similar repositories for iterlib

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

• google / szl
  A compiler and runtime for the Sawzall language
  ☆70Updated 6 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated 2 weeks ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆47Updated 6 years ago
• phaistos-networks / ConsistentHashing
  Consistent Hashing data structures and algorithms for C++
  ☆39Updated 9 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 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
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 8 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 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
• apache / lucy
  Mirror of Apache Lucy
  ☆101Updated 7 years ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 5 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 9 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆54Updated 4 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 6 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 7 years ago
• pmwkaa / engine.so
  Tracking, Benchmarking and Sharing Information about an open source embedded data storage engines, internals, architectures, data storage…
  ☆181Updated 7 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 10 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 9 years ago
• daniel-j-h / DistributedSearch
  Distributed search engine in C++14, using nanomsg for communication, bond for serialization.
  ☆67Updated 10 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 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
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆143Updated 6 years ago
• yahoo / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆997Updated last year
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆239Updated 6 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆120Updated 8 years ago