Create infrastructure for 'MinimalTuple' representation of in-memory
authorTom Lane <tgl@sss.pgh.pa.us>
Tue, 27 Jun 2006 02:51:40 +0000 (02:51 +0000)
committerTom Lane <tgl@sss.pgh.pa.us>
Tue, 27 Jun 2006 02:51:40 +0000 (02:51 +0000)
commita12890f3a9e2033d8ccd65c2a566376f9aab1d19
treef20ad04d687c66b2a5c6ae5c56071415c0651060
parent238869b4944e507d097388d3add10f66f45bce55
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.
13 files changed:
contrib/tablefunc/tablefunc.c
src/backend/access/common/heaptuple.c
src/backend/commands/portalcmds.c
src/backend/executor/execTuples.c
src/backend/executor/nodeFunctionscan.c
src/backend/executor/nodeMaterial.c
src/backend/executor/tstoreReceiver.c
src/backend/tcop/pquery.c
src/backend/utils/sort/tuplestore.c
src/include/access/heapam.h
src/include/access/htup.h
src/include/executor/tuptable.h
src/include/utils/tuplestore.h