* Wanted: Ada B+tree (in memory) pkg
@ 1993-01-19 20:42 K. A. Kelley
0 siblings, 0 replies; 2+ messages in thread
From: K. A. Kelley @ 1993-01-19 20:42 UTC (permalink / raw)
Does anybody out there have available a memory-efficient B+-tree package in
Ada (for memory, not files)?
--
______________________________________________________________________
/ Kris A. Kelley kkelley@vitro.com | "Subsidize something, and |
__ / Vitro Corporation (301) 231-3016 | you get more of it" |
\ / 14000 Georgia Ave. | - Jack Kemp |
\ / Silver Spring, MD 20906-2972
*
^ permalink raw reply [flat|nested] 2+ messages in thread
* Re: Wanted: Ada B+tree (in memory) pkg
@ 1993-01-19 22:51 news.uiowa.edu!news
0 siblings, 0 replies; 2+ messages in thread
From: news.uiowa.edu!news @ 1993-01-19 22:51 UTC (permalink / 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
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~1993-01-19 22:51 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1993-01-19 22:51 Wanted: Ada B+tree (in memory) pkg news.uiowa.edu!news
-- strict thread matches above, loose matches on Subject: below --
1993-01-19 20:42 K. A. Kelley
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox