in reply to Re: Perl performance just gets better and better!
in thread Perl performance just gets better and better!
Since BerkeleyDB is used by all of our products, each year since Oracle bought Sleepycat Software, Inc., we have had an outside counsel review the dual licenses for BerkeleyDB. This year we used a new firm to review, and the outcome was not nice.
Two points (from memory):
But I think you should get your own legal advice! For us those statements and others were alarming!
When I get back to the office after the holidays, I'll put up some real numbers. But in general, our pure-perl DB performs better than expected (Note: my original goal was to get 20% of the BerkeleyDB performace and that would meet our company needs). On fixed length records that are multiples of 8 bytes, our pure-perl DB is +/- 10% of BerkeleyDB. But on random variable length key/value pairs ( 20 to 64 byte keys, and 64 to 768 byte values), we're beating BerkeleyDB by as much as 300%.
Why, because I wrote it to Perl's strengths and not to be a copy of a C program. For example, my first pass used only arrays. When I replaced the arrays with hashes, there was an immediate performance boost. Perl's lookups are much faster than mine. After profiling, 'sort' showed up below 'pack/unpack' on the list of routines. Not worth trying to improve!
And, thanks to some questions from BrowserUk, we can support databases as large as 1024TBytes on 32/64 bit, big/little endian machines.
Thank you
"Well done is better than well said." - Benjamin Franklin
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: Perl performance just gets better and better!
by Anonymous Monk on Dec 23, 2011 at 19:28 UTC | |
by flexvault (Monsignor) on Dec 23, 2011 at 20:00 UTC | |
by Anonymous Monk on Dec 23, 2011 at 20:17 UTC | |
|
Re^3: Perl performance just gets better and better!
by vkon (Curate) on Dec 23, 2011 at 20:30 UTC |