> 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.
Aglio Database Solutions
In response to
pgsql-performance by date
|Next:||From: Ron||Date: 2005-08-30 23:02:28|
|Subject: Re: RAID Configuration Sugestion|
|Previous:||From: mark||Date: 2005-08-30 22:35:19|
|Subject: Re: 'Real' auto vacuum?|