JustKshitijD / Harmonia_for_B_plus_trees
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 3 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:
- c++ library for binary fuse filters, including a sharded filter☆88Updated 3 months ago
- Diagrams as text tool for visualizing concurrent operation histories☆21Updated 3 months ago
- ☆13Updated 4 years ago
- A JIT compiler implemented with MLIR/LLVM for faster query processing in SQLite☆14Updated 2 years ago
- ☆29Updated 2 weeks ago
- Zig library for HyperLogLog estimation☆89Updated 9 months ago
- A SQL query compiler written in Rust from scratch☆22Updated 7 months ago
- The fastest ACID-transactional persisted Key-Value store designed as modified LSM-Tree for NVMe block-devices with GPU-acceleration and S…☆71Updated 2 years ago
- Multi-Array Queue program codes☆75Updated this week
- A very fast online search algorithm☆24Updated last month
- The repo for HotOS paper "FIFO can be Better than LRU: the Power of Lazy Promotion and Quick Demotion"☆33Updated last year
- Performance evaluation and optimization of SQLite☆24Updated 2 years ago
- A highly concurrent, low latency, highly available monotonic hybrid timestamp service.☆22Updated 5 months ago
- In-memory, columnar, arrow-based database.☆46Updated 2 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- ☆53Updated last year
- ☆46Updated last year
- Columnar database on SSD NVMe☆14Updated 4 years ago
- Programming Language for Continuous Deep Analytics☆47Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- ☆137Updated 2 years ago
- Transactional Data Structure Libraries☆12Updated 7 years ago
- A runtime implementation of data-parallel actors.☆38Updated 3 years ago
- A simple implementation of the write-optimized Bε Tree 🌳 - for MIT 6.854 (Advanced Algorithms).☆24Updated 5 years ago
- Generate (message) sequence diagrams from TLA+ state traces☆73Updated 2 years ago
- An updated fork of sqlite_protobuf (https://github.com/rgov/sqlite_protobuf), a SQLite extension for extracting values from serialized Pr…☆27Updated last year
- Testing memory-level parallelism☆68Updated last year
- ☆20Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago