Alternatives and similar repositories for AlgorithmCollection:

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

• viktorleis / mmapbench
  ☆134Updated 2 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆35Updated 5 years ago
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆103Updated 5 months ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• sunbains / embedded-innodb
  Embedded InnoDB based on v5.1
  ☆30Updated 4 months ago
• jarulraj / databaseology
  Collection of Papers On Database Management Systems
  ☆219Updated 8 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆99Updated 6 years ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆71Updated last year
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 5 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 4 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆247Updated 4 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆224Updated this week
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆157Updated 3 years ago
• PLW / blink-tree-logic
  BLInk Tree logic - storage and locking experiment
  ☆26Updated 10 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆74Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆143Updated last year
• ayende / libgavran
  Experimenting with persistence in C
  ☆169Updated 2 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 12 years ago
• mfleming / performance-resources
  A collection of software performance content, blogs, books, and lists.
  ☆115Updated last year
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 7 years ago
• LineairDB / LineairDB
  C++ fast transactional key-value storage.
  ☆163Updated 3 weeks ago
• mitdbg / treeline
  An update-in-place key-value store for modern storage.
  ☆134Updated last year
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 3 months ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆74Updated 3 years ago
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• stephentu / silo
  Multicore in-memory storage engine
  ☆385Updated 7 years ago