⚡ Optimize random question selection to avoid ORDER BY rand() #12
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR optimizes the random question retrieval in
quiz_system_git/quiz.php.What
Replaced the following query pattern:
With a multi-step approach:
SELECT id ...).WHERE id IN (...)).Why
ORDER BY rand()is known to be inefficient on large tables because it typically forces the database to generate a random number for every row, create a temporary table, and perform a file sort (O(N log N)).By moving the shuffle logic to the application layer (which operates on lightweight integers) and only fetching the heavy row data for the displayed questions, we significantly reduce database load.
Verification
A benchmark script (using SQLite in-memory with 100,000 rows containing large text fields) showed a ~25% performance improvement (7.37s -> 5.51s). The improvement is expected to be even more significant on a production MySQL server where I/O and sorting overheads are higher.
The logic preserves the random display order of the questions.
PR created automatically by Jules for task 14001401200639589268 started by @xRahul