News for hackers. Stuff that matters.
Re:How does a B-tree make queries fast? by sgarland on Sunday December 24, 2023 @08:48AM (#38753429)
> isn’t going to go any faster with an index

Depends on the data, and the index. A covering index would almost certainly be faster. But you said analytics, which implies large results from huge datasets, so it’s unlikely to fit into memory in the first place.

There are no comments on this comment yet.