mirror of
https://github.com/postgres/postgres.git
synced 2025-10-24 01:29:19 +03:00
BRIN: Block Range Indexes
BRIN is a new index access method intended to accelerate scans of very large tables, without the maintenance overhead of btrees or other traditional indexes. They work by maintaining "summary" data about block ranges. Bitmap index scans work by reading each summary tuple and comparing them with the query quals; all pages in the range are returned in a lossy TID bitmap if the quals are consistent with the values in the summary tuple, otherwise not. Normal index scans are not supported because these indexes do not store TIDs. As new tuples are added into the index, the summary information is updated (if the block range in which the tuple is added is already summarized) or not; in the latter case, a subsequent pass of VACUUM or the brin_summarize_new_values() function will create the summary information. For data types with natural 1-D sort orders, the summary info consists of the maximum and the minimum values of each indexed column within each page range. This type of operator class we call "Minmax", and we supply a bunch of them for most data types with B-tree opclasses. Since the BRIN code is generalized, other approaches are possible for things such as arrays, geometric types, ranges, etc; even for things such as enum types we could do something different than minmax with better results. In this commit I only include minmax. Catalog version bumped due to new builtin catalog entries. There's more that could be done here, but this is a good step forwards. Loosely based on ideas from Simon Riggs; code mostly by Álvaro Herrera, with contribution by Heikki Linnakangas. Patch reviewed by: Amit Kapila, Heikki Linnakangas, Robert Haas. Testing help from Jeff Janes, Erik Rijkers, Emanuel Calvo. PS: The research leading to these results has received funding from the European Union's Seventh Framework Programme (FP7/2007-2013) under grant agreement n° 318633.
This commit is contained in:
52
src/include/access/brin.h
Normal file
52
src/include/access/brin.h
Normal file
@@ -0,0 +1,52 @@
|
||||
/*
|
||||
* AM-callable functions for BRIN indexes
|
||||
*
|
||||
* Portions Copyright (c) 1996-2014, PostgreSQL Global Development Group
|
||||
* Portions Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* src/include/access/brin.h
|
||||
*/
|
||||
#ifndef BRIN_H
|
||||
#define BRIN_H
|
||||
|
||||
#include "fmgr.h"
|
||||
#include "nodes/execnodes.h"
|
||||
#include "utils/relcache.h"
|
||||
|
||||
|
||||
/*
|
||||
* prototypes for functions in brin.c (external entry points for BRIN)
|
||||
*/
|
||||
extern Datum brinbuild(PG_FUNCTION_ARGS);
|
||||
extern Datum brinbuildempty(PG_FUNCTION_ARGS);
|
||||
extern Datum brininsert(PG_FUNCTION_ARGS);
|
||||
extern Datum brinbeginscan(PG_FUNCTION_ARGS);
|
||||
extern Datum bringettuple(PG_FUNCTION_ARGS);
|
||||
extern Datum bringetbitmap(PG_FUNCTION_ARGS);
|
||||
extern Datum brinrescan(PG_FUNCTION_ARGS);
|
||||
extern Datum brinendscan(PG_FUNCTION_ARGS);
|
||||
extern Datum brinmarkpos(PG_FUNCTION_ARGS);
|
||||
extern Datum brinrestrpos(PG_FUNCTION_ARGS);
|
||||
extern Datum brinbulkdelete(PG_FUNCTION_ARGS);
|
||||
extern Datum brinvacuumcleanup(PG_FUNCTION_ARGS);
|
||||
extern Datum brincanreturn(PG_FUNCTION_ARGS);
|
||||
extern Datum brincostestimate(PG_FUNCTION_ARGS);
|
||||
extern Datum brinoptions(PG_FUNCTION_ARGS);
|
||||
|
||||
/*
|
||||
* Storage type for BRIN's reloptions
|
||||
*/
|
||||
typedef struct BrinOptions
|
||||
{
|
||||
int32 vl_len_; /* varlena header (do not touch directly!) */
|
||||
BlockNumber pagesPerRange;
|
||||
} BrinOptions;
|
||||
|
||||
#define BRIN_DEFAULT_PAGES_PER_RANGE 128
|
||||
#define BrinGetPagesPerRange(relation) \
|
||||
((relation)->rd_options ? \
|
||||
((BrinOptions *) (relation)->rd_options)->pagesPerRange : \
|
||||
BRIN_DEFAULT_PAGES_PER_RANGE)
|
||||
|
||||
#endif /* BRIN_H */
|
||||
Reference in New Issue
Block a user