Alternatives and similar repositories for orly

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

• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• lantiga / tinydnnc
  ☆11Updated 8 years ago
• lexborisov / yauid
  A decentralized unique ID generator (int64)
  ☆21Updated 9 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• perone / nanopipe
  Nanopipe: connecting the modern babel
  ☆28Updated 8 years ago
• lemire / fasthashing
  A Variable-Length String Hashing Library in C++
  ☆44Updated 6 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆17Updated 11 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 8 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆74Updated 8 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 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
• maciekgajewski / coroutines
  Go-style coroutines and channels for C++
  ☆34Updated 11 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• fusiyuan2010 / cuttdb
  a hash-based key-value database for persistent storing massive small records
  ☆40Updated 11 years ago
• sachin-sinha / BangDB
  BangDB - nosql database
  ☆55Updated 3 months ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 8 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆50Updated 8 years ago
• troydhanson / kvspool
  A library to support streaming data applications
  ☆24Updated 4 years ago
• fiberize / fiberize
  High performance parallel systems with nonblocking IO
  ☆50Updated 6 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• tomerdmnt / levelfs
  leveldb FUSE filesystem
  ☆16Updated 11 years ago
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆77Updated 4 years ago
• google / varstruct
  ☆18Updated 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.
  ☆42Updated 8 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago