Alternatives and similar repositories for fastbit

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

• apache / lucy
  Mirror of Apache Lucy
  ☆99Updated 7 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• ucbrise / LatticeFlow
  ☆27Updated 8 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 10 years ago
• aerospike / aerospike-common
  Common Library
  ☆47Updated 4 months ago
• hypertable / hypertable
  A flexible database focused on performance and scalability
  ☆263Updated 6 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
• infinisql / infinisql
  Extreme Scale Distributed Transaction Processing
  ☆268Updated 11 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• lyogavin / Pistachio
  Low latency, strong consistency, fault tolerant distributed key value store. Colocate data and compute to achieve best performance cloud …
  ☆114Updated 9 years ago
• lemire / BitSliceIndex
  Experiments on bit-slice indexing
  ☆13Updated 10 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 8 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• brentp / fastbit-python
  pythonic access to fastbit
  ☆26Updated 6 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• lvv / lvvlib
  C++ utility library
  ☆24Updated 11 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
• wheresvic / zsearch
  A high performance search engine
  ☆105Updated 8 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆205Updated 4 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• rDSN-Projects / rocksdb.replicated
  RocksDB made replicated using Robust Distributed System Nucleus (rDSN) (Delta Learning)
  ☆16Updated 9 years ago
• google / szl
  A compiler and runtime for the Sawzall language
  ☆70Updated 5 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago