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

Re: Implementation of a Ladder System

by steveAZ98 (Monk)
on May 12, 2001 at 00:11 UTC ( [id://79833]=note: print w/replies, xml ) Need Help??


in reply to Implementation of a Ladder System

I think I would handle it with a couple of tables. One for the users information and another table with a column for a Storable serialized object. I would create a datastructure with the rankings of the users and then store it to the database. The next time through I would retrieve that data structure, reorder however necessary and then store it back. You can use that datastructure to order (rank) your users and it only requires one update and one select for the ordering. I'm not sure how many user id's you could store in a single field, it would depend I guess on what you stored in your data structure. This would remove the flat file and would probably increase your performance. I haven't used this for anything myself as of yet, but it seems like it might be a good way to do what your looking for.

HTH,
Steve

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://79833]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others romping around the Monastery: (7)
As of 2024-03-28 12:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found