help / color / mirror / Atom feed
* Single file resident B-tree library?
@ 2014-01-16 16:12 Dmitry A. Kazakov
  0 siblings, 0 replies; only message in thread
From: Dmitry A. Kazakov @ 2014-01-16 16:12 UTC (permalink / raw)

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

Something like this:

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,

Dmitry A. Kazakov

^ permalink raw reply	[flat|nested] only message in thread

only message in thread, other threads:[~2014-01-16 16:12 UTC | newest]

Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2014-01-16 16:12 Single file resident B-tree library? Dmitry A. Kazakov

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox