Null, cyclic and reused b-tree children were skipped while row counts and row pages still read as complete, so a readable sibling could look like the whole table. Such skips, along with missing pages, wrong page kinds, skipped rows and walk limits, now mark a count as a lower bound and a row page as incomplete, while the readable rows are kept.