Is it possible to traverse a B-tree database (possibly in non-index
order, with read-comiitted isolation) in a way such that most accesses
happen in on-disk order? Due to internal fragmentation,
whole-database scans are annoyingly slow once the database size
exceeds available RAM.
Would be using DB_RECNO or a sequence-based key a suitable workaround?
