Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> writes:
> Greg Stark <gsstark(at)mit(dot)edu> writes:
> > So should I set up a nested scan, essentially implementing a nested loop? or
> > should I gather together all the children in a list?
> I'd use the predigested form of the constraints attached to the Relation
> tupledescs, cf. RelationBuildTupleDesc, equalTupleDescs. It might be
> worth refactoring equalTupleDescs so you could share code --- ISTM what
> you're trying to implement is something like a "subsetTupleDesc".
Unless I'm missing something that predigested form only has the conbin field.
It doesn't have the name of the constraint nor the other fields like
deferrable and deferred by default. It also doesn't have foreign key
constraints which I'm ignoring now but suggesting that we will want to be
copying to children and checking for in new children in the future.
And subsetTupleDesc seems to be checking that the attributes are in the same
specific order, not that they match by name. That seems like a very different
kind of quality/subset nature than needed here.
In response to
pgsql-hackers by date
|Next:||From: Bill Bartlett||Date: 2006-06-12 19:04:55|
|Subject: Re: CSV mode option for pg_dump|
|Previous:||From: Alvaro Herrera||Date: 2006-06-12 19:00:13|
|Subject: Re: TODO: Add pg_get_acldef(), pg_get_typedefault(), pg_get_attrdef(),|
pgsql-patches by date
|Next:||From: Alvaro Herrera||Date: 2006-06-12 19:05:07|
|Subject: Re: Non-transactional pg_class, try 2|
|Previous:||From: Luke Lonergan||Date: 2006-06-12 17:11:07|
|Subject: Re: Bitmap index AM|