lodborg / cache-oblivious-btreeLinks
A B-Tree that exploits cache locality without prior knowledge of the memory hierarchy.
☆14Updated 3 years ago
Alternatives and similar repositories for cache-oblivious-btree
Users that are interested in cache-oblivious-btree are comparing it to the libraries listed below
Sorting:
- Fast Approximate Membership Filters (C++)☆288Updated 3 months ago
- Library for lock-free locks☆83Updated 2 years ago
- ☆39Updated 5 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated 11 months ago
- A simple, reference implementation of a B^e-tree☆160Updated 6 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆130Updated 11 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆31Updated 4 years ago
- Parallel Balanced Binary Tree Structures☆121Updated 9 months ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- ☆53Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Query☆50Updated 6 months ago
- The world's first wait-free Software Transactional Memory☆174Updated 5 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆83Updated 3 years ago
- ☆20Updated 2 years ago
- ☆50Updated last year
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆137Updated 9 months ago
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆107Updated 4 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- An adaptive radix tree for efficient indexing in main memory.☆167Updated last month
- A lock-free priority queue implementation☆35Updated 7 years ago
- ☆55Updated last year
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- ☆146Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Testing memory-level parallelism☆82Updated last year