diff options
author | Tom Lane <tgl@sss.pgh.pa.us> | 2019-03-03 16:57:14 -0500 |
---|---|---|
committer | Tom Lane <tgl@sss.pgh.pa.us> | 2019-03-03 16:57:14 -0500 |
commit | 80b9e9c4664a020ebd14889046bd8d22a17d1ca6 (patch) | |
tree | 62d9c7a81806693ff9c8c7e01f438f0fa0b64596 /src/backend/executor | |
parent | 78b408a20a5a19486f0ed833466d0de342c7e471 (diff) | |
download | postgresql-80b9e9c4664a020ebd14889046bd8d22a17d1ca6.tar.gz postgresql-80b9e9c4664a020ebd14889046bd8d22a17d1ca6.zip |
Improve performance of index-only scans with many index columns.
StoreIndexTuple was a loop over index_getattr, which is O(N^2)
if the index columns are variable-width, and the performance
impact is already quite visible at ten columns. The obvious
move is to replace that with a call to index_deform_tuple ...
but that's *also* a loop over index_getattr. Improve it to
be essentially a clone of heap_deform_tuple.
(There are a few other places that loop over all index columns
with index_getattr, and perhaps should be changed likewise,
but most of them don't seem performance-critical. Anyway, the
rest would mostly only be interested in the index key columns,
which there aren't likely to be so many of. Wide index tuples
are a new thing with INCLUDE.)
Konstantin Knizhnik
Discussion: https://postgr.es/m/e06b2d27-04fc-5c0e-bb8c-ecd72aa24959@postgrespro.ru
Diffstat (limited to 'src/backend/executor')
-rw-r--r-- | src/backend/executor/nodeIndexonlyscan.c | 20 |
1 files changed, 7 insertions, 13 deletions
diff --git a/src/backend/executor/nodeIndexonlyscan.c b/src/backend/executor/nodeIndexonlyscan.c index 72c04b528f5..26758e77039 100644 --- a/src/backend/executor/nodeIndexonlyscan.c +++ b/src/backend/executor/nodeIndexonlyscan.c @@ -269,23 +269,17 @@ IndexOnlyNext(IndexOnlyScanState *node) static void StoreIndexTuple(TupleTableSlot *slot, IndexTuple itup, TupleDesc itupdesc) { - int nindexatts = itupdesc->natts; - Datum *values = slot->tts_values; - bool *isnull = slot->tts_isnull; - int i; - /* - * Note: we must use the tupdesc supplied by the AM in index_getattr, not - * the slot's tupdesc, in case the latter has different datatypes (this - * happens for btree name_ops in particular). They'd better have the same - * number of columns though, as well as being datatype-compatible which is - * something we can't so easily check. + * Note: we must use the tupdesc supplied by the AM in index_deform_tuple, + * not the slot's tupdesc, in case the latter has different datatypes + * (this happens for btree name_ops in particular). They'd better have + * the same number of columns though, as well as being datatype-compatible + * which is something we can't so easily check. */ - Assert(slot->tts_tupleDescriptor->natts == nindexatts); + Assert(slot->tts_tupleDescriptor->natts == itupdesc->natts); ExecClearTuple(slot); - for (i = 0; i < nindexatts; i++) - values[i] = index_getattr(itup, i + 1, itupdesc, &isnull[i]); + index_deform_tuple(itup, itupdesc, slot->tts_values, slot->tts_isnull); ExecStoreVirtualTuple(slot); } |