SparseBitmap::set, test and clear spend most it's run time in relatively costly BePlusTree::locate method.
As bunch of bits reside on the same BePlusTree node we can avoid unnecessary call's to BePlusTree::locate when many SparseBitmap operations done with consecutive values. It often happens when we do an index scan as key duplicates now sorted by record numbers

Description

SparseBitmap::set, test and clear spend most it's run time in relatively costly BePlusTree::locate method.
As bunch of bits reside on the same BePlusTree node we can avoid unnecessary call's to BePlusTree::locate when many SparseBitmap operations done with consecutive values. It often happens when we do an index scan as key duplicates now sorted by record numbers