| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | John Naylor <john(dot)naylor(at)2ndquadrant(dot)com> |
| Cc: | Andrew Dunstan <andrew(dot)dunstan(at)2ndquadrant(dot)com>, Andres Freund <andres(at)anarazel(dot)de>, Joerg Sonnenberger <joerg(at)bec(dot)de>, David Rowley <david(dot)rowley(at)2ndquadrant(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: reducing the footprint of ScanKeyword (was Re: Large writable variables) |
| Date: | 2019-01-08 22:53:25 |
| Message-ID: | 15387.1546988005@sss.pgh.pa.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
John Naylor <john(dot)naylor(at)2ndquadrant(dot)com> writes:
> -As for the graph algorithm, I'd have to play with it to understand
> how it works.
I improved the comment about how come the hash table entry assignment
works. One thing I'm not clear about myself is
# A cycle-free graph is either empty or has some vertex of degree 1.
That sounds like a standard graph theory result, but I'm not familiar
with a proof for it.
regards, tom lane
| Attachment | Content-Type | Size |
|---|---|---|
| PerfectHash.pm | text/plain | 11.3 KB |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Joerg Sonnenberger | 2019-01-08 23:00:04 | Re: reducing the footprint of ScanKeyword (was Re: Large writable variables) |
| Previous Message | Michael Paquier | 2019-01-08 22:48:05 | Re: Displaying and dumping of table access methods |