What are the low level implementation details that make set based operations exponentially faster than iterative processes, like [cursors](https://en.wikipedia.org/wiki/Cursor_(databases))?

At a memory level how does a set operation "touch" the data less than a cursor?