diff options
Diffstat (limited to 'src/backend/commands/analyze.c')
| -rw-r--r-- | src/backend/commands/analyze.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/src/backend/commands/analyze.c b/src/backend/commands/analyze.c index 6cb545c1265..d7004e53138 100644 --- a/src/backend/commands/analyze.c +++ b/src/backend/commands/analyze.c @@ -1048,13 +1048,13 @@ acquire_sample_rows(Relation onerel, int elevel, * The first targrows sample rows are simply copied into the * reservoir. Then we start replacing tuples in the sample until * we reach the end of the relation. This algorithm is from Jeff - * Vitter's paper (see full citation below). It works by - * repeatedly computing the number of tuples to skip before - * selecting a tuple, which replaces a randomly chosen element of - * the reservoir (current set of tuples). At all times the - * reservoir is a true random sample of the tuples we've passed - * over so far, so when we fall off the end of the relation we're - * done. + * Vitter's paper (see full citation in utils/misc/sampling.c). It + * works by repeatedly computing the number of tuples to skip + * before selecting a tuple, which replaces a randomly chosen + * element of the reservoir (current set of tuples). At all times + * the reservoir is a true random sample of the tuples we've + * passed over so far, so when we fall off the end of the relation + * we're done. */ if (numrows < targrows) rows[numrows++] = ExecCopySlotHeapTuple(slot); |