database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-08 11:42:09 +03:00
Code Activity

Generic implementation of red-black binary tree. It's planned to use in

Browse Source 
several places, but for now only GIN uses it during index creation.
Using self-balanced tree greatly speeds up index creation in corner cases
with preordered data.
This commit is contained in:
Teodor Sigaev
2010-02-11 14:29:50 +00:00
parent 161d9d51b3
commit 5209c084a6
7 changed files with 971 additions and 224 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/backend/access/gin/gininsert.c
View File

@ -8,7 +8,7 @@
* Portions Copyright (c) 1994, Regents of the University of California
*
* IDENTIFICATION
* $PostgreSQL: pgsql/src/backend/access/gin/gininsert.c,v 1.25 2010/01/02 16:57:33 momjian Exp $
* $PostgreSQL: pgsql/src/backend/access/gin/gininsert.c,v 1.26 2010/02/11 14:29:50 teodor Exp $
*-------------------------------------------------------------------------
*/
@ -247,9 +247,7 @@ ginBuildCallback(Relation index, HeapTuple htup, Datum *values,
&htup->t_self);
/* If we've maxed out our available memory, dump everything to the index */
/* Also dump if the tree seems to be getting too unbalanced */
if (buildstate->accum.allocatedMemory >= maintenance_work_mem * 1024L ||
buildstate->accum.maxdepth > GIN_MAX_TREE_DEPTH)
if (buildstate->accum.allocatedMemory >= maintenance_work_mem * 1024L)
{
ItemPointerData *list;
Datum entry;