koeppl / separate_chainingLinks
Hash table with separate chaining layout
☆9Updated 3 years ago
Alternatives and similar repositories for separate_chaining
Users that are interested in separate_chaining are comparing it to the libraries listed below
Sorting:
- A blend of the compact and sparse hash table implementations.☆14Updated 3 years ago
- LZ Double factor Factorization.☆11Updated 8 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆30Updated 6 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- Super Scalar Sample Sort in modern C++☆20Updated 4 years ago
- Efficient Prefix-Sum data structures in C++.☆25Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆34Updated 3 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- ☆16Updated 10 years ago
- Persistent memory allocator for data-centric analytics☆54Updated this week
- Implementation of the sacabench framework☆17Updated 4 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆109Updated 5 months ago