Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Berkeley DB question

Berkeley DB question

From: Olivier Deme <odeme_at_titanic.rtxirl.ie>
Date: 2000/06/07
Message-ID: <Pine.LNX.4.10.10006070834400.4288-100000@titanic.rtxirl.ie>#1/1

Hello,

I am storing a large amount of key/data pairs in a Btree+ database. I generally have more than one possible data for one key.

My question is, if I store 2 entries with the same key that is, let's say, 20 bytes, does that mean that the key will be fully inserted again, the second time.
That is, the total amount of space used by the keys for both entries is 40 bytes?

Or is Berkeley DB managing duplicates in such a way that it is able to save space on key insertion?

This is important to me since I am working with very big databases in which, approximately 60% of entries have duplicated keys.

Thanks for your help,
Olivier


Olivier Deme                              
Software Engineer                               ~   
AIRTEL-ATN                                    .   . 
Phone:          +353-1-284 2821              /  v  \
                +353-1-214 7910 (Direct)    /(     )\    
Email:          olivier.deme_at_airtel-atn.com   ^^-^^
Web:            www.airtel-atn.com

-------------------------------------------------------------------------
Received on Wed Jun 07 2000 - 00:00:00 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US