PostgreSQL Source Code: Path Struct Reference

Header And Logo

PostgreSQL

|

The world's most advanced open source database.

#include <relation.h>

Data Fields
NodeTag	type
NodeTag	pathtype
RelOptInfo *	parent
ParamPathInfo *	param_info
double	rows
Cost	startup_cost
Cost	total_cost
List *	pathkeys

Detailed Description

Definition at line 702 of file relation.h.

Field Documentation

ParamPathInfo* Path::param_info

Definition at line 709 of file relation.h.

Referenced by _outPathInfo(), add_path(), add_path_precheck(), bitmap_and_cost_est(), bitmap_scan_cost_est(), compare_path_costs_fuzzily(), cost_index(), create_append_path(), create_bitmap_and_path(), create_bitmap_heap_path(), create_bitmap_or_path(), create_bitmap_scan_plan(), create_ctescan_path(), create_ctescan_plan(), create_foreignscan_path(), create_foreignscan_plan(), create_functionscan_path(), create_functionscan_plan(), create_hashjoin_path(), create_hashjoin_plan(), create_index_path(), create_indexscan_plan(), create_material_path(), create_merge_append_path(), create_mergejoin_path(), create_mergejoin_plan(), create_nestloop_path(), create_nestloop_plan(), create_result_path(), create_scan_plan(), create_seqscan_path(), create_seqscan_plan(), create_subqueryscan_path(), create_subqueryscan_plan(), create_tidscan_path(), create_tidscan_plan(), create_unique_path(), create_valuesscan_path(), create_valuesscan_plan(), create_worktablescan_path(), create_worktablescan_plan(), final_cost_hashjoin(), final_cost_mergejoin(), final_cost_nestloop(), generate_mergeappend_paths(), get_joinrel_parampathinfo(), has_indexed_join_quals(), query_planner(), reparameterize_path(), set_append_rel_pathlist(), and set_cheapest().

RelOptInfo* Path::parent

Definition at line 708 of file relation.h.

Referenced by _outPathInfo(), approx_tuple_count(), bitmap_and_cost_est(), bitmap_scan_cost_est(), build_minmax_path(), calc_nestloop_required_outer(), calc_non_nestloop_required_outer(), copy_path_costsize(), cost_rescan(), create_append_path(), create_append_plan(), create_bitmap_and_path(), create_bitmap_heap_path(), create_bitmap_or_path(), create_bitmap_scan_plan(), create_bitmap_subplan(), create_ctescan_path(), create_ctescan_plan(), create_foreignscan_path(), create_foreignscan_plan(), create_functionscan_path(), create_functionscan_plan(), create_hashjoin_path(), create_hashjoin_plan(), create_index_path(), create_indexscan_plan(), create_join_plan(), create_material_path(), create_merge_append_path(), create_merge_append_plan(), create_mergejoin_path(), create_mergejoin_plan(), create_nestloop_path(), create_nestloop_plan(), create_result_path(), create_result_plan(), create_scan_plan(), create_seqscan_path(), create_seqscan_plan(), create_subqueryscan_path(), create_subqueryscan_plan(), create_tidscan_path(), create_tidscan_plan(), create_unique_path(), create_unique_plan(), create_valuesscan_path(), create_valuesscan_plan(), create_worktablescan_path(), create_worktablescan_plan(), disuse_physical_tlist(), final_cost_hashjoin(), final_cost_mergejoin(), final_cost_nestloop(), get_joinrel_parampathinfo(), grouping_planner(), has_indexed_join_quals(), initial_cost_hashjoin(), initial_cost_mergejoin(), optimize_minmax_aggregates(), and reparameterize_path().

List* Path::pathkeys

Definition at line 716 of file relation.h.

Referenced by add_path(), add_path_precheck(), bitmap_and_cost_est(), bitmap_scan_cost_est(), build_minmax_path(), choose_hashed_grouping(), create_append_path(), create_bitmap_and_path(), create_bitmap_heap_path(), create_bitmap_or_path(), create_ctescan_path(), create_foreignscan_path(), create_functionscan_path(), create_hashjoin_path(), create_index_path(), create_material_path(), create_merge_append_path(), create_merge_append_plan(), create_mergejoin_path(), create_mergejoin_plan(), create_nestloop_path(), create_result_path(), create_seqscan_path(), create_subqueryscan_path(), create_tidscan_path(), create_unique_path(), create_valuesscan_path(), create_worktablescan_path(), get_cheapest_fractional_path_for_pathkeys(), get_cheapest_path_for_pathkeys(), get_index_paths(), grouping_planner(), initial_cost_mergejoin(), match_unsorted_outer(), query_planner(), reparameterize_path(), set_append_rel_pathlist(), set_cheapest(), and try_mergejoin_path().

NodeTag Path::pathtype

Cost Path::startup_cost

Definition at line 713 of file relation.h.

Referenced by add_path_precheck(), build_minmax_path(), choose_hashed_distinct(), choose_hashed_grouping(), choose_hashed_setop(), compare_fractional_path_costs(), compare_path_costs(), compare_path_costs_fuzzily(), copy_path_costsize(), cost_agg(), cost_bitmap_and_node(), cost_bitmap_heap_scan(), cost_bitmap_or_node(), cost_ctescan(), cost_functionscan(), cost_group(), cost_index(), cost_material(), cost_merge_append(), cost_rescan(), cost_seqscan(), cost_sort(), cost_subqueryscan(), cost_tidscan(), cost_valuesscan(), cost_windowagg(), create_append_path(), create_bitmap_subplan(), create_foreignscan_path(), create_material_path(), create_merge_append_path(), create_result_path(), create_unique_path(), final_cost_hashjoin(), final_cost_mergejoin(), final_cost_nestloop(), grouping_planner(), initial_cost_hashjoin(), initial_cost_mergejoin(), initial_cost_nestloop(), make_agg(), make_group(), make_sort(), make_windowagg(), materialize_finished_plan(), optimize_minmax_aggregates(), and query_planner().

Cost Path::total_cost

Definition at line 714 of file relation.h.

Referenced by add_path(), add_path_precheck(), bitmap_and_cost_est(), bitmap_scan_cost_est(), build_minmax_path(), choose_hashed_distinct(), choose_hashed_grouping(), choose_hashed_setop(), compare_fractional_path_costs(), compare_path_costs(), compare_path_costs_fuzzily(), copy_path_costsize(), cost_agg(), cost_bitmap_and_node(), cost_bitmap_heap_scan(), cost_bitmap_or_node(), cost_bitmap_tree_node(), cost_ctescan(), cost_functionscan(), cost_group(), cost_index(), cost_material(), cost_merge_append(), cost_rescan(), cost_seqscan(), cost_sort(), cost_subqueryscan(), cost_tidscan(), cost_valuesscan(), cost_windowagg(), create_append_path(), create_bitmap_subplan(), create_foreignscan_path(), create_material_path(), create_merge_append_path(), create_or_index_quals(), create_result_path(), create_unique_path(), final_cost_hashjoin(), final_cost_mergejoin(), final_cost_nestloop(), geqo_eval(), grouping_planner(), initial_cost_hashjoin(), initial_cost_mergejoin(), initial_cost_nestloop(), make_agg(), make_group(), make_sort(), make_windowagg(), materialize_finished_plan(), optimize_minmax_aggregates(), plan_cluster_use_sort(), and query_planner().

NodeTag Path::type

Definition at line 704 of file relation.h.

Referenced by bitmap_and_cost_est(), and bitmap_scan_cost_est().

The documentation for this struct was generated from the following file:

src/include/nodes/relation.h