News for hackers. Stuff that matters.
Re:How does a B-tree make queries fast? by valenterry on Saturday December 23, 2023 @11:59PM (#38751264)
> On the other hand, analytics queries touching a high proportion of rows with joins on equality conditions (ie. hash joinable) isn't going to go any faster with an index.

That's when you bring a BRIN to the table. :-)

Re:How does a B-tree make queries fast? by nojvek on Sunday December 24, 2023 @01:53PM (#38755634)
Or change the layout entirely to clustered columnstore from row store.

All databases are datastructures on disk and memory optimized for specific access and write patterns.