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
  ☆449Updated 4 years ago
• jmhodges / opposite_of_a_bloom_filter
  Implementations of a data structure with false negatives but no false positives.
  ☆355Updated last year
• dgryski / hokusai
  hokusai -- sketching streams in real-time
  ☆78Updated 7 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
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆114Updated 7 years ago
• spacejam / loghisto
  counters and logarithmically bucketed histograms for distributed systems
  ☆84Updated 7 years ago
• pbailis / ramp-sigmod2014-code
  Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014
  ☆71Updated 10 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• 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
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• eBay / GZinga
  ☆43Updated 3 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
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 8 years ago
• seiflotfy / vhll
  Hyper-Compact Virtual Estimators for Big Network Data Based on Register Sharing
  ☆33Updated 7 years ago
• bitly / dablooms
  scaling, counting, bloom filter library
  ☆969Updated 5 years ago
• seiflotfy / hyperbitbit
  HyperBitBit
  ☆133Updated 7 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• tristartom / key-value-store-indexing
  Secondary index on HBase
  ☆18Updated 9 years ago
• seiflotfy / pmc
  Probabilistic Multiplicity Counting
  ☆49Updated 9 years ago
• aggregateknowledge / js-hll
  JavaScript library for the HyperLogLog algorithm
  ☆74Updated 7 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated 9 months ago
• scalien / scaliendb
  ScalienDB is a scalable, replicated datastore.
  ☆86Updated 12 years ago
• apache / lucy
  Mirror of Apache Lucy
  ☆99Updated 6 years ago
• seiflotfy / dlCBF
  d-left Counting Bloom Filter
  ☆56Updated 9 years ago
• rescrv / Consus
  Consus is a geo-replicated transactional key-value store.
  ☆226Updated 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 10 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
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 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.
  ☆41Updated 8 years ago