pg.ddx.io  pgsql-performance@postgresql.org mailing list archive  
help / color / mirror / Atom feed
From: Andrew Dunstan <andrew@dunslane.net>
To: Tom Lane <tgl@sss.pgh.pa.us>
Cc: josh@agliodbs.com, Greg Stark <gsstark@mit.edu>
Cc: Marko Ristola <marko.ristola@kolumbus.fi>
Cc: pgsql-perform <pgsql-performance@postgresql.org>
Cc: pgsql-hackers@postgresql.org
Subject: Re: [HACKERS] Bad n_distinct estimation; hacks suggested?
Date: Sun, 24 Apr 2005 13:58:10 -0400
Message-ID: <426BDE32.4070004@dunslane.net> (raw)
In-Reply-To: <25382.1114318139@sss.pgh.pa.us>
References: <200504191209.05181.josh@agliodbs.com>
	<200504221336.08325.josh@agliodbs.com>
	<8764ydapky.fsf@stark.xeocode.com>
	<200504231639.11897.josh@agliodbs.com>
	<25382.1114318139@sss.pgh.pa.us>



Tom Lane wrote:

>Josh Berkus <josh@agliodbs.com> writes:
>  
>
>>Overall, our formula is inherently conservative of n_distinct.   That is, I 
>>believe that it is actually computing the *smallest* number of distinct 
>>values which would reasonably produce the given sample, rather than the 
>>*median* one.  This is contrary to the notes in analyze.c, which seem to 
>>think that we're *overestimating* n_distinct.  
>>    
>>
>
>Well, the notes are there because the early tests I ran on that formula
>did show it overestimating n_distinct more often than not.  Greg is
>correct that this is inherently a hard problem :-(
>
>I have nothing against adopting a different formula, if you can find
>something with a comparable amount of math behind it ... but I fear
>it'd only shift the failure cases around.
>
>
>  
>

The math in the paper does not seem to look at very low levels of q (= 
sample to pop ratio).

The formula has a range of [d,N]. It appears intuitively (i.e. I have 
not done any analysis) that at very low levels of q, as f1 moves down 
from n, the formula moves down from N towards d very rapidly. I did a 
test based on the l_comments field in a TPC lineitems table. The test 
set has N = 6001215, D =  2921877. In my random sample of 1000 I got d = 
976 and f1 = 961, for a DUJ1 figure of 24923, which is too low by 2 
orders of magnitude.

I wonder if this paper has anything that might help: 
http://www.stat.washington.edu/www/research/reports/1999/tr355.ps - if I 
were more of a statistician I might be able to answer :-)

cheers

andrew





view thread (53+ messages)  latest in thread

Message-ID: <426BDE32.4070004@dunslane.net>
Permalink:  ../426BDE32.4070004@dunslane.net/
Also on:    postgresql.org/message-id/426BDE32.4070004@dunslane.net

 · 

reply

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Reply to all the recipients using the --to and --cc options:
  reply via email

  To: pgsql-performance@postgresql.org
  Cc: andrew@dunslane.net, tgl@sss.pgh.pa.us, gsstark@mit.edu, marko.ristola@kolumbus.fi, pgsql-hackers@postgresql.org
  Subject: Re: [HACKERS] Bad n_distinct estimation; hacks suggested?
  In-Reply-To: <426BDE32.4070004@dunslane.net>

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox