Path: utzoo!attcan!uunet!vsi!friedl
From: friedl@vsi.UUCP (Stephen J. Friedl)
Newsgroups: comp.databases
Subject: Re: Large Databases
Summary: Reposted from comp.unix.questions
Message-ID: <838@vsi.UUCP>
Date: 15 Sep 88 01:10:29 GMT
References: <8194@alice.UUCP>
Distribution: na
Organization: V-Systems, Inc. -- Santa Ana, CA
Lines: 25

Hi folks, this was in comp.unix.{wizards,questions} and belongs
on comp.databases.  Please don't reply to me...

In article <8194@alice.UUCP>, andrew@alice.UUCP (Andrew Hume) writes:
< 
< does anyone know of, or can recommend, any UNIX database packages
< than can handle large databases? for the purpose of this question,
< consider large to mean 10^7 tuples. the keys average 40-60 bytes,
< the data averages about 30 bytes. i need real fast lookup by key,
< reasonably fast update and plausibly fast traversal of all keys.
< i have been using weinbergers compressed B-trees but my b-tree is
< now 4 levels deep (thus breaking the rule that all b-trees are 3 deep)
< and i have to rebuild the database too often (12 CPU hrs on a 750).
< 
< PLEASE mail replies to me directly, i will post a summary to the net
< if requested.
< 
< 	andrew hume
< 	andrew@research.att.com
< 	research!andrew

-- 
Steve Friedl    V-Systems, Inc.  +1 714 545 6442    3B2-kind-of-guy
friedl@vsi.com     {backbones}!vsi.com!friedl    attmail!vsi!friedl
------------Nancy Reagan on conductance: "Just say mho"------------