> It’s not a myth. In the trite examples provided with tiny datasets they scale. The point of the article is that in general nested loop joins based on index s

> It’s not a myth. In the trite examples provided with tiny datasets they scale. The point of the article is that in general nested loop joins based on index scans/iteration scale in the sense that the amount of I/O incurred grows at logarithmic intervals, at least once you assume a fixed amount of rows are returned. The amount of I/O incurred is practically fixed past a certain point. It doesn't matter how much data you have! It may be that there are practical difficulties with ensuring that everything runs smoothly in the real world (e.g., availability of good statistics), but that doesn't make the author's point any less valid.