naskitis / Cache-Conscious-Data-StructuresLinks
The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
☆43Updated 9 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☆53Updated 14 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Fast decoder for VByte-compressed integers☆125Updated 3 weeks ago
- LSM-trie☆114Updated 4 years ago
- ☆27Updated 8 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆11Updated 9 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
- Lock-free multithreaded memory allocation☆110Updated 8 years ago
- a quotient filter written in C☆87Updated 8 years ago
- C++11 port of the PostgreSQL DBMS☆70Updated 9 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- Iterator library.☆80Updated 6 years ago
- Embedded storage benchmarking tool☆139Updated 3 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 15 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆96Updated 6 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 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
- qp tries and crit-bit tries☆122Updated 3 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆76Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- RWMutex for sharing of multicore machines.☆18Updated 6 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Algorithms to compress sorted arrays of integers☆19Updated 11 years ago