lodborg / cache-oblivious-btree
A B-Tree that exploits cache locality without prior knowledge of the memory hierarchy.
☆13Updated 2 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
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- ☆21Updated 2 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- ☆53Updated 11 months ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Persistent memory allocator for data-centric analytics☆54Updated 3 weeks ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆56Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- ☆38Updated 4 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 2 years ago
- Library for lock-free locks☆77Updated last year
- Multi-core Window-Based Stream Processing Engine☆71Updated 3 years ago
- Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox☆24Updated 10 years ago
- ☆28Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆277Updated 3 months ago
- Order-preserving key encoder☆122Updated 5 years ago
- Parallel Balanced Binary Tree Structures☆115Updated last month
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- ☆45Updated last year
- ☆29Updated last week
- Sequential implementation of the Rewired Memory Array.☆19Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆109Updated 3 months ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆20Updated 3 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago