naskitis / B-trie
The B-trie and B-tree, written in C, as described in my PhD thesis.
☆27Updated 8 years ago
Alternatives and similar repositories for B-trie:
Users that are interested in B-trie are comparing it to the libraries listed below
- The HAT-trie, written in C, as described in my PhD thesis.☆20Updated 8 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
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆20Updated 4 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 5 years ago
- ☆29Updated 8 years ago
- Lock-free slab allocator / freelist.☆65Updated 9 years ago
- Columnar storage and query engine☆9Updated 6 years ago
- A comparison between different integer set techniques☆14Updated 6 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- BLInk Tree logic - storage and locking experiment☆26Updated 10 years ago
- Key-value store based on a trie data structure to handle the keyspace.☆12Updated 5 years ago
- Basic Database System implemented for MDBS course☆12Updated 10 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- ☆14Updated last year
- ☆13Updated last year
- ☆20Updated 2 years ago
- A small test for multithreaded C++ stack unwinding on unixes☆16Updated 5 years ago
- ☆25Updated 8 years ago
- The libdill tutorial.☆15Updated 5 years ago
- A benchmark for cache efficient data structures.