mirror of
https://github.com/postgres/postgres.git
synced 2025-04-22 23:02:54 +03:00
ddb2d78de0
instead of only one. This should speed up planning (only one hash path to consider for a given pair of relations) as well as allow more effective hashing, when there are multiple hashable joinclauses.
42 lines
1.4 KiB
C
42 lines
1.4 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* nodeHash.h
|
|
*
|
|
*
|
|
*
|
|
* Portions Copyright (c) 1996-2002, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* $Id: nodeHash.h,v 1.26 2002/11/30 00:08:20 tgl Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef NODEHASH_H
|
|
#define NODEHASH_H
|
|
|
|
#include "nodes/plannodes.h"
|
|
|
|
extern TupleTableSlot *ExecHash(Hash *node);
|
|
extern bool ExecInitHash(Hash *node, EState *estate, Plan *parent);
|
|
extern int ExecCountSlotsHash(Hash *node);
|
|
extern void ExecEndHash(Hash *node);
|
|
extern HashJoinTable ExecHashTableCreate(Hash *node);
|
|
extern void ExecHashTableDestroy(HashJoinTable hashtable);
|
|
extern void ExecHashTableInsert(HashJoinTable hashtable,
|
|
ExprContext *econtext,
|
|
List *hashkeys);
|
|
extern int ExecHashGetBucket(HashJoinTable hashtable,
|
|
ExprContext *econtext,
|
|
List *hashkeys);
|
|
extern HeapTuple ExecScanHashBucket(HashJoinState *hjstate, List *hjclauses,
|
|
ExprContext *econtext);
|
|
extern void ExecHashTableReset(HashJoinTable hashtable, long ntuples);
|
|
extern void ExecReScanHash(Hash *node, ExprContext *exprCtxt, Plan *parent);
|
|
extern void ExecChooseHashTableSize(double ntuples, int tupwidth,
|
|
int *virtualbuckets,
|
|
int *physicalbuckets,
|
|
int *numbatches);
|
|
extern uint32 ComputeHashFunc(Datum key, int typLen, bool byVal);
|
|
|
|
#endif /* NODEHASH_H */
|