Rew*_*ind 5 php mysql optimization
我不是一个很棒的php编码器(我来自C++).我只使用PHP进行数据库输入.
我有一个包含以下内容的数据库:
UserId (an unique int)
AsyncPointsAverage (float)
AsyncPointsAverageRank (a position based on the value immediately above)
AsyncPointsRecentAverage (float an average for the last 5 tests only)
AsyncPointsRecentAverageRank (a position based on the value immediately above)
Run Code Online (Sandbox Code Playgroud)
该表中有大约1000-1500个条目.每天早上和下午5人参加测试,影响他们的总体平均值和近期平均值.(这在其他地方更新,但这里没有显示.)在为这5个人计算之后,所有1000-1500的排名都将生效,所以我写了下面的代码.它是最佳的吗?
我最关心的是我正在进行大约1000次的MySql更新.那很好吗?我应该以另一种方式做吗?(也可以随意优化函数中的任何其他代码.正如我所说,我来自C++背景,所以不要真正了解php的细微差别.)
// Sorts by array entry 1
function ReRankCompareAverage($a, $b)
{
if($a[1] == $b[1]) return 0;
else return ($a[1] > $b[1] ? 1 : -1);
}
// Sorts by array entry 2
function ReRankCompareAverageRecent($a, $b)
{
if($a[2] == $b[2]) return 0;
else return ($a[2] > $b[2] ? 1 : -1);
}
function ReRank($db)
{
$i = 0, $j = 0;
$usersARR = null;
$stmt = $db->prepare("SELECT UserId, AsyncPointsAverage, AsyncPointsRecentAverage FROM studenttable");
$stmt->execute();
if($stmt && isset($stmt) && $stmt->rowCount() > 0)
{
$i = 0;
while(($row = $stmt->fetch(PDO::FETCH_ASSOC)))
{
$usersARR[$i][0] = intval($row['UserId']);
$usersARR[$i][1] = floatval($row['AsyncPointsAverage']);
$usersARR[$i][2] = floatval($row['AsyncPointsRecentAverage']);
$i++;
}
}
$stmt->closeCursor(); // mysql_free_result equivalent
// The first pass of $j == 3 does the ranking by Average, filling position $usersARR[][3] with that rank
// The second pass of $j == 4 does the ranking by AverageRecent, filling position $usersARR[][4] with that rank
for($j = 3, $j <= 4; $j++)
{
$iCompare = $j == 3 ? 1 : 2;
usort($usersARR, $j == 3 ? "ReRankCompareAverage" : "ReRankCompareAverageLast");
$count = count($usersARR);
if($count > 0)
{
// Start it off, with the person with the highest average is rank 1
$usersARR[$count - 1][$j] = 1; // Position $j is filled with the rank
// Now loop starting from the second one down
for($i = $count - 2, $rank = 1; $i >= 0; $i--)
{
// Only change the rank if the next one down is strictly lower than the one above, otherwise will share the same rank
if($usersARR[$i][$iCompare] < $usersARR[$i+1][$iCompare]) $rank = $count - $i; // Otherwise keep the same rank, because they are equal
$usersARR[$count - 1][$j] = $rank;
}
}
}
// Now $usersARR is filled with the correct rankings, and they are asscoiated with $UserId
// Now we must put all of these rankings into the database
$count = count($usersARR);
for($i = 0; $i < $count; $i++)
{
$stmt = $db->prepare("UPDATE studenttable SET AsyncPointsAverageRank=:AsyncPointsAverageRank, AsyncPointsRecentAverageRank=:AsyncPointsRecentAverageRank "
. "WHERE UserId=:UserId");
$stmt->execute(array(':AsyncPointsAverageRank' => $usersARR[$i][3],
':AsyncPointsRecentAverageRank' => $usersARR[$i][4],
':UserId' => $usersARR[$i][0]));
}
}
Run Code Online (Sandbox Code Playgroud)
您需要如何使用排名?也许您不需要存储排名?它们可以很容易地计算出来:
SELECT COUNT(*)
FROM studenttable
WHERE AsyncPointsAverage > $currentUserVariableAsyncPoints
Run Code Online (Sandbox Code Playgroud)
显示前 10 名:
SELECT * FROM studenttable ORDER BY AsyncPointsAverage DESC LIMIT 0,10
Run Code Online (Sandbox Code Playgroud)
ETC。
编辑:
要显示带有位置编号的完整排名,您可以在 PHP 中执行此操作(您已经拥有它 - 在获取行的循环内仅显示$i++变量)。或者你可以尝试使用纯SQL(我个人更喜欢它):
SET @rank=0; SELECT @rank := @rank +1 AS rank, UserId, AsyncPointsAverage
FROM studenttable
ORDER BY AsyncPointsAverage DESC
Run Code Online (Sandbox Code Playgroud)