JustKshitijD / Harmonia_for_B_plus_treesLinks
Harmonia is an algorithm that allows for the implementation of operations on B+ trees using parallelization. As a part of my GPU project, I implemented the Harmonia paper published in 2019 in CUDA.
☆30Updated 4 years ago
Alternatives and similar repositories for Harmonia_for_B_plus_trees
Users that are interested in Harmonia_for_B_plus_trees are comparing it to the libraries listed below
Sorting:
- Multi-Array Queue program codes☆75Updated 2 months ago
- c++ library for binary fuse filters, including a sharded filter☆91Updated 6 months ago
- The fastest ACID-transactional persisted Key-Value store designed as modified LSM-Tree for NVMe block-devices with GPU-acceleration and S…☆74Updated 2 years ago
- Generate (message) sequence diagrams from TLA+ state traces☆75Updated 2 years ago
- Integer Map Data Structure☆131Updated 2 years ago
- Zig library for HyperLogLog estimation☆89Updated last year
- ☆13Updated 5 months ago
- An Evaluation of Linear Probing Hashtable Algorithms☆32Updated last year
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Binary search trees☆47Updated 2 months ago
- C++20 idiomatic APIs for the Apache Arrow Columnar Format☆91Updated last week
- An optimizing compiler for a large subset of the C programming language☆26Updated 2 months ago
- Various implementation of byte matrix multiplication☆26Updated 6 months ago
- Testing memory-level parallelism☆79Updated last year
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Typescript implementation of Relaxed Radix Balanced Trees☆18Updated 10 months ago
- Poireau: a sampling allocation debugger☆99Updated 3 years ago
- a 64-bit histogram / quantile sketch☆59Updated 7 months ago
- GitHub copy of the NTS/TeX source code from 2001☆30Updated 4 years ago
- Fast WebAssembly Baseline Compiler☆58Updated 2 years ago
- ☆28Updated 2 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆124Updated 9 months ago
- Columnar database on SSD NVMe☆14Updated 4 years ago
- Public-facing version of the Twizzler OS source code. Note: this is not completely up-to-date with internal Twizzler code.☆65Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆110Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Beating the `bisect` module's implementation using C-extensions.☆30Updated 2 years ago
- A highly concurrent, low latency, highly available monotonic hybrid timestamp service.☆22Updated 7 months ago