RTS considers a table to visited for checking whether the table has any updates to be removed.

• Table is modified
• Durable timestamp is more than the stable timestamp
• Durable timestamp not found.
  When a table is considered to be processed for RTS, it loads all the internal pages into the memory to check whether the child pages have any newer updates or not? But this approach is having some performance problems when the tree is having many internal pages.

To avoid loading all the pages into the memory during tree walk, skip the pages by checking whether that subtree have any newer updates or not?