wolfgarbe / EliasFanoCompressionLinks
EliasFanoCompression: quasi-succinct compression of sorted integers in C#
☆44Updated 3 years ago
Alternatives and similar repositories for EliasFanoCompression
Users that are interested in EliasFanoCompression are comparing it to the libraries listed below
Sorting:
- FishStore is a prototype fast ingestion and querying layer for flexible-schema data☆228Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- Library for encoding integers in the minimal number of bits. Includes VLQ and Elias Omega encoding.☆77Updated 2 years ago
- High-performance dictionary coding☆106Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Compact Data Structures Library☆128Updated 11 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- ☆36Updated 4 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- fixed-length integer trim☆34Updated 2 years ago
- Minimalist Prolog compiler and runtime library☆21Updated 11 years ago
- Make QuickSort Quick Again in C#☆102Updated 3 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 6 years ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago
- a quotient filter written in C☆86Updated 8 years ago
- .Net wrapper for CRoaring - a C implementation of RoaringBitmap☆58Updated 5 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- MergedTrie code☆12Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- A Minimal Perfect Hash Function Library☆168Updated 4 years ago
- A collection of succinct data structures☆209Updated last year
- UMASH: a fast enough hash and fingerprint with collision bounds☆158Updated last month
- A fast SIMD parser for CSV files☆156Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago