vmg / libewokLinks
EWAH Compressed Bitmaps
☆25Updated 4 years ago
Alternatives and similar repositories for libewok
Users that are interested in libewok are comparing it to the libraries listed below
Sorting:
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- High-performance dictionary coding☆105Updated 8 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago
- a quotient filter written in C☆86Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- LSM-trie☆114Updated 4 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- Embedded storage benchmarking tool☆139Updated 3 years ago
- Iterator library.☆79Updated 5 years ago
- Wannabe Main Memory Database and More☆54Updated 4 years ago
- Tracking, Benchmarking and Sharing Information about an open source embedded data storage engines, internals, architectures, data storage…☆182Updated 6 years ago
- Roaring bitmaps in C☆17Updated 9 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
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- generate perfect hashes (alpha)☆77Updated 3 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 6 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 4 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated 2 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆37Updated 6 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago