DownloadA capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases.
The original motivation for this tree was a better backend for memory managers.
However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of the new tree sub-category, there can be others.
In any case, read the PDF: “Capsule Trees - A Primer”, before delving into the code.
Features
- Designed to scale while reducing pointer chasing
- Designed for in-memory usage (unlike B-trees and B+ trees)
- In-node element placement (unlike B+ tree)
- Is its own min and max heap (while maintaining lookup in logarithmic time)
- Inherently by-order, bi-directional, traversable
License
GNU General Public License version 2.0 (GPLv2)Follow Capsule Tree
Other Useful Business Software
With Red Hat Enterprise Linux on Azure, businesses can confidently modernize their IT environment, knowing they don’t have to compromise on security, scalability, reliability, and ease of management. Securely accelerate innovation and unlock a competitive edge with enterprise-grade modern cloud infrastructure.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Capsule Tree!