mirror of
https://github.com/postgres/postgres.git
synced 2026-02-25 19:02:00 -05:00
8daeb5ddd6
SP-GiST is comparable to GiST in flexibility, but supports non-balanced partitioned search structures rather than balanced trees. As described at PGCon 2011, this new indexing structure can beat GiST in both index build time and query speed for search problems that it is well matched to. There are a number of areas that could still use improvement, but at this point the code seems committable. Teodor Sigaev and Oleg Bartunov, with considerable revisions by Tom Lane
39 lines
804 B
C
39 lines
804 B
C
/*
|
|
* rmgr.h
|
|
*
|
|
* Resource managers definition
|
|
*
|
|
* src/include/access/rmgr.h
|
|
*/
|
|
#ifndef RMGR_H
|
|
#define RMGR_H
|
|
|
|
typedef uint8 RmgrId;
|
|
|
|
/*
|
|
* Built-in resource managers
|
|
*
|
|
* Note: RM_MAX_ID could be as much as 255 without breaking the XLOG file
|
|
* format, but we keep it small to minimize the size of RmgrTable[].
|
|
*/
|
|
#define RM_XLOG_ID 0
|
|
#define RM_XACT_ID 1
|
|
#define RM_SMGR_ID 2
|
|
#define RM_CLOG_ID 3
|
|
#define RM_DBASE_ID 4
|
|
#define RM_TBLSPC_ID 5
|
|
#define RM_MULTIXACT_ID 6
|
|
#define RM_RELMAP_ID 7
|
|
#define RM_STANDBY_ID 8
|
|
#define RM_HEAP2_ID 9
|
|
#define RM_HEAP_ID 10
|
|
#define RM_BTREE_ID 11
|
|
#define RM_HASH_ID 12
|
|
#define RM_GIN_ID 13
|
|
#define RM_GIST_ID 14
|
|
#define RM_SEQ_ID 15
|
|
#define RM_SPGIST_ID 16
|
|
|
|
#define RM_MAX_ID RM_SPGIST_ID
|
|
|
|
#endif /* RMGR_H */
|