Alternatives and similar repositories for min-heap

Users that are interested in min-heap are comparing it to the libraries listed below

• mintomic / samples
  [deprecated] Data structures and sample applications using Mintomic
  ☆93Updated 9 years ago
• solatis / libpaxos-cpp
  libpaxos-cpp is a C++ implementation of the Paxos distributed consensus protocol
  ☆67Updated 12 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• memsql / lockfree-bench
  Benchmarks for lockfree datastructures.
  ☆120Updated 11 years ago
• google / hashing-demo
  Sample implementation of a proposed C++ hashing framework
  ☆29Updated 10 years ago
• google / berrydb
  ☆66Updated 5 years ago
• andy-yx-chen / cornerstone
  A C++ Raft implementation, project moved
  ☆25Updated 9 years ago
• cmu-db / mongodb-d4
  Automatic MongoDB database designer
  ☆55Updated 10 years ago
• fbuihuu / libtree
  A library which implements a couple of famous binary search trees.
  ☆165Updated 3 years ago
• yuyuyu101 / C-Buffered-tree
  A buffered-tree implemented in dictionary type and more
  ☆75Updated 12 years ago
• kev009 / cii
  libcii ported to Autotools/libtool - D. R. Hanson's C Interfaces and Implementations
  ☆66Updated 14 years ago
• sol-prog / async_tutorial
  C++11 std::async
  ☆59Updated 13 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆96Updated 6 years ago
• uchicago-cs / cmsc12300
  CMSC 12300 - Computer Science with Applications 3
  ☆74Updated 8 years ago
• r-lyeh-archived / trie
  Trie is a lightweight and simple autocompletion data structure written in C++11.
  ☆45Updated 10 years ago
• bodokaiser / libuv-internals
  libuv-internals is a collection of snippets which try to show up some architecture sections of libuv on simple examples
  ☆38Updated 12 years ago
• chenshuo / cppindex
  ☆20Updated 9 years ago
• couchbase / kv_engine
  Couchbase Key-Value Engine
  ☆142Updated this week
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆193Updated last month
• embedded2016 / bplus-tree
  B+ tree implementation in C
  ☆132Updated 5 years ago
• aozturk / HashMap
  Basic HashMap (Hash Table) Implementation in C++
  ☆106Updated 8 months ago
• twitter / fatcache
  Memcache on SSD
  ☆1,305Updated 4 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 12 years ago
• jckarter / tbb
  Intel Threading Building Blocks with local modifications
  ☆31Updated 13 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• johnj / llds
  Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel
  ☆120Updated 2 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.
  ☆43Updated 9 years ago