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
Sorting:
- ☆12Updated 6 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- ☆26Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 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
- High-performance dictionary coding☆104Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 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
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- C++11 port of the PostgreSQL DBMS☆68Updated 8 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 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
- RWMutex for sharing of multicore machines.☆17Updated 5 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- Algorithms to compress sorted arrays of integers☆18Updated 11 years ago
- ☆12Updated 3 years ago
- Dependably fast multi-core in-memory transactions☆20Updated 7 years ago
- The Cicada engine☆57Updated 7 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Fast decoder for VByte-compressed integers☆122Updated 11 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Roaring bitmaps in C☆17Updated 9 years ago
- ☆13Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- LSM-trie☆114Updated 4 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆176Updated 3 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 4 years ago