{"kind": "plan", "major": "18", "item": {"slug": "bitmapand", "name": "BitmapAnd", "name_zh": "BitmapAnd", "category": "Bitmap", "summary": "Intersects bitmaps produced by its child plans.", "aliases": ["BitmapAnd", "T_BitmapAnd"], "content_hash": "6423b728057b60c165593b809d228f82bbf02a433dcc1d69ba1105867136eb95", "versions": {"10": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v10.23/postgresql-10.23.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "7c6494770b448c0beb9991dc604adec47c5362ccc301b10df00f0ff5b6b53d7c", "archive_sha256": "94a4b2528372458e5662c18d406629266667c437198160a18cdfd2c4a4d6eee9"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=10", "label": "EXPLAIN"}, {"url": "/docs/10/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/10/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 10.23 source archive", "label": "10.23", "major": "10", "channel": "historical", "revision": "94a4b2528372458e5662c18d406629266667c437198160a18cdfd2c4a4d6eee9", "source_url": "https://ftp.postgresql.org/pub/source/v10.23/postgresql-10.23.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v10.23/postgresql-10.23.tar.bz2", "line": 915, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:915", "sha256": "a785298532047cfeda969e78c3597a343dc1c56d61ba85830b0f16a02a14b5a1", "archive_sha256": "94a4b2528372458e5662c18d406629266667c437198160a18cdfd2c4a4d6eee9"}, {"url": "https://ftp.postgresql.org/pub/source/v10.23/postgresql-10.23.tar.bz2", "line": 194, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:194", "sha256": "cea76648bb38ae55f18f989768bee1a4ee025691ceea0f86bccb29dcdc166acc", "archive_sha256": "94a4b2528372458e5662c18d406629266667c437198160a18cdfd2c4a4d6eee9"}, {"url": "https://ftp.postgresql.org/pub/source/v10.23/postgresql-10.23.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "7c6494770b448c0beb9991dc604adec47c5362ccc301b10df00f0ff5b6b53d7c", "archive_sha256": "94a4b2528372458e5662c18d406629266667c437198160a18cdfd2c4a4d6eee9"}, {"url": "https://ftp.postgresql.org/pub/source/v10.23/postgresql-10.23.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "d562c321108844798cd234303fffb618f13d4ee3f3a5ac79bfd963b077e47c22", "archive_sha256": "94a4b2528372458e5662c18d406629266667c437198160a18cdfd2c4a4d6eee9"}, {"url": "/docs/10/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 10.23 \u00b7 using-explain", "sha256": "a4b4304aedb0a2da0145cc7c35b03b319a5c7ee3df35a8ef84ab6d3a610f98f3"}, {"url": "/docs/10/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 10.23 \u00b7 using-explain", "sha256": "a4b4304aedb0a2da0145cc7c35b03b319a5c7ee3df35a8ef84ab6d3a610f98f3"}, {"url": "/docs/10/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 10.23 \u00b7 using-explain", "sha256": "a4b4304aedb0a2da0145cc7c35b03b319a5c7ee3df35a8ef84ab6d3a610f98f3"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/10/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 10.23 \u00b7 using-explain", "sha256": "a4b4304aedb0a2da0145cc7c35b03b319a5c7ee3df35a8ef84ab6d3a610f98f3"}, "paragraphs": ["Example copied from the PostgreSQL 10.23 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244) (actual time=0.323..0.342 rows=10 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Buffers: shared hit=15\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0) (actual time=0.309..0.309 rows=0 loops=1)\n         Buffers: shared hit=7\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0) (actual time=0.043..0.043 rows=100 loops=1)\n               Index Cond: (unique1 < 100)\n               Buffers: shared hit=2\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.227..0.227 rows=999 loops=1)\n               Index Cond: (unique2 > 9000)\n               Buffers: shared hit=5\n Planning time: 0.088 ms\n Execution time: 0.423 ms", "source": {"url": "/docs/10/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 10.23 \u00b7 using-explain", "sha256": "a4b4304aedb0a2da0145cc7c35b03b319a5c7ee3df35a8ef84ab6d3a610f98f3"}, "paragraphs": ["Example copied from the PostgreSQL 10.23 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option that can be used with ANALYZE to get even more run time statistics:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "11": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v11.22/postgresql-11.22.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "e991b34f241eaffa4c664bbd3dd07ec3c418b1003e0a9c071cf008c0510bd038", "archive_sha256": "2cb7c97d7a0d7278851bbc9c61f467b69c094c72b81740b751108e7892ebe1f0"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=11", "label": "EXPLAIN"}, {"url": "/docs/11/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/11/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 11.22 source archive", "label": "11.22", "major": "11", "channel": "historical", "revision": "2cb7c97d7a0d7278851bbc9c61f467b69c094c72b81740b751108e7892ebe1f0", "source_url": "https://ftp.postgresql.org/pub/source/v11.22/postgresql-11.22.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v11.22/postgresql-11.22.tar.bz2", "line": 1040, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1040", "sha256": "9df8400c1a4377179572ceb916d6020fca4e2760f74bf416d77ed97476523bbd", "archive_sha256": "2cb7c97d7a0d7278851bbc9c61f467b69c094c72b81740b751108e7892ebe1f0"}, {"url": "https://ftp.postgresql.org/pub/source/v11.22/postgresql-11.22.tar.bz2", "line": 194, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:194", "sha256": "95ef4d4a5df4c29f14af9763fae2c530449bdacdf3853d9ff297adf1fed6153b", "archive_sha256": "2cb7c97d7a0d7278851bbc9c61f467b69c094c72b81740b751108e7892ebe1f0"}, {"url": "https://ftp.postgresql.org/pub/source/v11.22/postgresql-11.22.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "e991b34f241eaffa4c664bbd3dd07ec3c418b1003e0a9c071cf008c0510bd038", "archive_sha256": "2cb7c97d7a0d7278851bbc9c61f467b69c094c72b81740b751108e7892ebe1f0"}, {"url": "https://ftp.postgresql.org/pub/source/v11.22/postgresql-11.22.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "5e0511194183800e8d6eb293fd4b40639c7d3118e2d199c8e7865ba4fa4cf67f", "archive_sha256": "2cb7c97d7a0d7278851bbc9c61f467b69c094c72b81740b751108e7892ebe1f0"}, {"url": "/docs/11/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 11.22 \u00b7 using-explain", "sha256": "8411bc78085d4737e32d7cca103d859da6c6539e33ec5e2fba46e74c6f199d8a"}, {"url": "/docs/11/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 11.22 \u00b7 using-explain", "sha256": "8411bc78085d4737e32d7cca103d859da6c6539e33ec5e2fba46e74c6f199d8a"}, {"url": "/docs/11/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 11.22 \u00b7 using-explain", "sha256": "8411bc78085d4737e32d7cca103d859da6c6539e33ec5e2fba46e74c6f199d8a"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/11/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 11.22 \u00b7 using-explain", "sha256": "8411bc78085d4737e32d7cca103d859da6c6539e33ec5e2fba46e74c6f199d8a"}, "paragraphs": ["Example copied from the PostgreSQL 11.22 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244) (actual time=0.323..0.342 rows=10 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Buffers: shared hit=15\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0) (actual time=0.309..0.309 rows=0 loops=1)\n         Buffers: shared hit=7\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0) (actual time=0.043..0.043 rows=100 loops=1)\n               Index Cond: (unique1 < 100)\n               Buffers: shared hit=2\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.227..0.227 rows=999 loops=1)\n               Index Cond: (unique2 > 9000)\n               Buffers: shared hit=5\n Planning time: 0.088 ms\n Execution time: 0.423 ms", "source": {"url": "/docs/11/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 11.22 \u00b7 using-explain", "sha256": "8411bc78085d4737e32d7cca103d859da6c6539e33ec5e2fba46e74c6f199d8a"}, "paragraphs": ["Example copied from the PostgreSQL 11.22 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option that can be used with ANALYZE to get even more run time statistics:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "12": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v12.22/postgresql-12.22.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "56b28d4a22ee8f6234f26789dcd26140de350d94c41b91e955c061ff530cba2f", "archive_sha256": "8df3c0474782589d3c6f374b5133b1bd14d168086edbc13c6e72e67dd4527a3b"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=12", "label": "EXPLAIN"}, {"url": "/docs/12/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/12/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 12.22 source archive", "label": "12.22", "major": "12", "channel": "historical", "revision": "8df3c0474782589d3c6f374b5133b1bd14d168086edbc13c6e72e67dd4527a3b", "source_url": "https://ftp.postgresql.org/pub/source/v12.22/postgresql-12.22.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v12.22/postgresql-12.22.tar.bz2", "line": 1111, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1111", "sha256": "d02ea84fdaa201de5d9360645a9f24bfbd2c31f7d45a639e09560ac0e6b6471d", "archive_sha256": "8df3c0474782589d3c6f374b5133b1bd14d168086edbc13c6e72e67dd4527a3b"}, {"url": "https://ftp.postgresql.org/pub/source/v12.22/postgresql-12.22.tar.bz2", "line": 194, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:194", "sha256": "311b17379fe54e3f342fe5ad41c43afbdfa1b844978db2bb2eb22b82520d3256", "archive_sha256": "8df3c0474782589d3c6f374b5133b1bd14d168086edbc13c6e72e67dd4527a3b"}, {"url": "https://ftp.postgresql.org/pub/source/v12.22/postgresql-12.22.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "56b28d4a22ee8f6234f26789dcd26140de350d94c41b91e955c061ff530cba2f", "archive_sha256": "8df3c0474782589d3c6f374b5133b1bd14d168086edbc13c6e72e67dd4527a3b"}, {"url": "https://ftp.postgresql.org/pub/source/v12.22/postgresql-12.22.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "b0c4a0aeb48660ce06e5e700d5529ca9066fd16682bd15783d6e71b5420b07b0", "archive_sha256": "8df3c0474782589d3c6f374b5133b1bd14d168086edbc13c6e72e67dd4527a3b"}, {"url": "/docs/12/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 12.22 \u00b7 using-explain", "sha256": "06297525f2180b07e752837a3351be9c871b56559f535bcd0a67dec9baac10c0"}, {"url": "/docs/12/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 12.22 \u00b7 using-explain", "sha256": "06297525f2180b07e752837a3351be9c871b56559f535bcd0a67dec9baac10c0"}, {"url": "/docs/12/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 12.22 \u00b7 using-explain", "sha256": "06297525f2180b07e752837a3351be9c871b56559f535bcd0a67dec9baac10c0"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/12/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 12.22 \u00b7 using-explain", "sha256": "06297525f2180b07e752837a3351be9c871b56559f535bcd0a67dec9baac10c0"}, "paragraphs": ["Example copied from the PostgreSQL 12.22 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244) (actual time=0.323..0.342 rows=10 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Buffers: shared hit=15\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0) (actual time=0.309..0.309 rows=0 loops=1)\n         Buffers: shared hit=7\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0) (actual time=0.043..0.043 rows=100 loops=1)\n               Index Cond: (unique1 < 100)\n               Buffers: shared hit=2\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.227..0.227 rows=999 loops=1)\n               Index Cond: (unique2 > 9000)\n               Buffers: shared hit=5\n Planning time: 0.088 ms\n Execution time: 0.423 ms", "source": {"url": "/docs/12/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 12.22 \u00b7 using-explain", "sha256": "06297525f2180b07e752837a3351be9c871b56559f535bcd0a67dec9baac10c0"}, "paragraphs": ["Example copied from the PostgreSQL 12.22 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option that can be used with ANALYZE to get even more run time statistics:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "13": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v13.23/postgresql-13.23.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "189bd085e01ce8519420b49d790ca2065613c64c7022641bfcb81072f3efcb2e", "archive_sha256": "6ec3c82726af92b7dec873fa1cdf881eca92a4219787dfad05acb6b10e041fd6"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=13", "label": "EXPLAIN"}, {"url": "/docs/13/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/13/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 13.23 source archive", "label": "13.23", "major": "13", "channel": "historical", "revision": "6ec3c82726af92b7dec873fa1cdf881eca92a4219787dfad05acb6b10e041fd6", "source_url": "https://ftp.postgresql.org/pub/source/v13.23/postgresql-13.23.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v13.23/postgresql-13.23.tar.bz2", "line": 1169, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1169", "sha256": "541713e0e7f1c9cc352c2b6028964d440c19d2678a4463000094c24a88c1e730", "archive_sha256": "6ec3c82726af92b7dec873fa1cdf881eca92a4219787dfad05acb6b10e041fd6"}, {"url": "https://ftp.postgresql.org/pub/source/v13.23/postgresql-13.23.tar.bz2", "line": 194, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:194", "sha256": "d085ee99acfa00587e6ade3a1d9f8108a0566beedbbee3f54a50c9fc0cc2e875", "archive_sha256": "6ec3c82726af92b7dec873fa1cdf881eca92a4219787dfad05acb6b10e041fd6"}, {"url": "https://ftp.postgresql.org/pub/source/v13.23/postgresql-13.23.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "189bd085e01ce8519420b49d790ca2065613c64c7022641bfcb81072f3efcb2e", "archive_sha256": "6ec3c82726af92b7dec873fa1cdf881eca92a4219787dfad05acb6b10e041fd6"}, {"url": "https://ftp.postgresql.org/pub/source/v13.23/postgresql-13.23.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "dcb296833777b02008c4b6bae8e8f7c6423b7ffba21f36702597c9d596d039ab", "archive_sha256": "6ec3c82726af92b7dec873fa1cdf881eca92a4219787dfad05acb6b10e041fd6"}, {"url": "/docs/13/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 13.23 \u00b7 using-explain", "sha256": "650fd8629382d5dc8f9f8412c50ec5f32442a9ad2f98ca88e5348a7c2bd0ac7a"}, {"url": "/docs/13/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 13.23 \u00b7 using-explain", "sha256": "650fd8629382d5dc8f9f8412c50ec5f32442a9ad2f98ca88e5348a7c2bd0ac7a"}, {"url": "/docs/13/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 13.23 \u00b7 using-explain", "sha256": "650fd8629382d5dc8f9f8412c50ec5f32442a9ad2f98ca88e5348a7c2bd0ac7a"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/13/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 13.23 \u00b7 using-explain", "sha256": "650fd8629382d5dc8f9f8412c50ec5f32442a9ad2f98ca88e5348a7c2bd0ac7a"}, "paragraphs": ["Example copied from the PostgreSQL 13.23 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244) (actual time=0.323..0.342 rows=10 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Buffers: shared hit=15\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0) (actual time=0.309..0.309 rows=0 loops=1)\n         Buffers: shared hit=7\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0) (actual time=0.043..0.043 rows=100 loops=1)\n               Index Cond: (unique1 < 100)\n               Buffers: shared hit=2\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.227..0.227 rows=999 loops=1)\n               Index Cond: (unique2 > 9000)\n               Buffers: shared hit=5\n Planning time: 0.088 ms\n Execution time: 0.423 ms", "source": {"url": "/docs/13/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 13.23 \u00b7 using-explain", "sha256": "650fd8629382d5dc8f9f8412c50ec5f32442a9ad2f98ca88e5348a7c2bd0ac7a"}, "paragraphs": ["Example copied from the PostgreSQL 13.23 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option that can be used with ANALYZE to get even more run time statistics:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "14": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v14.24/postgresql-14.24.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "c096e3ef00f28184fe4dd7f94a4c2930d37cf1d80f152665e28c011c86e92ab3", "archive_sha256": "a7fa7ed3d558172355f51406097a7bd4f6b473be80f311ef7cda96bf383d8897"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=14", "label": "EXPLAIN"}, {"url": "/docs/14/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/14/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 14.24 source archive", "label": "14.24", "major": "14", "channel": "stable", "revision": "a7fa7ed3d558172355f51406097a7bd4f6b473be80f311ef7cda96bf383d8897", "source_url": "https://ftp.postgresql.org/pub/source/v14.24/postgresql-14.24.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v14.24/postgresql-14.24.tar.bz2", "line": 1205, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1205", "sha256": "e091be4e2a083b8dea39ccd09beedede22c1716ef974da66c214a44f48be8c41", "archive_sha256": "a7fa7ed3d558172355f51406097a7bd4f6b473be80f311ef7cda96bf383d8897"}, {"url": "https://ftp.postgresql.org/pub/source/v14.24/postgresql-14.24.tar.bz2", "line": 196, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:196", "sha256": "72da1c5ad457f1d92a39ab73531701794df858419e3b89d6e6cb7079634e68fa", "archive_sha256": "a7fa7ed3d558172355f51406097a7bd4f6b473be80f311ef7cda96bf383d8897"}, {"url": "https://ftp.postgresql.org/pub/source/v14.24/postgresql-14.24.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "c096e3ef00f28184fe4dd7f94a4c2930d37cf1d80f152665e28c011c86e92ab3", "archive_sha256": "a7fa7ed3d558172355f51406097a7bd4f6b473be80f311ef7cda96bf383d8897"}, {"url": "https://ftp.postgresql.org/pub/source/v14.24/postgresql-14.24.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "302f51a16b570dba7ec4e7bc045f7df5800d21630280354d1a24025f3baec75d", "archive_sha256": "a7fa7ed3d558172355f51406097a7bd4f6b473be80f311ef7cda96bf383d8897"}, {"url": "/docs/14/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 14.24 \u00b7 using-explain", "sha256": "7f5ab59cb21a035ada45ea3426c5d1cca3f781273483677f73fdd76753555206"}, {"url": "/docs/14/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 14.24 \u00b7 using-explain", "sha256": "7f5ab59cb21a035ada45ea3426c5d1cca3f781273483677f73fdd76753555206"}, {"url": "/docs/14/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 14.24 \u00b7 using-explain", "sha256": "7f5ab59cb21a035ada45ea3426c5d1cca3f781273483677f73fdd76753555206"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/14/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 14.24 \u00b7 using-explain", "sha256": "7f5ab59cb21a035ada45ea3426c5d1cca3f781273483677f73fdd76753555206"}, "paragraphs": ["Example copied from the PostgreSQL 14.24 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244) (actual time=0.323..0.342 rows=10 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Buffers: shared hit=15\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0) (actual time=0.309..0.309 rows=0 loops=1)\n         Buffers: shared hit=7\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0) (actual time=0.043..0.043 rows=100 loops=1)\n               Index Cond: (unique1 < 100)\n               Buffers: shared hit=2\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.227..0.227 rows=999 loops=1)\n               Index Cond: (unique2 > 9000)\n               Buffers: shared hit=5\n Planning time: 0.088 ms\n Execution time: 0.423 ms", "source": {"url": "/docs/14/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 14.24 \u00b7 using-explain", "sha256": "7f5ab59cb21a035ada45ea3426c5d1cca3f781273483677f73fdd76753555206"}, "paragraphs": ["Example copied from the PostgreSQL 14.24 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option that can be used with ANALYZE to get even more run time statistics:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel", "Async"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "15": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v15.19/postgresql-15.19.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "a68b2653499eda3a5c69d542314bf4dce813be2dfd4a0d09f547ec01085bcf08", "archive_sha256": "e1a64a87a46b825b88c082e4518161a47aab53c45694964f8ba1df28f7859f89"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=15", "label": "EXPLAIN"}, {"url": "/docs/15/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/15/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 15.19 source archive", "label": "15.19", "major": "15", "channel": "stable", "revision": "e1a64a87a46b825b88c082e4518161a47aab53c45694964f8ba1df28f7859f89", "source_url": "https://ftp.postgresql.org/pub/source/v15.19/postgresql-15.19.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v15.19/postgresql-15.19.tar.bz2", "line": 1208, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1208", "sha256": "bb3b442d0f1b098aa8707335250102f027a596cd94117308bd16d1d36b258f5c", "archive_sha256": "e1a64a87a46b825b88c082e4518161a47aab53c45694964f8ba1df28f7859f89"}, {"url": "https://ftp.postgresql.org/pub/source/v15.19/postgresql-15.19.tar.bz2", "line": 196, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:196", "sha256": "19836c50a272741a4eac653541e655437c2e00710a541e5348d6a277d0669d7c", "archive_sha256": "e1a64a87a46b825b88c082e4518161a47aab53c45694964f8ba1df28f7859f89"}, {"url": "https://ftp.postgresql.org/pub/source/v15.19/postgresql-15.19.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "a68b2653499eda3a5c69d542314bf4dce813be2dfd4a0d09f547ec01085bcf08", "archive_sha256": "e1a64a87a46b825b88c082e4518161a47aab53c45694964f8ba1df28f7859f89"}, {"url": "https://ftp.postgresql.org/pub/source/v15.19/postgresql-15.19.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "fb4a4c8165495299131173680bc02a950d88e1ff610231fd97997bc0c9afc1d7", "archive_sha256": "e1a64a87a46b825b88c082e4518161a47aab53c45694964f8ba1df28f7859f89"}, {"url": "/docs/15/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 15.19 \u00b7 using-explain", "sha256": "d1f509457c647da453d2575c772d91022a0f115dd84f9a3b20f5ff25a243648f"}, {"url": "/docs/15/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 15.19 \u00b7 using-explain", "sha256": "d1f509457c647da453d2575c772d91022a0f115dd84f9a3b20f5ff25a243648f"}, {"url": "/docs/15/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 15.19 \u00b7 using-explain", "sha256": "d1f509457c647da453d2575c772d91022a0f115dd84f9a3b20f5ff25a243648f"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/15/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 15.19 \u00b7 using-explain", "sha256": "d1f509457c647da453d2575c772d91022a0f115dd84f9a3b20f5ff25a243648f"}, "paragraphs": ["Example copied from the PostgreSQL 15.19 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244) (actual time=0.323..0.342 rows=10 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Buffers: shared hit=15\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0) (actual time=0.309..0.309 rows=0 loops=1)\n         Buffers: shared hit=7\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0) (actual time=0.043..0.043 rows=100 loops=1)\n               Index Cond: (unique1 < 100)\n               Buffers: shared hit=2\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.227..0.227 rows=999 loops=1)\n               Index Cond: (unique2 > 9000)\n               Buffers: shared hit=5\n Planning time: 0.088 ms\n Execution time: 0.423 ms", "source": {"url": "/docs/15/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 15.19 \u00b7 using-explain", "sha256": "d1f509457c647da453d2575c772d91022a0f115dd84f9a3b20f5ff25a243648f"}, "paragraphs": ["Example copied from the PostgreSQL 15.19 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option that can be used with ANALYZE to get even more run time statistics:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel", "Async"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "16": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v16.15/postgresql-16.15.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "c66658660763b50539da7d951c13c114cf83c26dc3c914e8a8f05844fc7271b0", "archive_sha256": "c1575341fa7bd40f5274ea465b34390f4dc64cdd0770af327005caaeb9f6b7ed"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=16", "label": "EXPLAIN"}, {"url": "/docs/16/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/16/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 16.15 source archive", "label": "16.15", "major": "16", "channel": "stable", "revision": "c1575341fa7bd40f5274ea465b34390f4dc64cdd0770af327005caaeb9f6b7ed", "source_url": "https://ftp.postgresql.org/pub/source/v16.15/postgresql-16.15.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v16.15/postgresql-16.15.tar.bz2", "line": 1241, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1241", "sha256": "8e017f0116dbea471339b40c37a667cc9f95039e7e0329c783e5e8ce194de7e1", "archive_sha256": "c1575341fa7bd40f5274ea465b34390f4dc64cdd0770af327005caaeb9f6b7ed"}, {"url": "https://ftp.postgresql.org/pub/source/v16.15/postgresql-16.15.tar.bz2", "line": 196, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:196", "sha256": "e48c08e555f8cb4e4bb43df516c4b8906ce9bc374b2a745d98a1fc8c22cc5099", "archive_sha256": "c1575341fa7bd40f5274ea465b34390f4dc64cdd0770af327005caaeb9f6b7ed"}, {"url": "https://ftp.postgresql.org/pub/source/v16.15/postgresql-16.15.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "c66658660763b50539da7d951c13c114cf83c26dc3c914e8a8f05844fc7271b0", "archive_sha256": "c1575341fa7bd40f5274ea465b34390f4dc64cdd0770af327005caaeb9f6b7ed"}, {"url": "https://ftp.postgresql.org/pub/source/v16.15/postgresql-16.15.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "97db47353db76326b874589a5ad0a04501cc74cd72e237e7bd956e7472c41f1f", "archive_sha256": "c1575341fa7bd40f5274ea465b34390f4dc64cdd0770af327005caaeb9f6b7ed"}, {"url": "/docs/16/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 16.15 \u00b7 using-explain", "sha256": "bd8b86e5281cf0e52ad6e0e4bb8b6ff6510dac61982b44f0c1dd07d54012db3c"}, {"url": "/docs/16/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 16.15 \u00b7 using-explain", "sha256": "bd8b86e5281cf0e52ad6e0e4bb8b6ff6510dac61982b44f0c1dd07d54012db3c"}, {"url": "/docs/16/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 16.15 \u00b7 using-explain", "sha256": "bd8b86e5281cf0e52ad6e0e4bb8b6ff6510dac61982b44f0c1dd07d54012db3c"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/16/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 16.15 \u00b7 using-explain", "sha256": "bd8b86e5281cf0e52ad6e0e4bb8b6ff6510dac61982b44f0c1dd07d54012db3c"}, "paragraphs": ["Example copied from the PostgreSQL 16.15 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.08..60.21 rows=10 width=244) (actual time=0.323..0.342 rows=10 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Buffers: shared hit=15\n   ->  BitmapAnd  (cost=25.08..25.08 rows=10 width=0) (actual time=0.309..0.309 rows=0 loops=1)\n         Buffers: shared hit=7\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=101 width=0) (actual time=0.043..0.043 rows=100 loops=1)\n               Index Cond: (unique1 < 100)\n               Buffers: shared hit=2\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.227..0.227 rows=999 loops=1)\n               Index Cond: (unique2 > 9000)\n               Buffers: shared hit=5\n Planning time: 0.088 ms\n Execution time: 0.423 ms", "source": {"url": "/docs/16/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 16.15 \u00b7 using-explain", "sha256": "bd8b86e5281cf0e52ad6e0e4bb8b6ff6510dac61982b44f0c1dd07d54012db3c"}, "paragraphs": ["Example copied from the PostgreSQL 16.15 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option that can be used with ANALYZE to get even more run time statistics:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel", "Async"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "17": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v17.11/postgresql-17.11.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "c86004ae4e1b0783ef28372663be71a9f3f7b020cafd835749d2041a5357c368", "archive_sha256": "dd27f2b3c59e73ed14aa3324901242bf69a032a6347805f274e6260322d42979"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=17", "label": "EXPLAIN"}, {"url": "/docs/17/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/17/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 17.11 source archive", "label": "17.11", "major": "17", "channel": "stable", "revision": "dd27f2b3c59e73ed14aa3324901242bf69a032a6347805f274e6260322d42979", "source_url": "https://ftp.postgresql.org/pub/source/v17.11/postgresql-17.11.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v17.11/postgresql-17.11.tar.bz2", "line": 1430, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1430", "sha256": "741251b1a3b6d269a52a673d42eb63b02e13a5872db7b359b137086ab21b63c8", "archive_sha256": "dd27f2b3c59e73ed14aa3324901242bf69a032a6347805f274e6260322d42979"}, {"url": "https://ftp.postgresql.org/pub/source/v17.11/postgresql-17.11.tar.bz2", "line": 196, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:196", "sha256": "a77576e158b94cb01fa8c5174ba133004eabdd727660323f8afc66c8d2e757b8", "archive_sha256": "dd27f2b3c59e73ed14aa3324901242bf69a032a6347805f274e6260322d42979"}, {"url": "https://ftp.postgresql.org/pub/source/v17.11/postgresql-17.11.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "c86004ae4e1b0783ef28372663be71a9f3f7b020cafd835749d2041a5357c368", "archive_sha256": "dd27f2b3c59e73ed14aa3324901242bf69a032a6347805f274e6260322d42979"}, {"url": "https://ftp.postgresql.org/pub/source/v17.11/postgresql-17.11.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "d390dd69e2d3f5085beb42b33e46ff0676a2959b916a12b82118a7e545f8e562", "archive_sha256": "dd27f2b3c59e73ed14aa3324901242bf69a032a6347805f274e6260322d42979"}, {"url": "/docs/17/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 17.11 \u00b7 using-explain", "sha256": "8e3422c77496cc53bfc225ccadda3e82eb23c8c362b8eb95e7fb02cdb315ea78"}, {"url": "/docs/17/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 17.11 \u00b7 using-explain", "sha256": "8e3422c77496cc53bfc225ccadda3e82eb23c8c362b8eb95e7fb02cdb315ea78"}, {"url": "/docs/17/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 17.11 \u00b7 using-explain", "sha256": "8e3422c77496cc53bfc225ccadda3e82eb23c8c362b8eb95e7fb02cdb315ea78"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/17/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 17.11 \u00b7 using-explain", "sha256": "8e3422c77496cc53bfc225ccadda3e82eb23c8c362b8eb95e7fb02cdb315ea78"}, "paragraphs": ["Example copied from the PostgreSQL 17.11 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244) (actual time=0.105..0.114 rows=10 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Heap Blocks: exact=10\n   Buffers: shared hit=14 read=3\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0) (actual time=0.100..0.101 rows=0 loops=1)\n         Buffers: shared hit=4 read=3\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0) (actual time=0.027..0.027 rows=100 loops=1)\n               Index Cond: (unique1 < 100)\n               Buffers: shared hit=2\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.070..0.070 rows=999 loops=1)\n               Index Cond: (unique2 > 9000)\n               Buffers: shared hit=2 read=3\n Planning:\n   Buffers: shared hit=3\n Planning Time: 0.162 ms\n Execution Time: 0.143 ms", "source": {"url": "/docs/17/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 17.11 \u00b7 using-explain", "sha256": "8e3422c77496cc53bfc225ccadda3e82eb23c8c362b8eb95e7fb02cdb315ea78"}, "paragraphs": ["Example copied from the PostgreSQL 17.11 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option that can be used with ANALYZE to get even more run time statistics:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel", "Async"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "18": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "ec359e3996322cd5f16aab61f23a38e26dae336bbcea4db735a6a70e0ecc89dd", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=18", "label": "EXPLAIN"}, {"url": "/docs/18/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/18/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 18.6 source archive", "label": "18.6", "major": "18", "channel": "stable", "revision": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f", "source_url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "line": 1415, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1415", "sha256": "34c86d6070224a0e981efef51f79101d6d505e5874f1684ace183034bab14bb4", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}, {"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "line": 196, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:196", "sha256": "f8a06a3f539077249b20664b2812433db6d7bd12b2c0ca633525db43d06f112a", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}, {"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "ec359e3996322cd5f16aab61f23a38e26dae336bbcea4db735a6a70e0ecc89dd", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}, {"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "52422b327a8049fbbb20d8b96008a0fc0a6fafa60f7eff3c695d5b2e83830120", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}, {"url": "/docs/18/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}, {"url": "/docs/18/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}, {"url": "/docs/18/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/18/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}, "paragraphs": ["Example copied from the PostgreSQL 18.6 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS OFF) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244) (actual time=0.105..0.114 rows=10.00 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Heap Blocks: exact=10\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0) (actual time=0.100..0.101 rows=0.00 loops=1)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0) (actual time=0.027..0.027 rows=100.00 loops=1)\n               Index Cond: (unique1 < 100)\n               Index Searches: 1\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.070..0.070 rows=999.00 loops=1)\n               Index Cond: (unique2 > 9000)\n               Index Searches: 1\n Planning Time: 0.162 ms\n Execution Time: 0.143 ms", "source": {"url": "/docs/18/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}, "paragraphs": ["Example copied from the PostgreSQL 18.6 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option which provides additional detail about I/O operations performed during the planning and execution of the given query. The buffer numbers displayed show the count of the non-distinct buffers hit, read, dirtied, and written for the given node and all of its child nodes. The ANALYZE option implicitly enables the BUFFERS option. If this is undesired, BUFFERS may be explicitly disabled:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel", "Async"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "19": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v19beta4/postgresql-19beta4.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "18f8afaa80ee549a64a6e7d1f55d795070c1e3a7971418cfd4c3ee77fd21464d", "archive_sha256": "83157ee9c599d03b2f7a3d73ef3a56ec24e0e79cc2b3501a64d1364f56398c86"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=19", "label": "EXPLAIN"}, {"url": "/docs/19/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/19/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 19beta4 source archive", "label": "19beta4", "major": "19", "channel": "preview", "revision": "83157ee9c599d03b2f7a3d73ef3a56ec24e0e79cc2b3501a64d1364f56398c86", "source_url": "https://ftp.postgresql.org/pub/source/v19beta4/postgresql-19beta4.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v19beta4/postgresql-19beta4.tar.bz2", "line": 1427, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1427", "sha256": "8b115b1c194a4b54ae630209a741e293b1df49a9052f10b2de9ca092a48998e3", "archive_sha256": "83157ee9c599d03b2f7a3d73ef3a56ec24e0e79cc2b3501a64d1364f56398c86"}, {"url": "https://ftp.postgresql.org/pub/source/v19beta4/postgresql-19beta4.tar.bz2", "line": 196, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:196", "sha256": "5e39b2037bed672da55104229ecc32da5abde44c26bcad01479edcfa044d09ed", "archive_sha256": "83157ee9c599d03b2f7a3d73ef3a56ec24e0e79cc2b3501a64d1364f56398c86"}, {"url": "https://ftp.postgresql.org/pub/source/v19beta4/postgresql-19beta4.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "18f8afaa80ee549a64a6e7d1f55d795070c1e3a7971418cfd4c3ee77fd21464d", "archive_sha256": "83157ee9c599d03b2f7a3d73ef3a56ec24e0e79cc2b3501a64d1364f56398c86"}, {"url": "https://ftp.postgresql.org/pub/source/v19beta4/postgresql-19beta4.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "1c65d5d6b6c81c71531685843647869bcae630779d815a5036b06e070c6c06c7", "archive_sha256": "83157ee9c599d03b2f7a3d73ef3a56ec24e0e79cc2b3501a64d1364f56398c86"}, {"url": "/docs/19/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 19beta4 \u00b7 using-explain", "sha256": "52f111fbd213e2200146319d01a9dcc2ea90001617d2a28edc52f7954c2dd70b"}, {"url": "/docs/19/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 19beta4 \u00b7 using-explain", "sha256": "52f111fbd213e2200146319d01a9dcc2ea90001617d2a28edc52f7954c2dd70b"}, {"url": "/docs/19/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 19beta4 \u00b7 using-explain", "sha256": "52f111fbd213e2200146319d01a9dcc2ea90001617d2a28edc52f7954c2dd70b"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/19/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 19beta4 \u00b7 using-explain", "sha256": "52f111fbd213e2200146319d01a9dcc2ea90001617d2a28edc52f7954c2dd70b"}, "paragraphs": ["Example copied from the PostgreSQL 19beta4 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS OFF) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244) (actual time=0.105..0.114 rows=10.00 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Heap Blocks: exact=10\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0) (actual time=0.100..0.101 rows=0.00 loops=1)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0) (actual time=0.027..0.027 rows=100.00 loops=1)\n               Index Cond: (unique1 < 100)\n               Index Searches: 1\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.070..0.070 rows=999.00 loops=1)\n               Index Cond: (unique2 > 9000)\n               Index Searches: 1\n Planning Time: 0.162 ms\n Execution Time: 0.143 ms", "source": {"url": "/docs/19/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 19beta4 \u00b7 using-explain", "sha256": "52f111fbd213e2200146319d01a9dcc2ea90001617d2a28edc52f7954c2dd70b"}, "paragraphs": ["Example copied from the PostgreSQL 19beta4 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option which provides additional detail about I/O operations performed during the planning and execution of the given query. The buffer numbers displayed show the count of the non-distinct buffers hit, read, dirtied, and written for the given node and all of its child nodes. The ANALYZE option implicitly enables the BUFFERS option. If this is undesired, BUFFERS may be explicitly disabled:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel", "Async"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "20": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/snapshot/dev/postgresql-snapshot.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "abe3988513ba535961cc5becec9234c985cd22cfb5836bba56053854b974304d", "archive_sha256": "4d3346909b201ac1648232cf290462a7070c119326f56196f1f0253ed80fae41"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=20", "label": "EXPLAIN"}, {"url": "/docs/devel/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/devel/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 20devel source archive", "label": "20devel", "major": "20", "channel": "devel", "revision": "4d3346909b201ac1648232cf290462a7070c119326f56196f1f0253ed80fae41", "source_url": "https://ftp.postgresql.org/pub/snapshot/dev/postgresql-snapshot.tar.bz2", "source_snapshot_utc": "26-Sep-2026 20:22"}, "sources": [{"url": "https://ftp.postgresql.org/pub/snapshot/dev/postgresql-snapshot.tar.bz2", "line": 1427, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1427", "sha256": "13402758013520451539427b5993db06d463ca11c4e2d4cc5444e82367688077", "archive_sha256": "4d3346909b201ac1648232cf290462a7070c119326f56196f1f0253ed80fae41"}, {"url": "https://ftp.postgresql.org/pub/snapshot/dev/postgresql-snapshot.tar.bz2", "line": 196, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:196", "sha256": "5e39b2037bed672da55104229ecc32da5abde44c26bcad01479edcfa044d09ed", "archive_sha256": "4d3346909b201ac1648232cf290462a7070c119326f56196f1f0253ed80fae41"}, {"url": "https://ftp.postgresql.org/pub/snapshot/dev/postgresql-snapshot.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "abe3988513ba535961cc5becec9234c985cd22cfb5836bba56053854b974304d", "archive_sha256": "4d3346909b201ac1648232cf290462a7070c119326f56196f1f0253ed80fae41"}, {"url": "https://ftp.postgresql.org/pub/snapshot/dev/postgresql-snapshot.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "7a94ed1652f0d74d50c39971d1cd3e8051dbc0d6058f31b6de71a433ca343521", "archive_sha256": "4d3346909b201ac1648232cf290462a7070c119326f56196f1f0253ed80fae41"}, {"url": "/docs/devel/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 20devel \u00b7 using-explain", "sha256": "99cfea3035876ea63f88b75ba8c964b51a32a70606544e09f769c0b60a234b31"}, {"url": "/docs/devel/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 20devel \u00b7 using-explain", "sha256": "99cfea3035876ea63f88b75ba8c964b51a32a70606544e09f769c0b60a234b31"}, {"url": "/docs/devel/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 20devel \u00b7 using-explain", "sha256": "99cfea3035876ea63f88b75ba8c964b51a32a70606544e09f769c0b60a234b31"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/devel/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 20devel \u00b7 using-explain", "sha256": "99cfea3035876ea63f88b75ba8c964b51a32a70606544e09f769c0b60a234b31"}, "paragraphs": ["Example copied from the PostgreSQL 20devel manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS OFF) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244) (actual time=0.105..0.114 rows=10.00 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Heap Blocks: exact=10\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0) (actual time=0.100..0.101 rows=0.00 loops=1)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0) (actual time=0.027..0.027 rows=100.00 loops=1)\n               Index Cond: (unique1 < 100)\n               Index Searches: 1\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.070..0.070 rows=999.00 loops=1)\n               Index Cond: (unique2 > 9000)\n               Index Searches: 1\n Planning Time: 0.162 ms\n Execution Time: 0.143 ms", "source": {"url": "/docs/devel/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 20devel \u00b7 using-explain", "sha256": "99cfea3035876ea63f88b75ba8c964b51a32a70606544e09f769c0b60a234b31"}, "paragraphs": ["Example copied from the PostgreSQL 20devel manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option which provides additional detail about I/O operations performed during the planning and execution of the given query. The buffer numbers displayed show the count of the non-distinct buffers hit, read, dirtied, and written for the given node and all of its child nodes. The ANALYZE option implicitly enables the BUFFERS option. If this is undesired, BUFFERS may be explicitly disabled:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel", "Async"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}}}, "snapshot": {"facts": [{"label": "Core node tag", "value": "T_BitmapAnd"}, {"label": "Structured EXPLAIN Node Type", "value": "BitmapAnd"}, {"label": "Inputs", "value": "Bitmap-producing child plans"}, {"label": "Output", "value": "Tuple-location bitmap, not a tuple stream"}, {"label": "Executor initializer", "value": "ExecInitBitmapAnd"}, {"label": "Memory mechanism", "value": "unclassified"}], "memory": {"evidence": [{"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "ec359e3996322cd5f16aab61f23a38e26dae336bbcea4db735a6a70e0ecc89dd", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}], "mechanism": "unclassified", "description": "This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider.", "source_notes": []}, "tables": [{"key": "explain-labels", "rows": [{"label": "BitmapAnd", "identity": "BitmapAnd"}], "title": "EXPLAIN labels in this source build", "columns": [{"key": "label", "label": "Text-format label"}, {"key": "identity", "label": "Structured node identity"}]}], "related": [{"url": "/wiki/sql/explain/?v=18", "label": "EXPLAIN"}, {"url": "/docs/18/using-explain.html", "label": "Using EXPLAIN"}, {"url": "/docs/18/parallel-plans.html", "label": "Parallel plans"}], "release": {"ref": "PostgreSQL 18.6 source archive", "label": "18.6", "major": "18", "channel": "stable", "revision": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f", "source_url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "source_snapshot_utc": ""}, "sources": [{"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "line": 1415, "path": "src/backend/commands/explain.c", "label": "src/backend/commands/explain.c:1415", "sha256": "34c86d6070224a0e981efef51f79101d6d505e5874f1684ace183034bab14bb4", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}, {"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "line": 196, "path": "src/backend/executor/execProcnode.c", "label": "src/backend/executor/execProcnode.c:196", "sha256": "f8a06a3f539077249b20664b2812433db6d7bd12b2c0ca633525db43d06f112a", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}, {"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "path": "src/backend/executor/nodeBitmapAnd.c", "label": "src/backend/executor/nodeBitmapAnd.c", "sha256": "ec359e3996322cd5f16aab61f23a38e26dae336bbcea4db735a6a70e0ecc89dd", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}, {"url": "https://ftp.postgresql.org/pub/source/v18.6/postgresql-18.6.tar.bz2", "path": "src/include/nodes/plannodes.h", "label": "src/include/nodes/plannodes.h", "sha256": "52422b327a8049fbbb20d8b96008a0fc0a6fafa60f7eff3c695d5b2e83830120", "archive_sha256": "555610c24d53e4316da5b7d3fc25c279d96856d5e0e23ee308c328c5fa881d9f"}, {"url": "/docs/18/using-explain.html#USING-EXPLAIN-CAVEATS", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}, {"url": "/docs/18/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}, {"url": "/docs/18/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}], "node_tag": "T_BitmapAnd", "sections": [{"title": "EXPLAIN names and attributes", "paragraphs": ["Structured formats use the Node Type above. Text-format spellings can also include operation, strategy, join type, scan direction or aggregation-stage attributes.", "Text names recorded by this source: BitmapAnd.", "Parallel-aware and parallel-safe are different plan properties. A node running inside a parallel worker is not necessarily a parallel-aware node."]}, {"title": "Memory and temporary storage", "paragraphs": ["This extraction does not assign a universal memory limit or spill policy to this node. Inspect the same-build implementation and its expressions or provider."]}, {"title": "Parallel execution and instrumentation", "paragraphs": ["The source callbacks below can coordinate execution or collect worker instrumentation. Their presence is not a blanket claim that this node supports a shared parallel scan or shared state.", "Callbacks in this build: none extracted from this node implementation."]}, {"title": "Same-version manual discussion", "paragraphs": ["BitmapAnd and BitmapOr nodes always report their actual row counts as zero, due to implementation limitations."]}, {"title": "Examples from this manual build", "blocks": [{"code": "EXPLAIN SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                     QUERY PLAN\n-------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0)\n               Index Cond: (unique1 < 100)\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0)\n               Index Cond: (unique2 > 9000)", "source": {"url": "/docs/18/using-explain.html#USING-EXPLAIN-BASICS", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}, "paragraphs": ["Example copied from the PostgreSQL 18.6 manual; it was not executed for this collection.", "If there are separate indexes on several of the columns referenced in WHERE , the planner might choose to use an AND or OR combination of the indexes:"]}, {"code": "EXPLAIN (ANALYZE, BUFFERS OFF) SELECT * FROM tenk1 WHERE unique1 < 100 AND unique2 > 9000;\n\n                                                           QUERY PLAN\n---------------------------------------------------------------------------------------------------------------------------------\n Bitmap Heap Scan on tenk1  (cost=25.07..60.11 rows=10 width=244) (actual time=0.105..0.114 rows=10.00 loops=1)\n   Recheck Cond: ((unique1 < 100) AND (unique2 > 9000))\n   Heap Blocks: exact=10\n   ->  BitmapAnd  (cost=25.07..25.07 rows=10 width=0) (actual time=0.100..0.101 rows=0.00 loops=1)\n         ->  Bitmap Index Scan on tenk1_unique1  (cost=0.00..5.04 rows=100 width=0) (actual time=0.027..0.027 rows=100.00 loops=1)\n               Index Cond: (unique1 < 100)\n               Index Searches: 1\n         ->  Bitmap Index Scan on tenk1_unique2  (cost=0.00..19.78 rows=999 width=0) (actual time=0.070..0.070 rows=999.00 loops=1)\n               Index Cond: (unique2 > 9000)\n               Index Searches: 1\n Planning Time: 0.162 ms\n Execution Time: 0.143 ms", "source": {"url": "/docs/18/using-explain.html#USING-EXPLAIN-ANALYZE", "path": "using-explain.html", "label": "PostgreSQL 18.6 \u00b7 using-explain", "sha256": "60040c30180093418a0affe56dd27dff9df2504b705b38039589e458bf5c31ed"}, "paragraphs": ["Example copied from the PostgreSQL 18.6 manual; it was not executed for this collection.", "EXPLAIN has a BUFFERS option which provides additional detail about I/O operations performed during the planning and execution of the given query. The buffer numbers displayed show the count of the non-distinct buffers hit, read, dirtied, and written for the given node and all of its child nodes. The ANALYZE option implicitly enables the BUFFERS option. If this is undesired, BUFFERS may be explicitly disabled:"]}]}, {"title": "Executor implementation notes", "paragraphs": ["NOTES BitmapAnd nodes don't make use of their left and right subtrees, rather they maintain a list of subplans, much like Append nodes. The logic is much simpler than Append, however, since we needn't cope with forward/backward execution.", "call ExecInitNode on each of the plans to be executed and save the results into the array \"bitmapplanstates\".", "BitmapAnd plans don't have expression contexts because they never call ExecQual or ExecProject. They don't need any tuple slots either.", "If at any stage we have a completely empty bitmap, we can fall out without evaluating the remaining subplans, since ANDing them can no longer change the result. (Note: the fact that indxpath.c orders the subplans by selectivity should make this case more likely to occur.)", "ExecReScan doesn't know about my subplans, so I have to do changed-parameter signaling myself."]}, {"code": "case T_BitmapAnd:\n\t\t\tpname = sname = \"BitmapAnd\";\n\t\t\tbreak;", "title": "EXPLAIN identity in core source"}], "strategies": [], "description": ["Intersects bitmaps produced by its child plans."], "evidence_kind": "source and documentation", "explain_names": ["BitmapAnd"], "partial_modes": [], "comparison_data": {"node_tag": "T_BitmapAnd", "strategies": [], "text_names": ["BitmapAnd"], "initializer": "ExecInitBitmapAnd", "partial_modes": [], "memory_mechanism": "unclassified", "parallel_callbacks": []}, "comparison_hash": "ffac2f4c3c78a9e2f88eb2c2de755f5a69e40f1ac6d7e9bcb4ed08615c9cb803", "explain_prefixes": ["Parallel", "Async"], "runtime_verified": false, "source_inventory": {"explain": "src/backend/commands/explain.c", "executor": "src/backend/executor/execProcnode.c", "implementation": "src/backend/executor/nodeBitmapAnd.c"}, "parallel_callbacks": []}, "comparison": {"left": "17", "right": "18", "status": "unchanged", "diff": ""}}