-
- Downloads
Fix some planner performance problems with large WHERE clauses, by
introducing new 'FastList' list-construction subroutines to use in hot spots. This avoids the O(N^2) behavior of repeated lappend's by keeping a tail pointer, while not changing behavior by reversing list order as the lcons() method would do.
Showing
- src/backend/executor/execQual.c 19 additions, 15 deletionssrc/backend/executor/execQual.c
- src/backend/nodes/list.c 117 additions, 3 deletionssrc/backend/nodes/list.c
- src/backend/optimizer/path/indxpath.c 43 additions, 36 deletionssrc/backend/optimizer/path/indxpath.c
- src/backend/optimizer/path/orindxpath.c 10 additions, 5 deletionssrc/backend/optimizer/path/orindxpath.c
- src/backend/optimizer/prep/prepqual.c 98 additions, 85 deletionssrc/backend/optimizer/prep/prepqual.c
- src/backend/optimizer/util/clauses.c 51 additions, 42 deletionssrc/backend/optimizer/util/clauses.c
- src/backend/optimizer/util/var.c 5 additions, 5 deletionssrc/backend/optimizer/util/var.c
- src/include/nodes/pg_list.h 21 additions, 1 deletionsrc/include/nodes/pg_list.h
Loading
Please register or sign in to comment