Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

mldbm ndbm sdbm gdbm db :: what differences

by perlcapt (Pilgrim)
on Nov 06, 2004 at 12:48 UTC ( #405754=perlquestion: print w/ replies, xml ) Need Help??
perlcapt has asked for the wisdom of the Perl Monks concerning the following question:

Because of availability or compatibility issues of different platforms and Perls (Linux, Cygwin, ActiveState), I have had to move between database (key/record) libraries. This table gives an overview of the availability of many of these. I would love to know what the under-the-cover differences are. Why are some not available on some platforms? Why are some so much faster than others?
perlcapt
-ben

Comment on mldbm ndbm sdbm gdbm db :: what differences
Re: mldbm ndbm sdbm gdbm db :: what differences
by simonm (Vicar) on Nov 06, 2004 at 15:03 UTC
    Each of these modules is based on a different underlying C library that provides the implementation. (They weren't written specifically for Perl.)

    Because of differences in how the C code was written, some of those are simpler to compile in a particular environment than others, or run faster or slower.

Re: mldbm ndbm sdbm gdbm db :: what differences
by deliria (Hermit) on Nov 06, 2004 at 17:26 UTC

    Aside from those listed in the table, there's an alternative to DB_File (DBM) in BerkelyDB.

    Both DB_File and BerkeleyDB link to the libraries from Sleepycat, but the latter links to a newer version with better support for different table types, internal locking etc.

    I've been playing around with it lateley, and a table of 12 million records can be about 3 times faster then a regular mysql-isam table.

    The difference in speeds across the different versions mostly comes from the way the data is stored and the way data is retrieved from the table using sequential lookup, hashed lookup, tree-based indexing and how it reads from the database.

    I don't know enough about those modules other than DB_File and BerkeleyDB, but the the table in the link you provided shows most implementations use custom block-sizes, whereas BerkeleyDB uses the block-size of the underlying IO system, so a diskread fetches a full with 1 read. When I changed this to a custom value performance dropped significantly

    Hth,
    Deliria

Re: mldbm ndbm sdbm gdbm db :: what differences
by mspringer (Initiate) on Nov 06, 2004 at 19:08 UTC
    Ben, Thanks for the table it is helping us figure out several compatibility issues that we were encountering. Melissa Springer www.SovereignFunding.com

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: perlquestion [id://405754]
Approved by jfroebe
Front-paged by jfroebe
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (15)
As of 2014-08-28 13:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (261 votes), past polls