rasky / gcs

Related projects ⓘ

Alternatives and complementary repositories for gcs

• armon / hlld
  C network daemon for HyperLogLogs
  ☆449Updated 3 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.
  ☆354Updated 11 months ago
• tristartom / key-value-store-indexing
  Secondary index on HBase
  ☆18Updated 9 years ago
• spacejam / loghisto
  counters and logarithmically bucketed histograms for distributed systems
  ☆84Updated 7 years ago
• seiflotfy / dlCBF
  d-left Counting Bloom Filter
  ☆56Updated 9 years ago
• scalien / scaliendb
  ScalienDB is a scalable, replicated datastore.
  ☆85Updated 11 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago
• aggregateknowledge / js-hll
  JavaScript library for the HyperLogLog algorithm
  ☆74Updated 7 years ago
• rescrv / pocdb
  Paxos-replicated key-value store in 3 hours or less.
  ☆25Updated 7 years ago
• wlloyd / eiger
  A research fork of cassandra that provides causal+ consistency, read-only transaction, and write-only transaction across all the servers …
  ☆77Updated 7 years ago
• pmwkaa / engine.so
  Tracking, Benchmarking and Sharing Information about an open source embedded data storage engines, internals, architectures, data storage…
  ☆180Updated 5 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…
  ☆179Updated 5 years ago
• seiflotfy / vhll
  Hyper-Compact Virtual Estimators for Big Network Data Based on Register Sharing
  ☆33Updated 7 years ago
• mintDS / mintds
  Probabilistic data structures server. The data model is key-value, where values are: Bloomfilters, LinearCounters, HyperLogLogs, CountMin…
  ☆24Updated 8 years ago
• pschanely / scoredb
  A simple database optimized for returning results by custom scoring functions.
  ☆20Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• indeedeng / mph-table
  Immutable key/value store with efficient space utilization and fast reads. They are ideal for the use-case of tables built by batch proce…
  ☆96Updated last year
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆115Updated 7 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
• tidwall / redraft
  Redis + Raft server implementation
  ☆77Updated 4 years ago
• rescrv / Consus
  Consus is a geo-replicated transactional key-value store.
  ☆226Updated 6 years ago
• pbailis / ramp-sigmod2014-code
  Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014
  ☆72Updated 9 years ago
• rcoh / treelayout
  Demonstrating the importance of laying out data in memory.
  ☆47Updated 6 years ago
• sinabz / itc4j
  An Implementation of Interval Tree Clock
  ☆59Updated 4 years ago
• echen / streaming-simulations
  Simulating the performance of various streaming algorithms. #experimentalmathematics
  ☆59Updated 6 years ago
• seiflotfy / hyperbitbit
  HyperBitBit
  ☆133Updated 7 years ago
• 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