On Fri, Jan 30, 2004 at 09:48:19AM -0500, Tom Lane wrote: > A variant is to make the per-page bit arrays be entries in a hash table > with page number as hash key. This would reduce insertion to a nearly > constant-time operation, but the drawback is that you'd need an explicit > sort at the end to put the per-page entries into page number order > before you scan 'em. You might come out ahead anyway, not sure.
Is there a reason sort the pages before scanning them? The result won't come out sorted one way or the other. -- Alvaro Herrera (<alvherre[a]dcc.uchile.cl>) "Para tener más hay que desear menos" ---------------------------(end of broadcast)--------------------------- TIP 4: Don't 'kill -9' the postmaster
