Awesome Algorithms

• Distributed Algorithm

  • raft - Golang implementation of the Raft consensus protocol
  • zab - Zookeeper Atomic Broadcast （Zookeeper原子广播）
  • phxpaxos - The Paxos library implemented in C++ that has been used in the WeChat production environment.
  • raft - C implementation of the Raft Consensus protocol

• bloom - Bloom Filter (布隆过滤器)

  • python-bloomfilter - Scalable Bloom Filter implemented in Python
  • dablooms - scaling, counting, bloom filter library
  • Java-BloomFilter - A stand-alone Bloom filter implementation written in Java
  • bloom - Go package implementing Bloom filters

• B+ - B+Tree (B+树)

  • cpp-btree - Google's cpp-btree B-tree set and map containers
  • LMDB - Lightning memory-mapped database library
  • Kyoto Cabinet - a straightforward implementation of DBM
  • linux - B+Tree in linux

• Hash Map

  • bitcask - because you need another a key/value storage engine

• SSTable

  • cassandra - The Apache Cassandra database.

• Inverted index - (倒排索引)

  • ds2i - A library of *inverted* *index* data structures
  • lucene-solr - Apache Lucene and Solr open-source search software

• SCC - Strongly connected component (强连通分量)

  • py-tarjan - Python implementation of Tarjan's strongly connected components algorithm.
  • neo4j-algorithm - scc in neo4j

• DAG - directed acyclic graph

  • DAG - FCC Directed Acyclic Graph Tool

• Cache

  • lrucache11 - A header only C++11 LRU Cache template class that allows you to define key, value and optionally the Map type
  • caches - LRU, LFU, FIFO cache C++ implementations

• Load Balance

  • rrdtool-1.x - RRDtool 1.x - Round Robin Database

• Page Rank

  • pagerank - A pagerank implementation in C++ able to handle very big graphs

• bitmap

  • linux - bitmap in linux kernel

• SL - Skip List (跳跃列表)

  • redis - skip list in reds
  • hbase - skip list in base
  • redis - skip list in reds
  • skiplist - Skip list implemented in Go

• LSM - Log-Structured Merge Tree (LSM树)

  • leveldb - a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values.
  • leveldb - a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values.
  • lsmtree - A fast key/value store that is efficient for high-volume random access reads and writes.

• RBtree - Red-Black Tree (红黑树)

  • linux - Red Black Trees in linux
  • gods - GoDS (Go Data Structures)

• B - BTree (B树)

  • mongoDB - The MongoDB Database

• AVL Tree - (AVL 树)

  • gods - GoDS (Go Data Structures)