{"content":"\n \n \n <\/a>\n <\/div>\n \n \n <\/span>\n <\/span>\n <\/span>\n <\/div>\n \n peppy<\/a>\n\n \n \n \n <\/div>\n\n <\/div>\n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 19,323 posts\n <\/a>\n <\/div>\n\n \n Here since the beginning<\/div>\n <\/div>\n <\/div>\n\n \n \n \n \n \n peppy<\/a>\n\n \n 2012-06-16T19:12:27+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n I am hoping to address this in a round-about way in the future. For now, due to my previously mentioned reasons, it is not possible.mmstick wrote:<\/h4>I don't see how this would be intensive to implement, plenty of other games do this. One way would be to store all scores on a server, only keeping the highest score a makes and the client simply grabs the data from the website database in real-time (similar to embedding a frame of a webpage). Another way would be for the clients to individually ask other clients for their highest local scores to sync with and promptly attempt to sync with friends clients when a new high score is obtained.<\/blockquote>You need an index per- per-beatmap ordered by score. As this information is obviously not stored in a single table, it means duplicating a lot of data, which all needs to be updated on a regular basis. Making this an efficient lookup is one of the most challenging query types for a database. It of course can be done, but requires a lot of optimisation, consideration and storage space.Your solutions may sound simple to you, but aren't actually feasible due to over-simplication (suggestion 1) or incorrect approach (suggestion 2).<\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n <\/a>\n <\/div>\n \n \n asdsasd123<\/a>\n\n \n \n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 2 posts\n <\/a>\n <\/div>\n\n \n ed February 2011<\/strong>\n <\/div>\n <\/div>\n\n \n \n \n \n \n asdsasd123<\/a>\n\n \n 2012-06-17T06:33:23+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n definitely a great idea....tired of going through asking friends their ranks\/scoreskinda annoying<\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n <\/a>\n <\/div>\n \n \n theowest<\/a>\n\n \n osu! Alumni\n <\/div>\n \n \n \n <\/a>\n\n <\/div>\n \n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 6,891 posts\n <\/a>\n <\/div>\n\n \n ed January 2009<\/strong>\n <\/div>\n <\/div>\n\n \n \n \n \n \n theowest<\/a>\n\n \n 2012-06-17T14:50:55+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n This looks awesome for now:<\/span>SPOILER<\/a><\/div><\/div><\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n <\/a>\n <\/div>\n \n \n Minty Gum<\/a>\n\n \n \n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 298 posts\n <\/a>\n <\/div>\n\n \n ed June 2011<\/strong>\n <\/div>\n <\/div>\n\n \n \n \n \n \n Minty Gum<\/a>\n\n \n 2012-06-21T06:43:07+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n This sounds fun... it would add something new to regular gameplay for me. Make things a bit more spicy <\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n <\/a>\n <\/div>\n \n \n lavalake<\/a>\n\n \n \n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 20 posts\n <\/a>\n <\/div>\n\n \n ed October 2011<\/strong>\n <\/div>\n <\/div>\n\n \n \n \n \n \n lavalake<\/a>\n\n \n 2012-06-30T04:54:13+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n I had the same idea. I do this idea, but this will be kind of hard to make. peppy wrote:<\/h4>I am hoping to address this in a round-about way in the future. For now, due to my previously mentioned reasons, it is not possible.mmstick wrote:<\/h4>I don't see how this would be intensive to implement, plenty of other games do this. One way would be to store all scores on a server, only keeping the highest score a makes and the client simply grabs the data from the website database in real-time (similar to embedding a frame of a webpage). Another way would be for the clients to individually ask other clients for their highest local scores to sync with and promptly attempt to sync with friends clients when a new high score is obtained.<\/blockquote>You need an index per- per-beatmap ordered by score. As this information is obviously not stored in a single table, it means duplicating a lot of data, which all needs to be updated on a regular basis. Making this an efficient lookup is one of the most challenging query types for a database. It of course can be done, but requires a lot of optimisation, consideration and storage space.Your solutions may sound simple to you, but aren't actually feasible due to over-simplication (suggestion 1) or incorrect approach (suggestion 2).<\/blockquote>This is kind of confusing to me. Whatever confusing must be hard, right?<\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n <\/a>\n <\/div>\n \n \n [Zappy]<\/a>\n\n \n \n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 118 posts\n <\/a>\n <\/div>\n\n \n ed January 2012<\/strong>\n <\/div>\n <\/div>\n\n \n \n \n \n \n [Zappy]<\/a>\n\n \n 2012-09-17T15:40:15+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n +2<\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n <\/a>\n <\/div>\n \n \n Skyara<\/a>\n\n \n \n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 52 posts\n <\/a>\n <\/div>\n\n \n ed January 2011<\/strong>\n <\/div>\n <\/div>\n\n \n \n \n \n \n Skyara<\/a>\n\n \n 2012-10-14T10:40:20+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n We can see when our friends are in the rank, so why can't we just make a filter for \"yellow players\" who are in the #400 ? I don't know if this is possible with those who are not :\/<\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n <\/a>\n <\/div>\n \n \n <\/span>\n <\/span>\n <\/span>\n <\/div>\n \n Soner Wolf<\/a>\n\n \n \n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 72 posts\n <\/a>\n <\/div>\n\n \n ed September 2011<\/strong>\n <\/div>\n <\/div>\n\n \n \n \n \n \n Soner Wolf<\/a>\n\n \n 2012-10-14T19:16:01+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n This is a wonderful idea! I actually wondering why something like this didn't exist when I first started playing a year ago. although I wasn't on the forums much, and didn't know you could make feature requests. I hope this gets added!<\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n <\/a>\n <\/div>\n \n \n jabberwockey<\/a>\n\n \n \n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 396 posts\n <\/a>\n <\/div>\n\n \n ed July 2011<\/strong>\n <\/div>\n <\/div>\n\n \n \n \n \n \n jabberwockey<\/a>\n\n \n 2012-10-15T08:17:57+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n I this, however if you learned how databases are made\/how to make one it's going to be very difficult. I'm trying to write a process tree down and it's giving me a headache <\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n ann_old\n <\/span>\n \n \n \n \n <\/div>\n\n \n \n \n \n \n ann_old<\/span>\n\n \n 2012-10-15T10:03:22+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n I'd love it. !<\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n - Akari -_old\n <\/span>\n \n \n \n \n <\/div>\n\n \n \n \n \n \n - Akari -_old<\/span>\n\n \n 2012-10-16T10:25:06+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n It could just be a client-side ranking filter that shows only friends scores.<\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n <\/a>\n <\/div>\n \n \n Synthox_old<\/a>\n\n \n \n \n \n \n <\/span>\n <\/a>\n <\/div>\n \n \n \n 15 posts\n <\/a>\n <\/div>\n\n \n ed July 2011<\/strong>\n <\/div>\n <\/div>\n\n \n \n \n \n \n Synthox_old<\/a>\n\n \n 2012-10-22T23:58:04+00:00<\/time>\n <\/a>\n <\/div>\n <\/div>\n\n <\/div>\n\n \n \n +1<\/div>\n <\/div>\n <\/div>\n\n \n \n <\/div>\n <\/div>\n \n \n \n 1z6d42