Description
Currently, each point lookup traverses the B-Trees of the primary index top to bottom, which is inefficient. Since the keys produced by searching secondary indexes are sorted, the next record could reside in the same leaf page of the primary index. Hence no need to for re-traversing the B-Tree again.
Attachments
Issue Links
- links to