☆16Jan 24, 2025Updated last year
Alternatives and similar repositories for BP-Tree
Users that are interested in BP-Tree are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Jun 18, 2023Updated 3 years ago
- Source code of our implementation of the concurrent RMA☆12May 23, 2019Updated 7 years ago
- ☆26Jan 21, 2026Updated 7 months ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆17Jun 13, 2020Updated 6 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated 2 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Official code of our work, VCSR: Mutable CSR Graph Format Using Vertex-Centric Packed Memory Array [CCGrid 2022].☆15Jun 30, 2022Updated 4 years ago
- ☆11May 29, 2024Updated 2 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Feb 14, 2022Updated 4 years ago
- ☆30Sep 14, 2022Updated 4 years ago
- ☆14Apr 29, 2019Updated 7 years ago
- SECONDO is a generic database kernel that can be filled with implementations of different data models.☆16Sep 3, 2026Updated 2 weeks ago
- Packed Memory Array☆17May 14, 2014Updated 12 years ago
- Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent Memory☆18Sep 4, 2023Updated 3 years ago
- Python bindings for the PMDK. Non-volatile memory for Python.☆13Mar 22, 2023Updated 3 years ago
- End-to-end encrypted cloud storage - Proton Drive • AdSpecial offer: 40% Off Yearly / 80% Off First Month. Protect your most important files, photos, and documents from prying eyes.
- Parallel Balanced Binary Tree Structures☆121Mar 15, 2025Updated last year
- Concurrent (with OLC) Adaptive Radix Trie in Golang.☆12Jul 31, 2020Updated 6 years ago
- ☆12Mar 17, 2022Updated 4 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated last year
- Benchmarking framework for index structures on persistent memory☆92Aug 10, 2026Updated last month
- Cache Oblivious Lookahead Arrays☆27Jul 20, 2013Updated 13 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆30Nov 4, 2024Updated last year
- Sequential implementation of the Rewired Memory Array.☆20May 23, 2019Updated 7 years ago
- A simple implementation of the write-optimized Bε Tree 🌳 - for MIT 6.854 (Advanced Algorithms).