jermp / dintLinks
Dictionary-based compression for inverted indexes.
☆23Updated 6 years ago
Alternatives and similar repositories for dint
Users that are interested in dint are comparing it to the libraries listed below
Sorting:
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Concurrent trie-hash map library☆92Updated last year
- QSBR and EBR library☆121Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Self-Tuning Adaptive Radix Tree☆28Updated 5 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- ☆15Updated 5 years ago
- Lock-free Transactions without Rollbacks for Linked Data Structures☆22Updated 2 years ago
- ☆108Updated last year
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- ☆54Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- a quotient filter written in C☆86Updated 7 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 6 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Embedded DB Benchmark Framework☆61Updated 4 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago