Alternatives and similar repositories for DataStructuresLab

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

• Amaury / AngstromDB
  Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.
  ☆14Updated 12 years ago
• tomerdmnt / levelfs
  leveldb FUSE filesystem
  ☆15Updated 11 years ago
• JanX2 / judy-arrays
  An implementation of Judy Arrays in 1250 Lines of C Code. (with sample CLI applications and Xcode project)
  ☆17Updated 14 years ago
• davidar / c-hashtable
  Git mirror of the hash table data structure in C by Christopher Clark ⛺
  ☆46Updated 6 years ago
• armon / c-minheap-indirect
  Implements a Min-Heap / Priority Queue in C using an indirection table for memory efficiency.
  ☆29Updated 11 years ago
• malbrain / ARTful
  ARTful radix tree
  ☆13Updated 8 years ago
• LMDB / memcachedb
  memcachedb ported from BerkeleyDB to LMDB originally from http://memcachedb.googlecode.com/svn/trunk
  ☆89Updated 10 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• fbuihuu / libtree
  A library which implements a couple of famous binary search trees.
  ☆165Updated 3 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• tylertreat / gatling
  Minimal pub/sub message queue in C.
  ☆23Updated 11 years ago
• hyc / mleak
  malloc leak tracer
  ☆71Updated 3 years ago
• jakogut / tinyht
  A small, simple hash table written in C.
  ☆23Updated 14 years ago
• morten-krogh / trlmdb
  Trlmdb is a replicating database using time stamps.
  ☆14Updated 9 years ago
• recoilme / okdbc
  A fast, light-weight key/value store with http & memcache(TCP/UDP) interface.
  ☆28Updated 8 years ago
• willemt / pearldb
  A Lightweight Durable HTTP Key-Value Pair Database in C
  ☆145Updated 7 years ago
• RedisLabs / triemap
  C implementation of a compressed trie lookup map
  ☆23Updated 6 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆163Updated 10 years ago
• jbenet / nanotime
  nanosecond-precision 64bit time type
  ☆53Updated 6 years ago
• supermartian / lockfree-queue
  A simple lock-free queue implementation.
  ☆80Updated 11 years ago
• aolarchive / ribs2
  RIBS (Robust Infrastructure for Backend Systems) version 2
  ☆130Updated 6 years ago
• adamierymenko / kissdb
  (Keep It) Simple Stupid Database
  ☆366Updated 10 years ago
• x86-64 / mustache-c
  Mustache templates implementation in pure c
  ☆50Updated 2 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• rescrv / pocdb
  Paxos-replicated key-value store in 3 hours or less.
  ☆25Updated 8 years ago
• indutny / bplus
  Append-only B+ tree implemented in C
  ☆33Updated 5 years ago
• naskitis / B-trie
  The B-trie and B-tree, written in C, as described in my PhD thesis.
  ☆30Updated 8 years ago
• stevedekorte / basekit
  C based OO portable data structure library
  ☆130Updated 16 years ago
• PeterScott / netstring-c
  Netstring parsing in C
  ☆36Updated 5 years ago