*BSD News Article 36651


Return to BSD News archive

Path: sserve!newshost.anu.edu.au!harbinger.cc.monash.edu.au!msuinfo!gmi!zombie.ncsc.mil!news.duke.edu!solaris.cc.vt.edu!uunet!fonorola!sentinel.synapse.net!orinoco!evanc
From: evanc@orinoco.synapse.net (Evan Champion)
Newsgroups: comp.unix.bsd
Subject: Berkeley db and Multiple Non-Unique Keys
Date: 7 Oct 1994 00:26:54 GMT
Organization: Babillard Synapse Inc. [819 246-2344] Gatineau, Quebec, Canada
Lines: 12
Distribution: inet
Message-ID: <3724ke$19a@sentinel.synapse.net>
NNTP-Posting-Host: orinoco.synapse.net
X-Newsreader: TIN [version 1.2 PL2]

I am trying to create a database using Berkeley db (the btree'd database,
to be exact) that would have multiple, non-unique keys.  Basically what I
would like db to do is be able to store all those non-unique keys and the
attached data, and then at a later date, be able to pull back out all the
data by doing multiple get/seq's on that particular key.

I think I've got the ability to store non-unique keys down (by using R_DUP)
but I have yet to be able to pull out more than the first record.

How do I accomplish what I described above?

Evan