Alternatives and similar repositories for fastbit

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

• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 years ago
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 8 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• google / szl
  A compiler and runtime for the Sawzall language
  ☆70Updated 6 years ago
• armon / hlld
  C network daemon for HyperLogLogs
  ☆451Updated 4 years ago
• google / berrydb
  ☆66Updated 5 years ago
• ucbrise / LatticeFlow
  ☆28Updated 9 years ago
• hypertable / hypertable
  A flexible database focused on performance and scalability
  ☆268Updated 7 years ago
• apache / lucy
  Mirror of Apache Lucy
  ☆102Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 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
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆178Updated 3 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 11 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 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 4 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆43Updated 10 years ago
• imzhenyu / rocksdb
  rocksdb replicated using rDSN (simple mode)
  ☆12Updated 9 years ago
• reverbrain / grape
  realtime pipeline processing engine
  ☆62Updated 11 years ago
• percona / PerconaFT
  PerconaFT is a high-performance, transactional key-value store
  ☆561Updated last year
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆127Updated 2 months 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.
  ☆44Updated 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 11 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 10 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 5 years ago
• phaistos-networks / ConsistentHashing
  Consistent Hashing data structures and algorithms for C++
  ☆40Updated 9 years ago