CPUs-yada casriga ahi waxay leeyihiin koorayaal badan. Muddo sanado ah, codsiyadu waxay u soo diri jireen su'aalo xog-ururin si barbar socda. Haddii ay tahay su'aal warbixin oo ku saabsan safaf badan oo miis ah, si dhakhso leh ayey u shaqeysaa marka la isticmaalayo CPUs badan, PostgreSQL waxay awooday inay tan sameyso tan iyo nooca 9.6.
Waxay qaadatay 3 sano in la hirgeliyo sifada isbarbar-dhigga - waxay ahayd inaan dib u qorno koodka marxaladaha kala duwan ee fulinta weydiinta. PostgreSQL 9.6 waxay soo bandhigtay kaabayaasha si kor loogu qaado koodhka. Noocyada xiga, noocyada kale ee weydiimaha ayaa si barbar socda loo fuliyo.
Xaddidaadda
Ha awoodin fulinta isbarbar-dhigga haddii dhammaan xudunta horeba ay mashquul ku yihiin, haddii kale codsiyada kale way gaabin doonaan.
Tan ugu muhiimsan, isbarbardhigga qiimaha WORK_MEM ee sarreeya ayaa isticmaala xusuusta badan - ku biirista xashiish kasta ama kala soocida waxay qaadataa xusuusta shaqada_mem.
Weydiimaha OLTP ee daahitaanka hooseeya laguma dardargelin karo fulinta isbarbar socda. Oo haddii waydiintu soo celiso hal saf, habaynta barbar socota ayaa kaliya hoos u dhigi doonta.
Horumariyayaashu waxay jecel yihiin inay isticmaalaan bartilmaameedka TPC-H. Waxaa laga yaabaa inaad hayso su'aalo isku mid ah oo ku saabsan fulinta dhammaystiran ee barbar socda.
Keliya su'aalaha SELECT iyada oo aan la xirin wax saadaaliya ayaa si barbar socda loo fuliyo.
Marmarka qaarkood tusmaynta saxda ah ayaa ka fiican shaxanka isku xigxiga ee isbarbardhigga.
Joojinta weydiimaha iyo cursarada lama taageero.
Shaqooyinka daaqadaha iyo shaqooyinka la isku daray ee la amray maaha kuwo isbarbar socda.
Waxba kama heleysid culeyska shaqada ee I/O.
Ma jiraan algorithms-kala-soocidda isbar-bar socda. Laakin su'aalaha noocaan ah waxaa loo fulin karaa si isbarbar socda dhinacyada qaarkood.
Ku beddel CTE (LA...) SELECT buul leh si aad awood ugu yeelato habaynta barbar socota.
Duubabka xogta qolo saddexaad weli ma taageeraan habaynta isbarbar-dhigga (laakiin way awoodaan!)
Horumarinta PostgreSQL waxay isku dayeen inay yareeyaan wakhtiga jawaabta ee weydiimaha bartilmaameedka TPC-H. Soo deji bartilmaameedka iyo u waafaji PostgreSQL. Kani waa isticmaalka aan rasmiga ahayn ee bar-tilmaameedka TPC-H - maaha xogta xogta ama isbarbardhigga qalabka.
Soo deji TPC-H_Tools_v2.17.3.zip (ama nooca cusub) ka TPC offsite.
Dib ugu magacow makefile.suite una beddel Makefile oo beddel sida halkan lagu sharraxay: https://github.com/tvondra/pg_tpch . Ku soo ururi koodka amarka samaynta.
Abuur xogta: ./dbgen -s 10 wuxuu abuuraa kayd 23 GB ah. Tani waxay ku filan tahay in la arko faraqa u dhexeeya waxqabadka su'aalaha isbarbardhigga iyo kuwa aan isbarbardhigga ahayn.
Beddeli faylasha tbl в csv с for и sed.
Xir kaydka pg_tpch oo koobiyi galalka csv в pg_tpch/dss/data.
Su'aalo ku samee amar qgen.
Ku shub xogta kaydka xogta amarka ./tpch.sh.
Iskaanka isku xig xiga ee barbar socda
Waxa laga yaabaa inay dhakhso badan tahay maaha sababtoo ah akhriska barbar socda, laakiin sababtoo ah xogta waxay ku faaftaa qaybo badan oo CPU ah. Nidaamyada hawlgalka casriga ah, faylasha xogta PostgreSQL si fiican ayaa loo kaydiyay. Marka hore loo akhriyo, waxa suurtogal ah in kayd ka weyn laga helo codsiyada PG daemon. Sidaa darteed, waxqabadka weydiintu kuma xaddidna diskka I/O. Waxay u isticmaashaa wareegyada CPU si ay:
safafka hal mar ka akhri boggaga miiska;
is barbar qiyamka xargaha iyo xaaladaha WHERE.
Aan wadno weydiin fudud select:
tpch=# explain analyze select l_quantity as sum_qty from lineitem where l_shipdate <= date '1998-12-01' - interval '105' day;
QUERY PLAN
--------------------------------------------------------------------------------------------------------------------------
Seq Scan on lineitem (cost=0.00..1964772.00 rows=58856235 width=5) (actual time=0.014..16951.669 rows=58839715 loops=1)
Filter: (l_shipdate <= '1998-08-18 00:00:00'::timestamp without time zone)
Rows Removed by Filter: 1146337
Planning Time: 0.203 ms
Execution Time: 19035.100 ms
Sawirka taxanaha ahi waxa uu soo saaraa safaf aad u badan oo aan la isku geyn, markaa su'aasha waxa fuliya hal udub oo CPU ah.
Hadii aad ku darto SUM(), waxaad arki kartaa in laba shaqo oo shaqo ay kaa caawin doonaan dedejinta weydiinta:
explain analyze select sum(l_quantity) as sum_qty from lineitem where l_shipdate <= date '1998-12-01' - interval '105' day;
QUERY PLAN
----------------------------------------------------------------------------------------------------------------------------------------------------
Finalize Aggregate (cost=1589702.14..1589702.15 rows=1 width=32) (actual time=8553.365..8553.365 rows=1 loops=1)
-> Gather (cost=1589701.91..1589702.12 rows=2 width=32) (actual time=8553.241..8555.067 rows=3 loops=1)
Workers Planned: 2
Workers Launched: 2
-> Partial Aggregate (cost=1588701.91..1588701.92 rows=1 width=32) (actual time=8547.546..8547.546 rows=1 loops=3)
-> Parallel Seq Scan on lineitem (cost=0.00..1527393.33 rows=24523431 width=5) (actual time=0.038..5998.417 rows=19613238 loops=3)
Filter: (l_shipdate <= '1998-08-18 00:00:00'::timestamp without time zone)
Rows Removed by Filter: 382112
Planning Time: 0.241 ms
Execution Time: 8555.131 ms
Isku-darka barbar socda
Isbarbardhigga Seq Scan node wuxuu soo saaraa safaf isku-darka qayb ahaan. Noodka "Qeyb Wadareedka" wuxuu gooyaa xadadkan isagoo isticmaalaya SUM(). Dhamaadka, miiska SUM ee habka shaqaale kasta waxaa lagu soo ururiyaa noodhka "Ururinta".
Natiijada kama dambaysta ah waxaa lagu xisaabiyaa "Dhammaystirka Isku-darka" Haddii aad leedahay hawlo isu-ururin adiga kuu gaar ah, ha ilaawin inaad ku calaamadiso "barro isbar-bar socda".
Tirada hababka shaqaalaha
Tirada hababka shaqaalaha waa la kordhin karaa iyada oo aan dib loo bilaabin serverka:
explain analyze select sum(l_quantity) as sum_qty from lineitem where l_shipdate <= date '1998-12-01' - interval '105' day;
QUERY PLAN
----------------------------------------------------------------------------------------------------------------------------------------------------
Finalize Aggregate (cost=1589702.14..1589702.15 rows=1 width=32) (actual time=8553.365..8553.365 rows=1 loops=1)
-> Gather (cost=1589701.91..1589702.12 rows=2 width=32) (actual time=8553.241..8555.067 rows=3 loops=1)
Workers Planned: 2
Workers Launched: 2
-> Partial Aggregate (cost=1588701.91..1588701.92 rows=1 width=32) (actual time=8547.546..8547.546 rows=1 loops=3)
-> Parallel Seq Scan on lineitem (cost=0.00..1527393.33 rows=24523431 width=5) (actual time=0.038..5998.417 rows=19613238 loops=3)
Filter: (l_shipdate <= '1998-08-18 00:00:00'::timestamp without time zone)
Rows Removed by Filter: 382112
Planning Time: 0.241 ms
Execution Time: 8555.131 ms
Mar kasta miiska ayaa 3 jeer ka weyn min_parallel_(index|table)_scan_size, Postgres waxay ku daraysaa habka shaqaalaha. Tirada socodka shaqadu kuma salaysna kharashyada. Ku-tiirsanaanta goobada ayaa ka dhigaysa fulinta qalafsan. Taa beddelkeeda, qorshayuhu wuxuu adeegsadaa xeerar fudud.
Ficil ahaan, xeerarkani had iyo jeer kuma habboona wax soo saarka, markaa waxaad bedeli kartaa tirada hababka shaqaalaha ee miis gaar ah: BEDELKA Miiska ... SET (parallel_workers = N).
Waa maxay sababta isbarbar-dhigga aan loo isticmaalin?
Marka lagu daro liiska dheer ee xannibaadaha, waxaa sidoo kale jira jeegaga kharashka:
parallel_setup_cost - si looga fogaado isbarbardhigga codsiyada gaaban. Halbeeggani waxa uu qiyaasaa wakhtiga lagu diyaariyo xusuusta, la bilaabo habka, iyo xog-isweydaarsiga bilowga ah.
parallel_tuple_costXidhiidhka u dhexeeya hogaamiyaha iyo shaqaalaha ayaa dib u dhigi kara marka loo eego tirada tuples ee habsocodka shaqada. Halbeeggani waxa uu xisaabinayaa kharashka xog beddelka.
Ku biirista Loop Nsted
PostgreSQL 9.6+ может выполнять вложенные циклы параллельно — это простая операция.
explain (costs off) select c_custkey, count(o_orderkey)
from customer left outer join orders on
c_custkey = o_custkey and o_comment not like '%special%deposits%'
group by c_custkey;
QUERY PLAN
--------------------------------------------------------------------------------------
Finalize GroupAggregate
Group Key: customer.c_custkey
-> Gather Merge
Workers Planned: 4
-> Partial GroupAggregate
Group Key: customer.c_custkey
-> Nested Loop Left Join
-> Parallel Index Only Scan using customer_pkey on customer
-> Index Scan using idx_orders_custkey on orders
Index Cond: (customer.c_custkey = o_custkey)
Filter: ((o_comment)::text !~~ '%special%deposits%'::text)
Ururintu waxay dhacdaa marxaladda ugu dambaysa, sidaa darteed Ku biirista Loop Bidixeed Nsted waa hawlgal barbar socda. Isbarbardhigga Scan kaliya ayaa lagu soo bandhigay kaliya nooca 10. Waxay u shaqeysaa si la mid ah iskaanka isbarbar socda. Xaalad c_custkey = o_custkey akhriya hal dalab halkii xadhig macmiil Markaa is barbar ma aha.
Hash Ku biir
Nidaam kasta oo shaqaale ah wuxuu abuuraa miis xashiishad u gaar ah ilaa PostgreSQL 11. Oo haddii ay jiraan wax ka badan afar habraacyadan, waxqabadku ma horumarayo. Nooca cusub, miiska xashiishka waa la wadaagaa. Nidaam kasta oo shaqaale ah ayaa isticmaali kara WORK_MEM si uu u sameeyo miiska xashiishka.
select
l_shipmode,
sum(case
when o_orderpriority = '1-URGENT'
or o_orderpriority = '2-HIGH'
then 1
else 0
end) as high_line_count,
sum(case
when o_orderpriority <> '1-URGENT'
and o_orderpriority <> '2-HIGH'
then 1
else 0
end) as low_line_count
from
orders,
lineitem
where
o_orderkey = l_orderkey
and l_shipmode in ('MAIL', 'AIR')
and l_commitdate < l_receiptdate
and l_shipdate < l_commitdate
and l_receiptdate >= date '1996-01-01'
and l_receiptdate < date '1996-01-01' + interval '1' year
group by
l_shipmode
order by
l_shipmode
LIMIT 1;
QUERY PLAN
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Limit (cost=1964755.66..1964961.44 rows=1 width=27) (actual time=7579.592..7922.997 rows=1 loops=1)
-> Finalize GroupAggregate (cost=1964755.66..1966196.11 rows=7 width=27) (actual time=7579.590..7579.591 rows=1 loops=1)
Group Key: lineitem.l_shipmode
-> Gather Merge (cost=1964755.66..1966195.83 rows=28 width=27) (actual time=7559.593..7922.319 rows=6 loops=1)
Workers Planned: 4
Workers Launched: 4
-> Partial GroupAggregate (cost=1963755.61..1965192.44 rows=7 width=27) (actual time=7548.103..7564.592 rows=2 loops=5)
Group Key: lineitem.l_shipmode
-> Sort (cost=1963755.61..1963935.20 rows=71838 width=27) (actual time=7530.280..7539.688 rows=62519 loops=5)
Sort Key: lineitem.l_shipmode
Sort Method: external merge Disk: 2304kB
Worker 0: Sort Method: external merge Disk: 2064kB
Worker 1: Sort Method: external merge Disk: 2384kB
Worker 2: Sort Method: external merge Disk: 2264kB
Worker 3: Sort Method: external merge Disk: 2336kB
-> Parallel Hash Join (cost=382571.01..1957960.99 rows=71838 width=27) (actual time=7036.917..7499.692 rows=62519 loops=5)
Hash Cond: (lineitem.l_orderkey = orders.o_orderkey)
-> Parallel Seq Scan on lineitem (cost=0.00..1552386.40 rows=71838 width=19) (actual time=0.583..4901.063 rows=62519 loops=5)
Filter: ((l_shipmode = ANY ('{MAIL,AIR}'::bpchar[])) AND (l_commitdate < l_receiptdate) AND (l_shipdate < l_commitdate) AND (l_receiptdate >= '1996-01-01'::date) AND (l_receiptdate < '1997-01-01 00:00:00'::timestamp without time zone))
Rows Removed by Filter: 11934691
-> Parallel Hash (cost=313722.45..313722.45 rows=3750045 width=20) (actual time=2011.518..2011.518 rows=3000000 loops=5)
Buckets: 65536 Batches: 256 Memory Usage: 3840kB
-> Parallel Seq Scan on orders (cost=0.00..313722.45 rows=3750045 width=20) (actual time=0.029..995.948 rows=3000000 loops=5)
Planning Time: 0.977 ms
Execution Time: 7923.770 ms
Weydiinta 12 ee TPC-H waxay si cad u muujinaysaa xidhiidhka xashiishka barbar socda. Nidaam kasta oo shaqaale ah ayaa gacan ka geysta abuurista miis xashiish ah oo caadi ah.
Ku biir Ku biir
Isku-darka isku-darka ah waa mid aan la mid ahayn dabeecadda. Ha ka werwerin haddii ay tani tahay tallaabadii u dambaysay ee weydiinta - waxay weli u socon kartaa si is barbar socda.
-- Query 2 from TPC-H
explain (costs off) select s_acctbal, s_name, n_name, p_partkey, p_mfgr, s_address, s_phone, s_comment
from part, supplier, partsupp, nation, region
where
p_partkey = ps_partkey
and s_suppkey = ps_suppkey
and p_size = 36
and p_type like '%BRASS'
and s_nationkey = n_nationkey
and n_regionkey = r_regionkey
and r_name = 'AMERICA'
and ps_supplycost = (
select
min(ps_supplycost)
from partsupp, supplier, nation, region
where
p_partkey = ps_partkey
and s_suppkey = ps_suppkey
and s_nationkey = n_nationkey
and n_regionkey = r_regionkey
and r_name = 'AMERICA'
)
order by s_acctbal desc, n_name, s_name, p_partkey
LIMIT 100;
QUERY PLAN
----------------------------------------------------------------------------------------------------------
Limit
-> Sort
Sort Key: supplier.s_acctbal DESC, nation.n_name, supplier.s_name, part.p_partkey
-> Merge Join
Merge Cond: (part.p_partkey = partsupp.ps_partkey)
Join Filter: (partsupp.ps_supplycost = (SubPlan 1))
-> Gather Merge
Workers Planned: 4
-> Parallel Index Scan using <strong>part_pkey</strong> on part
Filter: (((p_type)::text ~~ '%BRASS'::text) AND (p_size = 36))
-> Materialize
-> Sort
Sort Key: partsupp.ps_partkey
-> Nested Loop
-> Nested Loop
Join Filter: (nation.n_regionkey = region.r_regionkey)
-> Seq Scan on region
Filter: (r_name = 'AMERICA'::bpchar)
-> Hash Join
Hash Cond: (supplier.s_nationkey = nation.n_nationkey)
-> Seq Scan on supplier
-> Hash
-> Seq Scan on nation
-> Index Scan using idx_partsupp_suppkey on partsupp
Index Cond: (ps_suppkey = supplier.s_suppkey)
SubPlan 1
-> Aggregate
-> Nested Loop
Join Filter: (nation_1.n_regionkey = region_1.r_regionkey)
-> Seq Scan on region region_1
Filter: (r_name = 'AMERICA'::bpchar)
-> Nested Loop
-> Nested Loop
-> Index Scan using idx_partsupp_partkey on partsupp partsupp_1
Index Cond: (part.p_partkey = ps_partkey)
-> Index Scan using supplier_pkey on supplier supplier_1
Index Cond: (s_suppkey = partsupp_1.ps_suppkey)
-> Index Scan using nation_pkey on nation nation_1
Index Cond: (n_nationkey = supplier_1.s_nationkey)
Noodka "Ku biirista" waxay ku yaalaan korka "Isku darsiga". Markaa isku darka ma isticmaasho habayn is barbar socda. Laakin "Isbarbardhiga Tusmada Scan" ayaa wali ka caawiya qaybta part_pkey.
Isku xirka qaybaha
Gudaha PostgreSQL 11 isku xirka qaybaha naafo ahaan: waxay leedahay jadwal aad qaali u ah. Miisaska leh qaybin la mid ah ayaa lagu dari karaa qayb qayb ahaan. Sidan Postgres waxay isticmaali doontaa miisaska xashiishka yar yar. Xidhiidh kasta oo ka mid ah qaybaha wuxuu noqon karaa mid isbarbar socda.
tpch=# set enable_partitionwise_join=t;
tpch=# explain (costs off) select * from prt1 t1, prt2 t2
where t1.a = t2.b and t1.b = 0 and t2.b between 0 and 10000;
QUERY PLAN
---------------------------------------------------
Append
-> Hash Join
Hash Cond: (t2.b = t1.a)
-> Seq Scan on prt2_p1 t2
Filter: ((b >= 0) AND (b <= 10000))
-> Hash
-> Seq Scan on prt1_p1 t1
Filter: (b = 0)
-> Hash Join
Hash Cond: (t2_1.b = t1_1.a)
-> Seq Scan on prt2_p2 t2_1
Filter: ((b >= 0) AND (b <= 10000))
-> Hash
-> Seq Scan on prt1_p2 t1_1
Filter: (b = 0)
tpch=# set parallel_setup_cost = 1;
tpch=# set parallel_tuple_cost = 0.01;
tpch=# explain (costs off) select * from prt1 t1, prt2 t2
where t1.a = t2.b and t1.b = 0 and t2.b between 0 and 10000;
QUERY PLAN
-----------------------------------------------------------
Gather
Workers Planned: 4
-> Parallel Append
-> Parallel Hash Join
Hash Cond: (t2_1.b = t1_1.a)
-> Parallel Seq Scan on prt2_p2 t2_1
Filter: ((b >= 0) AND (b <= 10000))
-> Parallel Hash
-> Parallel Seq Scan on prt1_p2 t1_1
Filter: (b = 0)
-> Parallel Hash Join
Hash Cond: (t2.b = t1.a)
-> Parallel Seq Scan on prt2_p1 t2
Filter: ((b >= 0) AND (b <= 10000))
-> Parallel Hash
-> Parallel Seq Scan on prt1_p1 t1
Filter: (b = 0)
Waxa ugu muhiimsan waa in isku xirka qaybaha ay isku mid yihiin oo kaliya haddii qaybahani ay ku filan yihiin.
Lifaaqa barbar socda
Lifaaqa barbar socda waxaa loo isticmaali karaa halkii blocks kala duwan ee socodka shaqada kala duwan. Tani waxay badanaa ku dhacdaa UNION DHAMMAAN weydiimaha. Khasaaraha ayaa ka yar isbarbar-dhigga, sababtoo ah shaqaale kastaa wuxuu habeeyaa kaliya 1 codsi.
Waxaa jira 2 habraac oo shaqaale ah oo halkan ka socda, in kasta oo 4 karti loo leeyahay.
tpch=# explain (costs off) select sum(l_quantity) as sum_qty from lineitem where l_shipdate <= date '1998-12-01' - interval '105' day union all select sum(l_quantity) as sum_qty from lineitem where l_shipdate <= date '2000-12-01' - interval '105' day;
QUERY PLAN
------------------------------------------------------------------------------------------------
Gather
Workers Planned: 2
-> Parallel Append
-> Aggregate
-> Seq Scan on lineitem
Filter: (l_shipdate <= '2000-08-18 00:00:00'::timestamp without time zone)
-> Aggregate
-> Seq Scan on lineitem lineitem_1
Filter: (l_shipdate <= '1998-08-18 00:00:00'::timestamp without time zone)
Doorsoomayaasha ugu muhiimsan
WORK_MEM waxay xaddidaysaa xusuusta hawl kasta, ma aha oo kaliya su'aalaha: work_mem hababka isku xirka = xasuus badan.
max_parallel_workers_per_gather - intee in le'eg oo hawlwadeen ah ayaa barnaamijka fulinaya u isticmaali doona habaynta isbarbar-dhigga ee qorshaha.
max_worker_processes - waxay ku hagaajisaa tirada guud ee hababka shaqaalaha tirada xudunta CPU ee server-ka.