diff options
| author | Tom Lane | 2005-04-21 19:18:13 +0000 |
|---|---|---|
| committer | Tom Lane | 2005-04-21 19:18:13 +0000 |
| commit | 14c7fba3f7d0769d8a063dea2854693f35535f6a (patch) | |
| tree | 51b519e88e8092e6fc9cdd6bf50dbff872bc6fa6 /src/test | |
| parent | c6221db3c0f7049b804391d59aeadcfbd1f51800 (diff) | |
Rethink original decision to use AND/OR Expr nodes to represent bitmap
logic operations during planning. Seems cleaner to create two new Path
node types, instead --- this avoids duplication of cost-estimation code.
Also, create an enable_bitmapscan GUC parameter to control use of bitmap
plans.
Diffstat (limited to 'src/test')
| -rw-r--r-- | src/test/regress/expected/rangefuncs.out | 23 |
1 files changed, 12 insertions, 11 deletions
diff --git a/src/test/regress/expected/rangefuncs.out b/src/test/regress/expected/rangefuncs.out index 6caa7a1c7b5..7b70766742a 100644 --- a/src/test/regress/expected/rangefuncs.out +++ b/src/test/regress/expected/rangefuncs.out @@ -1,15 +1,16 @@ SELECT name, setting FROM pg_settings WHERE name LIKE 'enable%'; - name | setting -------------------+--------- - enable_hashagg | on - enable_hashjoin | on - enable_indexscan | on - enable_mergejoin | on - enable_nestloop | on - enable_seqscan | on - enable_sort | on - enable_tidscan | on -(8 rows) + name | setting +-------------------+--------- + enable_bitmapscan | on + enable_hashagg | on + enable_hashjoin | on + enable_indexscan | on + enable_mergejoin | on + enable_nestloop | on + enable_seqscan | on + enable_sort | on + enable_tidscan | on +(9 rows) CREATE TABLE foo2(fooid int, f2 int); INSERT INTO foo2 VALUES(1, 11); |