Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: Re: Node cache refactoring (DBI profiling)

by cleverett (Friar)
on Nov 18, 2003 at 20:25 UTC ( #308109=note: print w/replies, xml ) Need Help??


in reply to Re: Node cache refactoring (DBI profiling)
in thread Node cache refactoring

quoth tye:

I've currently tested it with loading some pages and found that a typical page load requires between 200 and 800 SQL statements at PerlMonks and 1 CPU second of web server time. The thread-that-must-not-be-named takes about 1500 SQL statements (a few more if not done anonymously) and 8 CPU seconds.

On casual reflection, that seems grossly inefficient to me (not to take away from the original author(s) of this marvelous resource).

Of course you plan to look at consolidating the queries.

  • Comment on Re: Re: Node cache refactoring (DBI profiling)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://308109]
help
Chatterbox?
[LanX]: interesting the author doesn't seem to accept javascript as a scripting language
[LanX]: ... and calls php7 the winner oO
[RonW]: RPerl is only a curiosity to me. I can see where some one who primarily codes in Perl might find RPerl useful, but to me, given the choice between RPerl's restrictions and C, I'd choose C

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (7)
As of 2017-05-22 20:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?