koeppl / separate_chaining
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
- A blend of the compact and sparse hash table implementations.☆12Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆25Updated 3 months 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
- LZ Double factor Factorization.☆11Updated 8 years ago
- Compact Tree Representation☆16Updated 7 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 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
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- ☆17Updated last month
- Super Scalar Sample Sort in modern C++☆20Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 6 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Efficient Prefix-Sum data structures in C++.☆25Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆29Updated 3 months ago
- Packed and Compressed Hash Tables☆15Updated last year
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆30Updated 6 years ago
- Implementation of the sacabench framework☆16Updated 3 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 6 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated 3 months ago
- Dynamic succinct/compressed data structures☆112Updated 9 months ago
- Sequential implementation of the Rewired Memory Array.☆18Updated 5 years ago