The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
☆44Nov 17, 2016Updated 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A compact implementation of Dr. Askitis HatTrie☆80May 20, 2014Updated 12 years ago
- The B-trie and B-tree, written in C, as described in my PhD thesis.☆31Nov 17, 2016Updated 9 years ago
- A small fast isam/btree library for key/val access☆12Jul 10, 2010Updated 16 years ago
- ☆14Mar 2, 2011Updated 15 years ago
- ☆39Jun 20, 2020Updated 6 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- HAMT implementation whose sub-trees can be shared over threads☆10Jul 3, 2026Updated 2 weeks ago
- Simple fault-tolerant distributed file system. 1. Utilize virtual ring style key-value store with 3 backups. 2. Automated failure detecti…