From: | Nicolas Barbier <nicolas(dot)barbier(at)gmail(dot)com> |
---|---|
To: | Florian Pflug <fgp(at)phlo(dot)org> |
Cc: | Tomas Vondra <tv(at)fuzzy(dot)cz>, pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: proposal : cross-column stats |
Date: | 2010-12-24 10:23:50 |
Message-ID: | AANLkTimn293-Ab71nuMXyDsiJAbTwNxs_Sv64RO+Gh7h@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
2010/12/24 Florian Pflug <fgp(at)phlo(dot)org>:
> On Dec23, 2010, at 20:39 , Tomas Vondra wrote:
>
>> I guess we could use the highest possible value (equal to the number
>> of tuples) - according to wiki you need about 10 bits per element
>> with 1% error, i.e. about 10MB of memory for each million of
>> elements.
>
> Drat. I had expected these number to come out quite a bit lower than
> that, at least for a higher error target. But even with 10% false
> positive rate, it's still 4.5MB per 1e6 elements. Still too much to
> assume the filter will always fit into memory, I fear :-(
I have the impression that both of you are forgetting that there are 8
bits in a byte. 10 bits per element = 1.25MB per milion elements.
Nicolas
From | Date | Subject | |
---|---|---|---|
Next Message | Shigeru HANADA | 2010-12-24 10:51:27 | Re: SQL/MED - core functionality |
Previous Message | Pavel Golub | 2010-12-24 09:52:53 | Re: Cannot compile Pg 9.0.2 with MinGW under Windows |