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
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• armon / hlld
  C network daemon for HyperLogLogs
  ☆451Updated 4 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 7 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
• google / szl
  A compiler and runtime for the Sawzall language
  ☆70Updated 6 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
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 11 years ago
• yahoo / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆997Updated 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.
  ☆43Updated 9 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 5 years ago
• ucbrise / LatticeFlow
  ☆28Updated 9 years ago
• percona / PerconaFT
  PerconaFT is a high-performance, transactional key-value store
  ☆561Updated last year
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• izenecloud / big-data-made-easy
  Big Data Made Easy
  ☆185Updated 7 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
• rescrv / HyperLevelDB
  A fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB.
  ☆464Updated 9 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆19Updated 11 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last month
• lyogavin / Pistachio
  Low latency, strong consistency, fault tolerant distributed key value store. Colocate data and compute to achieve best performance cloud …
  ☆115Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• phaistos-networks / ConsistentHashing
  Consistent Hashing data structures and algorithms for C++
  ☆39Updated 9 years ago
• rasky / gcs
  Golomb Coded Sets
  ☆94Updated 8 years ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 5 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago