naskitis / Cache-Conscious-Data-Structures
The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
☆41Updated 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
- ☆25Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- Artifact for PPoPP'18☆18Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- Algorithms to compress sorted arrays of integers☆18Updated 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
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 9 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- ☆24Updated 10 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 8 years ago
- Fast decoder for VByte-compressed integers☆121Updated 8 months ago
- ☆12Updated 6 years ago
- The SprayList data structure☆31Updated 7 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 2 years ago
- lock free modified prefix B+tree append-only database☆115Updated 9 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago