问题描述
我正在寻找一种使用磁盘文件存储树的轻量级开源分页 B+ 树实现.
I am looking for a lightweight opensource paging B+ tree implementation that uses a disk file for storing the tree.
到目前为止，我只找到了基于内存的实现，或某些东西 依赖于 QT (?!) 甚至无法编译.
So far I have found only memory-based implementations, or something that has dependency on QT (?!) and does not even compile.
现代 C++ 是首选，但 C 也可以.
Modern C++ is preferred, but C will do too.
我更喜欢避免完全可嵌入的 DBMS 解决方案，因为:1) 对于我的需求，可以使用最简单的磁盘文件组织的裸骨索引就足够了，不需要并发性、原子性和其他一切.2)我用它来设计我自己的索引，很可能会改变一些算法和存储布局.我想以最少的努力做到这一点.它不会是生产代码.
I prefer to avoid full embeddable DBMS solution, because: 1) for my needs bare bone index that can use the simplest possible disk file organization is enough, no need for concurrency, atomicity and everything else. 2) I am using this to prototype my own index, and most likely will change some of the algorithms and storage layout. I want to do that with a minimum of effort. It's not going to be production code.
推荐答案
http://people.csail.mit.edu/jaffer/WB.
您还可以考虑重新使用开源可嵌入数据库中的 B-Tree 实现.(BDB、SQLite 等)
You can also consider re-using the B-Tree implementations from an open source embeddable database. (BDB, SQLite etc)
这篇关于在 C++ 或 C 中寻找基于磁盘的 B+ 树实现的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持跟版网！