Alternatives and similar repositories for mergeshuffle

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

• qpfiffer / Simple-Sparsehash
  A simple re-implementation of Google's sparsehash as a learning excercise.
  ☆40Updated last year
• google / classp
  Classp -- a classier way to parse
  ☆169Updated 8 years ago
• invesdwin / invesdwin-context-persistence
  invesdwin-context modules that provide persistence features
  ☆44Updated 2 weeks ago
• chanian / hyperlogsandwich
  ☆172Updated 10 years ago
• scalien / scaliendb
  ScalienDB is a scalable, replicated datastore.
  ☆87Updated 12 years ago
• frankmcsherry / COST
  Single-threaded graph computation in Rust
  ☆252Updated 6 years ago
• ral99 / knuckleball
  Data structure server.
  ☆181Updated 9 years ago
• cruppstahl / libfor
  A very fast scalar implementation for Frame Of Reference integer compression.
  ☆109Updated 9 years ago
• bshafiee / BFS
  Behrooz File System (BFS)
  ☆54Updated 9 years ago
• flashxio / FlashX
  FlashX is a collection of big data analytics tools that perform data analytics in the form of graphs and matrices.
  ☆234Updated 5 years ago
• csvoss / retroactive
  Fun with time travel: Implementing retroactive data structures in Python
  ☆225Updated 4 years ago
• UWSysLab / specpaxos
  Speculative Paxos replication protocol
  ☆131Updated 8 years ago
• sustrik / ribosome
  Simple code generator
  ☆248Updated last year
• yedhukrishnan / turing-machine
  My implementations of deterministic and non-deterministic turing machines
  ☆71Updated 2 years ago
• rasky / gcs
  Golomb Coded Sets
  ☆94Updated 8 years ago
• jandrewrogers / MetroHash
  MetroHash v1: Exceptionally fast and statistically robust hash functions
  ☆369Updated 3 years ago
• lukego / snabb
  Snabb: simple and fast packet networking
  ☆81Updated 5 years ago
• rcoh / treelayout
  Demonstrating the importance of laying out data in memory.
  ☆47Updated 7 years ago
• cliqz-oss / keyvi
  Keyvi - a key value index that powers Cliqz search engine. It is an in-memory FST-based data structure highly optimized for size and look…
  ☆178Updated 6 years ago
• panyam / KafkaLite
  ☆60Updated 3 years ago
• refi64 / rejit
  A work-in-progress JIT-powered regex engine
  ☆112Updated 7 years ago
• abau / cppsat
  Propositional Encodings in C++11
  ☆18Updated 7 years ago
• kinghajj / kirk
  A highly-flexible thread pool for Rust
  ☆180Updated 9 years ago
• nickodell / pact
  Give pact several PIDs. When one PID dies, pact will kill all provided PIDs.
  ☆190Updated 9 years ago
• kgaughan / memoize.py
  Bill McCloskey's memoize.py, grabbed with archive.org from http://www.eecs.berkeley.edu/~billm/memoize.html
  ☆117Updated 2 years ago
• armon / hlld
  C network daemon for HyperLogLogs
  ☆450Updated 4 years ago
• StanfordPL / stoke-release
  ☆329Updated 9 years ago
• m00dy / BloomFilter
  BloomFilter in python
  ☆101Updated 8 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 3 years ago
• r0nk / ward
  state machine visual debugger
  ☆121Updated 10 years ago