wolfgarbe / EliasFanoCompressionLinks
EliasFanoCompression: quasi-succinct compression of sorted integers in C#
☆45Updated 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☆225Updated last year
- ☆36Updated 4 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Library for encoding integers in the minimal number of bits. Includes VLQ and Elias Omega encoding.☆77Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- a quotient filter written in C☆85Updated 7 years ago
- Inverted file indexing and retrieval optimized for short texts. Supports auto-suggest and query segment classification.☆34Updated 2 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- Fast directed acyclic word graph generator☆91Updated 7 years ago
- MergedTrie code☆12Updated 5 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- ViyaDB in-memory columnar analytical data store☆115Updated 5 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- A probabilistic data structures library for C#☆80Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Finite state dictionaries in Java☆130Updated 3 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- Exercises and sample code for a C# SIMD (vectorization) workshop☆36Updated 7 years ago
- C++ utility library☆24Updated 11 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Sample implementations using Naiad☆39Updated 10 years ago