Alternatives and similar repositories for pequod

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

• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 10 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
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• rumpkernel / rumpctrl
  Control and diagnostic applications for rump kernels
  ☆36Updated 8 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 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
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• salesforce / runway-compiler
  Parses and executes Runway models of distributed systems
  ☆50Updated 3 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 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
• pbailis / tinytocs-site
  Tiny Transactions on Computer Systems (TinyToCS) Site
  ☆32Updated 9 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆37Updated 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
• pron / amazon-snapshot-spec
  TLA+ and Alloy specs of database isolation
  ☆20Updated 9 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 7 years ago
• rescrv / pocdb
  Paxos-replicated key-value store in 3 hours or less.
  ☆25Updated 8 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆26Updated 7 years ago
• armon / c-minheap-indirect
  Implements a Min-Heap / Priority Queue in C using an indirection table for memory efficiency.
  ☆28Updated 11 years ago
• vrv / FAWN-KV
  A Distributed Key-Value Store for FAWN
  ☆77Updated 14 years ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆38Updated 3 years ago
• blynn / blt
  Crit-bit tree (trie) library
  ☆32Updated 11 years ago
• intel / lineuse
  I-cache line packing and branch misprediction measuring tool
  ☆18Updated 8 years ago
• GTkernel / nibble-lsm
  Concurrent Log-Structured Memory for Many-Core Key-Value Stores
  ☆35Updated 5 years ago
• mpoke / allconcur
  AllConcur: Algorithm for LeaderLess CONCURrent atomic broadcast
  ☆31Updated 8 years ago
• NanXiao / using-dtrace-stories
  ☆23Updated 3 months ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago