Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!cbosgd!ihnp4!homxb!mtuxo!mtune!rutgers!rochester!bbn!uwmcsd1!lakesys!gryphon!cadovax!mitchell
From: mitchell@cadovax.UUCP
Newsgroups: comp.sys.att,comp.unix.questions,comp.unix.wizards
Subject: B-tree routines/package for Sys V.2,3 Unix...
Message-ID: <1832@cadovax.UUCP>
Date: Wed, 28-Oct-87 20:03:46 EST
Article-I.D.: cadovax.1832
Posted: Wed Oct 28 20:03:46 1987
Date-Received: Sat, 31-Oct-87 19:44:09 EST
Organization: Contel Business Systems, Torrance, CA
Lines: 20
Xref: utgpu comp.sys.att:1417 comp.unix.questions:4225 comp.unix.wizards:4862

Anybody know where I can get a set of B-tree routines that manage
b-trees?  Of specific importance is that the routines handle elements
with varable length records or variable length fields within records
(whatever the difference may be). Any relational DB stuff that doesn't limit
the size of data elements would do but that usually costs.

C-Isam for example does not handle variable length records :'( 

Public domain is preferred because this will go into a product and
paying royalties or big bucks up front is not very inviting to us.

Thanks in advance!!!



-- 
Mitchell Lerner
UUCP:  {ucbvax,ihnp4,decvax}!trwrb!cadovax!mitchell

"When I fight with my mind, my mind always wins" - Ben Hummel