Ralph,
> When a row is orphaned it's added to a list of possibly available rows.
> When a new row is needed the list of possible rows is examined and the
> first one with a transaction id less then the lowest running transaction
> id is chosen to be the new row? These rows can be in a heap so it's
> really fast to find one.
This is the long-term plan. However, it's actually a lot harder than it
sounds. Patches welcome.
--
--Josh
Josh Berkus
Aglio Database Solutions
San Francisco