Alternatives and similar repositories for LatticeFlow

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

• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• cw75 / tiered-storage
  An Elastic, Tiered-Storage Service
  ☆30Updated 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.
  ☆42Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• cruzdb / zlog
  A high-performance distributed shared-log for Ceph
  ☆115Updated 6 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 8 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆17Updated 6 years ago
• UWSysLab / specpaxos
  Speculative Paxos replication protocol
  ☆132Updated 8 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 7 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 8 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆46Updated 6 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆11Updated 9 years ago
• rescrv / Consus
  Consus is a geo-replicated transactional key-value store.
  ☆225Updated 7 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 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
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 5 years ago
• fpaxos / fpaxos-lib
  Prototype of FPaxos, built upon LibPaxos3
  ☆48Updated 5 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• pgaref / ACaZoo
  A distributed key-value store based on replicated LSM-Trees
  ☆10Updated 8 years ago
• morganstanley / SilverKing
  Scalable, high-throughput storage and coordination
  ☆44Updated 3 years ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 5 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
• google / berrydb
  ☆66Updated 4 years ago