koeppl / separate_chaining
Hash table with separate chaining layout
☆9Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for separate_chaining
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Compact Tree Representation☆16Updated 7 years ago
- Learned Monotone Minimal Perfect Hashing☆23Updated 2 months ago
- A blend of the compact and sparse hash table implementations.☆12Updated 3 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 2 months ago
- LZ Double factor Factorization.☆11Updated 7 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 11 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- C++ Implementation of Zip Trees☆13Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- A Space-Optimal Grammar Compression☆10Updated 3 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
- Super Scalar Sample Sort in modern C++☆20Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆14Updated last month
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- Sequential implementation of the Rewired Memory Array.☆17Updated 5 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated 11 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated 2 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆30Updated last year
- Efficient Prefix-Sum data structures in C++.☆25Updated last year
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year