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.☆19Updated 8 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆41Updated 8 years ago
- Sample database with LLVM execution engine.☆11Updated 8 years ago
- squint - Rob Pike's Newsqueak interpreter for Unix☆37Updated 12 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- A comparison between different integer set techniques☆14Updated 6 years ago
- RLU resizable hash-table☆16Updated 9 years ago
- ☆10Updated 3 years ago
- The libdill tutorial.☆13Updated 5 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- System Programming Project Ideas and Information for honors students☆19Updated 9 years ago
- ☆13Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 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
- RWMutex for sharing of multicore machines.☆17Updated 5 years ago
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- Columnar storage and query engine☆9Updated 6 years ago
- C implementation of a compressed trie lookup map☆21Updated 5 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)☆40Updated 6 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- A fast priority queue/tree/sort struct that supports operations in O(loglog u) time☆18Updated 7 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆43Updated 11 years ago
- lock free modified prefix B+tree append-only database☆115Updated 9 years ago
- Slides for my 2019 presentation at C++ on Sea☆13Updated 3 years ago
- ☆25Updated 7 years ago
- The CIlk programming language from http://supertech.lcs.mit.edu/cilk/☆9Updated 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago