Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options

Re: Databases and tied hashes.

by Trimbach (Curate)
on Feb 11, 2001 at 07:40 UTC ( #57698=note: print w/replies, xml ) Need Help??

in reply to Databases and tied hashes.

I've set up a CGI/GDBM database combo that currently has about 4,500 records with 15-25 added each day. The traffic is alot less than you're expecting (I get about 50 accesses per day) but the system works very well with no perceivable loss of performance.

I'll bet that if you're not adding a ton of records you might be ok with GDBM. Even if the db is locked for reading, (does anyone know if GDBM does this?) the access is quick enough that even under the kind of load you're talking about you'll probably still be ok.

However, I have recently (in the past few months) graduated to using DBI and mySQL and I have to say that the learning curve really isn't that steep and the "real" dbs make lots of things much easier to do than the tied hash dbs. I always hated rolling my own routines to split and join records to do inserts and updates. So much easier in mySQL. If you have mySQL (or similar) available to you you won't regret moving your project over... and you'll probably get to trim alot of your code in the process.

Gary Blackburn
Trained Killer

Replies are listed 'Best First'.
Re (tilly) 2: Databases and tied hashes.
by tilly (Archbishop) on Feb 11, 2001 at 08:02 UTC
    If you are using complex records, then I agree that MySQL is better. But there are still some uses where I would still want to just pull out MLDBM. (Which eliminates all of your need to think about splitting fields yourself.)

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://57698]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (2)
As of 2021-10-25 23:54 GMT
Find Nodes?
    Voting Booth?
    My first memorable Perl project was:

    Results (90 votes). Check out past polls.