dupuy@amsterdam.columbia.edu (Alexander Dupuy) (08/13/87)
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