News for hackers. Stuff that matters.
Re:How does a B-tree make queries fast? by scotty79 on Sunday December 24, 2023 @12:34PM (#38755045)
That is a very valid scenario. But when you do those things you already know costs and benefits of the indexes so you are not going to be harmed by "no indexes = database slow" heuristc.

"database = fast" is way worse heuristic to believe in for the people that need heuristics to move on with what they are doing.

There are no comments on this comment yet.