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
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• vmg / libewok
  EWAH Compressed Bitmaps
  ☆25Updated 4 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 8 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.
  ☆42Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 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
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• tidwall / rocksdb-server
  Fast Redis clone written in C using RocksDB as a backend.
  ☆75Updated 3 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 11 years ago
• recoilme / okdbc
  A fast, light-weight key/value store with http & memcache(TCP/UDP) interface.
  ☆28Updated 8 years ago
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆54Updated 10 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆139Updated 3 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆17Updated 11 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆53Updated 4 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆77Updated 3 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• tspurway / hustle
  A column oriented, embarrassingly distributed relational event database.
  ☆240Updated 7 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• snaga / monetdb_fdw
  monetdb_fdw - PostgreSQL Foreign Data Wrapper for MonetDB
  ☆40Updated 8 years ago
• patrickfrey / strus
  Library implementing the storage and the query evaluation for a text search engine. It uses on a key value store database interface to st…
  ☆47Updated 3 years ago
• jedisct1 / PureDB
  PureDB is a portable and tiny set of libraries for creating and reading constant databases.
  ☆35Updated last year
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆50Updated 8 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 8 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago