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
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• 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
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 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
• 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
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• gstrauss / mcdb
  mcdb - fast, reliable, simple code to create and read constant databases
  ☆111Updated 2 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 8 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆162Updated 10 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆53Updated 4 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆33Updated 8 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• pmwkaa / engine.so
  Tracking, Benchmarking and Sharing Information about an open source embedded data storage engines, internals, architectures, data storage…
  ☆182Updated 6 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• tspurway / hustle
  A column oriented, embarrassingly distributed relational event database.
  ☆240Updated 7 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 6 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆54Updated 10 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆77Updated 3 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• mulle-concurrent / mulle-concurrent
  📶 A lock- and wait-free hashtable (and an array too)
  ☆109Updated 2 months ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• RaphaelJ / fast_strstr
  A fast substitution to the stdlib's strstr() sub-string search function.
  ☆117Updated 10 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago