问题描述
我正在寻找使用磁盘文件存储树的轻量级开源分页B +树实现。
I am looking for a lightweight open source 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.
推荐答案
。
您还可以考虑重新 - 使用开源嵌入数据库中的B-Tree实现。 （，等）
You can also consider re-using the B-Tree implementations from an open source embeddable database. (BDB, SQLite etc)
这篇关于在C ++或C中寻找基于磁盘的B +树实现的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！