From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Single file resident B-tree library?
Date: Thu, 16 Jan 2014 17:12:08 +0100
Date: 2014-01-16T17:12:08+01:00 [thread overview]
Message-ID: <4i4mwx1uinnc$.54e8vzuvkfxl.dlg@40tude.net> (raw)
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
reply other threads:[~2014-01-16 16:12 UTC|newest]
Thread overview: [no followups] expand[flat|nested] mbox.gz Atom feed
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox