A little while back, I posted a short series on seeks and scans:
One of the things I highlighted in the middle post was the difference between a singleton seek and a range scan:
- 
A singleton equality seek always retrieves exactly one row, and is guaranteed to do so because a unique index exists to enforce it. 
- 
A range scan seeks down the B-tree to a starting (or ending) point, and scans forward (or backward) from that point using the next or previous page pointers. 
Today’s short post shows how much faster a singleton seek is, compared with a range scan, even when both return exactly the same number of records.

