Alternatives and similar repositories for msgskip

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

• etolabo / kumofs
  kumofs is a scalable and highly available distributed key-value store.
  ☆302Updated 14 years ago
• kumagi / lockfree
  lockfree concurrent containers.
  ☆18Updated 9 years ago
• frsyuki / mpio
  Multipurpose parallel I/O framework for C++ with fully multithreaded event loop implementation
  ☆98Updated 10 years ago
• kazuho / golombset
  An implementation of Golomb compressed set in C
  ☆22Updated 9 years ago
• sunsuk7tp / MyCassandra
  This project is MyCassandra. MyCassandra is a modular cloud storage where the storage engine is exchangeable from Cassandra's storage eng…
  ☆22Updated 6 years ago
• yamasa / lockfree
  Experimental implementations of lock-free algorithms, using hazard pointers and tagged pointers.
  ☆31Updated 14 years ago
• kuenishi / erezrdfh
  MessagePack MessageQueue without AMQP
  ☆15Updated 12 years ago
• drevell / megalon
  A toy school project intended to be an approximate clone of Google's Megastore database for geographically-distributed scalable fault-to…
  ☆35Updated 14 years ago
• gree / flare
  distributed, and persistent key-value storage
  ☆170Updated 3 months ago
• lvv / lvvlib
  C++ utility library
  ☆24Updated 11 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 5 years ago
• hyc / mleak
  malloc leak tracer
  ☆71Updated 3 years ago
• jimbelton / sxe
  libsxe, mak and related components
  ☆50Updated 2 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• retrieva / pficommon
  General purpose C++ library for PFI
  ☆160Updated 4 years ago
• siganakis / tny
  Tiny data structures that pack a punch!
  ☆101Updated 13 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• moriyoshi / ik
  ☆123Updated 10 years ago
• toffaletti / libten
  C++11 library for network services on modern x86_64 Linux
  ☆87Updated 10 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
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• cdaylward / libappc
  A C++ library for working with App Containers
  ☆53Updated 9 years ago
• umbrant / extsort
  External sorting of integers in C
  ☆20Updated 14 years ago
• bioothod / unetstack
  Userspace TCP/IP stack
  ☆69Updated 11 years ago
• collie / accord
  A high-performance coordination service for write-intensive workloads.
  ☆87Updated 6 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 8 years ago
• scylladb / scylla-graphite-monitoring
  ☆20Updated 9 years ago