mirror of
https://git.postgresql.org/git/postgresql.git
synced 2024-09-06 16:19:21 +02:00
of tuples when passing data up through multiple plan nodes. A slot can now hold either a normal "physical" HeapTuple, or a "virtual" tuple consisting of Datum/isnull arrays. Upper plan levels can usually just copy the Datum arrays, avoiding heap_formtuple() and possible subsequent nocachegetattr() calls to extract the data again. This work extends Atsushi Ogawa's earlier patch, which provided the key idea of adding Datum arrays to TupleTableSlots. (I believe however that something like this was foreseen way back in Berkeley days --- see the old comment on ExecProject.) A test case involving many levels of join of fairly wide tables (about 80 columns altogether) showed about 3x overall speedup, though simple queries will probably not be helped very much. I have also duplicated some code in heaptuple.c in order to provide versions of heap_formtuple and friends that use "bool" arrays to indicate null attributes, instead of the old convention of "char" arrays containing either 'n' or ' '. This provides a better match to the convention used by ExecEvalExpr. While I have not made a concerted effort to get rid of uses of the old routines, I think they should be deprecated and eventually removed.
74 lines
1.9 KiB
C
74 lines
1.9 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* index.h
|
|
* prototypes for index.c.
|
|
*
|
|
*
|
|
* Portions Copyright (c) 1996-2005, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* $PostgreSQL: pgsql/src/include/catalog/index.h,v 1.60 2005/03/16 21:38:09 tgl Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef INDEX_H
|
|
#define INDEX_H
|
|
|
|
#include "access/itup.h"
|
|
#include "catalog/pg_index.h"
|
|
#include "nodes/execnodes.h"
|
|
|
|
|
|
#define DEFAULT_INDEX_TYPE "btree"
|
|
|
|
/* Typedef for callback function for IndexBuildHeapScan */
|
|
typedef void (*IndexBuildCallback) (Relation index,
|
|
HeapTuple htup,
|
|
Datum *attdata,
|
|
char *nulls,
|
|
bool tupleIsAlive,
|
|
void *state);
|
|
|
|
|
|
extern Oid index_create(Oid heapRelationId,
|
|
const char *indexRelationName,
|
|
IndexInfo *indexInfo,
|
|
Oid accessMethodObjectId,
|
|
Oid tableSpaceId,
|
|
Oid *classObjectId,
|
|
bool primary,
|
|
bool isconstraint,
|
|
bool allow_system_table_mods,
|
|
bool skip_build);
|
|
|
|
extern void index_drop(Oid indexId);
|
|
|
|
extern IndexInfo *BuildIndexInfo(Relation index);
|
|
|
|
extern void FormIndexDatum(IndexInfo *indexInfo,
|
|
TupleTableSlot *slot,
|
|
EState *estate,
|
|
Datum *datum,
|
|
char *nullv);
|
|
|
|
extern void UpdateStats(Oid relid, double reltuples);
|
|
|
|
extern void setRelhasindex(Oid relid, bool hasindex,
|
|
bool isprimary, Oid reltoastidxid);
|
|
|
|
extern void setNewRelfilenode(Relation relation);
|
|
|
|
extern void index_build(Relation heapRelation, Relation indexRelation,
|
|
IndexInfo *indexInfo);
|
|
|
|
extern double IndexBuildHeapScan(Relation heapRelation,
|
|
Relation indexRelation,
|
|
IndexInfo *indexInfo,
|
|
IndexBuildCallback callback,
|
|
void *callback_state);
|
|
|
|
extern void reindex_index(Oid indexId);
|
|
extern bool reindex_relation(Oid relid, bool toast_too);
|
|
|
|
#endif /* INDEX_H */
|