jermp / clustered_elias_fano_indexesLinks
Clustered Elias-Fano inverted indexes.
☆15Updated 7 years ago
Alternatives and similar repositories for clustered_elias_fano_indexes
Users that are interested in clustered_elias_fano_indexes are comparing it to the libraries listed below
Sorting:
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Succinct C++☆24Updated 4 years ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago
- Interleaving bits from two sources using SIMD instructions.☆14Updated 7 years ago
- SUccinct Retrieval Framework☆20Updated 9 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Compact Data Structures Library☆100Updated 3 years ago