On Mon, Jan 27, 2014 at 12:03 PM, Amit Kapila <amit.kapil...@gmail.com> wrote: >> I think that's a good thing to try. Can you code it up? > > I have tried to improve algorithm in another way so that we can get > benefit of same chunks during find match (something similar to lz). > The main change is to consider chunks at fixed boundary (4 byte) > and after finding match, try to find if there is a longer match than > current chunk. While finding longer match, it still takes care that > next bigger match should be at chunk boundary. I am not > completely sure about the chunk boundary may be 8 or 16 can give > better results. > > I think now we can once run with this patch on high end m/c.
Here are the results I got on the community PPC64 box. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company
pgrb-v5 test.ods
Description: application/vnd.oasis.opendocument.spreadsheet
-- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
