Jeff Janes:
That is such a beautiful little trick. I made a table with just ids, and a
query for it reads almost 10 times less buffers (as reported by explain
analyze buffers), and sure enough, after another reboot, query executes
about 10 times faster.
I'm not doing anything special with those r
a from another table, it would
work much, much faster since there would be very little to read from disk
after index lookup. But looks like there isn't.
So am I correct in assumption that as the amount of rows grows, query times
for rows that are not in memory (and considering how many of them
I have a table with roughly 300 000 rows, each row containing two large
strings - one is news article HTML, the other is news article plaintext.
The table has a bigint primary key.
A GIN index is used to do fulltext search on the plaintext part. All I want
to retrieve when I do fulltext search is
