naskitis / Cache-Conscious-Data-StructuresLinks
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
Sorting:
- Feed-forward Bloom filters☆52Updated 14 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- ☆12Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- a quotient filter written in C☆84Updated 7 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 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
- ☆26Updated 8 years ago
- C++11 port of the PostgreSQL DBMS☆68Updated 8 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- RWMutex for sharing of multicore machines.☆17Updated 6 years ago
- Persistent Memory Graph Database☆43Updated 2 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Fast decoder for VByte-compressed integers☆123Updated last year
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Embedded DB Benchmark Framework☆60Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Algorithms to compress sorted arrays of integers☆17Updated 11 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24Updated 10 years ago