Replace the parser's namespace tree (which formerly had the same
Tom Lane <tgl@sss.pgh.pa.us>
Replace the parser's namespace tree (which formerly had the same representation as the jointree) with two lists of RTEs, one showing the RTEs accessible by qualified names, and the other showing the RTEs accessible by unqualified names. I think this is conceptually simpler than what we did before, and it's sure a whole lot easier to search. This seems to eliminate the parse-time bottleneck for deeply nested JOIN structures that was exhibited by phil@vodafone.
Files
| Path | Change | +/− |
|---|---|---|
| src/backend/catalog/heap.c | modified | +2 −2 |
| src/backend/commands/tablecmds.c | modified | +2 −2 |
| src/backend/parser/analyze.c | modified | +43 −39 |
| src/backend/parser/parse_clause.c | modified | +175 −122 |
| src/backend/parser/parse_relation.c | modified | +74 −274 |
| src/backend/parser/parse_target.c | modified | +15 −35 |
| src/backend/utils/adt/ruleutils.c | modified | +3 −7 |
| src/include/nodes/parsenodes.h | modified | +6 −6 |
| src/include/parser/parse_node.h | modified | +16 −8 |
| src/include/parser/parse_relation.h | modified | +5 −4 |