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:
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- Persistent memory allocator for data-centric analytics☆55Updated last week
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Fast Approximate Membership Filters (C++)☆286Updated last month
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 6 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 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☆53Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- ☆12Updated 4 years ago
- a quotient filter written in C☆86Updated 8 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 4 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☆127Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Embedded DB Benchmark Framework☆62Updated 4 years ago
- C library to compute the Hamming weight of arrays☆49Updated 6 years ago
- For details, see the blog post:☆34Updated last year
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago