Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

What is a good open source B-tree implementation in C? [closed]

I am looking for a lean and well constructed open source implementation of a B-tree library written in C. It needs to be under a non-GPL license so that it can be used in a commercial application. Ideally, this library supports the B-tree index to be stored/manipulated as a disk file so that large trees can be built using a configurable (ie: minimal) RAM footprint.

Note: Since there seemed to be some confusion, a Binary Tree and a B-Tree are not the same thing.

like image 557
Tall Jeff Avatar asked Aug 28 '08 14:08

Tall Jeff


People also ask

What is a B-tree give example?

A B-tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. Unlike self-balancing binary search trees, it is optimized for systems that read and write large blocks of data. It is most commonly used in database and file systems.

What are the applications of B-tree?

Applications Of B Trees B trees are used to index the data especially in large databases as access to data stored in large databases on disks is very time-consuming. Searching of data in larger unsorted data sets takes a lot of time but this can be improved significantly with indexing using B tree.


1 Answers

The author of the SQLite implementation has disclaimed copyright. If LGPL is okay, then maybe you could use GNUpdate's implementation?

like image 123
A. Rex Avatar answered Oct 03 '22 22:10

A. Rex