Alternatives and similar repositories for fastbit

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

• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 8 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 7 years ago
• armon / hlld
  C network daemon for HyperLogLogs
  ☆449Updated 4 years ago
• ucbrise / LatticeFlow
  ☆28Updated 8 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 4 years ago
• google / szl
  A compiler and runtime for the Sawzall language
  ☆70Updated 5 years ago
• hypertable / hypertable
  A flexible database focused on performance and scalability
  ☆264Updated 6 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• apache / lucy
  Mirror of Apache Lucy
  ☆99Updated 7 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago
• google / berrydb
  ☆66Updated 4 years ago
• aerospike / aerospike-common
  Common Library
  ☆48Updated last month
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 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
• percona / PerconaFT
  PerconaFT is a high-performance, transactional key-value store
  ☆562Updated last year
• rescrv / HyperLevelDB
  A fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB.
  ☆463Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 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
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• remis-thoughts / native-hdfs-fuse
  C HDFS FUSE implementation, no libhdfs
  ☆88Updated 2 years ago
• yahoo / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆990Updated last year
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• bytemaster / disruptor
  My take on the LMAX Disruptor
  ☆75Updated 12 years ago
• lyogavin / Pistachio
  Low latency, strong consistency, fault tolerant distributed key value store. Colocate data and compute to achieve best performance cloud …
  ☆114Updated 10 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 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