MySQL can use different storage models, including BerkeleyDB (BDB). How much overhead is it if you go the MySQL way -- compared if you use BDB directly?
Any other practical (speed and scaling) differences? (It is easier to use the SQL database, I assume.)
Disclaimer: I am a Postgresql person, so I might be totally confused. :-)
In reply to MySQL && BDB? (was Re: Perl's Hash vs BerkeleyDB vs MySQL)
by BerntB
in thread Perl's Hash vs BerkeleyDB vs MySQL
by monkfan
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |