wolfgarbe / EliasFanoCompression
EliasFanoCompression: quasi-succinct compression of sorted integers in C#
☆42Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for EliasFanoCompression
- MergedTrie code☆12Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 7 years ago
- Experiments with array layouts for comparison-based searching☆80Updated 10 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- ☆35Updated 4 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 5 years ago
- a 64-bit histogram / quantile sketch☆56Updated last year
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 10 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 3 years ago
- Universe-sliced indexes in C++.☆17Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 11 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 7 months ago
- FishStore is a prototype fast ingestion and querying layer for flexible-schema data☆214Updated last year
- A benchmark for sorting algorithms☆59Updated 3 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆25Updated 5 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- High-performance dictionary coding☆103Updated 7 years ago
- Fast decoder for VByte-compressed integers☆117Updated 6 months ago