Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Re: Random Top Nodes (nice)

by liz (Monsignor)
on Feb 08, 2004 at 14:01 UTC ( #327456=note: print w/replies, xml ) Need Help??


in reply to Re: Random Top Nodes (nice)
in thread Random Top Nodes

...while a separate node lists a random selection of all-time best nodes.

I would be for that. And I think that could be done rather cheaply by just determining the top 1000 nodes of all time only once a day or so. If it were plain mod_perl, I would just store the id's of those 1000 in an array at a server start time (before forking) and randomly select from that from memory without ever touching the disk. It would only make startup a little longer, but would not affect runtime in general.

Liz

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://327456]
help
Chatterbox?
Discipulus there are none so deaf as those who will not hear..
Discipulus who do not want to ear
[Corion]: marto: No, I haven't seen anything either and I'm not sure if learning-by- osmosis will work here
[marto]: I've experienced the behavior LanX described, outsourcing really opens your eyes to the situation :)
[Discipulus]: ;=)

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (6)
As of 2017-03-30 07:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Should Pluto Get Its Planethood Back?



    Results (353 votes). Check out past polls.