Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!think.com!linus!nixbur!nixpbe!peun33!mboen From: mboen@nixdorf.de (Martin Boening) Newsgroups: comp.unix.programmer Subject: Re: PUBLIC DOMAIN RELAT. DB ? (addendum) Message-ID: Date: 18 Nov 90 14:20:32 GMT References: <2300@sixhub.UUCP> <1990Nov16.163718.8675@abcfd20.larc.nasa.gov> <1990Nov16.170454.9304@abcfd20.larc.nasa.gov> Sender: news@nixpbe.nixdorf.de Lines: 18 Hi, after reading the answers to your question: I once saw a system of management routines (b+tree) posted on the net which implements a library for building DB systems. So you'd have to program you own DB system but you could use the b+tree library to do it. Supposedly (i'd have to check in our archives to see if I could check on what I'm saying here) the b+tree routines support variable length records and multiple keys. If you insist on dbm, an example implementation of dbm routines based on b+tree was also delivered. So maybe you want to check that out. -- Email: in the USA -> mboening.pad@nixdorf.com outside USA -> mboening.pad@nixdorf.de Paper Mail: Martin Boening, Nixdorf Computer AG, SNI STO SI 355, Pontanusstr. 55, 4790 Paderborn, W.-Germany (Phone: +49 5251 146155)