alexsmith1612 / hadoofusLinks
HDFS client library for C
☆45Updated last year
Alternatives and similar repositories for hadoofus
Users that are interested in hadoofus are comparing it to the libraries listed below
Sorting:
- C HDFS FUSE implementation, no libhdfs☆87Updated 2 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- An API to provide an efficient distributed queue on a cluster. Libcircle is currently used in production to quickly traverse and perform …☆98Updated 5 years ago
- Iterator library.☆80Updated 5 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- EWAH Compressed Bitmaps☆25Updated 5 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Userspace file-system using the TokuFT fractal tree library☆23Updated 4 years ago
- Wannabe Main Memory Database and More☆54Updated 4 years ago
- Git mirror for the FastBit library Subversion repository.☆71Updated 8 years ago
- Algorithms to compress sorted arrays of integers☆19Updated 11 years ago
- A compiler and runtime for the Sawzall language☆70Updated 5 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- Simple out-of-process invoker☆18Updated 4 months ago
- ☆27Updated 8 years ago
- mklove - not autoconf☆54Updated 4 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated 2 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- There can never be enough http (2) libraries.☆33Updated 3 years ago
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- Command line interface to and serialization format for Blosc☆123Updated 2 years ago
- Linux kernel source tree with fast swap patches.☆20Updated 11 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 5 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- A distributed key-value cache with builtin materialized views.☆25Updated 10 years ago