When dealing with databases, developers frequently run into the N+1 problem, in which they populate domain objects via queries in loops. This causes terrible performance drags. There is a solution in plain PHP that makes the number of queries constant to increase performance overall. The talk shows typical PHP code involving the N+1 problem, then shows how to solve the problem in plain PHP (that is, without a framework or ORM), and includes editorializing about the origins of the N+1 problem in the developer mindset.
23:00 |
A Stitch In Time Saves 9; or, Solving the N+1 Problem
Talk by Paul M. Jones (1 hour) A Stitch In Time Saves 9; or, Solving the N+1 Problem |