naskitis / HAT-trie
The HAT-trie, written in C, as described in my PhD thesis.
☆20Updated 8 years ago
Alternatives and similar repositories for HAT-trie:
Users that are interested in HAT-trie are comparing it to the libraries listed below
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- Lock-free slab allocator / freelist.☆65Updated 9 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- ☆12Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Automatically exported from code.google.com/p/judyarray☆17Updated 9 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated last year
- Hyaline Reclamation (PLDI '21, PODC '19)☆20Updated 3 years ago
- unrolled skip list library for C☆21Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Transactional Data Structure Libraries☆12Updated 7 years ago
- Compact tries for fixed-width keys☆25Updated 6 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- The B-trie and B-tree, written in C, as described in my PhD thesis.☆27Updated 8 years ago
- ☆41Updated last year
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆56Updated last year
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Updated 4 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago