naskitis / B-trie
The B-trie and B-tree, written in C, as described in my PhD thesis.
☆25Updated 7 years ago
Related projects: ⓘ
- The HAT-trie, written in C, as described in my PhD thesis.☆19Updated 7 years ago
- Bloom filter alternative (C++)☆17Updated 5 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆40Updated 7 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆47Updated 3 years ago
- ☆10Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆50Updated 7 years ago
- Sample database with LLVM execution engine.☆11Updated 8 years ago
- RLU resizable hash-table☆16Updated 9 years ago
- RWMutex for sharing of multicore machines.☆16Updated 5 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 11 years ago
- ☆24Updated 7 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Rust bindings for SPDK☆19Updated 7 years ago
- A benchmark for cache efficient data structures.☆28Updated 5 years ago
- ☆11Updated 11 months ago
- ☆13Updated last year
- ☆27Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆24Updated 4 years ago
- Quick sort code using AVX2 instructions☆67Updated 7 years ago
- Simple in process cycle counting for Linux☆20Updated 12 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- ☆20Updated last year
- The CIlk programming language from http://supertech.lcs.mit.edu/cilk/☆9Updated 8 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆15Updated 9 years ago
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 5 years ago
- Popular hash table implementation benchmarks☆27Updated 7 years ago
- A C11 implementation of D. Vyukov MPSC queue☆25Updated last year
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- A comparison between different integer set techniques☆14Updated 6 years ago