From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: Single file resident B-tree library?
Date: Thu, 16 Jan 2014 17:12:08 +0100
Organization: cbb software GmbH
Message-ID: <4i4mwx1uinnc$.54e8vzuvkfxl.dlg@40tude.net>
Reply-To: mailbox@dmitry-kazakov.de
NNTP-Posting-Host: I5Na6+WsEzT8WoegI0VZTA.user.speranza.aioe.org
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
X-Complaints-To: abuse@aioe.org
User-Agent: 40tude_Dialog/2.0.15.1
X-Notice: Filtered by postfilter v. 0.8.2
Xref: news.eternal-september.org comp.lang.ada:18200
Date: 2014-01-16T17:12:08+01:00
List-Id: <comp.lang.ada>

Is there an Ada implementation of (under a commercially-friendly license)?

Something like this:

http://people.csail.mit.edu/jaffer/wb/C-Interface.html#C-Interface

with an ability to scan adjacent keys (ranges of keys). Yet better to be
able to attach some data to non-leaf nodes.

P.S. I know that SQLite3 uses B+ trees, but it has an SQL interface, while
I need something more light-weight. Berkeley DB does not support scanning,
right?

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de