Create infrastructure for 'MinimalTuple' representation of in-memory
Tom Lane <tgl@sss.pgh.pa.us>
Create infrastructure for 'MinimalTuple' representation of in-memory tuples with less header overhead than a regular HeapTuple, per my recent proposal. Teach TupleTableSlot code how to deal with these. As proof of concept, change tuplestore.c to store MinimalTuples instead of HeapTuples. Future patches will expand the concept to other places where it is useful.
Files
| Path | Change | +/− |
|---|---|---|
| contrib/tablefunc/tablefunc.c | modified | +8 −14 |
| src/backend/access/common/heaptuple.c | modified | +174 −4 |
| src/backend/commands/portalcmds.c | modified | +2 −11 |
| src/backend/executor/execTuples.c | modified | +127 −12 |
| src/backend/executor/nodeFunctionscan.c | modified | +5 −10 |
| src/backend/executor/nodeMaterial.c | modified | +20 −24 |
| src/backend/executor/tstoreReceiver.c | modified | +2 −2 |
| src/backend/tcop/pquery.c | modified | +4 −8 |
| src/backend/utils/sort/tuplestore.c | modified | +104 −26 |
| src/include/access/heapam.h | modified | +8 −2 |
| src/include/access/htup.h | modified | +66 −5 |
| src/include/executor/tuptable.h | modified | +23 −2 |
| src/include/utils/tuplestore.h | modified | +15 −9 |