寻找在C基于磁盘的B +树的实现++或C [英] Looking for a disk-based B+ tree implementation in C++ or C

查看:452
本文介绍了寻找在C基于磁盘的B +树的实现++或C的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我要寻找一个使用磁盘文件存储树一个轻量级的开源呼叫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 ++是preferred,但按c也这样做。

Modern C++ is preferred, but C will do too.

我preFER,以避免全嵌入式数据库管理系统解决方案,因为:1)我的需求的可以用尽可能简单的磁盘文件组织裸骨指标就足够了,没有必要的并发性,原子和其他一切。 2)我使用这个原型我自己的指数,而且很可能会改变一些算法和存储布局的。我想这样做,用最少的努力。它不会是生产code。

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 /贾弗/ WB

您也可以考虑重新使用B树实现从一个开源的嵌入式数据库。 ( BDB ,的 SQLite的等)

You can also consider re-using the B-Tree implementations from an open source embeddable database. (BDB, SQLite etc)

这篇关于寻找在C基于磁盘的B +树的实现++或C的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆