"Florian G. Pflug" <fgp@phlo.org> writes:
> Using perl, and a perl-hash was even slower, so I wrote my to c-functions
> (actualy c++), which use a STL hash_set to filter out duplicates.
This makes me fairly nervous, because what's going to ensure that the
memory used by the hash_set is reclaimed? Particularly if the query
errors out partway through?
regards, tom lane
