vmg / libewokLinks
EWAH Compressed Bitmaps
☆25Updated 5 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☆121Updated 8 years ago
- Fast decoder for VByte-compressed integers☆125Updated last month
- qp tries and crit-bit tries☆122Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- Embedded storage benchmarking tool☆139Updated 3 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- An efficient trie implementation.☆255Updated 5 years ago
- a quotient filter written in C☆88Updated 8 years ago
- Roaring bitmaps in C☆17Updated 9 years ago
- LSM-trie☆114Updated 4 years ago
- Tracking, Benchmarking and Sharing Information about an open source embedded data storage engines, internals, architectures, data storage…☆181Updated 7 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Iterator library.☆80Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- 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
- Wannabe Main Memory Database and More☆54Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- A very fast scalar implementation for Frame Of Reference integer compression.☆109Updated 10 years ago
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 3 years ago
- generate perfect hashes (alpha)☆79Updated 3 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated 11 months ago