Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!seismo!columbia!amsterdam!dupuy
From: dupuy@amsterdam.columbia.edu (Alexander Dupuy)
Newsgroups: comp.databases
Subject: Looking for ndbm(3) style b-tree routines.
Message-ID: <4902@columbia.edu>
Date: Thu, 13-Aug-87 16:14:02 EDT
Article-I.D.: columbia.4902
Posted: Thu Aug 13 16:14:02 1987
Date-Received: Sat, 15-Aug-87 10:08:12 EDT
Sender: nobody@columbia.edu
Reply-To: dupuy@amsterdam.columbia.edu (Alexander Dupuy)
Distribution: world
Organization: Columbia University Computer Science Dept.
Lines: 15

I am looking for a simple collection of low level database routines,
in the spirit of ndbm(3).  The reason I can't just use dbm is that I
need to be able to do indexing on partial keys, so the hashing
scheme used by dbm won't work.  Something using B-trees or ISAM would
do the trick quite nicely.  I don't even need file based access (i.e.
it can all run in memory) and in fact a memory based implementation
might even be better (although database size would be limited).

Any leads or pointers would be greatly appreciated.

@alex

---
arpanet: dupuy@columbia.edu
uucp:	...!seismo!columbia!dupuy