On Tue, 2008-04-08 at 12:26 +0300, Hannu Krosing wrote: > Probably we could do without sparse files, if we find an efficient way > to compute the "add order" of leaf and parent pages for above algorithm.
if we always add only the minimal needed set of parents then the order will look something like 1: 0 2: 1 3: (0-1) 4: 2 5: (0-3) 6: 3 7: (2-3) 8: 4 9: (0-7) 10: 5 11: (4-5) 12. 6 13: (4-7) 13: 7 14: (6-7) seems pretty regular :) and is probably easy to expand into pages ------------ Will work on this a little more -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
