Once the rowid has been obtained from the index, it is used to perform a binary search on the b-tree which constitutes table test. For ordinary tables, (those which are not WITHOUT ROWID tables), the rowid is the key by which the b-tree is ordered.
Once the rowid has been obtained from the index, it is used to perform a binary search on the b-tree which constitutes table test. For ordinary tables, (those which are not WITHOUT ROWID tables), the rowid is the key by which the b-tree is ordered.