Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
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?
[LanX]: yeah whatever ... I'm in the favorable condition to already autohiding him ... how can I judge the poor FOOLs who still see his contributions xD
[Eily]: he's been pretty saavy about threads that were implictly about him in the past. I think he might have deliberatly avoiding mentioning it for some reason (he got tired?)
[Eily]: he did mention one of his propositions: basically make it possible to ignore downvotes, by separating them more from the upvotes
Eily translate("Eilish ", "Proper English")

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (8)
As of 2017-07-24 17:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I came, I saw, I ...
























    Results (356 votes). Check out past polls.