diff options
| author | Robert Haas | 2017-02-15 18:53:24 +0000 |
|---|---|---|
| committer | Robert Haas | 2017-02-15 18:53:24 +0000 |
| commit | 5262f7a4fc44f651241d2ff1fa688dd664a34874 (patch) | |
| tree | 8bccf6ebd560f5e081cbba37efa0ecb40d017fd2 /contrib/bloom/blcost.c | |
| parent | 51ee6f3160d2e1515ed6197594bda67eb99dc2cc (diff) | |
Add optimizer and executor support for parallel index scans.
In combination with 569174f1be92be93f5366212cc46960d28a5c5cd, which
taught the btree AM how to perform parallel index scans, this allows
parallel index scan plans on btree indexes. This infrastructure
should be general enough to support parallel index scans for other
index AMs as well, if someone updates them to support parallel
scans.
Amit Kapila, reviewed and tested by Anastasia Lubennikova, Tushar
Ahuja, and Haribabu Kommi, and me.
Diffstat (limited to 'contrib/bloom/blcost.c')
| -rw-r--r-- | contrib/bloom/blcost.c | 4 |
1 files changed, 3 insertions, 1 deletions
diff --git a/contrib/bloom/blcost.c b/contrib/bloom/blcost.c index 98a2228edf6..ba39f627fd2 100644 --- a/contrib/bloom/blcost.c +++ b/contrib/bloom/blcost.c @@ -24,7 +24,8 @@ void blcostestimate(PlannerInfo *root, IndexPath *path, double loop_count, Cost *indexStartupCost, Cost *indexTotalCost, - Selectivity *indexSelectivity, double *indexCorrelation) + Selectivity *indexSelectivity, double *indexCorrelation, + double *indexPages) { IndexOptInfo *index = path->indexinfo; List *qinfos; @@ -45,4 +46,5 @@ blcostestimate(PlannerInfo *root, IndexPath *path, double loop_count, *indexTotalCost = costs.indexTotalCost; *indexSelectivity = costs.indexSelectivity; *indexCorrelation = costs.indexCorrelation; + *indexPages = costs.numIndexPages; } |