At what point is it better to use a BTree rather than a PersistentDict
of Persistent values?  My goal is to keep only a few values in memory
at a time (for display) while still being able to iterate all values
efficiently (for an advanced search).

I assume a BTree with Persistent values is overkill since the BTree
value would be only a stub.

--
Mike Orr