naskitis / Cache-Conscious-Data-Structures
The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
☆42Updated 8 years ago
Alternatives and similar repositories for Cache-Conscious-Data-Structures:
Users that are interested in Cache-Conscious-Data-Structures are comparing it to the libraries listed below
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- ☆26Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 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
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24Updated 9 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- RWMutex for sharing of multicore machines.☆17Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Persistent Memory Graph Database☆43Updated 2 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆176Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Embedded DB Benchmark Framework☆60Updated 4 years ago
- Algorithms to compress sorted arrays of integers☆18Updated 11 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- lock free modified prefix B+tree append-only database☆117Updated 9 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- Fast decoder for VByte-compressed integers☆122Updated 11 months ago
- LSM-trie☆113Updated 4 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- ☆11Updated 7 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- The Cicada engine☆55Updated 7 years ago
- ☆12Updated 6 years ago