Paul wrote:
--- Tom Allison <[EMAIL PROTECTED]> wrote:

My first guess is to use "tie" to access a file of type DB_File.
The number of records is small <1000 but the record structure is going to be either a hash of hashes, hash of arrays, or similar.

One possible solution depends on your data structure.
Frequently hashes of hashes are convenient, but can eat up a lot of memory and program speed when they
get large. On the other hand, if your keys allow it,
you can often compund the *keys* and end up with a single hash, which is easily storable via DBM. e.g.:

I thought I would fill you in on my adventures.

I was playing with DB_File to tie in DB_BTREE type data.

The DBTREE data storage, for what I am doing, was better than 5X faster then DB_HASH (default). I'll stick with DBTREE for now.

I'm using tie-DB_BTREE to keep a list of email accounts for whitelisting & blacklisting of email. I expect this to remain <1,000 emails. I'll probably add some kind of expiration method to kill entries that haven't been active for a while...

--
I'd just as soon kiss a Wookie.
-- Princess Leia Organa


--
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]

Reply via email to