Alternatives and similar repositories for gcs:

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

• armon / hlld
  C network daemon for HyperLogLogs
  ☆448Updated 4 years ago
• pmwkaa / engine.so
  Tracking, Benchmarking and Sharing Information about an open source embedded data storage engines, internals, architectures, data storage…
  ☆181Updated 6 years ago
• dgryski / hokusai
  hokusai -- sketching streams in real-time
  ☆78Updated 7 years ago
• jmhodges / opposite_of_a_bloom_filter
  Implementations of a data structure with false negatives but no false positives.
  ☆357Updated last year
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆114Updated 7 years ago
• rescrv / Consus
  Consus is a geo-replicated transactional key-value store.
  ☆225Updated 6 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 8 years ago
• spacejam / loghisto
  counters and logarithmically bucketed histograms for distributed systems
  ☆84Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• 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 5 years ago
• mintDS / mintds
  Probabilistic data structures server. The data model is key-value, where values are: Bloomfilters, LinearCounters, HyperLogLogs, CountMin…
  ☆25Updated 9 years ago
• cliqz-oss / keyvi
  Keyvi - a key value index that powers Cliqz search engine. It is an in-memory FST-based data structure highly optimized for size and look…
  ☆177Updated 6 years ago
• tristartom / key-value-store-indexing
  Secondary index on HBase
  ☆18Updated 9 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago
• redis / redis-rcp
  Redis Change Proposals
  ☆136Updated 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
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• seiflotfy / dlCBF
  d-left Counting Bloom Filter
  ☆56Updated 9 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• bshafiee / BFS
  Behrooz File System (BFS)
  ☆54Updated 9 years ago
• cruppstahl / libfor
  A very fast scalar implementation for Frame Of Reference integer compression.
  ☆108Updated 9 years ago
• pschanely / scoredb
  A simple database optimized for returning results by custom scoring functions.
  ☆20Updated 9 years ago
• seiflotfy / hyperbitbit
  HyperBitBit
  ☆133Updated 8 years ago
• eBay / GZinga
  ☆43Updated 3 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆176Updated 3 years ago
• cw75 / tiered-storage
  An Elastic, Tiered-Storage Service
  ☆30Updated 6 years ago
• seiflotfy / adaptive
  Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams
  ☆37Updated 7 years ago
• rescrv / HyperLevelDB
  A fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB.
  ☆460Updated 9 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year