aboutsummaryrefslogtreecommitdiff
path: root/src/backend/utils/adt/xml.c
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2012-08-16 13:03:54 -0400
committerTom Lane <tgl@sss.pgh.pa.us>2012-08-16 13:03:54 -0400
commitf5983923d81d6327bdacf9d439a1536c4c8c4c15 (patch)
tree997abf7798809e86853da59c57efc23580817f6f /src/backend/utils/adt/xml.c
parent56ba337e6fdff1e7ecb916f3037c666a30a98af0 (diff)
downloadpostgresql-f5983923d81d6327bdacf9d439a1536c4c8c4c15.tar.gz
postgresql-f5983923d81d6327bdacf9d439a1536c4c8c4c15.zip
Allow create_index_paths() to consider multiple join bitmapscan paths.
In the initial cut at the "parameterized paths" feature, I'd simplified create_index_paths() to the point where it would only generate a single parameterized bitmap path per relation. Experimentation with an example supplied by Josh Berkus convinces me that that's not good enough: we really need to consider a bitmap path for each possible outer relation. Otherwise we have regressions relative to pre-9.2 versions, in which the planner picks a plain indexscan where it should have used a bitmap scan in queries involving three or more tables. Indeed, after fixing this, several queries in the regression tests show improved plans as a result of using bitmap not plain indexscans.
Diffstat (limited to 'src/backend/utils/adt/xml.c')
0 files changed, 0 insertions, 0 deletions