Alternatives and similar repositories for cuttdb:

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

• Amaury / FineDB
  High-performance nosql database. Written in C, multi-threaded, based on LightningDB and nanomsg.
  ☆116Updated 11 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆115Updated 9 years ago
• mpalmer / redis
  Redis is an in-memory database that persists on disk. The data model is key-value, but many different kind of values are supported: Strin…
  ☆129Updated 10 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 8 years ago
• reverbrain / eblob
  Eblob is an append-only low-level IO library, which saves data in blob files. Created as low-level backend for elliptics
  ☆104Updated 5 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆76Updated last year
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 9 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆18Updated 10 years ago
• vmg / libewok
  EWAH Compressed Bitmaps
  ☆25Updated 4 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.
  ☆40Updated 8 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago
• jedisct1 / PureDB
  PureDB is a portable and tiny set of libraries for creating and reading constant databases.
  ☆34Updated last year
• recoilme / okdbc
  A fast, light-weight key/value store with http & memcache(TCP/UDP) interface.
  ☆28Updated 7 years ago
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆52Updated 9 years ago
• malbrain / ARTful
  ARTful radix tree
  ☆13Updated 7 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆53Updated 4 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆252Updated 4 years ago
• RaphaelJ / fast_strstr
  A fast substitution to the stdlib's strstr() sub-string search function.
  ☆116Updated 9 years ago
• willemt / duraqueue
  Durable dead simple queue that allows zero copy semantics. Durable under failure!
  ☆18Updated 9 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆46Updated 7 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆76Updated 2 years ago
• janneku / btree_db
  A very fast on-disk database for SHA1-identified objects
  ☆58Updated 8 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 7 months ago
• pmwkaa / engine.so
  Tracking, Benchmarking and Sharing Information about an open source embedded data storage engines, internals, architectures, data storage…
  ☆180Updated 6 years ago
• tidwall / rocksdb-server
  Fast Redis clone written in C using RocksDB as a backend.
  ☆74Updated 3 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago