From: news.uiowa.edu!news@uunet.uu.net (Douglas W. Jones,201H MLH,3193350740,3
Subject: Re: Wanted: Ada B+tree (in memory) pkg
Date: 19 Jan 93 22:51:27 GMT [thread overview]
Message-ID: <1993Jan19.225127.9792@news.uiowa.edu> (raw)
>From article <1993Jan19.154259.1@sep.vitro.com>,
by kkelley@vitro.com (K. A. Kelley):
> Does anybody out there have available a memory-efficient B+-tree package in
> Ada (for memory, not files)?
I can give you a splay-tree package in Ada, and that's not a bad way to
arrange lexicographic trees. They're binary instead of n-ary, but for
most purposes, the particular tree organization in memory isn't as
important as the set of operations it supports and the run-time for
those operations. Splay-trees are very good on both counts.
Doug Jones
jones@cs.uiowa.edu
next reply other threads:[~1993-01-19 22:51 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
1993-01-19 22:51 news.uiowa.edu!news [this message]
-- strict thread matches above, loose matches on Subject: below --
1993-01-19 20:42 Wanted: Ada B+tree (in memory) pkg K. A. Kelley
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox