chango / hustle
Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
☆44Updated 10 years ago
Related projects ⓘ
Alternatives and complementary repositories for hustle
- A column oriented, embarrassingly distributed relational event database.☆240Updated 6 years ago
- An embedded non-relational database for Java and C++☆38Updated 2 months ago
- 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
- A system for maintaining replicated state machines☆115Updated 7 years ago
- 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
- Behrooz File System (BFS)☆54Updated 9 years ago
- A simple database optimized for returning results by custom scoring functions.☆20Updated 8 years ago
- An efficient, immutable, persistent mapping object☆99Updated 5 years ago
- Fast Redis clone written in C using RocksDB as a backend.☆74Updated 2 years ago
- ☆43Updated 2 years ago
- hokusai -- sketching streams in real-time☆78Updated 7 years ago
- A scalable, fast, consistent graph store☆214Updated 8 years ago
- Git mirror for the FastBit library Subversion repository.☆71Updated 7 years ago
- monetdb_fdw - PostgreSQL Foreign Data Wrapper for MonetDB☆40Updated 7 years ago
- Secondary index on HBase☆18Updated 9 years ago
- 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
- ScalienDB is a scalable, replicated datastore.☆85Updated 11 years ago
- Probabilistic data structures server. The data model is key-value, where values are: Bloomfilters, LinearCounters, HyperLogLogs, CountMin…☆24Updated 8 years ago
- Redis + Raft server implementation☆77Updated 4 years ago
- Golomb Coded Sets☆90Updated 7 years ago
- Fast Protocol Buffers module for Python☆41Updated 9 years ago
- Coordination Service for Distributed Systems☆104Updated 3 months ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆10Updated 7 years ago
- C network daemon for HyperLogLogs☆449Updated 3 years ago
- A GPU Database☆143Updated 6 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Probabilistic Multiplicity Counting☆49Updated 9 years ago
- a hash-based key-value database for persistent storing massive small records☆41Updated 10 years ago