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
• lemire / fasthashing
  A Variable-Length String Hashing Library in C++
  ☆44Updated 5 years ago
• lexborisov / yauid
  A decentralized unique ID generator (int64)
  ☆21Updated 8 years ago
• perone / nanopipe
  Nanopipe: connecting the modern babel
  ☆28Updated 8 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• lantiga / tinydnnc
  ☆11Updated 8 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 8 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• jamwt / rolla
  Rolla - Tiny, fast, crash-safe embedded k/v storage engine
  ☆53Updated 2 years ago
• lvv / lvvlib
  C++ utility library
  ☆24Updated 11 years ago
• ronmrdechai / Pie
  Provide an idiomatic C++ interface to CPython's C API.
  ☆27Updated 7 years ago
• talrasha007 / lmdb-queue
  An embed, kafka like queue.
  ☆35Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• fusiyuan2010 / cuttdb
  a hash-based key-value database for persistent storing massive small records
  ☆40Updated 10 years ago
• maciekgajewski / coroutines
  Go-style coroutines and channels for C++
  ☆33Updated 11 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• cruppstahl / sparsemap
  A sparse and compressed bitmap library.
  ☆13Updated 10 years ago
• t3rm1n4l / lightkv
  A light weight, low level embedded key-value database library
  ☆32Updated 11 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• efficient / ARF
  ☆11Updated 7 years ago
• r-lyeh-archived / giant
  Giant is a tiny C++11 library to handle little/big endianness.
  ☆18Updated 9 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• google / berrydb
  ☆66Updated 4 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• Amaury / AngstromDB
  Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.
  ☆14Updated 11 years ago
• recoilme / okdbc
  A fast, light-weight key/value store with http & memcache(TCP/UDP) interface.
  ☆28Updated 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
  ☆53Updated last year