MySQL innodb seeks vs. contiguous reads tradeoff?

The optimiser should make the decision about how to implement the query. Just write it how you want it Use EXPLAIN to see roughly what it's done. It may be that it does two range scans on the index on pkey In general reading fewer rows is better.

You can also keep more of them in the buffer pool. Two range scans is better than one in the general case I am assuming that your table t1 will not fit in memory entirely, in which case it's mostly academic.

The optimiser should make the decision about how to implement the query. Just write it how you want it. Use EXPLAIN to see roughly what it's URL1 may be that it does two range scans on the index on pkey.

In general reading fewer rows is better. You can also keep more of them in the buffer pool. Two range scans is better than one in the general case.

I am assuming that your table t1 will not fit in memory entirely, in which case it's mostly academic.

You really need to supplement your two options with the output from EXPLAIN... it doesn't just matter which is theoretically faster, it matters what optimizations MySQL is going to have available. Let me guess for you: a) The ranged pkey lookup is very efficient because it's on a clustered index. For everything that is in the range it reads "next, next next" to check if X matches.

B) This is a series of point lookups. But it creates a temporary table even though you think it could pipeline the results to you(!) facebook.com/note.php?note_id=276225210932 My vote is almost certainly (a).

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.