On Wed, 9 Jan 2002 15:03:56 -0600, Moritz von Schweinitz wrote:
>it seemed as if b-trieve was somehow capable of storing data internally
>as trees or something like that, but i haven't heard anything about it
>for a while, so i guess it got a bit obsolete...
Then you should take a look at Berkeley DB, and, even closer to home,
tied hashes, with *DBM files. ("perldoc AnyDBM_File")
Also, indexes for plain SQL servers (I'm *not* talking about MS SQL
Server) are commonly stored in B-Tree's or related datastructures. See,
for example, MySQL's manual.
Obsolete my ass.
--
Bart.
