in reply to Re: Giant Tie'd data structures
in thread Giant Tie'd data structures

I need something that can store, and retrieve, items of data with specific keys (which themselves store important data.)

I've just tried SQLite and it appears to be orders of magnitude slower, but I'm sure I'm just doing something wrong.

I know bdb can be used to store large GB of data--so which one should I be using? A Tie'd BTree maybe?

I'd love to educate myself about what the storage limitations are of the various tie methods. Doh! Help!

Replies are listed 'Best First'.
Re^3: Giant Tie'd data structures
by perrin (Chancellor) on Oct 26, 2005 at 01:26 UTC
    SQLite is a lot slower than Berkeley DB. A couple of tips for you:

    The error message says to increase page size. You are setting "bsize" which means block size. The page size parameter is called "psize."

    Also, you can tell it to use a BTree instead of a hash, and this is usually faster as well.

[reply]

In Section Seekers of Perl Wisdom