aboutsummaryrefslogtreecommitdiff
path: root/src/backend/executor/nodeBitmapIndexscan.c
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2007-05-21 17:57:35 +0000
committerTom Lane <tgl@sss.pgh.pa.us>2007-05-21 17:57:35 +0000
commit2415ad983174164ff30ce487c0e6b4b53321b83a (patch)
tree8f3bae7fd588a6cfa9bcaf33e6e5ea5f1cf89a4d /src/backend/executor/nodeBitmapIndexscan.c
parent3963574d13383b4f377ab054e47e4af20cb75e7d (diff)
downloadpostgresql-2415ad983174164ff30ce487c0e6b4b53321b83a.tar.gz
postgresql-2415ad983174164ff30ce487c0e6b4b53321b83a.zip
Teach tuplestore.c to throw away data before the "mark" point when the caller
is using mark/restore but not rewind or backward-scan capability. Insert a materialize plan node between a mergejoin and its inner child if the inner child is a sort that is expected to spill to disk. The materialize shields the sort from the need to do mark/restore and thereby allows it to perform its final merge pass on-the-fly; while the materialize itself is normally cheap since it won't spill to disk unless the number of tuples with equal key values exceeds work_mem. Greg Stark, with some kibitzing from Tom Lane.
Diffstat (limited to 'src/backend/executor/nodeBitmapIndexscan.c')
0 files changed, 0 insertions, 0 deletions