Alternatives and similar repositories for Replicant

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

• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 11 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆25Updated 11 years ago
• rescrv / pocdb
  Paxos-replicated key-value store in 3 hours or less.
  ☆25Updated 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
• juruen / cavalieri
  A C++ event stream processing tool to monitor and alert
  ☆70Updated 10 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆54Updated 4 years ago
• ot / semi_index
  Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"
  ☆58Updated 12 years ago
• reverbrain / eblob
  Eblob is an append-only low-level IO library, which saves data in blob files. Created as low-level backend for elliptics
  ☆105Updated 6 years ago
• dubey / weaver
  A scalable, fast, consistent graph store
  ☆213Updated 9 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 9 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
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 8 years ago
• fpaxos / fpaxos-lib
  Prototype of FPaxos, built upon LibPaxos3
  ☆48Updated 5 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
• AlexKashuba / SQLite_JIT
  ☆28Updated 7 years ago
• YADL / yadl
  Yet Another Dedupe Library
  ☆16Updated 10 years ago
• rasky / gcs
  Golomb Coded Sets
  ☆94Updated 8 years ago
• phaistos-networks / ConsistentHashing
  Consistent Hashing data structures and algorithms for C++
  ☆39Updated 9 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 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
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 6 years ago
• UWSysLab / specpaxos
  Speculative Paxos replication protocol
  ☆133Updated 9 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 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
• tspurway / hustle
  A column oriented, embarrassingly distributed relational event database.
  ☆238Updated 7 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• ucbrise / LatticeFlow
  ☆28Updated 8 years ago